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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:20:24,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:20:24,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:20:24,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:20:24,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:20:24,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:20:24,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:20:24,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:20:24,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:20:24,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:20:24,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:20:24,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:20:24,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:20:24,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:20:24,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:20:24,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:20:24,089 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:20:24,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:20:24,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:20:24,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:20:24,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:20:24,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:20:24,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:20:24,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:20:24,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:20:24,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:20:24,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:20:24,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:20:24,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:20:24,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:20:24,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:20:24,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:20:24,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:20:24,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:20:24,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:20:24,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:20:24,115 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:20:24,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:20:24,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:20:24,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:20:24,125 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:20:24,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:20:24,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:20:24,126 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:20:24,126 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:20:24,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:20:24,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:20:24,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:20:24,196 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:20:24,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:20:24,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2018-09-26 08:20:24,197 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2018-09-26 08:20:24,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:20:24,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:20:24,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:24,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:20:24,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:20:24,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:24,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:20:24,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:20:24,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:20:24,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:20:24,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:20:24,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:20:24,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:20:24,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/1) ... [2018-09-26 08:20:24,446 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:20:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:20:24,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:20:24,665 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:20:24,666 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:24 BoogieIcfgContainer [2018-09-26 08:20:24,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:20:24,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:20:24,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:20:24,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:20:24,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:24" (1/2) ... [2018-09-26 08:20:24,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59cb9ab1 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:20:24, skipping insertion in model container [2018-09-26 08:20:24,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:24" (2/2) ... [2018-09-26 08:20:24,676 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2018-09-26 08:20:24,687 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:20:24,698 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:20:24,751 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:20:24,752 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:20:24,752 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:20:24,752 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:20:24,753 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:20:24,753 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:20:24,753 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:20:24,753 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:20:24,754 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:20:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:20:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:20:24,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:24,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:20:24,787 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:24,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 29056668, now seen corresponding path program 1 times [2018-09-26 08:20:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:24,877 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:20:24,880 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:24,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:20:24,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:24,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:24,900 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-09-26 08:20:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:24,960 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-09-26 08:20:24,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:24,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 08:20:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:24,973 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:20:24,973 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:20:24,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:20:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:20:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:20:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 08:20:25,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-09-26 08:20:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,020 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 08:20:25,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 08:20:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:20:25,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:20:25,022 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash 923948517, now seen corresponding path program 1 times [2018-09-26 08:20:25,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:25,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:25,143 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-09-26 08:20:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,345 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:20:25,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:25,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:20:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,347 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:20:25,347 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:20:25,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:20:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-26 08:20:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:20:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-09-26 08:20:25,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2018-09-26 08:20:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,355 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-09-26 08:20:25,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-09-26 08:20:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:20:25,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,357 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:25,357 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1091246844, now seen corresponding path program 1 times [2018-09-26 08:20:25,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:25,417 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2018-09-26 08:20:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,474 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-09-26 08:20:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:25,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-09-26 08:20:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,476 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:20:25,476 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:20:25,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:20:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:20:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:20:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:20:25,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-09-26 08:20:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:20:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:20:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:20:25,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,492 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:25,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash -167964723, now seen corresponding path program 2 times [2018-09-26 08:20:25,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:25,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:25,607 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-09-26 08:20:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,802 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 08:20:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:25,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-09-26 08:20:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,804 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:20:25,806 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:20:25,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:20:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:20:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-26 08:20:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:20:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-09-26 08:20:25,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-09-26 08:20:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,821 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-09-26 08:20:25,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-09-26 08:20:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:20:25,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,822 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-09-26 08:20:25,823 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash -196279780, now seen corresponding path program 3 times [2018-09-26 08:20:25,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:25,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:25,863 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 8 states. [2018-09-26 08:20:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,908 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-09-26 08:20:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:25,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-09-26 08:20:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,909 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:20:25,911 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:20:25,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:20:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:20:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:20:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:20:25,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-09-26 08:20:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:20:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:20:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:20:25,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,931 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:20:25,931 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1035952027, now seen corresponding path program 4 times [2018-09-26 08:20:25,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:26,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:26,034 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2018-09-26 08:20:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,191 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 08:20:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:20:26,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-09-26 08:20:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,192 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:20:26,193 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:20:26,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:20:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-26 08:20:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:20:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-09-26 08:20:26,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-09-26 08:20:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,204 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-09-26 08:20:26,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-09-26 08:20:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:20:26,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,206 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2018-09-26 08:20:26,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1592035972, now seen corresponding path program 5 times [2018-09-26 08:20:26,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:26,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:26,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:26,241 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2018-09-26 08:20:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,298 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-09-26 08:20:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:26,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-09-26 08:20:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,305 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:20:26,305 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:20:26,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:20:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:20:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:20:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:20:26,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-09-26 08:20:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,323 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:20:26,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:20:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:20:26,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,325 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:20:26,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1310860211, now seen corresponding path program 6 times [2018-09-26 08:20:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:26,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:26,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:26,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:26,449 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2018-09-26 08:20:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,630 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-09-26 08:20:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:20:26,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-09-26 08:20:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,632 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:20:26,632 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:20:26,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:20:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-26 08:20:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:20:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-09-26 08:20:26,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-09-26 08:20:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,649 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-09-26 08:20:26,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-09-26 08:20:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:20:26,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,654 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2018-09-26 08:20:26,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1990007396, now seen corresponding path program 7 times [2018-09-26 08:20:26,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:26,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:26,705 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-09-26 08:20:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,783 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-09-26 08:20:26,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:20:26,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:20:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,785 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:20:26,785 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:20:26,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:20:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:20:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:20:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:20:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:20:26,805 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-09-26 08:20:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,809 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:20:26,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:20:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:20:26,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,810 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-26 08:20:26,817 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash 945564389, now seen corresponding path program 8 times [2018-09-26 08:20:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:20:26,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:20:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:20:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:26,920 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 14 states. [2018-09-26 08:20:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,175 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-26 08:20:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:20:27,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-09-26 08:20:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,179 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:20:27,179 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:20:27,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:20:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-26 08:20:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:20:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-09-26 08:20:27,197 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2018-09-26 08:20:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-09-26 08:20:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:20:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-09-26 08:20:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:20:27,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,199 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2018-09-26 08:20:27,199 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1377898492, now seen corresponding path program 9 times [2018-09-26 08:20:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:27,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:20:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:20:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:20:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:27,264 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2018-09-26 08:20:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,356 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-09-26 08:20:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:20:27,357 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-26 08:20:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,358 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:20:27,358 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:20:27,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:20:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:20:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:20:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:20:27,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-09-26 08:20:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,382 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:20:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:20:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:20:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:20:27,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,384 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:20:27,384 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 145909965, now seen corresponding path program 10 times [2018-09-26 08:20:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:27,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:20:27,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:20:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:20:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:27,524 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2018-09-26 08:20:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,823 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 08:20:27,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:20:27,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-09-26 08:20:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,824 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:20:27,825 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:20:27,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:20:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-26 08:20:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:20:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-09-26 08:20:27,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2018-09-26 08:20:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,851 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-09-26 08:20:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:20:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-09-26 08:20:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:20:27,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,854 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1] [2018-09-26 08:20:27,854 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 300747036, now seen corresponding path program 11 times [2018-09-26 08:20:27,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:27,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:20:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:20:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:20:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:27,919 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-09-26 08:20:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,016 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-09-26 08:20:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:20:28,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-09-26 08:20:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,018 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:20:28,018 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:20:28,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:20:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:20:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:20:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:20:28,045 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-09-26 08:20:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,045 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:20:28,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:20:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:20:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:20:28,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,050 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-26 08:20:28,050 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1901393253, now seen corresponding path program 12 times [2018-09-26 08:20:28,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:28,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:20:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:20:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:20:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:28,196 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 18 states. [2018-09-26 08:20:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,556 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-09-26 08:20:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:20:28,556 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-09-26 08:20:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,557 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:20:28,557 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:20:28,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:20:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-26 08:20:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:20:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-09-26 08:20:28,588 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2018-09-26 08:20:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,589 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-09-26 08:20:28,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:20:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-09-26 08:20:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:20:28,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,590 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1] [2018-09-26 08:20:28,591 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1913383548, now seen corresponding path program 13 times [2018-09-26 08:20:28,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 77 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:28,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:20:28,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:20:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:20:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:28,663 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2018-09-26 08:20:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,772 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-09-26 08:20:28,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:20:28,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-09-26 08:20:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,774 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:20:28,774 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:20:28,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:20:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:20:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:20:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:20:28,800 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-09-26 08:20:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,800 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:20:28,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:20:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:20:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:20:28,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,802 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:20:28,802 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -477448883, now seen corresponding path program 14 times [2018-09-26 08:20:28,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:28,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:20:28,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:20:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:20:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:28,955 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 20 states. [2018-09-26 08:20:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:29,347 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-09-26 08:20:29,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:20:29,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-09-26 08:20:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:29,348 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:20:29,348 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:20:29,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:20:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-26 08:20:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:20:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-09-26 08:20:29,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2018-09-26 08:20:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,375 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-09-26 08:20:29,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:20:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-09-26 08:20:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:20:29,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,376 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1] [2018-09-26 08:20:29,376 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1255894172, now seen corresponding path program 15 times [2018-09-26 08:20:29,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:29,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:29,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:20:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:20:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:20:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:29,436 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 20 states. [2018-09-26 08:20:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:29,550 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-09-26 08:20:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:20:29,551 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-09-26 08:20:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:29,551 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:29,551 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:20:29,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:20:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:20:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:20:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:20:29,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-09-26 08:20:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,580 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:20:29,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:20:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:20:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:20:29,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,582 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-26 08:20:29,582 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1323630619, now seen corresponding path program 16 times [2018-09-26 08:20:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:29,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:29,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:20:29,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:20:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:20:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:29,727 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-09-26 08:20:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:30,120 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 08:20:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:20:30,120 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-09-26 08:20:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:30,121 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:20:30,121 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:30,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-26 08:20:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:20:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-09-26 08:20:30,158 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2018-09-26 08:20:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:30,158 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-09-26 08:20:30,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:20:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-09-26 08:20:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:20:30,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:30,160 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2018-09-26 08:20:30,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:30,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash -181142780, now seen corresponding path program 17 times [2018-09-26 08:20:30,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 126 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:30,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:30,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:20:30,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:20:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:20:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:30,230 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 22 states. [2018-09-26 08:20:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:30,361 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-09-26 08:20:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:20:30,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-09-26 08:20:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:30,362 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:20:30,362 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:30,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:20:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:20:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:20:30,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-09-26 08:20:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:30,395 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:20:30,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:20:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:20:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:20:30,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:30,396 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:20:30,396 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:30,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1064747469, now seen corresponding path program 18 times [2018-09-26 08:20:30,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:30,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:30,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:20:30,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:20:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:20:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:30,562 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 24 states. [2018-09-26 08:20:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:31,033 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-26 08:20:31,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:20:31,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-09-26 08:20:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:31,034 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:20:31,034 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:20:31,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:20:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-26 08:20:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:20:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-26 08:20:31,072 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2018-09-26 08:20:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:31,072 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-26 08:20:31,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:20:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-26 08:20:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:20:31,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:31,074 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2018-09-26 08:20:31,074 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:31,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1562251292, now seen corresponding path program 19 times [2018-09-26 08:20:31,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 155 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:31,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:31,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:20:31,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:20:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:20:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:31,154 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 24 states. [2018-09-26 08:20:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:31,311 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-09-26 08:20:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:20:31,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-09-26 08:20:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:31,312 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:20:31,312 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:20:31,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:20:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:20:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:20:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:20:31,350 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 45 [2018-09-26 08:20:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:31,351 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:20:31,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:20:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:20:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:20:31,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:31,352 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-26 08:20:31,352 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:31,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:31,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1482798491, now seen corresponding path program 20 times [2018-09-26 08:20:31,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:31,546 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:31,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:20:31,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:20:31,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:20:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:31,548 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2018-09-26 08:20:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:32,216 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-09-26 08:20:32,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:20:32,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-09-26 08:20:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:32,217 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:20:32,217 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:32,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=2253, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-26 08:20:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:20:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-09-26 08:20:32,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2018-09-26 08:20:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:32,271 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-09-26 08:20:32,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:20:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-09-26 08:20:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:20:32,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:32,274 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1] [2018-09-26 08:20:32,274 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:32,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash -307322748, now seen corresponding path program 21 times [2018-09-26 08:20:32,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 187 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:32,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:32,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:20:32,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:20:32,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:20:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:32,385 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 26 states. [2018-09-26 08:20:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:32,573 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-09-26 08:20:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:20:32,573 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-09-26 08:20:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:32,574 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:20:32,574 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:32,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:20:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:20:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:20:32,620 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 49 [2018-09-26 08:20:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:32,621 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:20:32,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:20:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:20:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:20:32,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:32,622 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:20:32,622 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:32,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 763792973, now seen corresponding path program 22 times [2018-09-26 08:20:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:32,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:32,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:20:32,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:20:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:20:32,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:32,834 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 28 states. [2018-09-26 08:20:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,442 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-26 08:20:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:20:33,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2018-09-26 08:20:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,443 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:20:33,443 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:20:33,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=2648, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:20:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-26 08:20:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:20:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-09-26 08:20:33,491 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2018-09-26 08:20:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,491 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-09-26 08:20:33,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:20:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-09-26 08:20:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:20:33,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,492 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1] [2018-09-26 08:20:33,492 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash -576392292, now seen corresponding path program 23 times [2018-09-26 08:20:33,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 222 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:20:33,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:20:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:20:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:33,587 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2018-09-26 08:20:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,794 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-09-26 08:20:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:20:33,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-09-26 08:20:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,795 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:20:33,795 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:20:33,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:20:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:20:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:20:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:20:33,841 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-09-26 08:20:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,842 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:20:33,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:20:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:20:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:20:33,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,843 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-26 08:20:33,843 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1892603109, now seen corresponding path program 24 times [2018-09-26 08:20:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:20:34,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:20:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:20:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:34,063 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 30 states. [2018-09-26 08:20:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,710 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-09-26 08:20:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:20:34,711 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-09-26 08:20:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,712 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:20:34,712 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:34,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=3075, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-26 08:20:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:20:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-09-26 08:20:34,766 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2018-09-26 08:20:34,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,766 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-09-26 08:20:34,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:20:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-09-26 08:20:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:20:34,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,768 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1] [2018-09-26 08:20:34,768 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1787558396, now seen corresponding path program 25 times [2018-09-26 08:20:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 260 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:20:34,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:20:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:20:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:34,866 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 30 states. [2018-09-26 08:20:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,118 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-09-26 08:20:35,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:20:35,118 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-09-26 08:20:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,119 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:20:35,119 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:35,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:20:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:20:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:20:35,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 57 [2018-09-26 08:20:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,180 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:20:35,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:20:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:20:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:20:35,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,182 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:20:35,182 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash -758506803, now seen corresponding path program 26 times [2018-09-26 08:20:35,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:20:35,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:20:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:20:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:35,457 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 32 states. [2018-09-26 08:20:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,168 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-26 08:20:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:20:36,168 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-09-26 08:20:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,169 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:20:36,169 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:20:36,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=3534, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:20:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-26 08:20:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:20:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-09-26 08:20:36,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 58 [2018-09-26 08:20:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,224 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-09-26 08:20:36,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:20:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-09-26 08:20:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:20:36,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,226 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1] [2018-09-26 08:20:36,226 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash -849340644, now seen corresponding path program 27 times [2018-09-26 08:20:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 301 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:20:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:20:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:20:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:36,325 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 32 states. [2018-09-26 08:20:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,558 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-09-26 08:20:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:20:36,559 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-09-26 08:20:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,560 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:20:36,560 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:20:36,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:20:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:20:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:20:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:20:36,620 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2018-09-26 08:20:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,620 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:20:36,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:20:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:20:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:20:36,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,622 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-26 08:20:36,623 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1801674907, now seen corresponding path program 28 times [2018-09-26 08:20:36,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:20:36,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:20:36,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:20:36,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:36,861 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 34 states. [2018-09-26 08:20:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,555 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-09-26 08:20:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:20:37,555 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2018-09-26 08:20:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,556 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:37,556 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:37,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=4025, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-26 08:20:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:20:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-09-26 08:20:37,613 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2018-09-26 08:20:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,613 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-09-26 08:20:37,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:20:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-09-26 08:20:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:20:37,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,614 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1] [2018-09-26 08:20:37,615 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash 513026948, now seen corresponding path program 29 times [2018-09-26 08:20:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 345 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,715 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:20:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:20:37,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:20:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:37,717 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 34 states. [2018-09-26 08:20:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,931 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2018-09-26 08:20:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:20:37,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-09-26 08:20:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,932 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:20:37,932 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:37,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:20:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:20:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:20:37,992 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-09-26 08:20:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,992 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:20:37,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:20:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:20:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:20:37,993 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,993 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:20:37,993 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1750165325, now seen corresponding path program 30 times [2018-09-26 08:20:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:20:38,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:20:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:20:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:38,238 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 36 states. [2018-09-26 08:20:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,070 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-09-26 08:20:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:20:39,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-09-26 08:20:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,071 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:20:39,071 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:20:39,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=4548, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:20:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-26 08:20:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:20:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-09-26 08:20:39,144 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 66 [2018-09-26 08:20:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,145 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-09-26 08:20:39,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:20:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-09-26 08:20:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:20:39,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,146 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1] [2018-09-26 08:20:39,146 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1723893092, now seen corresponding path program 31 times [2018-09-26 08:20:39,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 392 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:20:39,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:20:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:20:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:39,310 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 36 states. [2018-09-26 08:20:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,504 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-09-26 08:20:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:20:39,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-09-26 08:20:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,505 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:20:39,505 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:20:39,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:20:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:20:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:20:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:20:39,570 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 69 [2018-09-26 08:20:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,570 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:20:39,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:20:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:20:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:20:39,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,571 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-26 08:20:39,571 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash 116894181, now seen corresponding path program 32 times [2018-09-26 08:20:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:20:39,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:20:39,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:20:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:39,832 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 38 states. [2018-09-26 08:20:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,608 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-09-26 08:20:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:20:40,609 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2018-09-26 08:20:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,609 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:20:40,609 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:40,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=5103, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-26 08:20:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:20:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-09-26 08:20:40,672 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2018-09-26 08:20:40,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,672 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-09-26 08:20:40,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:20:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-09-26 08:20:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:20:40,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,673 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1] [2018-09-26 08:20:40,673 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash -820047612, now seen corresponding path program 33 times [2018-09-26 08:20:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 442 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:20:40,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:20:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:20:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:40,780 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 38 states. [2018-09-26 08:20:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,040 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-09-26 08:20:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:20:41,040 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-09-26 08:20:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,041 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:20:41,041 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:41,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:20:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:20:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:20:41,102 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 73 [2018-09-26 08:20:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,102 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:20:41,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:20:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:20:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:20:41,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,103 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:20:41,103 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash 992768973, now seen corresponding path program 34 times [2018-09-26 08:20:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:20:41,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:20:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:20:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:41,348 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 40 states. [2018-09-26 08:20:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:42,126 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 08:20:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:20:42,126 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2018-09-26 08:20:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:42,127 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:20:42,127 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:20:42,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=5690, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:20:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-26 08:20:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:20:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-09-26 08:20:42,191 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 74 [2018-09-26 08:20:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:42,192 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-09-26 08:20:42,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:20:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-09-26 08:20:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:20:42,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:42,193 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2018-09-26 08:20:42,193 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:42,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash 439557660, now seen corresponding path program 35 times [2018-09-26 08:20:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 495 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:42,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:20:42,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:20:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:20:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:42,366 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 40 states. [2018-09-26 08:20:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:42,627 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 08:20:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:20:42,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-09-26 08:20:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:42,628 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:20:42,628 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:20:42,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:20:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:20:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:20:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:20:42,700 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-09-26 08:20:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:42,700 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:20:42,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:20:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:20:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:20:42,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:42,703 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-26 08:20:42,704 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:42,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 667939941, now seen corresponding path program 36 times [2018-09-26 08:20:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:42,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:20:42,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:20:42,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:20:42,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:42,958 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 42 states. [2018-09-26 08:20:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:43,804 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-26 08:20:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:20:43,808 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2018-09-26 08:20:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:43,808 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:20:43,809 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:20:43,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=6309, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:20:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:20:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-26 08:20:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:20:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-09-26 08:20:43,878 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2018-09-26 08:20:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:43,878 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-09-26 08:20:43,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:20:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-09-26 08:20:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:20:43,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:43,879 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1] [2018-09-26 08:20:43,880 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:43,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash 19183236, now seen corresponding path program 37 times [2018-09-26 08:20:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 551 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:44,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:44,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:20:44,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:20:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:20:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:44,016 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 42 states. [2018-09-26 08:20:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:44,301 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-09-26 08:20:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:20:44,302 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2018-09-26 08:20:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:44,302 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:20:44,303 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:20:44,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:20:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:20:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:20:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:20:44,378 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 81 [2018-09-26 08:20:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:44,379 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:20:44,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:20:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:20:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:20:44,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:44,380 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:20:44,380 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:44,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1402257331, now seen corresponding path program 38 times [2018-09-26 08:20:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:44,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:44,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:20:44,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:20:44,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:20:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:44,656 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 44 states. [2018-09-26 08:20:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:45,646 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-09-26 08:20:45,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:20:45,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2018-09-26 08:20:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:45,647 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:20:45,647 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:20:45,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=6960, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:20:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-26 08:20:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:20:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-09-26 08:20:45,740 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 82 [2018-09-26 08:20:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:45,740 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-09-26 08:20:45,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:20:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-09-26 08:20:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:20:45,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:45,742 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1] [2018-09-26 08:20:45,742 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:45,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1792343652, now seen corresponding path program 39 times [2018-09-26 08:20:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 610 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:45,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:45,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:20:45,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:20:45,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:20:45,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:45,925 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 44 states. [2018-09-26 08:20:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:46,205 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-09-26 08:20:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:20:46,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-09-26 08:20:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:46,207 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:20:46,207 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:20:46,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:20:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:20:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:20:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:20:46,287 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 85 [2018-09-26 08:20:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:46,287 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:20:46,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:20:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:20:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:20:46,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:46,289 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-26 08:20:46,289 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:46,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1022001435, now seen corresponding path program 40 times [2018-09-26 08:20:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:46,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:46,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:20:46,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:20:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:20:46,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:46,578 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 46 states. [2018-09-26 08:20:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:47,524 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-09-26 08:20:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:20:47,525 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2018-09-26 08:20:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:47,525 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:20:47,526 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:20:47,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=7643, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:20:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-26 08:20:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:20:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-09-26 08:20:47,606 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2018-09-26 08:20:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:47,606 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-09-26 08:20:47,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:20:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-09-26 08:20:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:20:47,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:47,607 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1] [2018-09-26 08:20:47,607 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:47,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:47,608 INFO L82 PathProgramCache]: Analyzing trace with hash 582294532, now seen corresponding path program 41 times [2018-09-26 08:20:47,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 672 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:47,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:47,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:20:47,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:20:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:20:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:47,724 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 46 states. [2018-09-26 08:20:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:48,074 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2018-09-26 08:20:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:20:48,074 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2018-09-26 08:20:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:48,075 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:20:48,075 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:20:48,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:20:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:20:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:20:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:20:48,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-09-26 08:20:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:20:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:20:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:20:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:20:48,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:48,172 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:20:48,172 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:48,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash 824036557, now seen corresponding path program 42 times [2018-09-26 08:20:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:48,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:48,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:20:48,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:20:48,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:20:48,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:48,479 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 48 states. [2018-09-26 08:20:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:49,534 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-26 08:20:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:20:49,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2018-09-26 08:20:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:49,535 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:20:49,535 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:20:49,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=384, Invalid=8358, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:20:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-26 08:20:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:20:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-09-26 08:20:49,637 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 90 [2018-09-26 08:20:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:49,637 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-09-26 08:20:49,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:20:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-09-26 08:20:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:20:49,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:49,638 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1] [2018-09-26 08:20:49,639 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:49,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1156111076, now seen corresponding path program 43 times [2018-09-26 08:20:49,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 737 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:49,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:49,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:20:49,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:20:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:20:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:49,766 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 48 states. [2018-09-26 08:20:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:50,140 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-09-26 08:20:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:20:50,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2018-09-26 08:20:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:50,141 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:20:50,142 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:20:50,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:20:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:20:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:20:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:20:50,243 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 93 [2018-09-26 08:20:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:50,244 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:20:50,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:20:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:20:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:20:50,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:50,245 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-26 08:20:50,245 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:50,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:50,246 INFO L82 PathProgramCache]: Analyzing trace with hash 280512869, now seen corresponding path program 44 times [2018-09-26 08:20:50,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 1013 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:50,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:50,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:20:50,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:20:50,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:20:50,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:50,559 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 50 states. [2018-09-26 08:20:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:51,439 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-26 08:20:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:20:51,440 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2018-09-26 08:20:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:51,440 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:20:51,441 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:20:51,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=401, Invalid=9105, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:20:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:20:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-26 08:20:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:20:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-09-26 08:20:51,517 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2018-09-26 08:20:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:51,517 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-09-26 08:20:51,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:20:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-09-26 08:20:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:20:51,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:51,519 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1] [2018-09-26 08:20:51,519 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:51,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1243594364, now seen corresponding path program 45 times [2018-09-26 08:20:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 805 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:51,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:51,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:20:51,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:20:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:20:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:51,642 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2018-09-26 08:20:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:52,047 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-09-26 08:20:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:20:52,047 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-09-26 08:20:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:52,048 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:20:52,048 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:20:52,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:20:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:20:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:20:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:20:52,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 97 [2018-09-26 08:20:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:52,146 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:20:52,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:20:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:20:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:20:52,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:52,147 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:20:52,147 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:52,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1381243213, now seen corresponding path program 46 times [2018-09-26 08:20:52,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:52,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:52,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:20:52,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:20:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:20:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:52,568 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 52 states. [2018-09-26 08:20:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:53,541 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-09-26 08:20:53,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:20:53,541 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2018-09-26 08:20:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:53,542 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:20:53,542 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:20:53,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=418, Invalid=9884, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:20:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:20:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-26 08:20:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:20:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-09-26 08:20:53,614 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 98 [2018-09-26 08:20:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:53,615 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-09-26 08:20:53,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:20:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-09-26 08:20:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:20:53,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:53,616 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1] [2018-09-26 08:20:53,616 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:53,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1461221220, now seen corresponding path program 47 times [2018-09-26 08:20:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 876 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:53,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:53,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:20:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:20:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:20:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:53,738 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 52 states. [2018-09-26 08:20:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:54,160 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-09-26 08:20:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:20:54,161 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2018-09-26 08:20:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:54,162 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:20:54,162 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:20:54,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:20:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:20:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:20:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:20:54,268 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-09-26 08:20:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:54,268 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:20:54,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:20:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:20:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:20:54,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:54,269 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-26 08:20:54,270 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:54,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1264036891, now seen corresponding path program 48 times [2018-09-26 08:20:54,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 1201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:54,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:54,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:20:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:20:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:20:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:54,628 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 54 states. [2018-09-26 08:20:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,598 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-09-26 08:20:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:20:55,598 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2018-09-26 08:20:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,599 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:20:55,599 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:20:55,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=10695, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:20:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:20:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-09-26 08:20:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:20:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-09-26 08:20:55,698 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2018-09-26 08:20:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,699 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-09-26 08:20:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:20:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-09-26 08:20:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:20:55,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,700 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1] [2018-09-26 08:20:55,700 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1354114820, now seen corresponding path program 49 times [2018-09-26 08:20:55,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 950 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:20:55,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:20:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:20:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:55,841 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 54 states. [2018-09-26 08:20:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,208 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-09-26 08:20:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:20:56,208 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2018-09-26 08:20:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,209 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:20:56,209 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:20:56,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:20:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:20:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:20:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:20:56,288 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 105 [2018-09-26 08:20:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,289 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:20:56,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:20:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:20:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:20:56,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,290 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:20:56,290 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1390533171, now seen corresponding path program 50 times [2018-09-26 08:20:56,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 0 proven. 1301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,664 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,664 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:20:56,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:20:56,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:20:56,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:56,666 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 56 states. [2018-09-26 08:20:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,787 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-26 08:20:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:20:57,787 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2018-09-26 08:20:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,788 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:20:57,788 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:20:57,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=452, Invalid=11538, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:20:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:20:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-09-26 08:20:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:20:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-09-26 08:20:57,872 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 106 [2018-09-26 08:20:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,872 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-09-26 08:20:57,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:20:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-09-26 08:20:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:20:57,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,873 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1] [2018-09-26 08:20:57,873 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -410244068, now seen corresponding path program 51 times [2018-09-26 08:20:57,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 1027 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:20:58,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:20:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:20:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:58,022 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 56 states. [2018-09-26 08:20:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,369 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-09-26 08:20:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:20:58,369 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2018-09-26 08:20:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,370 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:20:58,370 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:20:58,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:20:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:20:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:20:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:20:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:20:58,451 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 109 [2018-09-26 08:20:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,452 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:20:58,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:20:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:20:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:20:58,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,452 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-26 08:20:58,453 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1093296539, now seen corresponding path program 52 times [2018-09-26 08:20:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 0 proven. 1405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:20:58,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:20:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:20:58,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:58,724 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 58 states. [2018-09-26 08:20:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:59,761 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 08:20:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:20:59,761 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2018-09-26 08:20:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:59,762 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:20:59,762 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:20:59,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=469, Invalid=12413, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:20:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:20:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-09-26 08:20:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:20:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-09-26 08:20:59,844 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2018-09-26 08:20:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,844 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-09-26 08:20:59,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:20:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-09-26 08:20:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:20:59,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:59,845 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1] [2018-09-26 08:20:59,845 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:59,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1656304508, now seen corresponding path program 53 times [2018-09-26 08:20:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 1107 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:20:59,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:20:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:20:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:59,968 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 58 states. [2018-09-26 08:21:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:00,277 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-09-26 08:21:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:21:00,277 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2018-09-26 08:21:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:00,278 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:21:00,278 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:21:00,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:21:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:21:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:21:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:21:00,359 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-09-26 08:21:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:00,359 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:21:00,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:21:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:21:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:21:00,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,360 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:21:00,360 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash -225709491, now seen corresponding path program 54 times [2018-09-26 08:21:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 1513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:00,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:00,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:21:00,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:21:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:21:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:00,630 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 60 states. [2018-09-26 08:21:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,610 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-09-26 08:21:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:21:01,610 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2018-09-26 08:21:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,611 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:21:01,611 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:21:01,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=486, Invalid=13320, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:21:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:21:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-09-26 08:21:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:21:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-09-26 08:21:01,695 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 114 [2018-09-26 08:21:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:01,696 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-09-26 08:21:01,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:21:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-09-26 08:21:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:21:01,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:01,697 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1] [2018-09-26 08:21:01,697 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:01,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:01,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1811222428, now seen corresponding path program 55 times [2018-09-26 08:21:01,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1190 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:21:01,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:21:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:21:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:01,866 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 60 states. [2018-09-26 08:21:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,251 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-09-26 08:21:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:21:02,251 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2018-09-26 08:21:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,252 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:21:02,252 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:21:02,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:21:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:21:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:21:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:21:02,344 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 117 [2018-09-26 08:21:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,345 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:21:02,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:21:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:21:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:21:02,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,346 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-26 08:21:02,346 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1422907163, now seen corresponding path program 56 times [2018-09-26 08:21:02,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 1625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:02,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:02,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:21:02,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:21:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:21:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:02,789 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 62 states. [2018-09-26 08:21:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:03,924 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-09-26 08:21:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:21:03,924 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2018-09-26 08:21:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:03,925 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:21:03,925 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:21:03,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=503, Invalid=14259, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:21:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:21:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-09-26 08:21:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:21:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-09-26 08:21:04,012 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2018-09-26 08:21:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,012 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-09-26 08:21:04,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:21:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-09-26 08:21:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:21:04,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,013 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1] [2018-09-26 08:21:04,013 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1503801860, now seen corresponding path program 57 times [2018-09-26 08:21:04,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 1276 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:04,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:21:04,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:21:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:21:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:04,192 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 62 states. [2018-09-26 08:21:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:04,590 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2018-09-26 08:21:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:21:04,591 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2018-09-26 08:21:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:04,592 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:21:04,592 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:21:04,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:21:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:21:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:21:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:21:04,744 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 121 [2018-09-26 08:21:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,745 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:21:04,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:21:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:21:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:21:04,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,746 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:21:04,746 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -408060211, now seen corresponding path program 58 times [2018-09-26 08:21:04,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 0 proven. 1741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:05,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:05,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:21:05,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:21:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:21:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:05,197 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 64 states. [2018-09-26 08:21:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,451 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-09-26 08:21:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:21:06,451 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2018-09-26 08:21:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,452 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:21:06,452 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:21:06,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=520, Invalid=15230, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:21:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:21:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-09-26 08:21:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:21:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-09-26 08:21:06,551 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 122 [2018-09-26 08:21:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:06,552 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-09-26 08:21:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:21:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-09-26 08:21:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:21:06,552 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:06,553 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1] [2018-09-26 08:21:06,553 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:06,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1760414948, now seen corresponding path program 59 times [2018-09-26 08:21:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 1365 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:06,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:06,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:21:06,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:21:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:21:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:06,683 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 64 states. [2018-09-26 08:21:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:07,134 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-09-26 08:21:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:21:07,134 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2018-09-26 08:21:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:07,135 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:21:07,135 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:21:07,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:21:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:21:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:21:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:21:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:21:07,268 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-09-26 08:21:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:07,268 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:21:07,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:21:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:21:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:21:07,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:07,269 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-26 08:21:07,270 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:07,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1638396773, now seen corresponding path program 60 times [2018-09-26 08:21:07,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 1861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:07,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:07,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:21:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:21:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:21:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:07,606 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 66 states. [2018-09-26 08:21:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:08,855 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-26 08:21:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:21:08,855 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2018-09-26 08:21:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:08,856 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:21:08,856 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:21:08,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=537, Invalid=16233, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:21:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:21:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-09-26 08:21:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:21:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-09-26 08:21:08,993 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2018-09-26 08:21:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:08,994 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-09-26 08:21:08,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:21:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-09-26 08:21:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:21:08,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:08,995 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1] [2018-09-26 08:21:08,995 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:08,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1473795972, now seen corresponding path program 61 times [2018-09-26 08:21:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 1457 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:09,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:09,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:21:09,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:21:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:21:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:09,196 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 66 states. [2018-09-26 08:21:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:09,662 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-09-26 08:21:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:21:09,663 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2018-09-26 08:21:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:09,664 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:21:09,664 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:21:09,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:21:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:21:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:21:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:21:09,779 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 129 [2018-09-26 08:21:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:09,779 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:21:09,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:21:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:21:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:21:09,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:09,780 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:21:09,780 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:09,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1704119117, now seen corresponding path program 62 times [2018-09-26 08:21:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 0 proven. 1985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:10,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:21:10,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:21:10,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:21:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:10,136 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 68 states. [2018-09-26 08:21:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:11,442 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-26 08:21:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:21:11,442 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 130 [2018-09-26 08:21:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:11,443 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:21:11,443 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:21:11,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=554, Invalid=17268, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:21:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:21:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-09-26 08:21:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:21:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-09-26 08:21:11,554 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 130 [2018-09-26 08:21:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:11,555 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-09-26 08:21:11,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:21:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-09-26 08:21:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:21:11,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:11,556 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1] [2018-09-26 08:21:11,556 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:11,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 903059100, now seen corresponding path program 63 times [2018-09-26 08:21:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 1552 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:11,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:11,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:21:11,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:21:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:21:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:11,692 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 68 states. [2018-09-26 08:21:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,147 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-09-26 08:21:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:21:12,147 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2018-09-26 08:21:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,148 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:21:12,148 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:21:12,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:21:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:21:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:21:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:21:12,273 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 133 [2018-09-26 08:21:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:12,274 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:21:12,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:21:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:21:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:21:12,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:12,275 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-26 08:21:12,275 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:12,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 908918245, now seen corresponding path program 64 times [2018-09-26 08:21:12,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 0 proven. 2113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:12,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:12,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:21:12,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:21:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:21:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:12,748 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 70 states. [2018-09-26 08:21:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:14,005 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-09-26 08:21:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:21:14,005 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 134 [2018-09-26 08:21:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:14,006 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:21:14,006 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:21:14,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=571, Invalid=18335, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:21:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:21:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-09-26 08:21:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:21:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-09-26 08:21:14,121 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2018-09-26 08:21:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:14,121 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-09-26 08:21:14,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:21:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-09-26 08:21:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:21:14,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:14,122 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1] [2018-09-26 08:21:14,122 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:14,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2113486084, now seen corresponding path program 65 times [2018-09-26 08:21:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 1650 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:14,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:14,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:21:14,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:21:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:21:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:14,261 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 70 states. [2018-09-26 08:21:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:14,875 INFO L93 Difference]: Finished difference Result 244 states and 246 transitions. [2018-09-26 08:21:14,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:21:14,875 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2018-09-26 08:21:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:14,876 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:21:14,876 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:21:14,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:21:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:21:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:21:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:21:14,994 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-09-26 08:21:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:14,994 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:21:14,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:21:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:21:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:21:14,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:14,995 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:21:14,995 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:14,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1498142669, now seen corresponding path program 66 times [2018-09-26 08:21:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 2245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:15,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:15,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:21:15,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:21:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:21:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:15,353 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 72 states. [2018-09-26 08:21:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:16,795 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-26 08:21:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:21:16,795 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 138 [2018-09-26 08:21:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:16,796 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:21:16,796 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:21:16,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=588, Invalid=19434, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:21:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:21:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-26 08:21:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:21:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-09-26 08:21:16,926 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 138 [2018-09-26 08:21:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:16,926 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-09-26 08:21:16,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:21:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-09-26 08:21:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:21:16,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:16,927 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1] [2018-09-26 08:21:16,927 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:16,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2128004580, now seen corresponding path program 67 times [2018-09-26 08:21:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 1751 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:17,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:17,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:21:17,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:21:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:21:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:17,094 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 72 states. [2018-09-26 08:21:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:17,758 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-09-26 08:21:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:21:17,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2018-09-26 08:21:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:17,760 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:21:17,760 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:21:17,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:21:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:21:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:21:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:21:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:21:17,888 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 141 [2018-09-26 08:21:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:17,888 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:21:17,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:21:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:21:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:21:17,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:17,889 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-26 08:21:17,889 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:17,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash -391165851, now seen corresponding path program 68 times [2018-09-26 08:21:17,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 0 proven. 2381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:18,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:18,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:21:18,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:21:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:21:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:18,305 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 74 states. [2018-09-26 08:21:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:19,917 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-09-26 08:21:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:21:19,918 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 142 [2018-09-26 08:21:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:19,918 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:21:19,919 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:21:19,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=20565, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:21:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:21:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-09-26 08:21:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:21:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-09-26 08:21:20,117 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2018-09-26 08:21:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:20,117 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-09-26 08:21:20,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:21:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-09-26 08:21:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:21:20,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:20,119 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1] [2018-09-26 08:21:20,119 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:20,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash -971709820, now seen corresponding path program 69 times [2018-09-26 08:21:20,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 1855 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:20,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:20,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:21:20,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:21:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:21:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:20,342 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 74 states. [2018-09-26 08:21:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:20,931 INFO L93 Difference]: Finished difference Result 258 states and 260 transitions. [2018-09-26 08:21:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:21:20,931 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2018-09-26 08:21:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:20,932 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:21:20,932 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:21:20,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:21:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:21:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:21:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:21:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:21:21,061 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 145 [2018-09-26 08:21:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:21,062 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:21:21,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:21:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:21:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:21:21,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:21,062 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:21:21,062 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:21,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1008163763, now seen corresponding path program 70 times [2018-09-26 08:21:21,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2521 backedges. 0 proven. 2521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:21,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:21,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:21,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:21,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:21,524 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 76 states. [2018-09-26 08:21:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:23,086 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-09-26 08:21:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:21:23,086 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 146 [2018-09-26 08:21:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:23,087 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:21:23,087 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:21:23,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2630 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=622, Invalid=21728, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:21:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:21:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-09-26 08:21:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:21:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-09-26 08:21:23,264 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 146 [2018-09-26 08:21:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:23,264 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-09-26 08:21:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-09-26 08:21:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:21:23,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:23,265 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1] [2018-09-26 08:21:23,266 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:23,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash 503520668, now seen corresponding path program 71 times [2018-09-26 08:21:23,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 1962 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:23,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:23,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:23,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:23,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:23,452 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 76 states. [2018-09-26 08:21:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:24,045 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-09-26 08:21:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:21:24,045 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2018-09-26 08:21:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:24,046 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:21:24,046 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:21:24,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:21:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:21:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:21:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:21:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:21:24,298 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-09-26 08:21:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:24,299 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:21:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:21:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:21:24,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:24,300 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-09-26 08:21:24,300 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:24,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1524706587, now seen corresponding path program 72 times [2018-09-26 08:21:24,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2665 backedges. 0 proven. 2665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:24,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:24,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:24,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:24,818 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 78 states. [2018-09-26 08:21:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:26,557 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-09-26 08:21:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:21:26,557 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 150 [2018-09-26 08:21:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:26,559 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:21:26,559 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:21:26,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=639, Invalid=22923, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:21:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:21:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-09-26 08:21:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:21:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-09-26 08:21:26,732 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2018-09-26 08:21:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:26,732 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-09-26 08:21:26,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-09-26 08:21:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:21:26,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:26,733 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1] [2018-09-26 08:21:26,733 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:26,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1044072452, now seen corresponding path program 73 times [2018-09-26 08:21:26,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 2072 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:27,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:27,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:27,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:27,010 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 78 states. [2018-09-26 08:21:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:27,862 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-09-26 08:21:27,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:21:27,862 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2018-09-26 08:21:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:27,863 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:21:27,864 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:21:27,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:21:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:21:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:21:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:21:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:21:28,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 153 [2018-09-26 08:21:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:28,054 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:21:28,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:21:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:21:28,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:28,055 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:21:28,055 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:28,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1166462771, now seen corresponding path program 74 times [2018-09-26 08:21:28,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2813 backedges. 0 proven. 2813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:28,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:28,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:28,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:28,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:28,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:28,608 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 80 states. [2018-09-26 08:21:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:30,312 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-09-26 08:21:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:21:30,312 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 154 [2018-09-26 08:21:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:30,313 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:21:30,313 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:21:30,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=656, Invalid=24150, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:21:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:21:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-09-26 08:21:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:21:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-09-26 08:21:30,468 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 154 [2018-09-26 08:21:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:30,468 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-09-26 08:21:30,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-09-26 08:21:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:21:30,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:30,469 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1] [2018-09-26 08:21:30,469 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:30,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash 491864348, now seen corresponding path program 75 times [2018-09-26 08:21:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 2185 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:30,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:30,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:30,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:30,647 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 80 states. [2018-09-26 08:21:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:31,259 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2018-09-26 08:21:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:21:31,259 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2018-09-26 08:21:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:31,260 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:21:31,260 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:21:31,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:21:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:21:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:21:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:21:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:21:31,405 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 157 [2018-09-26 08:21:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:31,405 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:21:31,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:21:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:21:31,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:31,406 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-09-26 08:21:31,406 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:31,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash 57384293, now seen corresponding path program 76 times [2018-09-26 08:21:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2965 backedges. 0 proven. 2965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:31,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:31,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:21:31,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:31,904 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 82 states. [2018-09-26 08:21:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,759 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-26 08:21:33,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:21:33,759 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2018-09-26 08:21:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,760 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:21:33,760 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:21:33,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=673, Invalid=25409, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:21:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:21:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-09-26 08:21:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:21:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-09-26 08:21:33,905 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2018-09-26 08:21:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,905 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-09-26 08:21:33,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-09-26 08:21:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:21:33,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,906 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1] [2018-09-26 08:21:33,906 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash 142372228, now seen corresponding path program 77 times [2018-09-26 08:21:33,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 2301 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:21:34,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:34,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:34,091 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 82 states. [2018-09-26 08:21:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,781 INFO L93 Difference]: Finished difference Result 286 states and 288 transitions. [2018-09-26 08:21:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:21:34,781 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2018-09-26 08:21:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,783 INFO L225 Difference]: With dead ends: 286 [2018-09-26 08:21:34,783 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:21:34,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:21:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:21:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:21:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:21:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:21:34,936 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-09-26 08:21:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,936 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:21:34,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:21:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:21:34,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,937 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:21:34,937 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1712160077, now seen corresponding path program 78 times [2018-09-26 08:21:34,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 0 proven. 3121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:21:35,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:21:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:21:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:35,492 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 84 states. [2018-09-26 08:21:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,383 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-09-26 08:21:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:21:37,383 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 162 [2018-09-26 08:21:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,384 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:21:37,384 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:21:37,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=690, Invalid=26700, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:21:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:21:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-09-26 08:21:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:21:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-09-26 08:21:37,535 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 162 [2018-09-26 08:21:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,536 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-09-26 08:21:37,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:21:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-09-26 08:21:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:21:37,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,536 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1] [2018-09-26 08:21:37,537 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash -66870116, now seen corresponding path program 79 times [2018-09-26 08:21:37,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 2420 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:21:37,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:21:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:21:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:37,736 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 84 states. [2018-09-26 08:21:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,272 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-09-26 08:21:38,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:21:38,272 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2018-09-26 08:21:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,273 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:21:38,273 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:21:38,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:21:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:21:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:21:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:21:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:21:38,435 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 165 [2018-09-26 08:21:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,435 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:21:38,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:21:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:21:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:21:38,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,436 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-09-26 08:21:38,436 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash 126199781, now seen corresponding path program 80 times [2018-09-26 08:21:38,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 0 proven. 3281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:21:38,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:21:38,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:21:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:38,953 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 86 states. [2018-09-26 08:21:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,880 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-09-26 08:21:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:21:40,880 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 166 [2018-09-26 08:21:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,881 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:21:40,881 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:21:40,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3405 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=707, Invalid=28023, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:21:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:21:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-09-26 08:21:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:21:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-09-26 08:21:41,051 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 166 [2018-09-26 08:21:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,051 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-09-26 08:21:41,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:21:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-09-26 08:21:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:21:41,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,052 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 1, 1, 1, 1] [2018-09-26 08:21:41,052 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1525175044, now seen corresponding path program 81 times [2018-09-26 08:21:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 2542 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:41,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:41,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:21:41,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:21:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:21:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:41,300 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 86 states. [2018-09-26 08:21:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,031 INFO L93 Difference]: Finished difference Result 300 states and 302 transitions. [2018-09-26 08:21:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:21:42,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2018-09-26 08:21:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,032 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:21:42,032 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:21:42,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:21:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:21:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:21:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:21:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:21:42,192 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 169 [2018-09-26 08:21:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,192 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:21:42,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:21:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:21:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:21:42,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,193 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:21:42,193 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash 62228941, now seen corresponding path program 82 times [2018-09-26 08:21:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3445 backedges. 0 proven. 3445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:21:42,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:21:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:21:42,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:42,709 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 88 states. [2018-09-26 08:21:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:44,835 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-09-26 08:21:44,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:21:44,835 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 170 [2018-09-26 08:21:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:44,836 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:21:44,836 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:21:44,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=29378, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:21:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:21:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-09-26 08:21:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:21:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-09-26 08:21:45,026 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 170 [2018-09-26 08:21:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,026 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-09-26 08:21:45,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:21:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-09-26 08:21:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:21:45,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,027 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 1, 1, 1, 1] [2018-09-26 08:21:45,027 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1559607268, now seen corresponding path program 83 times [2018-09-26 08:21:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 2667 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:21:45,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:21:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:21:45,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:45,268 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 88 states. [2018-09-26 08:21:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,996 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:21:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:21:45,996 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2018-09-26 08:21:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,997 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:21:45,997 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:21:45,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:21:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:21:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:21:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:21:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:21:46,166 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-09-26 08:21:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,167 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:21:46,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:21:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:21:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:21:46,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,168 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-09-26 08:21:46,168 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash 559739493, now seen corresponding path program 84 times [2018-09-26 08:21:46,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3613 backedges. 0 proven. 3613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:21:46,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:21:46,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:21:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:46,715 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 90 states. [2018-09-26 08:21:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:48,930 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-09-26 08:21:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:21:48,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 174 [2018-09-26 08:21:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:48,931 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:21:48,931 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:21:48,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3743 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=741, Invalid=30765, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:21:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:21:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-09-26 08:21:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:21:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-09-26 08:21:49,131 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 174 [2018-09-26 08:21:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,131 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-09-26 08:21:49,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:21:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-09-26 08:21:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:21:49,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,132 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 1, 1, 1, 1] [2018-09-26 08:21:49,132 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2140076164, now seen corresponding path program 85 times [2018-09-26 08:21:49,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 2795 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:49,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:21:49,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:21:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:21:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:49,383 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 90 states. [2018-09-26 08:21:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,222 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-09-26 08:21:50,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:21:50,222 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2018-09-26 08:21:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,223 INFO L225 Difference]: With dead ends: 314 [2018-09-26 08:21:50,223 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:21:50,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:21:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:21:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:21:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:21:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:21:50,396 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 177 [2018-09-26 08:21:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,396 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:21:50,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:21:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:21:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:21:50,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,397 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:21:50,397 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -461285811, now seen corresponding path program 86 times [2018-09-26 08:21:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3785 backedges. 0 proven. 3785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:21:50,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:21:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:21:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:50,953 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 92 states. [2018-09-26 08:21:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,305 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-09-26 08:21:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:21:53,305 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 178 [2018-09-26 08:21:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,306 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:21:53,306 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:21:53,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3918 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=758, Invalid=32184, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:21:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:21:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-09-26 08:21:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:21:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-09-26 08:21:53,516 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 178 [2018-09-26 08:21:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,516 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-09-26 08:21:53,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:21:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-09-26 08:21:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:21:53,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,517 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 1, 1, 1, 1] [2018-09-26 08:21:53,517 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1733634972, now seen corresponding path program 87 times [2018-09-26 08:21:53,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 2926 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:53,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:53,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:21:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:21:53,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:21:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:53,785 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 92 states. [2018-09-26 08:21:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:54,775 INFO L93 Difference]: Finished difference Result 321 states and 323 transitions. [2018-09-26 08:21:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:21:54,775 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2018-09-26 08:21:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:54,776 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:21:54,776 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:21:54,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:21:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:21:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:21:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:21:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:21:54,982 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 181 [2018-09-26 08:21:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:54,982 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:21:54,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:21:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:21:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:21:54,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:54,983 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-09-26 08:21:54,983 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:54,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 752975077, now seen corresponding path program 88 times [2018-09-26 08:21:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3961 backedges. 0 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:55,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:55,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:21:55,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:21:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:21:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:55,886 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 94 states. [2018-09-26 08:21:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,320 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-09-26 08:21:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:21:58,320 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 182 [2018-09-26 08:21:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,321 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:21:58,321 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:21:58,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=775, Invalid=33635, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:21:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:21:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-09-26 08:21:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:21:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-09-26 08:21:58,537 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 182 [2018-09-26 08:21:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,538 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-09-26 08:21:58,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:21:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-09-26 08:21:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:21:58,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:58,538 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 1, 1, 1, 1] [2018-09-26 08:21:58,539 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:58,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -729784828, now seen corresponding path program 89 times [2018-09-26 08:21:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 3060 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:58,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:21:58,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:21:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:21:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:58,810 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 94 states. [2018-09-26 08:21:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:59,450 INFO L93 Difference]: Finished difference Result 328 states and 330 transitions. [2018-09-26 08:21:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:21:59,450 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2018-09-26 08:21:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:59,451 INFO L225 Difference]: With dead ends: 328 [2018-09-26 08:21:59,451 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:21:59,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:21:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:21:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:21:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:21:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:21:59,662 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 185 [2018-09-26 08:21:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:59,662 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:21:59,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:21:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:21:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:21:59,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:59,663 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:21:59,663 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:59,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1837163213, now seen corresponding path program 90 times [2018-09-26 08:21:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:00,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:00,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:22:00,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:22:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:22:00,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:00,336 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 96 states. [2018-09-26 08:22:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:02,861 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-09-26 08:22:02,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:22:02,861 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 186 [2018-09-26 08:22:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:02,862 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:22:02,862 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:22:02,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=792, Invalid=35118, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:22:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:22:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-09-26 08:22:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:22:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-09-26 08:22:03,065 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 186 [2018-09-26 08:22:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-09-26 08:22:03,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:22:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-09-26 08:22:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:22:03,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:03,066 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1] [2018-09-26 08:22:03,066 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:03,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash 164908828, now seen corresponding path program 91 times [2018-09-26 08:22:03,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 3197 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:03,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:03,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:22:03,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:22:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:22:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:03,335 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 96 states. [2018-09-26 08:22:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:04,277 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2018-09-26 08:22:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:22:04,277 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2018-09-26 08:22:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:04,278 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:22:04,278 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:22:04,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:22:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:22:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:22:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:22:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:22:04,518 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 189 [2018-09-26 08:22:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:04,519 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:22:04,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:22:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:22:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:22:04,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:04,520 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-09-26 08:22:04,520 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:04,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1912817509, now seen corresponding path program 92 times [2018-09-26 08:22:04,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4325 backedges. 0 proven. 4325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:05,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:05,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:22:05,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:22:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:22:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:05,162 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 98 states. [2018-09-26 08:22:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:07,725 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-09-26 08:22:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:22:07,725 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 190 [2018-09-26 08:22:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:07,726 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:22:07,726 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:22:07,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4467 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=809, Invalid=36633, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:22:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:22:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-09-26 08:22:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:22:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-09-26 08:22:07,961 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 190 [2018-09-26 08:22:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:07,961 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-09-26 08:22:07,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:22:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-09-26 08:22:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:22:07,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:07,963 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 1, 1, 1, 1] [2018-09-26 08:22:07,963 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:07,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash -875789436, now seen corresponding path program 93 times [2018-09-26 08:22:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 3337 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:08,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:08,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:22:08,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:22:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:22:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:08,331 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 98 states. [2018-09-26 08:22:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:09,481 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-09-26 08:22:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:22:09,481 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2018-09-26 08:22:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:09,483 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:22:09,483 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:22:09,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:22:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:22:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:22:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:22:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:22:09,725 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 193 [2018-09-26 08:22:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:09,725 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:22:09,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:22:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:22:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:22:09,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:09,726 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:22:09,726 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:09,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash 398733133, now seen corresponding path program 94 times [2018-09-26 08:22:09,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4513 backedges. 0 proven. 4513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:10,466 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:10,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:22:10,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:22:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:22:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:22:10,468 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 100 states. [2018-09-26 08:22:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:13,388 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-26 08:22:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:22:13,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 194 [2018-09-26 08:22:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:13,389 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:22:13,389 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:22:13,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4658 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=826, Invalid=38180, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:22:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:22:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-09-26 08:22:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:22:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-09-26 08:22:13,633 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 194 [2018-09-26 08:22:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:13,634 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-09-26 08:22:13,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:22:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-09-26 08:22:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:22:13,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:13,635 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 1, 1, 1, 1] [2018-09-26 08:22:13,635 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:13,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1216892260, now seen corresponding path program 95 times [2018-09-26 08:22:13,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 3480 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:13,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:13,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:22:13,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:22:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:22:13,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:22:13,937 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 100 states. [2018-09-26 08:22:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:15,122 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2018-09-26 08:22:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:22:15,122 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2018-09-26 08:22:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:15,123 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:22:15,123 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:22:15,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:22:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:22:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:22:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:22:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:22:15,368 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 197 [2018-09-26 08:22:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:15,368 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:22:15,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:22:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:22:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:22:15,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:15,369 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-09-26 08:22:15,370 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:15,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1531817499, now seen corresponding path program 96 times [2018-09-26 08:22:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4705 backedges. 0 proven. 4705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:16,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:16,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:22:16,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:22:16,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:22:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:16,155 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 102 states. [2018-09-26 08:22:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:19,021 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-09-26 08:22:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:22:19,021 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 198 [2018-09-26 08:22:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:19,022 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:22:19,022 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:22:19,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4853 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=843, Invalid=39759, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:22:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:22:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-09-26 08:22:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:22:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-09-26 08:22:19,269 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 198 [2018-09-26 08:22:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:19,270 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-09-26 08:22:19,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:22:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-09-26 08:22:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:22:19,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:19,271 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 1, 1, 1, 1] [2018-09-26 08:22:19,271 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:19,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash -343709436, now seen corresponding path program 97 times [2018-09-26 08:22:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 3626 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:19,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:19,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:22:19,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:22:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:22:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:19,580 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 102 states. [2018-09-26 08:22:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:20,365 INFO L93 Difference]: Finished difference Result 356 states and 358 transitions. [2018-09-26 08:22:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:22:20,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-09-26 08:22:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:20,366 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:22:20,366 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:22:20,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:22:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:22:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:22:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:22:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:22:20,601 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 201 [2018-09-26 08:22:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:20,601 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:22:20,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:22:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:22:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:22:20,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:20,602 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:22:20,603 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1885027277, now seen corresponding path program 98 times [2018-09-26 08:22:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4901 backedges. 0 proven. 4901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:21,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:21,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:22:21,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:22:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:22:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:21,373 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 104 states. [2018-09-26 08:22:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:24,068 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-09-26 08:22:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:22:24,068 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 202 [2018-09-26 08:22:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:24,069 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:22:24,069 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:22:24,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5052 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=860, Invalid=41370, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:22:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:22:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-09-26 08:22:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:22:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-09-26 08:22:24,298 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 202 [2018-09-26 08:22:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:24,299 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-09-26 08:22:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:22:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-09-26 08:22:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:22:24,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:24,300 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 1, 1, 1, 1] [2018-09-26 08:22:24,300 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:24,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:24,300 INFO L82 PathProgramCache]: Analyzing trace with hash 154097180, now seen corresponding path program 99 times [2018-09-26 08:22:24,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 3775 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:24,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:24,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:22:24,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:22:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:22:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:24,594 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 104 states. [2018-09-26 08:22:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:25,756 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2018-09-26 08:22:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:22:25,756 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2018-09-26 08:22:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:25,757 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:22:25,757 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:22:25,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:22:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:22:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:22:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:22:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:22:26,034 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 205 [2018-09-26 08:22:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:26,035 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:22:26,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:22:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:22:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:22:26,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:26,036 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-09-26 08:22:26,036 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:26,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash -455173019, now seen corresponding path program 100 times [2018-09-26 08:22:26,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5101 backedges. 0 proven. 5101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:26,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:26,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:22:26,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:22:26,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:22:26,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:26,820 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 106 states. [2018-09-26 08:22:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:29,886 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-09-26 08:22:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:22:29,886 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 206 [2018-09-26 08:22:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:29,888 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:22:29,888 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:22:29,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5255 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=877, Invalid=43013, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:22:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:22:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-09-26 08:22:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:22:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-09-26 08:22:30,138 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 206 [2018-09-26 08:22:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:30,138 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-09-26 08:22:30,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:22:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-09-26 08:22:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:22:30,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:30,139 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 1, 1, 1, 1] [2018-09-26 08:22:30,139 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:30,140 INFO L82 PathProgramCache]: Analyzing trace with hash -843772284, now seen corresponding path program 101 times [2018-09-26 08:22:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 3927 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:30,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:30,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:22:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:22:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:22:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:30,486 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 106 states. [2018-09-26 08:22:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:31,445 INFO L93 Difference]: Finished difference Result 370 states and 372 transitions. [2018-09-26 08:22:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:22:31,445 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2018-09-26 08:22:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:31,446 INFO L225 Difference]: With dead ends: 370 [2018-09-26 08:22:31,447 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:22:31,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:22:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:22:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:22:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:22:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:22:31,697 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 209 [2018-09-26 08:22:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:31,697 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:22:31,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:22:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:22:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:22:31,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:31,699 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:22:31,699 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:31,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 408291405, now seen corresponding path program 102 times [2018-09-26 08:22:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5305 backedges. 0 proven. 5305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:32,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:32,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:22:32,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:22:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:22:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:32,468 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 108 states. [2018-09-26 08:22:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:35,670 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-09-26 08:22:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:22:35,670 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 210 [2018-09-26 08:22:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:35,671 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:22:35,671 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:22:35,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5462 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=894, Invalid=44688, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:22:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:22:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-09-26 08:22:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:22:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-09-26 08:22:35,953 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 210 [2018-09-26 08:22:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:35,953 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-09-26 08:22:35,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:22:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-09-26 08:22:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:22:35,954 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:35,955 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 1, 1, 1, 1] [2018-09-26 08:22:35,955 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:35,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 65747356, now seen corresponding path program 103 times [2018-09-26 08:22:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 4082 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:36,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:36,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:22:36,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:22:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:22:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:36,281 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 108 states. [2018-09-26 08:22:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:37,287 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-09-26 08:22:37,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:22:37,287 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2018-09-26 08:22:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:37,288 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:22:37,288 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:22:37,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:22:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:22:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:22:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:22:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:22:37,540 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 213 [2018-09-26 08:22:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:37,540 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:22:37,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:22:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:22:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:22:37,541 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:37,541 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-09-26 08:22:37,541 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:37,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1099421979, now seen corresponding path program 104 times [2018-09-26 08:22:37,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5513 backedges. 0 proven. 5513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:38,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:38,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:22:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:22:38,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:22:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:38,368 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 110 states. [2018-09-26 08:22:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:41,403 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-09-26 08:22:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:22:41,403 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 214 [2018-09-26 08:22:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:41,404 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:22:41,404 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:22:41,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=911, Invalid=46395, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:22:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:22:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-09-26 08:22:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:22:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2018-09-26 08:22:41,667 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 214 [2018-09-26 08:22:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:41,667 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2018-09-26 08:22:41,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:22:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2018-09-26 08:22:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:22:41,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:41,668 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 1, 1, 1, 1] [2018-09-26 08:22:41,668 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:41,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash 544306180, now seen corresponding path program 105 times [2018-09-26 08:22:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 4240 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:42,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:42,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:22:42,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:22:42,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:22:42,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:42,091 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 110 states. [2018-09-26 08:22:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:43,128 INFO L93 Difference]: Finished difference Result 384 states and 386 transitions. [2018-09-26 08:22:43,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:22:43,128 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2018-09-26 08:22:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:43,128 INFO L225 Difference]: With dead ends: 384 [2018-09-26 08:22:43,128 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:22:43,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:22:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:22:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:22:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:22:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:22:43,387 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 217 [2018-09-26 08:22:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:43,387 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:22:43,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:22:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:22:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:22:43,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:43,388 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:22:43,388 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:43,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -993749811, now seen corresponding path program 106 times [2018-09-26 08:22:43,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 0 proven. 5725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:44,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:44,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:22:44,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:22:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:22:44,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:44,222 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 112 states. [2018-09-26 08:22:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:47,468 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-09-26 08:22:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:22:47,469 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 218 [2018-09-26 08:22:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:47,469 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:22:47,469 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:22:47,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5888 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=928, Invalid=48134, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:22:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:22:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2018-09-26 08:22:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:22:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-09-26 08:22:47,779 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 218 [2018-09-26 08:22:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:47,779 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-09-26 08:22:47,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:22:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-09-26 08:22:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:22:47,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:47,780 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 1, 1, 1, 1] [2018-09-26 08:22:47,780 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:47,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash 412835100, now seen corresponding path program 107 times [2018-09-26 08:22:47,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 4401 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:48,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:48,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:22:48,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:22:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:22:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:48,183 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 112 states. [2018-09-26 08:22:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:49,445 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-09-26 08:22:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:22:49,445 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 221 [2018-09-26 08:22:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:49,446 INFO L225 Difference]: With dead ends: 391 [2018-09-26 08:22:49,446 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:22:49,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:22:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:22:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:22:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:22:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:22:49,749 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 221 [2018-09-26 08:22:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:49,749 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:22:49,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:22:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:22:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:22:49,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:49,750 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-09-26 08:22:49,750 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:49,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:49,751 INFO L82 PathProgramCache]: Analyzing trace with hash 695136613, now seen corresponding path program 108 times [2018-09-26 08:22:49,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5941 backedges. 0 proven. 5941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:50,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:50,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:22:50,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:22:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:22:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:50,733 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 114 states. [2018-09-26 08:22:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:54,326 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-09-26 08:22:54,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:22:54,326 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 222 [2018-09-26 08:22:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:54,327 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:22:54,327 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:22:54,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6107 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=945, Invalid=49905, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:22:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:22:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-09-26 08:22:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:22:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-09-26 08:22:54,643 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2018-09-26 08:22:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:54,644 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-09-26 08:22:54,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:22:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-09-26 08:22:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:22:54,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:54,645 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 1, 1, 1, 1] [2018-09-26 08:22:54,645 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:54,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1513580156, now seen corresponding path program 109 times [2018-09-26 08:22:54,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 4565 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:55,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:55,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:22:55,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:22:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:22:55,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:55,037 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 114 states. [2018-09-26 08:22:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:56,333 INFO L93 Difference]: Finished difference Result 398 states and 400 transitions. [2018-09-26 08:22:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:22:56,333 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 225 [2018-09-26 08:22:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:56,334 INFO L225 Difference]: With dead ends: 398 [2018-09-26 08:22:56,334 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:22:56,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:22:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:22:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:22:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:22:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:22:56,643 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 225 [2018-09-26 08:22:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:56,643 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:22:56,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:22:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:22:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:22:56,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:56,644 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:22:56,644 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:56,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1052172621, now seen corresponding path program 110 times [2018-09-26 08:22:56,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 0 proven. 6161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:57,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:57,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:22:57,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:22:57,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:22:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:22:57,537 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 116 states. [2018-09-26 08:23:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:01,183 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-09-26 08:23:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:23:01,184 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 226 [2018-09-26 08:23:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:01,184 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:23:01,184 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:23:01,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6330 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=962, Invalid=51708, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:23:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:23:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-09-26 08:23:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:23:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-09-26 08:23:01,478 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 226 [2018-09-26 08:23:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:01,478 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-09-26 08:23:01,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:23:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-09-26 08:23:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:23:01,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:01,479 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 1, 1, 1, 1] [2018-09-26 08:23:01,479 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:01,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash 607109276, now seen corresponding path program 111 times [2018-09-26 08:23:01,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 4732 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:01,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:01,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:23:01,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:23:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:23:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:23:01,849 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 116 states. [2018-09-26 08:23:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:03,038 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2018-09-26 08:23:03,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:23:03,038 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 229 [2018-09-26 08:23:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:03,039 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:23:03,039 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:23:03,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:23:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:23:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:23:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:23:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:23:03,345 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 229 [2018-09-26 08:23:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:03,345 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:23:03,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:23:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:23:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:23:03,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:03,346 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-09-26 08:23:03,346 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:03,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1984758811, now seen corresponding path program 112 times [2018-09-26 08:23:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6385 backedges. 0 proven. 6385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:04,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:04,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:23:04,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:23:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:23:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:23:04,325 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 118 states. [2018-09-26 08:23:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:07,742 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-09-26 08:23:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:23:07,742 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 230 [2018-09-26 08:23:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:07,743 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:23:07,743 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:23:07,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6557 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=979, Invalid=53543, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:23:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:23:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2018-09-26 08:23:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:23:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-09-26 08:23:08,043 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 230 [2018-09-26 08:23:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:08,044 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-09-26 08:23:08,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:23:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-09-26 08:23:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:23:08,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:08,044 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 1, 1, 1, 1] [2018-09-26 08:23:08,045 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:08,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash 868908804, now seen corresponding path program 113 times [2018-09-26 08:23:08,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 4902 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:08,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:08,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:23:08,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:23:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:23:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:23:08,495 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 118 states. [2018-09-26 08:23:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:09,595 INFO L93 Difference]: Finished difference Result 412 states and 414 transitions. [2018-09-26 08:23:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:23:09,595 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 233 [2018-09-26 08:23:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:09,596 INFO L225 Difference]: With dead ends: 412 [2018-09-26 08:23:09,596 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:23:09,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:23:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:23:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:23:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:23:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:23:09,904 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 233 [2018-09-26 08:23:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:09,904 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:23:09,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:23:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:23:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:23:09,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:09,905 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:23:09,905 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:09,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1664937421, now seen corresponding path program 114 times [2018-09-26 08:23:09,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6613 backedges. 0 proven. 6613 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:10,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:10,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:23:10,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:23:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:23:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:23:10,891 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 120 states. [2018-09-26 08:23:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:14,824 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-09-26 08:23:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:23:14,824 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 234 [2018-09-26 08:23:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:14,825 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:23:14,825 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:23:14,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6788 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=996, Invalid=55410, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:23:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:23:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-09-26 08:23:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:23:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-09-26 08:23:15,174 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 234 [2018-09-26 08:23:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:15,174 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-09-26 08:23:15,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:23:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-09-26 08:23:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:23:15,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:15,175 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 1, 1, 1, 1] [2018-09-26 08:23:15,175 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:15,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:15,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1872258076, now seen corresponding path program 115 times [2018-09-26 08:23:15,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 5075 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:15,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:15,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:23:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:23:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:23:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:23:15,686 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 120 states. [2018-09-26 08:23:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:17,186 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2018-09-26 08:23:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:23:17,186 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 237 [2018-09-26 08:23:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:17,187 INFO L225 Difference]: With dead ends: 419 [2018-09-26 08:23:17,187 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:23:17,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:23:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:23:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:23:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:23:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-09-26 08:23:17,576 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 237 [2018-09-26 08:23:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:17,577 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-09-26 08:23:17,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:23:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-09-26 08:23:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:23:17,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:17,577 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-09-26 08:23:17,578 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:17,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1355528603, now seen corresponding path program 116 times [2018-09-26 08:23:17,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6845 backedges. 0 proven. 6845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:18,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:18,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:23:18,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:23:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:23:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:23:18,657 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 122 states. [2018-09-26 08:23:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:22,797 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-09-26 08:23:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:23:22,797 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 238 [2018-09-26 08:23:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:22,797 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:23:22,797 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:23:22,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7023 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1013, Invalid=57309, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:23:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:23:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-09-26 08:23:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:23:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2018-09-26 08:23:23,159 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 238 [2018-09-26 08:23:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:23,160 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2018-09-26 08:23:23,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:23:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2018-09-26 08:23:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:23:23,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:23,161 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 1, 1, 1, 1] [2018-09-26 08:23:23,161 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:23,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1266211708, now seen corresponding path program 117 times [2018-09-26 08:23:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 5251 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:23,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:23,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:23:23,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:23:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:23:23,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:23:23,619 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 122 states. [2018-09-26 08:23:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:25,147 INFO L93 Difference]: Finished difference Result 426 states and 428 transitions. [2018-09-26 08:23:25,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:23:25,147 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 241 [2018-09-26 08:23:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:25,148 INFO L225 Difference]: With dead ends: 426 [2018-09-26 08:23:25,148 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:23:25,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:23:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:23:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:23:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:23:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:23:25,510 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 241 [2018-09-26 08:23:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:25,510 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:23:25,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:23:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:23:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:23:25,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:25,511 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:23:25,511 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:25,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 593934925, now seen corresponding path program 118 times [2018-09-26 08:23:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7081 backedges. 0 proven. 7081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:26,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:26,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:23:26,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:23:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:23:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:23:26,689 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 124 states. [2018-09-26 08:23:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:30,859 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-09-26 08:23:30,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:23:30,859 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 242 [2018-09-26 08:23:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:30,860 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:23:30,860 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:23:30,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7262 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1030, Invalid=59240, Unknown=0, NotChecked=0, Total=60270 [2018-09-26 08:23:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:23:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-09-26 08:23:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:23:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-09-26 08:23:31,277 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 242 [2018-09-26 08:23:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:31,277 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-09-26 08:23:31,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:23:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-09-26 08:23:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:23:31,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:31,278 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 1, 1, 1, 1] [2018-09-26 08:23:31,278 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:31,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1346025572, now seen corresponding path program 119 times [2018-09-26 08:23:31,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 5430 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:31,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:31,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:23:31,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:23:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:23:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:23:31,740 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 124 states. [2018-09-26 08:23:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:32,908 INFO L93 Difference]: Finished difference Result 433 states and 435 transitions. [2018-09-26 08:23:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:23:32,908 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 245 [2018-09-26 08:23:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:32,908 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:23:32,909 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:23:32,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:23:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:23:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:23:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:23:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:23:33,279 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 245 [2018-09-26 08:23:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:33,280 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:23:33,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:23:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:23:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:23:33,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:33,281 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-09-26 08:23:33,281 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:33,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash -706555675, now seen corresponding path program 120 times [2018-09-26 08:23:33,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7321 backedges. 0 proven. 7321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:34,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:34,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:23:34,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:23:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:23:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:23:34,468 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 126 states. [2018-09-26 08:23:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:38,837 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-09-26 08:23:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:23:38,837 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 246 [2018-09-26 08:23:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:38,837 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:23:38,838 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:23:38,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7505 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1047, Invalid=61203, Unknown=0, NotChecked=0, Total=62250 [2018-09-26 08:23:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:23:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2018-09-26 08:23:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-26 08:23:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-09-26 08:23:39,221 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 246 [2018-09-26 08:23:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:39,221 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-09-26 08:23:39,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:23:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-09-26 08:23:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-26 08:23:39,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:39,222 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 1, 1, 1, 1] [2018-09-26 08:23:39,222 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:39,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 638487044, now seen corresponding path program 121 times [2018-09-26 08:23:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 5612 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:39,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:39,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:23:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:23:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:23:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:23:39,797 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 126 states. [2018-09-26 08:23:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:41,394 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2018-09-26 08:23:41,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:23:41,395 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 249 [2018-09-26 08:23:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:41,395 INFO L225 Difference]: With dead ends: 440 [2018-09-26 08:23:41,395 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:23:41,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:23:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:23:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:23:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:23:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:23:41,777 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 249 [2018-09-26 08:23:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:41,777 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:23:41,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:23:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:23:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:23:41,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:41,778 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:23:41,779 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:41,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2075900211, now seen corresponding path program 122 times [2018-09-26 08:23:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7565 backedges. 0 proven. 7565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:42,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:42,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:23:42,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:23:42,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:23:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:23:42,992 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 128 states. [2018-09-26 08:23:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:47,358 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-09-26 08:23:47,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:23:47,359 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 250 [2018-09-26 08:23:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:47,359 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:23:47,359 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:23:47,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7752 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1064, Invalid=63198, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:23:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:23:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-09-26 08:23:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-09-26 08:23:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-09-26 08:23:47,757 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 250 [2018-09-26 08:23:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:47,758 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-09-26 08:23:47,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:23:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-09-26 08:23:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-26 08:23:47,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:47,759 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 1, 1, 1, 1] [2018-09-26 08:23:47,759 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:47,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash 94792476, now seen corresponding path program 123 times [2018-09-26 08:23:47,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 5797 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:48,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:48,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:23:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:23:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:23:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:23:48,255 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 128 states. [2018-09-26 08:23:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:49,940 INFO L93 Difference]: Finished difference Result 447 states and 449 transitions. [2018-09-26 08:23:49,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:23:49,940 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 253 [2018-09-26 08:23:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:49,941 INFO L225 Difference]: With dead ends: 447 [2018-09-26 08:23:49,941 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:23:49,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5797 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:23:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:23:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:23:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:23:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:23:50,317 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 253 [2018-09-26 08:23:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:23:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:23:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:23:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:23:50,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:50,318 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-09-26 08:23:50,318 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:50,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1515283611, now seen corresponding path program 124 times [2018-09-26 08:23:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7813 backedges. 0 proven. 7813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:51,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:51,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:23:51,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:23:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:23:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:51,506 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 130 states. [2018-09-26 08:23:56,087 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 320 [2018-09-26 08:23:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:56,122 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-09-26 08:23:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:23:56,122 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 254 [2018-09-26 08:23:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:56,123 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:23:56,123 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:23:56,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8003 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1081, Invalid=65225, Unknown=0, NotChecked=0, Total=66306 [2018-09-26 08:23:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:23:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2018-09-26 08:23:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-09-26 08:23:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2018-09-26 08:23:56,519 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 254 [2018-09-26 08:23:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:56,519 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2018-09-26 08:23:56,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:23:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2018-09-26 08:23:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-26 08:23:56,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:56,520 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 1, 1, 1, 1] [2018-09-26 08:23:56,520 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:56,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1703891068, now seen corresponding path program 125 times [2018-09-26 08:23:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 5985 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:57,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:57,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:23:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:23:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:23:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:57,040 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 130 states. [2018-09-26 08:23:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,534 INFO L93 Difference]: Finished difference Result 454 states and 456 transitions. [2018-09-26 08:23:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:23:58,534 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 257 [2018-09-26 08:23:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,535 INFO L225 Difference]: With dead ends: 454 [2018-09-26 08:23:58,535 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:23:58,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:23:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:23:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:23:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:23:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:23:58,898 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 257 [2018-09-26 08:23:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,898 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:23:58,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:23:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:23:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:23:58,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,900 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:23:58,900 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1629121715, now seen corresponding path program 126 times [2018-09-26 08:23:58,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8065 backedges. 0 proven. 8065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:24:00,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:24:00,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:24:00,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:24:00,057 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 132 states. [2018-09-26 08:24:04,823 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2018-09-26 08:24:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:04,858 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-09-26 08:24:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:24:04,858 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 258 [2018-09-26 08:24:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:04,859 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:24:04,859 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:24:04,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8258 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1098, Invalid=67284, Unknown=0, NotChecked=0, Total=68382 [2018-09-26 08:24:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:24:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2018-09-26 08:24:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-26 08:24:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 263 transitions. [2018-09-26 08:24:05,293 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 263 transitions. Word has length 258 [2018-09-26 08:24:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 263 transitions. [2018-09-26 08:24:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:24:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 263 transitions. [2018-09-26 08:24:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-26 08:24:05,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:05,294 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 1, 1, 1, 1] [2018-09-26 08:24:05,295 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:05,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -30683492, now seen corresponding path program 127 times [2018-09-26 08:24:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 6176 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:05,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:05,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:24:05,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:24:05,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:24:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:24:05,793 INFO L87 Difference]: Start difference. First operand 262 states and 263 transitions. Second operand 132 states. [2018-09-26 08:24:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:07,461 INFO L93 Difference]: Finished difference Result 461 states and 463 transitions. [2018-09-26 08:24:07,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:24:07,461 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 261 [2018-09-26 08:24:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:07,462 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:24:07,462 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:24:07,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:24:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:24:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:24:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:24:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-09-26 08:24:07,838 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 261 [2018-09-26 08:24:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:07,838 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-09-26 08:24:07,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:24:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-09-26 08:24:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:24:07,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:07,839 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-09-26 08:24:07,839 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:07,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 847750629, now seen corresponding path program 128 times [2018-09-26 08:24:07,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8321 backedges. 0 proven. 8321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:09,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:24:09,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:24:09,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:24:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:24:09,091 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 134 states. [2018-09-26 08:24:13,797 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 330 [2018-09-26 08:24:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,830 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-09-26 08:24:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:24:13,831 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 262 [2018-09-26 08:24:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,831 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:24:13,831 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:24:13,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8517 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1115, Invalid=69375, Unknown=0, NotChecked=0, Total=70490 [2018-09-26 08:24:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:24:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2018-09-26 08:24:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 08:24:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2018-09-26 08:24:14,262 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 262 [2018-09-26 08:24:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,263 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2018-09-26 08:24:14,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:24:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2018-09-26 08:24:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 08:24:14,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,264 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 1, 1, 1, 1] [2018-09-26 08:24:14,264 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash 935171332, now seen corresponding path program 129 times [2018-09-26 08:24:14,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 6370 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:14,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:24:14,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:24:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:24:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:24:14,814 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 134 states. [2018-09-26 08:24:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,753 INFO L93 Difference]: Finished difference Result 468 states and 470 transitions. [2018-09-26 08:24:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:24:16,754 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 265 [2018-09-26 08:24:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,754 INFO L225 Difference]: With dead ends: 468 [2018-09-26 08:24:16,754 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:24:16,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:24:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:24:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:24:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:24:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:24:17,192 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 265 [2018-09-26 08:24:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,193 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:24:17,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:24:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:24:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:24:17,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,194 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:24:17,194 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1604673587, now seen corresponding path program 130 times [2018-09-26 08:24:17,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8581 backedges. 0 proven. 8581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:18,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:24:18,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:24:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:24:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:24:18,597 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 136 states. [2018-09-26 08:24:23,674 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 335 [2018-09-26 08:24:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:23,709 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-09-26 08:24:23,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:24:23,710 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 266 [2018-09-26 08:24:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:23,710 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:24:23,710 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:24:23,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8780 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1132, Invalid=71498, Unknown=0, NotChecked=0, Total=72630 [2018-09-26 08:24:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:24:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2018-09-26 08:24:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-26 08:24:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-09-26 08:24:24,159 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 266 [2018-09-26 08:24:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:24,159 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-09-26 08:24:24,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:24:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-09-26 08:24:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-26 08:24:24,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:24,160 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 1, 1, 1, 1] [2018-09-26 08:24:24,160 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:24,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1840942564, now seen corresponding path program 131 times [2018-09-26 08:24:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 6567 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:24,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:24,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:24:24,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:24:24,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:24:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:24:24,729 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 136 states. [2018-09-26 08:24:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:26,762 INFO L93 Difference]: Finished difference Result 475 states and 477 transitions. [2018-09-26 08:24:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:24:26,762 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 269 [2018-09-26 08:24:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:26,763 INFO L225 Difference]: With dead ends: 475 [2018-09-26 08:24:26,763 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:24:26,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6567 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:24:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:24:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:24:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:24:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:24:27,210 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 269 [2018-09-26 08:24:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,210 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:24:27,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:24:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:24:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:24:27,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,211 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-09-26 08:24:27,211 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -60952475, now seen corresponding path program 132 times [2018-09-26 08:24:27,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8845 backedges. 0 proven. 8845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:28,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:24:28,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:24:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:24:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:24:28,610 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 138 states. [2018-09-26 08:24:33,817 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2018-09-26 08:24:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:33,849 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-09-26 08:24:33,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:24:33,849 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 270 [2018-09-26 08:24:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:33,850 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:24:33,850 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:24:33,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9047 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1149, Invalid=73653, Unknown=0, NotChecked=0, Total=74802 [2018-09-26 08:24:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:24:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2018-09-26 08:24:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-26 08:24:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-09-26 08:24:34,261 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 270 [2018-09-26 08:24:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:34,261 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-09-26 08:24:34,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:24:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-09-26 08:24:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-09-26 08:24:34,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:34,262 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 1, 1, 1, 1] [2018-09-26 08:24:34,262 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:34,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 939866756, now seen corresponding path program 133 times [2018-09-26 08:24:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 6767 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:24:34,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:24:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:24:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:24:34,774 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 138 states. Received shutdown request... [2018-09-26 08:24:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:24:35,341 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:24:35,346 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:24:35,346 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:24:35 BoogieIcfgContainer [2018-09-26 08:24:35,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:24:35,347 INFO L168 Benchmark]: Toolchain (without parser) took 251086.01 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 576.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:24:35,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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:24:35,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.22 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:24:35,349 INFO L168 Benchmark]: Boogie Preprocessor took 30.08 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:24:35,349 INFO L168 Benchmark]: RCFGBuilder took 320.87 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:24:35,350 INFO L168 Benchmark]: TraceAbstraction took 250678.74 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 565.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:24:35,352 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.18 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 49.22 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 30.08 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 320.87 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 250678.74 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 565.5 MB. 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 (274states) and FLOYD_HOARE automaton (currently 92 states, 138 states before enhancement), while ReachableStatesComputation was computing reachable states (200 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. TIMEOUT Result, 250.6s OverallTime, 135 OverallIterations, 68 TraceHistogramMax, 175.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4850 SDtfs, 7507 SDslu, 273024 SDs, 0 SdLazy, 784169 SolverSat, 7134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16505 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361339 ImplicationChecksByTransitivity, 102.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=134, 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: 22.1s AutomataMinimizationTime, 134 MinimizatonAttempts, 67 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 42.2s InterpolantComputationTime, 18698 NumberOfCodeBlocks, 18698 NumberOfCodeBlocksAsserted, 135 NumberOfCheckSat, 18563 ConstructedInterpolants, 0 QuantifiedInterpolants, 27832559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 135 InterpolantComputations, 1 PerfectInterpolantSequences, 154904/407829 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/ArrayInit02.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-24-35-367.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArrayInit02.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-24-35-367.csv Completed graceful shutdown