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/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:55,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:55,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:55,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:55,239 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:55,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:55,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:55,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:55,246 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:55,247 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:55,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:55,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:55,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:55,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:55,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:55,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:55,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:55,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:55,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:55,259 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:55,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:55,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:55,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:55,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:55,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:55,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:55,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:55,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:55,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:55,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:55,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:55,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:55,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:55,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:55,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:55,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:55,276 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:10:55,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:55,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:55,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:55,286 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:55,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:55,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:55,287 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:55,287 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:55,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:55,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:55,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:55,362 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:55,362 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:55,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-09-26 08:10:55,363 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-09-26 08:10:55,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:55,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:55,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:55,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:55,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:55,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:55,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:55,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:55,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:55,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:55,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:55,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:55,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:55,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/1) ... [2018-09-26 08:10:55,564 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:55,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:55,741 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:55,742 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:55 BoogieIcfgContainer [2018-09-26 08:10:55,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:55,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:55,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:55,749 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:55,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:55" (1/2) ... [2018-09-26 08:10:55,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bee755d and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:55, skipping insertion in model container [2018-09-26 08:10:55,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:55" (2/2) ... [2018-09-26 08:10:55,754 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-09-26 08:10:55,767 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:55,777 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:55,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:55,839 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:55,839 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:55,840 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:55,840 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:55,840 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:55,840 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:55,841 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:55,841 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:10:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:10:55,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:10:55,875 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-09-26 08:10:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,972 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:10:55,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:55,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:10:55,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:10:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:10:55,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:55,995 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:10:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,027 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-09-26 08:10:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:10:56,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:10:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,039 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:56,040 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:10:56,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:10:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-26 08:10:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:10:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-26 08:10:56,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-09-26 08:10:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,084 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-26 08:10:56,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:10:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-26 08:10:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:10:56,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:10:56,088 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-09-26 08:10:56,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,109 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:56,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:10:56,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:10:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:10:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:56,113 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-09-26 08:10:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,131 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-26 08:10:56,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:10:56,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-09-26 08:10:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,133 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:56,133 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:10:56,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:10:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:10:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:10:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 08:10:56,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-26 08:10:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,139 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 08:10:56,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:10:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 08:10:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:56,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:10:56,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-09-26 08:10:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:56,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:56,183 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-09-26 08:10:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,199 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-26 08:10:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:56,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:10:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,200 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:10:56,201 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:10:56,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:10:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:10:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:10:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 08:10:56,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-26 08:10:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,205 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 08:10:56,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 08:10:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:10:56,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,206 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 08:10:56,206 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-09-26 08:10:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:10:56,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:10:56,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:56,235 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-09-26 08:10:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,255 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:10:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:56,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-09-26 08:10:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,257 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:10:56,257 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:10:56,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:10:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-09-26 08:10:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:10:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-09-26 08:10:56,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-09-26 08:10:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,266 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-09-26 08:10:56,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-09-26 08:10:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:10:56,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,267 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-09-26 08:10:56,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,269 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-09-26 08:10:56,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 08:10:56,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:56,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:56,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:56,337 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-09-26 08:10:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,356 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-09-26 08:10:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:56,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-09-26 08:10:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,358 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:10:56,358 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:10:56,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:10:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:10:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:10:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-09-26 08:10:56,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-09-26 08:10:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,372 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-09-26 08:10:56,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-09-26 08:10:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:10:56,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,375 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-09-26 08:10:56,376 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-09-26 08:10:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 08:10:56,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:56,453 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-09-26 08:10:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,468 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-09-26 08:10:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:56,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-26 08:10:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,470 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:10:56,470 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:56,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:10:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:10:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-09-26 08:10:56,476 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-09-26 08:10:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,476 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-09-26 08:10:56,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-09-26 08:10:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:10:56,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,478 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-09-26 08:10:56,478 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-09-26 08:10:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-26 08:10:56,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:56,515 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-09-26 08:10:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,546 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-09-26 08:10:56,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:56,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-09-26 08:10:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,548 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:10:56,548 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:10:56,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:10:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-09-26 08:10:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:10:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-09-26 08:10:56,556 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2018-09-26 08:10:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,557 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-09-26 08:10:56,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-09-26 08:10:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:10:56,558 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,558 INFO L375 BasicCegarLoop]: trace histogram [12, 3, 3, 1, 1, 1] [2018-09-26 08:10:56,559 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,559 INFO L82 PathProgramCache]: Analyzing trace with hash -569669823, now seen corresponding path program 6 times [2018-09-26 08:10:56,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-26 08:10:56,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:56,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:56,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:56,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:56,621 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-09-26 08:10:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,664 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-09-26 08:10:56,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:56,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-09-26 08:10:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,669 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:10:56,669 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:10:56,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:10:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-09-26 08:10:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:10:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-09-26 08:10:56,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2018-09-26 08:10:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,694 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-09-26 08:10:56,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-09-26 08:10:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:10:56,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,697 INFO L375 BasicCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1] [2018-09-26 08:10:56,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash -384158805, now seen corresponding path program 7 times [2018-09-26 08:10:56,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-26 08:10:56,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:56,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:56,773 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-09-26 08:10:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,817 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-09-26 08:10:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:56,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-09-26 08:10:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,818 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:10:56,818 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:10:56,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:10:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:10:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:10:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-09-26 08:10:56,842 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2018-09-26 08:10:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,842 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-09-26 08:10:56,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-09-26 08:10:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:10:56,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,848 INFO L375 BasicCegarLoop]: trace histogram [20, 4, 4, 1, 1, 1] [2018-09-26 08:10:56,848 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1897277373, now seen corresponding path program 8 times [2018-09-26 08:10:56,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-09-26 08:10:56,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:56,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:56,891 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-09-26 08:10:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,909 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-09-26 08:10:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:56,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-09-26 08:10:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,910 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:10:56,910 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:10:56,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:10:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:10:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:10:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-09-26 08:10:56,921 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 31 [2018-09-26 08:10:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,921 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-09-26 08:10:56,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-09-26 08:10:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:10:56,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,923 INFO L375 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-09-26 08:10:56,923 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 9 times [2018-09-26 08:10:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-09-26 08:10:56,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:56,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:56,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:56,989 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-09-26 08:10:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,009 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-09-26 08:10:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:57,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-09-26 08:10:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,010 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:10:57,010 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:10:57,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:10:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:10:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:10:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-09-26 08:10:57,020 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-09-26 08:10:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,021 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-09-26 08:10:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-09-26 08:10:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:10:57,022 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,022 INFO L375 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-09-26 08:10:57,023 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 10 times [2018-09-26 08:10:57,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-09-26 08:10:57,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:57,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:57,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:57,124 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2018-09-26 08:10:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,164 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-09-26 08:10:57,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:57,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-09-26 08:10:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,166 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:10:57,166 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:10:57,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:10:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-09-26 08:10:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:10:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-09-26 08:10:57,178 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 39 [2018-09-26 08:10:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,179 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-09-26 08:10:57,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-09-26 08:10:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:10:57,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,181 INFO L375 BasicCegarLoop]: trace histogram [35, 5, 5, 1, 1, 1] [2018-09-26 08:10:57,182 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1933961390, now seen corresponding path program 11 times [2018-09-26 08:10:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 655 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-09-26 08:10:57,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:57,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:57,235 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-09-26 08:10:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,260 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-09-26 08:10:57,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:57,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-09-26 08:10:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,262 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:10:57,262 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:10:57,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:10:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-09-26 08:10:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:10:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-09-26 08:10:57,276 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 48 [2018-09-26 08:10:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,277 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-09-26 08:10:57,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-09-26 08:10:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:10:57,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,279 INFO L375 BasicCegarLoop]: trace histogram [42, 6, 6, 1, 1, 1] [2018-09-26 08:10:57,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -529480157, now seen corresponding path program 12 times [2018-09-26 08:10:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 0 proven. 981 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-09-26 08:10:57,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:57,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:57,341 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-09-26 08:10:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,369 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-09-26 08:10:57,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:57,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-09-26 08:10:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,371 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:10:57,371 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:10:57,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:10:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-09-26 08:10:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:10:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-09-26 08:10:57,388 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 57 [2018-09-26 08:10:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,388 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-09-26 08:10:57,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-09-26 08:10:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:10:57,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,390 INFO L375 BasicCegarLoop]: trace histogram [49, 7, 7, 1, 1, 1] [2018-09-26 08:10:57,390 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1363198898, now seen corresponding path program 13 times [2018-09-26 08:10:57,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 391 proven. 28 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-09-26 08:10:57,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:57,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:57,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:57,445 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 10 states. [2018-09-26 08:10:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,467 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-09-26 08:10:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:57,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-09-26 08:10:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,469 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:10:57,469 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:10:57,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:10:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:10:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:10:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-09-26 08:10:57,487 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 66 [2018-09-26 08:10:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,487 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-09-26 08:10:57,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-09-26 08:10:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:10:57,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,489 INFO L375 BasicCegarLoop]: trace histogram [56, 7, 7, 1, 1, 1] [2018-09-26 08:10:57,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1515039575, now seen corresponding path program 14 times [2018-09-26 08:10:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-09-26 08:10:57,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:57,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:57,571 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 10 states. [2018-09-26 08:10:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,608 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-09-26 08:10:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:57,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-09-26 08:10:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,610 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:10:57,610 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:10:57,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:10:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-09-26 08:10:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:10:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-09-26 08:10:57,646 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 73 [2018-09-26 08:10:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,646 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-09-26 08:10:57,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-09-26 08:10:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:10:57,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,652 INFO L375 BasicCegarLoop]: trace histogram [64, 8, 8, 1, 1, 1] [2018-09-26 08:10:57,652 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -603639725, now seen corresponding path program 15 times [2018-09-26 08:10:57,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 575 proven. 36 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2018-09-26 08:10:57,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:57,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:57,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:57,736 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 11 states. [2018-09-26 08:10:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,765 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2018-09-26 08:10:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:57,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-09-26 08:10:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,766 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:10:57,766 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:10:57,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:10:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:10:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:10:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-09-26 08:10:57,808 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 83 [2018-09-26 08:10:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,808 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-09-26 08:10:57,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-09-26 08:10:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:10:57,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,818 INFO L375 BasicCegarLoop]: trace histogram [72, 8, 8, 1, 1, 1] [2018-09-26 08:10:57,818 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1521070467, now seen corresponding path program 16 times [2018-09-26 08:10:57,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2018-09-26 08:10:57,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:57,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:57,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:57,904 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 12 states. [2018-09-26 08:10:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:57,933 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2018-09-26 08:10:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:57,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-09-26 08:10:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:57,934 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:10:57,934 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:10:57,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:10:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:10:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:10:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-09-26 08:10:57,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 91 [2018-09-26 08:10:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:57,955 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-09-26 08:10:57,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-09-26 08:10:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:10:57,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:57,957 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-09-26 08:10:57,957 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:57,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:57,958 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2018-09-26 08:10:57,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 08:10:58,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:58,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:58,057 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-09-26 08:10:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,094 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-26 08:10:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:58,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-09-26 08:10:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,096 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:10:58,097 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:10:58,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:10:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-09-26 08:10:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:10:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-09-26 08:10:58,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-09-26 08:10:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,124 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-09-26 08:10:58,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-09-26 08:10:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:10:58,126 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,127 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-09-26 08:10:58,127 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2018-09-26 08:10:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-26 08:10:58,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:58,245 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-09-26 08:10:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,299 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-09-26 08:10:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:58,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-09-26 08:10:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,302 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:10:58,302 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:10:58,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:10:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-09-26 08:10:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:10:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-09-26 08:10:58,334 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-09-26 08:10:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,335 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-09-26 08:10:58,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-09-26 08:10:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:10:58,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,337 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-09-26 08:10:58,337 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2018-09-26 08:10:58,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-09-26 08:10:58,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:58,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:58,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:58,491 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-09-26 08:10:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,546 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-09-26 08:10:58,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:10:58,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-09-26 08:10:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,549 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:10:58,549 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:10:58,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:10:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-09-26 08:10:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:10:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-09-26 08:10:58,581 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-09-26 08:10:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,581 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-09-26 08:10:58,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-09-26 08:10:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:10:58,586 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,587 INFO L375 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-09-26 08:10:58,587 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 20 times [2018-09-26 08:10:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-09-26 08:10:58,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:58,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:10:58,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:10:58,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:10:58,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:58,747 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-09-26 08:10:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,800 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-09-26 08:10:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:58,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-09-26 08:10:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,804 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:10:58,804 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:10:58,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:10:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:10:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-09-26 08:10:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:10:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-09-26 08:10:58,840 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-09-26 08:10:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,840 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-09-26 08:10:58,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:10:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-09-26 08:10:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:10:58,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,843 INFO L375 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-09-26 08:10:58,843 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 21 times [2018-09-26 08:10:58,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-09-26 08:10:59,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:10:59,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:10:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:10:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:59,016 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-09-26 08:10:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,083 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-09-26 08:10:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:10:59,084 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-09-26 08:10:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,085 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:10:59,086 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:10:59,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:10:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-09-26 08:10:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:10:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-09-26 08:10:59,127 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-09-26 08:10:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,153 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-09-26 08:10:59,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:10:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-09-26 08:10:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:10:59,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,158 INFO L375 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-09-26 08:10:59,158 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 22 times [2018-09-26 08:10:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-09-26 08:10:59,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:10:59,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:10:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:10:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:59,378 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-09-26 08:10:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,441 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-09-26 08:10:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:10:59,441 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-09-26 08:10:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,443 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:10:59,443 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:10:59,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:10:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:10:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-09-26 08:10:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:10:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-09-26 08:10:59,485 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-09-26 08:10:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,486 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-09-26 08:10:59,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:10:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-09-26 08:10:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:10:59,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,488 INFO L375 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-09-26 08:10:59,488 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 23 times [2018-09-26 08:10:59,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-09-26 08:10:59,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:10:59,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:10:59,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:10:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:59,665 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-09-26 08:10:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:59,739 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-09-26 08:10:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:10:59,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-09-26 08:10:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:59,740 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:10:59,741 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:10:59,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:10:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-09-26 08:10:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:10:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-09-26 08:10:59,786 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-09-26 08:10:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:59,786 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-09-26 08:10:59,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:10:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-09-26 08:10:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:10:59,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:59,789 INFO L375 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-09-26 08:10:59,789 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:59,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 24 times [2018-09-26 08:10:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-09-26 08:10:59,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:10:59,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:10:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:10:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:10:59,941 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-09-26 08:11:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,025 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-09-26 08:11:00,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:11:00,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-09-26 08:11:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,026 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:11:00,027 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:11:00,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:11:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:11:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-09-26 08:11:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:11:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-09-26 08:11:00,075 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-09-26 08:11:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,076 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-09-26 08:11:00,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:11:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-09-26 08:11:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:11:00,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,078 INFO L375 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-09-26 08:11:00,078 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 25 times [2018-09-26 08:11:00,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-09-26 08:11:00,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:11:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:11:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:11:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:00,234 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-09-26 08:11:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,312 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-09-26 08:11:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:11:00,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-09-26 08:11:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,314 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:11:00,314 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:11:00,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:11:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-09-26 08:11:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:11:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-09-26 08:11:00,368 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-09-26 08:11:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,368 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-09-26 08:11:00,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:11:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-09-26 08:11:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:11:00,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,371 INFO L375 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-09-26 08:11:00,371 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 26 times [2018-09-26 08:11:00,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-09-26 08:11:00,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:11:00,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:11:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:11:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:00,534 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-09-26 08:11:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,620 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-09-26 08:11:00,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:11:00,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-09-26 08:11:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,622 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:11:00,622 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:11:00,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:11:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-09-26 08:11:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:11:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-09-26 08:11:00,680 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-09-26 08:11:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,681 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-09-26 08:11:00,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:11:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-09-26 08:11:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:11:00,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:00,684 INFO L375 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-09-26 08:11:00,684 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:00,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 27 times [2018-09-26 08:11:00,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-09-26 08:11:00,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:00,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:11:00,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:11:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:11:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:00,911 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-09-26 08:11:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,032 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-09-26 08:11:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:11:01,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-09-26 08:11:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,034 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:11:01,034 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:11:01,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:11:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-09-26 08:11:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:11:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-09-26 08:11:01,167 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-09-26 08:11:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,168 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-09-26 08:11:01,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:11:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-09-26 08:11:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:11:01,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,171 INFO L375 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-09-26 08:11:01,172 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 28 times [2018-09-26 08:11:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-09-26 08:11:01,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:11:01,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:11:01,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:11:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:01,376 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-09-26 08:11:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,491 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-09-26 08:11:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:11:01,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-09-26 08:11:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,493 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:11:01,494 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:11:01,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:11:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-09-26 08:11:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-26 08:11:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-09-26 08:11:01,581 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-09-26 08:11:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,581 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-09-26 08:11:01,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:11:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-09-26 08:11:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-26 08:11:01,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,585 INFO L375 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-09-26 08:11:01,585 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 29 times [2018-09-26 08:11:01,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-09-26 08:11:01,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:01,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:11:01,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:11:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:11:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:01,808 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-09-26 08:11:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,916 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-09-26 08:11:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:11:01,916 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-09-26 08:11:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,918 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:11:01,918 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:11:01,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:11:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-09-26 08:11:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:11:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-09-26 08:11:02,002 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-09-26 08:11:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:02,003 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-09-26 08:11:02,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:11:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-09-26 08:11:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 08:11:02,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:02,007 INFO L375 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-09-26 08:11:02,007 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 30 times [2018-09-26 08:11:02,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-09-26 08:11:02,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:11:02,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:11:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:11:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:02,245 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-09-26 08:11:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:02,375 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-09-26 08:11:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:11:02,376 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-09-26 08:11:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:02,378 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:11:02,378 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:11:02,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:11:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-09-26 08:11:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 08:11:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-09-26 08:11:02,468 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-09-26 08:11:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:02,469 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-09-26 08:11:02,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:11:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-09-26 08:11:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-26 08:11:02,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:02,473 INFO L375 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-09-26 08:11:02,473 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:02,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:02,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 31 times [2018-09-26 08:11:02,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-09-26 08:11:02,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:11:02,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:11:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:11:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:02,728 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-09-26 08:11:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:02,898 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-09-26 08:11:02,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:11:02,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-09-26 08:11:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:02,901 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:11:02,901 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:11:02,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:11:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-09-26 08:11:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-26 08:11:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-09-26 08:11:03,011 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-09-26 08:11:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,012 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-09-26 08:11:03,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:11:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-09-26 08:11:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-26 08:11:03,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,016 INFO L375 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-09-26 08:11:03,017 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 32 times [2018-09-26 08:11:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-09-26 08:11:03,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:11:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:11:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:11:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:03,353 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-09-26 08:11:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:03,489 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-09-26 08:11:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:11:03,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-09-26 08:11:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:03,492 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:11:03,492 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:11:03,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:11:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-09-26 08:11:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-26 08:11:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-09-26 08:11:03,604 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-09-26 08:11:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:03,605 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-09-26 08:11:03,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:11:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-09-26 08:11:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-26 08:11:03,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:03,609 INFO L375 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-09-26 08:11:03,609 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:03,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 33 times [2018-09-26 08:11:03,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-09-26 08:11:03,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:03,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:11:03,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:11:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:11:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:03,856 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-09-26 08:11:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,013 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-09-26 08:11:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:11:04,013 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-09-26 08:11:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,016 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:11:04,016 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:11:04,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:11:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-09-26 08:11:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-09-26 08:11:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-09-26 08:11:04,131 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-09-26 08:11:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,131 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-09-26 08:11:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:11:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-09-26 08:11:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-26 08:11:04,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,135 INFO L375 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-09-26 08:11:04,136 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 34 times [2018-09-26 08:11:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-09-26 08:11:04,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:04,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:11:04,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:11:04,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:11:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:04,412 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-09-26 08:11:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,582 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-09-26 08:11:04,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:11:04,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-09-26 08:11:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,585 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:11:04,585 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:11:04,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:11:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-09-26 08:11:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-09-26 08:11:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-09-26 08:11:04,725 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-09-26 08:11:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,726 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-09-26 08:11:04,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:11:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-09-26 08:11:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-26 08:11:04,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,732 INFO L375 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-09-26 08:11:04,732 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 35 times [2018-09-26 08:11:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-09-26 08:11:05,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:11:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:11:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:11:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:05,009 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-09-26 08:11:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,202 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-09-26 08:11:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:11:05,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-09-26 08:11:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,206 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:11:05,206 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:11:05,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:11:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-09-26 08:11:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-09-26 08:11:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-09-26 08:11:05,356 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-09-26 08:11:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-09-26 08:11:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:11:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-09-26 08:11:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-09-26 08:11:05,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:05,365 INFO L375 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-09-26 08:11:05,365 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:05,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 36 times [2018-09-26 08:11:05,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-09-26 08:11:05,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:11:05,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:11:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:11:05,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:05,774 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-09-26 08:11:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:05,991 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-09-26 08:11:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:11:05,991 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-09-26 08:11:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:05,994 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:11:05,994 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:11:05,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:11:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-09-26 08:11:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-26 08:11:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-09-26 08:11:06,164 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-09-26 08:11:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-09-26 08:11:06,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:11:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-09-26 08:11:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-26 08:11:06,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,170 INFO L375 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-09-26 08:11:06,170 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 37 times [2018-09-26 08:11:06,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-09-26 08:11:06,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:06,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:11:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:11:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:11:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:06,527 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-09-26 08:11:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:06,734 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-09-26 08:11:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:11:06,734 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-09-26 08:11:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:06,737 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:11:06,737 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:11:06,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:11:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-09-26 08:11:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-09-26 08:11:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-09-26 08:11:06,908 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-09-26 08:11:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:06,909 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-09-26 08:11:06,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:11:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-09-26 08:11:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-09-26 08:11:06,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:06,915 INFO L375 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-09-26 08:11:06,915 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:06,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:06,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 38 times [2018-09-26 08:11:06,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-09-26 08:11:07,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:07,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:11:07,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:11:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:11:07,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:07,264 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-09-26 08:11:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,494 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-09-26 08:11:07,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:11:07,494 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-09-26 08:11:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,498 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:11:07,498 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:11:07,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:11:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-09-26 08:11:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-26 08:11:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-09-26 08:11:07,682 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-09-26 08:11:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,683 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-09-26 08:11:07,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:11:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-09-26 08:11:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-09-26 08:11:07,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,690 INFO L375 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-09-26 08:11:07,690 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 39 times [2018-09-26 08:11:07,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-09-26 08:11:08,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:11:08,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:11:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:11:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:08,087 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-09-26 08:11:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:08,326 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-09-26 08:11:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:11:08,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-09-26 08:11:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:08,330 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:11:08,330 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:11:08,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:11:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-09-26 08:11:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-09-26 08:11:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-09-26 08:11:08,534 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-09-26 08:11:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:08,535 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-09-26 08:11:08,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:11:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-09-26 08:11:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-09-26 08:11:08,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:08,542 INFO L375 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-09-26 08:11:08,542 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:08,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 40 times [2018-09-26 08:11:08,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-09-26 08:11:08,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:11:08,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:11:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:11:08,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:08,915 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-09-26 08:11:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:09,139 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-09-26 08:11:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:11:09,139 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-09-26 08:11:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:09,142 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:11:09,142 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:11:09,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:11:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-09-26 08:11:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-26 08:11:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-09-26 08:11:09,324 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-09-26 08:11:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:09,324 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-09-26 08:11:09,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:11:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-09-26 08:11:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-09-26 08:11:09,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:09,331 INFO L375 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-09-26 08:11:09,331 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 41 times [2018-09-26 08:11:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-09-26 08:11:09,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:09,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:11:09,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:11:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:11:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:09,740 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-09-26 08:11:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,040 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-09-26 08:11:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:11:10,040 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-09-26 08:11:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,044 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:11:10,044 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:11:10,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:11:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-09-26 08:11:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-09-26 08:11:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-09-26 08:11:10,268 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-09-26 08:11:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,269 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-09-26 08:11:10,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:11:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-09-26 08:11:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-09-26 08:11:10,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,273 INFO L375 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-09-26 08:11:10,273 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 42 times [2018-09-26 08:11:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-09-26 08:11:10,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:10,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:11:10,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:11:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:11:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:11:10,840 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-09-26 08:11:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,105 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-09-26 08:11:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:11:11,106 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-09-26 08:11:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,109 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:11:11,109 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:11:11,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:11:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:11:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-09-26 08:11:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-09-26 08:11:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-09-26 08:11:11,320 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-09-26 08:11:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:11,321 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-09-26 08:11:11,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:11:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-09-26 08:11:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-09-26 08:11:11,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:11,324 INFO L375 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-09-26 08:11:11,324 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:11,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 43 times [2018-09-26 08:11:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-09-26 08:11:11,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:11,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:11:11,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:11:11,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:11:11,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:11,707 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-09-26 08:11:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:11,992 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-09-26 08:11:11,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:11:11,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-09-26 08:11:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:11,995 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:11:11,995 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:11:11,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:11:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-09-26 08:11:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-09-26 08:11:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-09-26 08:11:12,261 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-09-26 08:11:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:12,262 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-09-26 08:11:12,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:11:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-09-26 08:11:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-09-26 08:11:12,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:12,265 INFO L375 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-09-26 08:11:12,265 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:12,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 44 times [2018-09-26 08:11:12,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-09-26 08:11:12,674 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:11:12,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:11:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:11:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:12,677 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-09-26 08:11:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:12,978 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-09-26 08:11:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:11:12,978 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-09-26 08:11:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:12,982 INFO L225 Difference]: With dead ends: 449 [2018-09-26 08:11:12,982 INFO L226 Difference]: Without dead ends: 447 [2018-09-26 08:11:12,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-26 08:11:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-09-26 08:11:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-26 08:11:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-09-26 08:11:13,253 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-09-26 08:11:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:13,254 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-09-26 08:11:13,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:11:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-09-26 08:11:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-09-26 08:11:13,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:13,259 INFO L375 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-09-26 08:11:13,259 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:13,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 45 times [2018-09-26 08:11:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-09-26 08:11:13,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:13,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:11:13,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:11:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:11:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:13,767 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-09-26 08:11:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:14,086 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-09-26 08:11:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:11:14,087 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-09-26 08:11:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:14,090 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:11:14,090 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:11:14,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:11:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-09-26 08:11:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-09-26 08:11:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-09-26 08:11:14,369 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-09-26 08:11:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,370 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-09-26 08:11:14,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:11:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-09-26 08:11:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-09-26 08:11:14,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,375 INFO L375 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-09-26 08:11:14,375 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 46 times [2018-09-26 08:11:14,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-09-26 08:11:14,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:14,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:11:14,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:11:14,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:11:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:14,833 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-09-26 08:11:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:15,165 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-09-26 08:11:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:11:15,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-09-26 08:11:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:15,170 INFO L225 Difference]: With dead ends: 473 [2018-09-26 08:11:15,170 INFO L226 Difference]: Without dead ends: 471 [2018-09-26 08:11:15,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-09-26 08:11:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-09-26 08:11:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-09-26 08:11:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-09-26 08:11:15,438 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-09-26 08:11:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:15,439 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-09-26 08:11:15,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:11:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-09-26 08:11:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-09-26 08:11:15,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:15,443 INFO L375 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-09-26 08:11:15,443 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:15,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 47 times [2018-09-26 08:11:15,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-09-26 08:11:15,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:11:15,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:11:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:11:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:15,942 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-09-26 08:11:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:16,301 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-09-26 08:11:16,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:11:16,301 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-09-26 08:11:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:16,304 INFO L225 Difference]: With dead ends: 485 [2018-09-26 08:11:16,305 INFO L226 Difference]: Without dead ends: 483 [2018-09-26 08:11:16,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-09-26 08:11:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-09-26 08:11:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-09-26 08:11:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-09-26 08:11:16,590 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-09-26 08:11:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:16,591 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-09-26 08:11:16,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:11:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-09-26 08:11:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-09-26 08:11:16,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:16,595 INFO L375 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-09-26 08:11:16,596 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:16,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 48 times [2018-09-26 08:11:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-09-26 08:11:17,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:17,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:11:17,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:11:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:11:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:17,040 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-09-26 08:11:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,378 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-09-26 08:11:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:11:17,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-09-26 08:11:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,381 INFO L225 Difference]: With dead ends: 497 [2018-09-26 08:11:17,381 INFO L226 Difference]: Without dead ends: 495 [2018-09-26 08:11:17,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-09-26 08:11:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-09-26 08:11:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-09-26 08:11:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-09-26 08:11:17,629 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-09-26 08:11:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,630 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-09-26 08:11:17,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:11:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-09-26 08:11:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-09-26 08:11:17,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,634 INFO L375 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-09-26 08:11:17,634 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 49 times [2018-09-26 08:11:17,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-09-26 08:11:18,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:18,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:11:18,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:11:18,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:11:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:18,127 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-09-26 08:11:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:18,489 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-09-26 08:11:18,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:11:18,489 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-09-26 08:11:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:18,493 INFO L225 Difference]: With dead ends: 509 [2018-09-26 08:11:18,493 INFO L226 Difference]: Without dead ends: 507 [2018-09-26 08:11:18,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-09-26 08:11:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-09-26 08:11:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-09-26 08:11:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-09-26 08:11:18,839 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-09-26 08:11:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:18,840 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-09-26 08:11:18,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:11:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-09-26 08:11:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-09-26 08:11:18,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:18,846 INFO L375 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-09-26 08:11:18,846 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:18,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 50 times [2018-09-26 08:11:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-09-26 08:11:19,359 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:19,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:11:19,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:11:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:11:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:19,361 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-09-26 08:11:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:19,713 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-09-26 08:11:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:11:19,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-09-26 08:11:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:19,717 INFO L225 Difference]: With dead ends: 521 [2018-09-26 08:11:19,717 INFO L226 Difference]: Without dead ends: 519 [2018-09-26 08:11:19,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-09-26 08:11:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-09-26 08:11:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-26 08:11:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-09-26 08:11:20,020 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-09-26 08:11:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:20,021 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-09-26 08:11:20,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:11:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-09-26 08:11:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-09-26 08:11:20,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:20,025 INFO L375 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-09-26 08:11:20,025 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:20,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 51 times [2018-09-26 08:11:20,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-09-26 08:11:20,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:20,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:11:20,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:11:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:11:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:20,543 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-09-26 08:11:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:20,966 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-09-26 08:11:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:11:20,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-09-26 08:11:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:20,971 INFO L225 Difference]: With dead ends: 533 [2018-09-26 08:11:20,971 INFO L226 Difference]: Without dead ends: 531 [2018-09-26 08:11:20,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-26 08:11:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-09-26 08:11:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-26 08:11:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-09-26 08:11:21,226 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-09-26 08:11:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:21,227 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-09-26 08:11:21,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:11:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-09-26 08:11:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-09-26 08:11:21,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:21,230 INFO L375 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-09-26 08:11:21,231 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:21,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 52 times [2018-09-26 08:11:21,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-09-26 08:11:21,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:21,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:11:21,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:11:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:11:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:21,774 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-09-26 08:11:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:22,231 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-09-26 08:11:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:11:22,231 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-09-26 08:11:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:22,235 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:11:22,235 INFO L226 Difference]: Without dead ends: 543 [2018-09-26 08:11:22,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-09-26 08:11:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-09-26 08:11:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-09-26 08:11:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-09-26 08:11:22,543 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-09-26 08:11:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:22,543 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-09-26 08:11:22,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:11:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-09-26 08:11:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-09-26 08:11:22,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:22,549 INFO L375 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-09-26 08:11:22,549 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:22,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 53 times [2018-09-26 08:11:22,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-09-26 08:11:23,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:23,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:11:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:11:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:11:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:23,115 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-09-26 08:11:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:23,447 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-09-26 08:11:23,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:11:23,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-09-26 08:11:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:23,450 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:11:23,450 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:11:23,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:11:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-09-26 08:11:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-09-26 08:11:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-09-26 08:11:23,721 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-09-26 08:11:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:23,722 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-09-26 08:11:23,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:11:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-09-26 08:11:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-09-26 08:11:23,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:23,726 INFO L375 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-09-26 08:11:23,726 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:23,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 54 times [2018-09-26 08:11:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-09-26 08:11:24,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:24,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:11:24,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:11:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:11:24,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:24,279 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-09-26 08:11:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:24,756 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-09-26 08:11:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:11:24,757 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-09-26 08:11:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:24,760 INFO L225 Difference]: With dead ends: 569 [2018-09-26 08:11:24,760 INFO L226 Difference]: Without dead ends: 567 [2018-09-26 08:11:24,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-09-26 08:11:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-09-26 08:11:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-09-26 08:11:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-09-26 08:11:25,071 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-09-26 08:11:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,071 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-09-26 08:11:25,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:11:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-09-26 08:11:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-09-26 08:11:25,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,076 INFO L375 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-09-26 08:11:25,076 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 55 times [2018-09-26 08:11:25,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-09-26 08:11:25,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:11:25,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:11:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:11:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:25,664 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-09-26 08:11:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,086 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-09-26 08:11:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:11:26,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-09-26 08:11:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,089 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:11:26,090 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:11:26,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:11:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-09-26 08:11:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-09-26 08:11:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-09-26 08:11:26,392 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-09-26 08:11:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,393 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-09-26 08:11:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:11:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-09-26 08:11:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-09-26 08:11:26,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,397 INFO L375 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-09-26 08:11:26,397 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 56 times [2018-09-26 08:11:26,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-09-26 08:11:26,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:11:26,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:11:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:11:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:26,964 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-09-26 08:11:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,413 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-09-26 08:11:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:11:27,413 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-09-26 08:11:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,416 INFO L225 Difference]: With dead ends: 593 [2018-09-26 08:11:27,416 INFO L226 Difference]: Without dead ends: 591 [2018-09-26 08:11:27,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-09-26 08:11:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-09-26 08:11:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-09-26 08:11:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-09-26 08:11:27,720 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-09-26 08:11:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,720 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-09-26 08:11:27,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:11:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-09-26 08:11:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-09-26 08:11:27,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,723 INFO L375 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-09-26 08:11:27,723 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 57 times [2018-09-26 08:11:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-09-26 08:11:28,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:11:28,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:11:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:11:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:28,306 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-09-26 08:11:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,664 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-09-26 08:11:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:11:28,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-09-26 08:11:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,668 INFO L225 Difference]: With dead ends: 605 [2018-09-26 08:11:28,668 INFO L226 Difference]: Without dead ends: 603 [2018-09-26 08:11:28,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-09-26 08:11:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-09-26 08:11:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-09-26 08:11:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-09-26 08:11:29,097 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-09-26 08:11:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,098 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-09-26 08:11:29,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:11:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-09-26 08:11:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-09-26 08:11:29,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,103 INFO L375 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-09-26 08:11:29,104 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,104 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 58 times [2018-09-26 08:11:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-09-26 08:11:29,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:11:29,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:11:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:11:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:29,768 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-09-26 08:11:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,149 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-09-26 08:11:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:11:30,150 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-09-26 08:11:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,152 INFO L225 Difference]: With dead ends: 617 [2018-09-26 08:11:30,152 INFO L226 Difference]: Without dead ends: 615 [2018-09-26 08:11:30,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-09-26 08:11:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-09-26 08:11:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-09-26 08:11:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-09-26 08:11:30,655 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-09-26 08:11:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,655 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-09-26 08:11:30,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:11:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-09-26 08:11:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-09-26 08:11:30,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,659 INFO L375 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-09-26 08:11:30,659 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 59 times [2018-09-26 08:11:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-09-26 08:11:31,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:11:31,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:11:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:11:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:31,076 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-09-26 08:11:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,507 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-09-26 08:11:31,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:11:31,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-09-26 08:11:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,510 INFO L225 Difference]: With dead ends: 629 [2018-09-26 08:11:31,510 INFO L226 Difference]: Without dead ends: 627 [2018-09-26 08:11:31,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-09-26 08:11:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-09-26 08:11:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-09-26 08:11:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-09-26 08:11:31,889 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-09-26 08:11:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,889 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-09-26 08:11:31,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:11:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-09-26 08:11:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-09-26 08:11:31,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,893 INFO L375 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-09-26 08:11:31,894 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 60 times [2018-09-26 08:11:31,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-09-26 08:11:32,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:11:32,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:11:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:11:32,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:32,434 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-09-26 08:11:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,801 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-09-26 08:11:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:11:32,801 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-09-26 08:11:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,804 INFO L225 Difference]: With dead ends: 641 [2018-09-26 08:11:32,804 INFO L226 Difference]: Without dead ends: 639 [2018-09-26 08:11:32,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-09-26 08:11:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-09-26 08:11:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-09-26 08:11:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-09-26 08:11:33,142 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-09-26 08:11:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,143 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-09-26 08:11:33,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:11:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-09-26 08:11:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-09-26 08:11:33,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,146 INFO L375 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-09-26 08:11:33,146 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 61 times [2018-09-26 08:11:33,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-09-26 08:11:33,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:11:33,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:11:33,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:11:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:33,579 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-09-26 08:11:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,959 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-09-26 08:11:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:11:33,959 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-09-26 08:11:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,961 INFO L225 Difference]: With dead ends: 653 [2018-09-26 08:11:33,961 INFO L226 Difference]: Without dead ends: 651 [2018-09-26 08:11:33,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-09-26 08:11:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-09-26 08:11:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-09-26 08:11:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-09-26 08:11:34,322 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-09-26 08:11:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,322 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-09-26 08:11:34,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:11:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-09-26 08:11:34,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-09-26 08:11:34,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,327 INFO L375 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-09-26 08:11:34,327 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 62 times [2018-09-26 08:11:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-09-26 08:11:34,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:11:34,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:11:34,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:11:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:34,862 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-09-26 08:11:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,302 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-09-26 08:11:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:11:35,302 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-09-26 08:11:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,304 INFO L225 Difference]: With dead ends: 665 [2018-09-26 08:11:35,304 INFO L226 Difference]: Without dead ends: 663 [2018-09-26 08:11:35,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-09-26 08:11:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-09-26 08:11:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-09-26 08:11:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-09-26 08:11:35,666 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-09-26 08:11:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:35,667 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-09-26 08:11:35,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:11:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-09-26 08:11:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-09-26 08:11:35,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:35,671 INFO L375 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-09-26 08:11:35,672 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:35,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 63 times [2018-09-26 08:11:35,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-09-26 08:11:36,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:11:36,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:11:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:11:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:36,126 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-09-26 08:11:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,540 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-09-26 08:11:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:11:36,540 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-09-26 08:11:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,542 INFO L225 Difference]: With dead ends: 677 [2018-09-26 08:11:36,542 INFO L226 Difference]: Without dead ends: 675 [2018-09-26 08:11:36,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-09-26 08:11:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-09-26 08:11:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-26 08:11:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-09-26 08:11:36,924 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-09-26 08:11:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,924 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-09-26 08:11:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:11:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-09-26 08:11:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-09-26 08:11:36,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,929 INFO L375 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-09-26 08:11:36,930 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 64 times [2018-09-26 08:11:36,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-09-26 08:11:37,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:11:37,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:11:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:11:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:37,401 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-09-26 08:11:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:37,819 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-09-26 08:11:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:11:37,819 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-09-26 08:11:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:37,821 INFO L225 Difference]: With dead ends: 689 [2018-09-26 08:11:37,822 INFO L226 Difference]: Without dead ends: 687 [2018-09-26 08:11:37,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-26 08:11:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-09-26 08:11:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-09-26 08:11:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-09-26 08:11:38,269 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-09-26 08:11:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,270 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-09-26 08:11:38,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:11:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-09-26 08:11:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-09-26 08:11:38,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,273 INFO L375 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-09-26 08:11:38,273 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 65 times [2018-09-26 08:11:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-09-26 08:11:38,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:11:38,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:11:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:11:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:38,751 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-09-26 08:11:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:39,172 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-09-26 08:11:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:11:39,173 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-09-26 08:11:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:39,175 INFO L225 Difference]: With dead ends: 701 [2018-09-26 08:11:39,175 INFO L226 Difference]: Without dead ends: 699 [2018-09-26 08:11:39,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-09-26 08:11:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-09-26 08:11:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-09-26 08:11:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-09-26 08:11:39,583 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-09-26 08:11:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:39,583 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-09-26 08:11:39,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:11:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-09-26 08:11:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-09-26 08:11:39,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:39,588 INFO L375 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-09-26 08:11:39,588 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:39,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 66 times [2018-09-26 08:11:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-09-26 08:11:40,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:11:40,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:11:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:11:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:40,079 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-09-26 08:11:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,560 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-09-26 08:11:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:11:40,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-09-26 08:11:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,562 INFO L225 Difference]: With dead ends: 713 [2018-09-26 08:11:40,562 INFO L226 Difference]: Without dead ends: 711 [2018-09-26 08:11:40,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-09-26 08:11:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-09-26 08:11:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-09-26 08:11:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-09-26 08:11:41,039 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-09-26 08:11:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,040 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-09-26 08:11:41,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:11:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-09-26 08:11:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-09-26 08:11:41,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,045 INFO L375 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-09-26 08:11:41,045 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 67 times [2018-09-26 08:11:41,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-09-26 08:11:41,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:11:41,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:11:41,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:11:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:41,660 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-09-26 08:11:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,128 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-09-26 08:11:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:11:42,128 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-09-26 08:11:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,131 INFO L225 Difference]: With dead ends: 725 [2018-09-26 08:11:42,131 INFO L226 Difference]: Without dead ends: 723 [2018-09-26 08:11:42,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-09-26 08:11:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-09-26 08:11:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-09-26 08:11:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-09-26 08:11:42,553 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-09-26 08:11:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,554 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-09-26 08:11:42,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:11:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-09-26 08:11:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-09-26 08:11:42,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,559 INFO L375 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-09-26 08:11:42,560 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 68 times [2018-09-26 08:11:42,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-09-26 08:11:43,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:43,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:11:43,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:11:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:11:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:43,079 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-09-26 08:11:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,666 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-09-26 08:11:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:11:43,666 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-09-26 08:11:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,668 INFO L225 Difference]: With dead ends: 737 [2018-09-26 08:11:43,668 INFO L226 Difference]: Without dead ends: 735 [2018-09-26 08:11:43,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-09-26 08:11:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-09-26 08:11:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-09-26 08:11:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-09-26 08:11:44,124 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-09-26 08:11:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,124 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-09-26 08:11:44,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:11:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-09-26 08:11:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-09-26 08:11:44,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,128 INFO L375 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-09-26 08:11:44,129 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 69 times [2018-09-26 08:11:44,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-09-26 08:11:44,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:11:44,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:11:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:11:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:44,738 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-09-26 08:11:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,278 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-09-26 08:11:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:11:45,278 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-09-26 08:11:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,281 INFO L225 Difference]: With dead ends: 749 [2018-09-26 08:11:45,281 INFO L226 Difference]: Without dead ends: 747 [2018-09-26 08:11:45,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-09-26 08:11:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-09-26 08:11:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-09-26 08:11:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-09-26 08:11:45,736 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-09-26 08:11:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,737 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-09-26 08:11:45,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:11:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-09-26 08:11:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-09-26 08:11:45,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,740 INFO L375 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-09-26 08:11:45,741 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 70 times [2018-09-26 08:11:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-09-26 08:11:46,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:11:46,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:11:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:11:46,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:46,306 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-09-26 08:11:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,841 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-09-26 08:11:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:11:46,841 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-09-26 08:11:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,844 INFO L225 Difference]: With dead ends: 761 [2018-09-26 08:11:46,844 INFO L226 Difference]: Without dead ends: 759 [2018-09-26 08:11:46,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-09-26 08:11:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-09-26 08:11:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-09-26 08:11:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-09-26 08:11:47,358 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-09-26 08:11:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,359 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-09-26 08:11:47,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:11:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-09-26 08:11:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-09-26 08:11:47,362 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,362 INFO L375 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-09-26 08:11:47,363 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 71 times [2018-09-26 08:11:47,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-09-26 08:11:47,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:11:47,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:11:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:11:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:47,923 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-09-26 08:11:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,485 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-09-26 08:11:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:11:48,486 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-09-26 08:11:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,488 INFO L225 Difference]: With dead ends: 773 [2018-09-26 08:11:48,488 INFO L226 Difference]: Without dead ends: 771 [2018-09-26 08:11:48,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-09-26 08:11:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-09-26 08:11:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-09-26 08:11:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-09-26 08:11:48,989 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-09-26 08:11:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-09-26 08:11:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:11:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-09-26 08:11:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-09-26 08:11:48,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,994 INFO L375 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-09-26 08:11:48,994 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 72 times [2018-09-26 08:11:48,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-09-26 08:11:49,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:11:49,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:11:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:11:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:49,572 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-09-26 08:11:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,188 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-09-26 08:11:50,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:11:50,188 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-09-26 08:11:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,190 INFO L225 Difference]: With dead ends: 785 [2018-09-26 08:11:50,191 INFO L226 Difference]: Without dead ends: 783 [2018-09-26 08:11:50,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-26 08:11:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-09-26 08:11:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-09-26 08:11:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-09-26 08:11:50,703 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-09-26 08:11:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,703 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-09-26 08:11:50,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:11:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-09-26 08:11:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-09-26 08:11:50,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,707 INFO L375 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-09-26 08:11:50,707 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 73 times [2018-09-26 08:11:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-09-26 08:11:51,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:11:51,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:11:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:11:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:51,301 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-09-26 08:11:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,895 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-09-26 08:11:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:11:51,896 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-09-26 08:11:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,899 INFO L225 Difference]: With dead ends: 797 [2018-09-26 08:11:51,900 INFO L226 Difference]: Without dead ends: 795 [2018-09-26 08:11:51,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-09-26 08:11:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-09-26 08:11:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-09-26 08:11:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-09-26 08:11:52,545 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-09-26 08:11:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,545 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-09-26 08:11:52,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:11:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-09-26 08:11:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-09-26 08:11:52,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,549 INFO L375 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-09-26 08:11:52,550 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 74 times [2018-09-26 08:11:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-09-26 08:11:53,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:11:53,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:11:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:11:53,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:53,210 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-09-26 08:11:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,821 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-09-26 08:11:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:11:53,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-09-26 08:11:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,824 INFO L225 Difference]: With dead ends: 809 [2018-09-26 08:11:53,824 INFO L226 Difference]: Without dead ends: 807 [2018-09-26 08:11:53,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-09-26 08:11:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-09-26 08:11:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-09-26 08:11:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-09-26 08:11:54,379 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-09-26 08:11:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,379 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-09-26 08:11:54,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:11:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-09-26 08:11:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-09-26 08:11:54,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,384 INFO L375 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-09-26 08:11:54,384 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 75 times [2018-09-26 08:11:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-09-26 08:11:55,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:11:55,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:11:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:11:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:55,018 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-09-26 08:11:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,617 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-09-26 08:11:55,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:11:55,617 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-09-26 08:11:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,620 INFO L225 Difference]: With dead ends: 821 [2018-09-26 08:11:55,620 INFO L226 Difference]: Without dead ends: 819 [2018-09-26 08:11:55,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-26 08:11:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-09-26 08:11:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-09-26 08:11:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-09-26 08:11:56,235 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-09-26 08:11:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:56,235 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-09-26 08:11:56,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:11:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-09-26 08:11:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-09-26 08:11:56,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:56,239 INFO L375 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-09-26 08:11:56,240 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:56,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 76 times [2018-09-26 08:11:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-09-26 08:11:56,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:11:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:11:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:11:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:56,903 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-09-26 08:11:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,542 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-09-26 08:11:57,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:11:57,542 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-09-26 08:11:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,546 INFO L225 Difference]: With dead ends: 833 [2018-09-26 08:11:57,546 INFO L226 Difference]: Without dead ends: 831 [2018-09-26 08:11:57,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-09-26 08:11:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-09-26 08:11:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-09-26 08:11:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-09-26 08:11:58,142 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-09-26 08:11:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,143 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-09-26 08:11:58,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:11:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-09-26 08:11:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-09-26 08:11:58,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,147 INFO L375 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-09-26 08:11:58,147 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 77 times [2018-09-26 08:11:58,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-09-26 08:11:58,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:11:58,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:11:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:11:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:58,841 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-09-26 08:11:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,549 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-09-26 08:11:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:11:59,550 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-09-26 08:11:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,553 INFO L225 Difference]: With dead ends: 845 [2018-09-26 08:11:59,553 INFO L226 Difference]: Without dead ends: 843 [2018-09-26 08:11:59,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-09-26 08:12:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-09-26 08:12:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-09-26 08:12:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-09-26 08:12:00,166 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-09-26 08:12:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,167 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-09-26 08:12:00,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:12:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-09-26 08:12:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-09-26 08:12:00,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,171 INFO L375 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-09-26 08:12:00,172 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 78 times [2018-09-26 08:12:00,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-09-26 08:12:00,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:12:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:12:00,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:12:00,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:12:00,856 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-09-26 08:12:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,542 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-09-26 08:12:01,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:12:01,543 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-09-26 08:12:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,545 INFO L225 Difference]: With dead ends: 857 [2018-09-26 08:12:01,545 INFO L226 Difference]: Without dead ends: 855 [2018-09-26 08:12:01,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:12:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-09-26 08:12:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-09-26 08:12:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-09-26 08:12:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-09-26 08:12:02,228 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-09-26 08:12:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,229 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-09-26 08:12:02,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:12:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-09-26 08:12:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-09-26 08:12:02,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,233 INFO L375 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-09-26 08:12:02,234 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 79 times [2018-09-26 08:12:02,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-09-26 08:12:02,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:12:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:12:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:12:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:12:02,933 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-09-26 08:12:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,666 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-09-26 08:12:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:12:03,666 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-09-26 08:12:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,668 INFO L225 Difference]: With dead ends: 869 [2018-09-26 08:12:03,668 INFO L226 Difference]: Without dead ends: 867 [2018-09-26 08:12:03,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:12:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-09-26 08:12:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-09-26 08:12:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-09-26 08:12:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-09-26 08:12:04,342 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-09-26 08:12:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,343 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-09-26 08:12:04,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:12:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-09-26 08:12:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-09-26 08:12:04,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,348 INFO L375 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-09-26 08:12:04,348 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 80 times [2018-09-26 08:12:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-09-26 08:12:05,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:12:05,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:12:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:12:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:12:05,120 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-09-26 08:12:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,868 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-09-26 08:12:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:12:05,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-09-26 08:12:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,870 INFO L225 Difference]: With dead ends: 881 [2018-09-26 08:12:05,870 INFO L226 Difference]: Without dead ends: 879 [2018-09-26 08:12:05,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:12:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-09-26 08:12:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-09-26 08:12:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-09-26 08:12:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-09-26 08:12:06,554 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-09-26 08:12:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:06,555 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-09-26 08:12:06,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:12:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-09-26 08:12:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-09-26 08:12:06,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:06,560 INFO L375 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-09-26 08:12:06,560 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:06,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 81 times [2018-09-26 08:12:06,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-09-26 08:12:07,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:12:07,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:12:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:12:07,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:12:07,336 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-09-26 08:12:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:08,110 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-09-26 08:12:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:12:08,110 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-09-26 08:12:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,112 INFO L225 Difference]: With dead ends: 893 [2018-09-26 08:12:08,112 INFO L226 Difference]: Without dead ends: 891 [2018-09-26 08:12:08,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:12:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-09-26 08:12:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-09-26 08:12:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-09-26 08:12:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-09-26 08:12:08,818 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-09-26 08:12:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,819 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-09-26 08:12:08,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:12:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-09-26 08:12:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-09-26 08:12:08,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,824 INFO L375 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-09-26 08:12:08,824 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 82 times [2018-09-26 08:12:08,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-09-26 08:12:09,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:09,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:12:09,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:12:09,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:12:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:12:09,587 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-09-26 08:12:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,401 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-09-26 08:12:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:12:10,401 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-09-26 08:12:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,402 INFO L225 Difference]: With dead ends: 905 [2018-09-26 08:12:10,403 INFO L226 Difference]: Without dead ends: 903 [2018-09-26 08:12:10,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:12:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-09-26 08:12:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-09-26 08:12:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-09-26 08:12:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-09-26 08:12:11,119 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-09-26 08:12:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,119 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-09-26 08:12:11,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:12:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-09-26 08:12:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-09-26 08:12:11,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,124 INFO L375 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-09-26 08:12:11,124 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 83 times [2018-09-26 08:12:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-09-26 08:12:11,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:12:11,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:12:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:12:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:12:11,892 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-09-26 08:12:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:12,748 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-09-26 08:12:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:12:12,749 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-09-26 08:12:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:12,750 INFO L225 Difference]: With dead ends: 917 [2018-09-26 08:12:12,750 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 08:12:12,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:12:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 08:12:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-09-26 08:12:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-09-26 08:12:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-09-26 08:12:13,492 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-09-26 08:12:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,493 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-09-26 08:12:13,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:12:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-09-26 08:12:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-09-26 08:12:13,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,501 INFO L375 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-09-26 08:12:13,501 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 84 times [2018-09-26 08:12:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-09-26 08:12:14,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:14,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:12:14,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:12:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:12:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:12:14,359 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-09-26 08:12:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:15,246 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-09-26 08:12:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:12:15,246 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-09-26 08:12:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:15,247 INFO L225 Difference]: With dead ends: 929 [2018-09-26 08:12:15,248 INFO L226 Difference]: Without dead ends: 927 [2018-09-26 08:12:15,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:12:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-26 08:12:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-09-26 08:12:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-26 08:12:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-09-26 08:12:16,014 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-09-26 08:12:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,015 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-09-26 08:12:16,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:12:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-09-26 08:12:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-09-26 08:12:16,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,020 INFO L375 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-09-26 08:12:16,020 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 85 times [2018-09-26 08:12:16,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-09-26 08:12:16,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:16,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:12:16,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:12:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:12:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:12:16,893 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-09-26 08:12:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:17,753 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-09-26 08:12:17,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:12:17,754 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-09-26 08:12:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:17,755 INFO L225 Difference]: With dead ends: 941 [2018-09-26 08:12:17,755 INFO L226 Difference]: Without dead ends: 939 [2018-09-26 08:12:17,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:12:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-09-26 08:12:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-09-26 08:12:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-09-26 08:12:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-09-26 08:12:18,538 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-09-26 08:12:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:18,538 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-09-26 08:12:18,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:12:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-09-26 08:12:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-09-26 08:12:18,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:18,544 INFO L375 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-09-26 08:12:18,544 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:18,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 86 times [2018-09-26 08:12:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-09-26 08:12:19,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:19,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:12:19,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:12:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:12:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:12:19,434 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-09-26 08:12:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,299 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-09-26 08:12:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:12:20,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-09-26 08:12:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,301 INFO L225 Difference]: With dead ends: 953 [2018-09-26 08:12:20,301 INFO L226 Difference]: Without dead ends: 951 [2018-09-26 08:12:20,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:12:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-09-26 08:12:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-09-26 08:12:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-09-26 08:12:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-09-26 08:12:21,178 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-09-26 08:12:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:21,178 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-09-26 08:12:21,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:12:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-09-26 08:12:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-09-26 08:12:21,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:21,184 INFO L375 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-09-26 08:12:21,184 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:21,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 87 times [2018-09-26 08:12:21,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-09-26 08:12:22,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:22,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:12:22,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:12:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:12:22,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:12:22,086 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-09-26 08:12:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:23,021 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-09-26 08:12:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:12:23,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-09-26 08:12:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:23,023 INFO L225 Difference]: With dead ends: 965 [2018-09-26 08:12:23,023 INFO L226 Difference]: Without dead ends: 963 [2018-09-26 08:12:23,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:12:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-09-26 08:12:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-09-26 08:12:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-09-26 08:12:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-09-26 08:12:23,902 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-09-26 08:12:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:23,903 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-09-26 08:12:23,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:12:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-09-26 08:12:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-09-26 08:12:23,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,908 INFO L375 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-09-26 08:12:23,908 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 88 times [2018-09-26 08:12:23,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-09-26 08:12:24,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:24,838 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:12:24,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:12:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:12:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:12:24,840 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-09-26 08:12:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:25,791 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-09-26 08:12:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:12:25,791 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-09-26 08:12:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:25,794 INFO L225 Difference]: With dead ends: 977 [2018-09-26 08:12:25,794 INFO L226 Difference]: Without dead ends: 975 [2018-09-26 08:12:25,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:12:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-26 08:12:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-09-26 08:12:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-09-26 08:12:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-09-26 08:12:26,835 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-09-26 08:12:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,836 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-09-26 08:12:26,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:12:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-09-26 08:12:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-09-26 08:12:26,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,842 INFO L375 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-09-26 08:12:26,842 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 89 times [2018-09-26 08:12:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-09-26 08:12:27,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:27,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:12:27,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:12:27,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:12:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:12:27,735 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-09-26 08:12:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:28,746 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-09-26 08:12:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:12:28,747 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-09-26 08:12:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:28,748 INFO L225 Difference]: With dead ends: 989 [2018-09-26 08:12:28,748 INFO L226 Difference]: Without dead ends: 987 [2018-09-26 08:12:28,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:12:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-09-26 08:12:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-09-26 08:12:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-09-26 08:12:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-09-26 08:12:29,661 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-09-26 08:12:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-09-26 08:12:29,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:12:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-09-26 08:12:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-09-26 08:12:29,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:29,667 INFO L375 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-09-26 08:12:29,667 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:29,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 90 times [2018-09-26 08:12:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-09-26 08:12:30,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:30,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:12:30,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:12:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:12:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:12:30,581 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-09-26 08:12:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:31,630 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-09-26 08:12:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:12:31,630 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-09-26 08:12:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:31,632 INFO L225 Difference]: With dead ends: 1001 [2018-09-26 08:12:31,632 INFO L226 Difference]: Without dead ends: 999 [2018-09-26 08:12:31,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:12:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-09-26 08:12:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-09-26 08:12:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-09-26 08:12:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-09-26 08:12:32,542 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-09-26 08:12:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:32,542 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-09-26 08:12:32,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:12:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-09-26 08:12:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-09-26 08:12:32,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:32,548 INFO L375 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-09-26 08:12:32,548 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:32,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 91 times [2018-09-26 08:12:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-09-26 08:12:33,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:33,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:12:33,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:12:33,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:12:33,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:12:33,530 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-09-26 08:12:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:34,606 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-09-26 08:12:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:12:34,606 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-09-26 08:12:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:34,608 INFO L225 Difference]: With dead ends: 1013 [2018-09-26 08:12:34,608 INFO L226 Difference]: Without dead ends: 1011 [2018-09-26 08:12:34,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:12:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-09-26 08:12:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-09-26 08:12:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-09-26 08:12:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-09-26 08:12:35,667 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-09-26 08:12:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:35,667 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-09-26 08:12:35,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:12:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-09-26 08:12:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-09-26 08:12:35,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:35,675 INFO L375 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-09-26 08:12:35,676 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:35,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 92 times [2018-09-26 08:12:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-09-26 08:12:36,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:36,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:12:36,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:12:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:12:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:36,633 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-09-26 08:12:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:37,721 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-09-26 08:12:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:12:37,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-09-26 08:12:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:37,723 INFO L225 Difference]: With dead ends: 1025 [2018-09-26 08:12:37,723 INFO L226 Difference]: Without dead ends: 1023 [2018-09-26 08:12:37,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:12:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-09-26 08:12:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-09-26 08:12:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-09-26 08:12:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-09-26 08:12:39,294 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-09-26 08:12:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,294 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-09-26 08:12:39,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:12:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-09-26 08:12:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-09-26 08:12:39,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,301 INFO L375 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-09-26 08:12:39,301 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 93 times [2018-09-26 08:12:39,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-09-26 08:12:40,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:12:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:12:40,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:12:40,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:40,290 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-09-26 08:12:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:41,448 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-09-26 08:12:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:12:41,448 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-09-26 08:12:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:41,450 INFO L225 Difference]: With dead ends: 1037 [2018-09-26 08:12:41,450 INFO L226 Difference]: Without dead ends: 1035 [2018-09-26 08:12:41,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:12:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-09-26 08:12:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-09-26 08:12:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-26 08:12:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-09-26 08:12:42,455 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-09-26 08:12:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:42,456 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-09-26 08:12:42,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:12:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-09-26 08:12:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-09-26 08:12:42,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:42,466 INFO L375 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-09-26 08:12:42,466 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:42,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 94 times [2018-09-26 08:12:42,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-09-26 08:12:43,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:43,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:12:43,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:12:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:12:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:43,498 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-09-26 08:12:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:44,680 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-09-26 08:12:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:12:44,680 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-09-26 08:12:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:44,681 INFO L225 Difference]: With dead ends: 1049 [2018-09-26 08:12:44,681 INFO L226 Difference]: Without dead ends: 1047 [2018-09-26 08:12:44,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:12:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-09-26 08:12:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-09-26 08:12:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-09-26 08:12:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-09-26 08:12:45,896 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-09-26 08:12:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:45,897 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-09-26 08:12:45,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:12:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-09-26 08:12:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-09-26 08:12:45,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:45,903 INFO L375 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-09-26 08:12:45,904 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:45,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 95 times [2018-09-26 08:12:45,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-09-26 08:12:46,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:46,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:12:46,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:12:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:12:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:46,941 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-09-26 08:12:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:48,144 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-09-26 08:12:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:12:48,144 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-09-26 08:12:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:48,146 INFO L225 Difference]: With dead ends: 1061 [2018-09-26 08:12:48,146 INFO L226 Difference]: Without dead ends: 1059 [2018-09-26 08:12:48,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:12:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-09-26 08:12:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-09-26 08:12:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-09-26 08:12:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-09-26 08:12:49,208 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-09-26 08:12:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-09-26 08:12:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:12:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-09-26 08:12:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-09-26 08:12:49,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:49,217 INFO L375 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-09-26 08:12:49,217 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:49,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 96 times [2018-09-26 08:12:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-09-26 08:12:50,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:50,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:12:50,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:12:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:12:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:50,291 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-09-26 08:12:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:51,532 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-09-26 08:12:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:12:51,532 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-09-26 08:12:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:51,534 INFO L225 Difference]: With dead ends: 1073 [2018-09-26 08:12:51,534 INFO L226 Difference]: Without dead ends: 1071 [2018-09-26 08:12:51,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:12:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-09-26 08:12:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-09-26 08:12:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-09-26 08:12:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-09-26 08:12:52,630 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-09-26 08:12:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:52,630 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-09-26 08:12:52,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:12:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-09-26 08:12:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-09-26 08:12:52,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:52,637 INFO L375 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-09-26 08:12:52,637 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:52,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:52,638 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 97 times [2018-09-26 08:12:52,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-09-26 08:12:53,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:53,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:12:53,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:12:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:12:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:53,750 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-09-26 08:12:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:55,040 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-09-26 08:12:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:12:55,040 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-09-26 08:12:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:55,042 INFO L225 Difference]: With dead ends: 1085 [2018-09-26 08:12:55,042 INFO L226 Difference]: Without dead ends: 1083 [2018-09-26 08:12:55,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:12:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-09-26 08:12:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-09-26 08:12:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-09-26 08:12:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-09-26 08:12:56,261 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-09-26 08:12:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:56,262 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-09-26 08:12:56,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:12:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-09-26 08:12:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-09-26 08:12:56,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:56,272 INFO L375 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-09-26 08:12:56,272 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:56,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 98 times [2018-09-26 08:12:56,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-09-26 08:12:57,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:57,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:12:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:12:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:12:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:57,390 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-09-26 08:12:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:58,672 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-09-26 08:12:58,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:12:58,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-09-26 08:12:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:58,673 INFO L225 Difference]: With dead ends: 1097 [2018-09-26 08:12:58,673 INFO L226 Difference]: Without dead ends: 1095 [2018-09-26 08:12:58,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:12:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-26 08:12:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-09-26 08:12:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-09-26 08:12:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-09-26 08:12:59,848 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-09-26 08:12:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:59,849 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-09-26 08:12:59,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:12:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-09-26 08:12:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-09-26 08:12:59,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:59,857 INFO L375 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-09-26 08:12:59,857 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:59,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 99 times [2018-09-26 08:12:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-09-26 08:13:01,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:01,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:13:01,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:13:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:13:01,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:13:01,054 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-09-26 08:13:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:02,453 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-09-26 08:13:02,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:13:02,454 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-09-26 08:13:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:02,455 INFO L225 Difference]: With dead ends: 1109 [2018-09-26 08:13:02,455 INFO L226 Difference]: Without dead ends: 1107 [2018-09-26 08:13:02,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:13:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-09-26 08:13:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-09-26 08:13:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-09-26 08:13:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-09-26 08:13:03,638 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-09-26 08:13:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:03,639 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-09-26 08:13:03,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:13:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-09-26 08:13:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-09-26 08:13:03,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:03,648 INFO L375 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-09-26 08:13:03,648 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:03,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 100 times [2018-09-26 08:13:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-09-26 08:13:04,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:04,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:13:04,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:13:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:13:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:13:04,814 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-09-26 08:13:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:06,161 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-09-26 08:13:06,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:13:06,162 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-09-26 08:13:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:06,163 INFO L225 Difference]: With dead ends: 1121 [2018-09-26 08:13:06,163 INFO L226 Difference]: Without dead ends: 1119 [2018-09-26 08:13:06,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:13:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-26 08:13:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-09-26 08:13:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-09-26 08:13:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-09-26 08:13:07,365 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-09-26 08:13:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:07,365 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-09-26 08:13:07,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:13:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-09-26 08:13:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-09-26 08:13:07,371 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:07,372 INFO L375 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-09-26 08:13:07,372 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:07,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 101 times [2018-09-26 08:13:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-09-26 08:13:08,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:08,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:13:08,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:13:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:13:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:13:08,561 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-09-26 08:13:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:09,965 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-09-26 08:13:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:13:09,965 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-09-26 08:13:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:09,966 INFO L225 Difference]: With dead ends: 1133 [2018-09-26 08:13:09,966 INFO L226 Difference]: Without dead ends: 1131 [2018-09-26 08:13:09,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:13:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-26 08:13:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-09-26 08:13:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-09-26 08:13:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-09-26 08:13:11,218 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-09-26 08:13:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:11,219 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-09-26 08:13:11,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:13:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-09-26 08:13:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-09-26 08:13:11,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:11,225 INFO L375 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-09-26 08:13:11,225 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:11,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 102 times [2018-09-26 08:13:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-09-26 08:13:12,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:12,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:13:12,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:13:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:13:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:13:12,457 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-09-26 08:13:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:13,883 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-09-26 08:13:13,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:13:13,883 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-09-26 08:13:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:13,884 INFO L225 Difference]: With dead ends: 1145 [2018-09-26 08:13:13,884 INFO L226 Difference]: Without dead ends: 1143 [2018-09-26 08:13:13,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:13:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-09-26 08:13:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-09-26 08:13:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-09-26 08:13:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-09-26 08:13:15,177 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-09-26 08:13:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:15,177 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-09-26 08:13:15,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:13:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-09-26 08:13:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-09-26 08:13:15,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:15,184 INFO L375 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-09-26 08:13:15,184 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:15,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 103 times [2018-09-26 08:13:15,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-09-26 08:13:16,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:16,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:13:16,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:13:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:13:16,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:13:16,383 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-09-26 08:13:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:17,901 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-09-26 08:13:17,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:13:17,901 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-09-26 08:13:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:17,903 INFO L225 Difference]: With dead ends: 1157 [2018-09-26 08:13:17,903 INFO L226 Difference]: Without dead ends: 1155 [2018-09-26 08:13:17,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:13:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-09-26 08:13:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-09-26 08:13:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-09-26 08:13:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-09-26 08:13:19,203 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-09-26 08:13:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-09-26 08:13:19,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:13:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-09-26 08:13:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-09-26 08:13:19,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:19,211 INFO L375 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-09-26 08:13:19,211 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:19,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 104 times [2018-09-26 08:13:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-09-26 08:13:20,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:20,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:13:20,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:13:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:13:20,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:13:20,489 INFO L87 Difference]: Start difference. First operand 1144 states and 1239 transitions. Second operand 98 states. [2018-09-26 08:13:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:21,998 INFO L93 Difference]: Finished difference Result 1169 states and 1266 transitions. [2018-09-26 08:13:21,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:13:21,998 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 1143 [2018-09-26 08:13:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:21,999 INFO L225 Difference]: With dead ends: 1169 [2018-09-26 08:13:22,000 INFO L226 Difference]: Without dead ends: 1167 [2018-09-26 08:13:22,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:13:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-09-26 08:13:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1156. [2018-09-26 08:13:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-09-26 08:13:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1252 transitions. [2018-09-26 08:13:23,342 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1252 transitions. Word has length 1143 [2018-09-26 08:13:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:23,343 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1252 transitions. [2018-09-26 08:13:23,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:13:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1252 transitions. [2018-09-26 08:13:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2018-09-26 08:13:23,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:23,350 INFO L375 BasicCegarLoop]: trace histogram [960, 96, 96, 1, 1, 1] [2018-09-26 08:13:23,350 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:23,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash -84868925, now seen corresponding path program 105 times [2018-09-26 08:13:23,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 561696 backedges. 0 proven. 556416 refuted. 0 times theorem prover too weak. 5280 trivial. 0 not checked. [2018-09-26 08:13:24,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:24,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:13:24,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:13:24,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:13:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:13:24,646 INFO L87 Difference]: Start difference. First operand 1156 states and 1252 transitions. Second operand 99 states. [2018-09-26 08:13:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:26,228 INFO L93 Difference]: Finished difference Result 1181 states and 1279 transitions. [2018-09-26 08:13:26,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:13:26,228 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1155 [2018-09-26 08:13:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:26,230 INFO L225 Difference]: With dead ends: 1181 [2018-09-26 08:13:26,230 INFO L226 Difference]: Without dead ends: 1179 [2018-09-26 08:13:26,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:13:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-09-26 08:13:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1168. [2018-09-26 08:13:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-09-26 08:13:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1265 transitions. [2018-09-26 08:13:27,630 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1265 transitions. Word has length 1155 [2018-09-26 08:13:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:27,630 INFO L480 AbstractCegarLoop]: Abstraction has 1168 states and 1265 transitions. [2018-09-26 08:13:27,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:13:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1265 transitions. [2018-09-26 08:13:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2018-09-26 08:13:27,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:27,637 INFO L375 BasicCegarLoop]: trace histogram [970, 97, 97, 1, 1, 1] [2018-09-26 08:13:27,637 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:27,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1722927091, now seen corresponding path program 106 times [2018-09-26 08:13:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 573464 backedges. 0 proven. 568129 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2018-09-26 08:13:28,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:28,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:13:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:13:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:13:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:13:28,938 INFO L87 Difference]: Start difference. First operand 1168 states and 1265 transitions. Second operand 100 states. [2018-09-26 08:13:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:30,469 INFO L93 Difference]: Finished difference Result 1193 states and 1292 transitions. [2018-09-26 08:13:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:13:30,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 1167 [2018-09-26 08:13:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:30,470 INFO L225 Difference]: With dead ends: 1193 [2018-09-26 08:13:30,470 INFO L226 Difference]: Without dead ends: 1191 [2018-09-26 08:13:30,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:13:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-09-26 08:13:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1180. [2018-09-26 08:13:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-09-26 08:13:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1278 transitions. [2018-09-26 08:13:31,881 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1278 transitions. Word has length 1167 [2018-09-26 08:13:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:31,882 INFO L480 AbstractCegarLoop]: Abstraction has 1180 states and 1278 transitions. [2018-09-26 08:13:31,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:13:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1278 transitions. [2018-09-26 08:13:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2018-09-26 08:13:31,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:31,888 INFO L375 BasicCegarLoop]: trace histogram [980, 98, 98, 1, 1, 1] [2018-09-26 08:13:31,889 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:31,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:31,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1401892777, now seen corresponding path program 107 times [2018-09-26 08:13:31,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 585354 backedges. 0 proven. 579964 refuted. 0 times theorem prover too weak. 5390 trivial. 0 not checked. [2018-09-26 08:13:33,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:33,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:13:33,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:13:33,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:13:33,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:13:33,227 INFO L87 Difference]: Start difference. First operand 1180 states and 1278 transitions. Second operand 101 states. [2018-09-26 08:13:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:34,832 INFO L93 Difference]: Finished difference Result 1205 states and 1305 transitions. [2018-09-26 08:13:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:13:34,832 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1179 [2018-09-26 08:13:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:34,834 INFO L225 Difference]: With dead ends: 1205 [2018-09-26 08:13:34,834 INFO L226 Difference]: Without dead ends: 1203 [2018-09-26 08:13:34,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:13:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-09-26 08:13:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1192. [2018-09-26 08:13:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-09-26 08:13:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1291 transitions. [2018-09-26 08:13:36,314 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1291 transitions. Word has length 1179 [2018-09-26 08:13:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:36,314 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1291 transitions. [2018-09-26 08:13:36,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:13:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1291 transitions. [2018-09-26 08:13:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2018-09-26 08:13:36,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:36,322 INFO L375 BasicCegarLoop]: trace histogram [990, 99, 99, 1, 1, 1] [2018-09-26 08:13:36,322 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:36,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:36,322 INFO L82 PathProgramCache]: Analyzing trace with hash -632338015, now seen corresponding path program 108 times [2018-09-26 08:13:36,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-09-26 08:13:37,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:37,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:13:37,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:13:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:13:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:13:37,693 INFO L87 Difference]: Start difference. First operand 1192 states and 1291 transitions. Second operand 102 states. [2018-09-26 08:13:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:39,309 INFO L93 Difference]: Finished difference Result 1217 states and 1318 transitions. [2018-09-26 08:13:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:13:39,309 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1191 [2018-09-26 08:13:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:39,311 INFO L225 Difference]: With dead ends: 1217 [2018-09-26 08:13:39,311 INFO L226 Difference]: Without dead ends: 1215 [2018-09-26 08:13:39,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:13:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2018-09-26 08:13:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1204. [2018-09-26 08:13:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-09-26 08:13:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1304 transitions. [2018-09-26 08:13:40,856 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1304 transitions. Word has length 1191 [2018-09-26 08:13:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:40,856 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1304 transitions. [2018-09-26 08:13:40,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:13:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1304 transitions. [2018-09-26 08:13:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-09-26 08:13:40,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:40,865 INFO L375 BasicCegarLoop]: trace histogram [1000, 100, 100, 1, 1, 1] [2018-09-26 08:13:40,866 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:40,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:40,866 INFO L82 PathProgramCache]: Analyzing trace with hash 186655723, now seen corresponding path program 109 times [2018-09-26 08:13:40,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 609500 backedges. 0 proven. 604000 refuted. 0 times theorem prover too weak. 5500 trivial. 0 not checked. [2018-09-26 08:13:42,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:42,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:13:42,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:13:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:13:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:13:42,257 INFO L87 Difference]: Start difference. First operand 1204 states and 1304 transitions. Second operand 103 states. [2018-09-26 08:13:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:43,991 INFO L93 Difference]: Finished difference Result 1229 states and 1331 transitions. [2018-09-26 08:13:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:13:43,991 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1203 [2018-09-26 08:13:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:43,992 INFO L225 Difference]: With dead ends: 1229 [2018-09-26 08:13:43,992 INFO L226 Difference]: Without dead ends: 1227 [2018-09-26 08:13:43,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:13:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-09-26 08:13:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1216. [2018-09-26 08:13:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-09-26 08:13:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1317 transitions. [2018-09-26 08:13:45,541 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1317 transitions. Word has length 1203 [2018-09-26 08:13:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:45,542 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1317 transitions. [2018-09-26 08:13:45,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:13:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1317 transitions. [2018-09-26 08:13:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2018-09-26 08:13:45,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:45,549 INFO L375 BasicCegarLoop]: trace histogram [1010, 101, 101, 1, 1, 1] [2018-09-26 08:13:45,549 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:45,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash 156884789, now seen corresponding path program 110 times [2018-09-26 08:13:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 621756 backedges. 0 proven. 616201 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-09-26 08:13:47,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:47,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:13:47,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:13:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:13:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:13:47,909 INFO L87 Difference]: Start difference. First operand 1216 states and 1317 transitions. Second operand 104 states. [2018-09-26 08:13:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:49,721 INFO L93 Difference]: Finished difference Result 1241 states and 1344 transitions. [2018-09-26 08:13:49,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:13:49,721 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 1215 [2018-09-26 08:13:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:49,723 INFO L225 Difference]: With dead ends: 1241 [2018-09-26 08:13:49,723 INFO L226 Difference]: Without dead ends: 1239 [2018-09-26 08:13:49,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:13:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-09-26 08:13:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1228. [2018-09-26 08:13:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-09-26 08:13:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1330 transitions. [2018-09-26 08:13:51,290 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1330 transitions. Word has length 1215 [2018-09-26 08:13:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:51,290 INFO L480 AbstractCegarLoop]: Abstraction has 1228 states and 1330 transitions. [2018-09-26 08:13:51,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:13:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1330 transitions. [2018-09-26 08:13:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2018-09-26 08:13:51,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:51,298 INFO L375 BasicCegarLoop]: trace histogram [1020, 102, 102, 1, 1, 1] [2018-09-26 08:13:51,298 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:51,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 565377919, now seen corresponding path program 111 times [2018-09-26 08:13:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 634134 backedges. 0 proven. 628524 refuted. 0 times theorem prover too weak. 5610 trivial. 0 not checked. [2018-09-26 08:13:52,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:52,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:13:52,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:13:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:13:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:13:52,741 INFO L87 Difference]: Start difference. First operand 1228 states and 1330 transitions. Second operand 105 states. [2018-09-26 08:13:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:54,449 INFO L93 Difference]: Finished difference Result 1253 states and 1357 transitions. [2018-09-26 08:13:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:13:54,450 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1227 [2018-09-26 08:13:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:54,451 INFO L225 Difference]: With dead ends: 1253 [2018-09-26 08:13:54,451 INFO L226 Difference]: Without dead ends: 1251 [2018-09-26 08:13:54,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:13:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-09-26 08:13:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1240. [2018-09-26 08:13:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-09-26 08:13:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1343 transitions. [2018-09-26 08:13:56,056 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1343 transitions. Word has length 1227 [2018-09-26 08:13:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:56,056 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1343 transitions. [2018-09-26 08:13:56,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:13:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1343 transitions. [2018-09-26 08:13:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2018-09-26 08:13:56,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:56,064 INFO L375 BasicCegarLoop]: trace histogram [1030, 103, 103, 1, 1, 1] [2018-09-26 08:13:56,065 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:56,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1021183799, now seen corresponding path program 112 times [2018-09-26 08:13:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 646634 backedges. 0 proven. 640969 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-09-26 08:13:57,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:57,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:13:57,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:13:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:13:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:13:57,543 INFO L87 Difference]: Start difference. First operand 1240 states and 1343 transitions. Second operand 106 states. [2018-09-26 08:13:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:59,299 INFO L93 Difference]: Finished difference Result 1265 states and 1370 transitions. [2018-09-26 08:13:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:13:59,299 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 1239 [2018-09-26 08:13:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:59,300 INFO L225 Difference]: With dead ends: 1265 [2018-09-26 08:13:59,300 INFO L226 Difference]: Without dead ends: 1263 [2018-09-26 08:13:59,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:13:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-09-26 08:14:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1252. [2018-09-26 08:14:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-09-26 08:14:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1356 transitions. [2018-09-26 08:14:00,949 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1356 transitions. Word has length 1239 [2018-09-26 08:14:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:00,950 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1356 transitions. [2018-09-26 08:14:00,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:14:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1356 transitions. [2018-09-26 08:14:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2018-09-26 08:14:00,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:00,959 INFO L375 BasicCegarLoop]: trace histogram [1040, 104, 104, 1, 1, 1] [2018-09-26 08:14:00,959 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:00,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 517822227, now seen corresponding path program 113 times [2018-09-26 08:14:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 659256 backedges. 0 proven. 653536 refuted. 0 times theorem prover too weak. 5720 trivial. 0 not checked. [2018-09-26 08:14:02,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:02,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:14:02,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:14:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:14:02,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:14:02,497 INFO L87 Difference]: Start difference. First operand 1252 states and 1356 transitions. Second operand 107 states. [2018-09-26 08:14:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:04,291 INFO L93 Difference]: Finished difference Result 1277 states and 1383 transitions. [2018-09-26 08:14:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:14:04,291 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1251 [2018-09-26 08:14:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:04,292 INFO L225 Difference]: With dead ends: 1277 [2018-09-26 08:14:04,292 INFO L226 Difference]: Without dead ends: 1275 [2018-09-26 08:14:04,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:14:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-09-26 08:14:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1264. [2018-09-26 08:14:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-09-26 08:14:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1369 transitions. [2018-09-26 08:14:05,961 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1369 transitions. Word has length 1251 [2018-09-26 08:14:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:05,962 INFO L480 AbstractCegarLoop]: Abstraction has 1264 states and 1369 transitions. [2018-09-26 08:14:05,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:14:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1369 transitions. [2018-09-26 08:14:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1264 [2018-09-26 08:14:05,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:05,969 INFO L375 BasicCegarLoop]: trace histogram [1050, 105, 105, 1, 1, 1] [2018-09-26 08:14:05,970 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:05,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash -933521827, now seen corresponding path program 114 times [2018-09-26 08:14:05,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 672000 backedges. 0 proven. 666225 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-09-26 08:14:07,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:07,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:14:07,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:14:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:14:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:14:07,485 INFO L87 Difference]: Start difference. First operand 1264 states and 1369 transitions. Second operand 108 states. [2018-09-26 08:14:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:09,448 INFO L93 Difference]: Finished difference Result 1289 states and 1396 transitions. [2018-09-26 08:14:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:14:09,448 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 1263 [2018-09-26 08:14:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:09,450 INFO L225 Difference]: With dead ends: 1289 [2018-09-26 08:14:09,450 INFO L226 Difference]: Without dead ends: 1287 [2018-09-26 08:14:09,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:14:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-09-26 08:14:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1276. [2018-09-26 08:14:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-09-26 08:14:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1382 transitions. [2018-09-26 08:14:11,196 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1382 transitions. Word has length 1263 [2018-09-26 08:14:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:11,197 INFO L480 AbstractCegarLoop]: Abstraction has 1276 states and 1382 transitions. [2018-09-26 08:14:11,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:14:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1382 transitions. [2018-09-26 08:14:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2018-09-26 08:14:11,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:11,206 INFO L375 BasicCegarLoop]: trace histogram [1060, 106, 106, 1, 1, 1] [2018-09-26 08:14:11,206 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:11,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1431516839, now seen corresponding path program 115 times [2018-09-26 08:14:11,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 684866 backedges. 0 proven. 679036 refuted. 0 times theorem prover too weak. 5830 trivial. 0 not checked. [2018-09-26 08:14:12,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:12,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:14:12,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:14:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:14:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:14:12,775 INFO L87 Difference]: Start difference. First operand 1276 states and 1382 transitions. Second operand 109 states. [2018-09-26 08:14:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:14,811 INFO L93 Difference]: Finished difference Result 1301 states and 1409 transitions. [2018-09-26 08:14:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:14:14,811 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1275 [2018-09-26 08:14:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:14,814 INFO L225 Difference]: With dead ends: 1301 [2018-09-26 08:14:14,814 INFO L226 Difference]: Without dead ends: 1299 [2018-09-26 08:14:14,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:14:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-09-26 08:14:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1288. [2018-09-26 08:14:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-09-26 08:14:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1395 transitions. [2018-09-26 08:14:16,571 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1395 transitions. Word has length 1275 [2018-09-26 08:14:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:16,572 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1395 transitions. [2018-09-26 08:14:16,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:14:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1395 transitions. [2018-09-26 08:14:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2018-09-26 08:14:16,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:16,581 INFO L375 BasicCegarLoop]: trace histogram [1070, 107, 107, 1, 1, 1] [2018-09-26 08:14:16,581 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:16,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash -38094863, now seen corresponding path program 116 times [2018-09-26 08:14:16,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 697854 backedges. 0 proven. 691969 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-09-26 08:14:18,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:18,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:14:18,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:14:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:14:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:14:18,754 INFO L87 Difference]: Start difference. First operand 1288 states and 1395 transitions. Second operand 110 states. [2018-09-26 08:14:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:20,794 INFO L93 Difference]: Finished difference Result 1313 states and 1422 transitions. [2018-09-26 08:14:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:14:20,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 1287 [2018-09-26 08:14:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:20,796 INFO L225 Difference]: With dead ends: 1313 [2018-09-26 08:14:20,796 INFO L226 Difference]: Without dead ends: 1311 [2018-09-26 08:14:20,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:14:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-09-26 08:14:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1300. [2018-09-26 08:14:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-09-26 08:14:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1408 transitions. [2018-09-26 08:14:22,616 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1408 transitions. Word has length 1287 [2018-09-26 08:14:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:22,616 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1408 transitions. [2018-09-26 08:14:22,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:14:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1408 transitions. [2018-09-26 08:14:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-09-26 08:14:22,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:22,625 INFO L375 BasicCegarLoop]: trace histogram [1080, 108, 108, 1, 1, 1] [2018-09-26 08:14:22,625 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1003002427, now seen corresponding path program 117 times [2018-09-26 08:14:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 710964 backedges. 0 proven. 705024 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-09-26 08:14:24,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:24,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:14:24,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:14:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:14:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:14:24,248 INFO L87 Difference]: Start difference. First operand 1300 states and 1408 transitions. Second operand 111 states. [2018-09-26 08:14:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:26,371 INFO L93 Difference]: Finished difference Result 1325 states and 1435 transitions. [2018-09-26 08:14:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:14:26,371 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1299 [2018-09-26 08:14:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:26,372 INFO L225 Difference]: With dead ends: 1325 [2018-09-26 08:14:26,372 INFO L226 Difference]: Without dead ends: 1323 [2018-09-26 08:14:26,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:14:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-26 08:14:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1312. [2018-09-26 08:14:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-09-26 08:14:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1421 transitions. [2018-09-26 08:14:28,228 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1421 transitions. Word has length 1299 [2018-09-26 08:14:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:28,228 INFO L480 AbstractCegarLoop]: Abstraction has 1312 states and 1421 transitions. [2018-09-26 08:14:28,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:14:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1421 transitions. [2018-09-26 08:14:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1312 [2018-09-26 08:14:28,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:28,237 INFO L375 BasicCegarLoop]: trace histogram [1090, 109, 109, 1, 1, 1] [2018-09-26 08:14:28,237 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:28,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1811111301, now seen corresponding path program 118 times [2018-09-26 08:14:28,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 724196 backedges. 0 proven. 718201 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2018-09-26 08:14:30,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:30,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:14:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:14:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:14:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:14:30,183 INFO L87 Difference]: Start difference. First operand 1312 states and 1421 transitions. Second operand 112 states. [2018-09-26 08:14:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:32,343 INFO L93 Difference]: Finished difference Result 1337 states and 1448 transitions. [2018-09-26 08:14:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:14:32,344 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 1311 [2018-09-26 08:14:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:32,345 INFO L225 Difference]: With dead ends: 1337 [2018-09-26 08:14:32,345 INFO L226 Difference]: Without dead ends: 1335 [2018-09-26 08:14:32,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:14:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-09-26 08:14:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1324. [2018-09-26 08:14:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-09-26 08:14:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1434 transitions. [2018-09-26 08:14:34,286 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1434 transitions. Word has length 1311 [2018-09-26 08:14:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:34,287 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1434 transitions. [2018-09-26 08:14:34,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:14:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1434 transitions. [2018-09-26 08:14:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2018-09-26 08:14:34,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:34,297 INFO L375 BasicCegarLoop]: trace histogram [1100, 110, 110, 1, 1, 1] [2018-09-26 08:14:34,297 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:34,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1827766735, now seen corresponding path program 119 times [2018-09-26 08:14:34,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 737550 backedges. 0 proven. 731500 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-09-26 08:14:35,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:35,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:14:35,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:14:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:14:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:14:35,948 INFO L87 Difference]: Start difference. First operand 1324 states and 1434 transitions. Second operand 113 states. [2018-09-26 08:14:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:38,072 INFO L93 Difference]: Finished difference Result 1349 states and 1461 transitions. [2018-09-26 08:14:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:14:38,073 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1323 [2018-09-26 08:14:38,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:38,074 INFO L225 Difference]: With dead ends: 1349 [2018-09-26 08:14:38,074 INFO L226 Difference]: Without dead ends: 1347 [2018-09-26 08:14:38,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:14:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-09-26 08:14:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1336. [2018-09-26 08:14:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2018-09-26 08:14:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1447 transitions. [2018-09-26 08:14:40,030 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1447 transitions. Word has length 1323 [2018-09-26 08:14:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:40,030 INFO L480 AbstractCegarLoop]: Abstraction has 1336 states and 1447 transitions. [2018-09-26 08:14:40,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:14:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1447 transitions. [2018-09-26 08:14:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2018-09-26 08:14:40,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:40,039 INFO L375 BasicCegarLoop]: trace histogram [1110, 111, 111, 1, 1, 1] [2018-09-26 08:14:40,040 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:40,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1069123353, now seen corresponding path program 120 times [2018-09-26 08:14:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 751026 backedges. 0 proven. 744921 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-09-26 08:14:41,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:41,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:14:41,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:14:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:14:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:14:41,714 INFO L87 Difference]: Start difference. First operand 1336 states and 1447 transitions. Second operand 114 states. [2018-09-26 08:14:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:43,813 INFO L93 Difference]: Finished difference Result 1361 states and 1474 transitions. [2018-09-26 08:14:43,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:14:43,813 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 1335 [2018-09-26 08:14:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:43,815 INFO L225 Difference]: With dead ends: 1361 [2018-09-26 08:14:43,815 INFO L226 Difference]: Without dead ends: 1359 [2018-09-26 08:14:43,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:14:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2018-09-26 08:14:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1348. [2018-09-26 08:14:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-09-26 08:14:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1460 transitions. [2018-09-26 08:14:45,787 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1460 transitions. Word has length 1335 [2018-09-26 08:14:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:45,788 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 1460 transitions. [2018-09-26 08:14:45,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:14:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1460 transitions. [2018-09-26 08:14:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2018-09-26 08:14:45,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:45,798 INFO L375 BasicCegarLoop]: trace histogram [1120, 112, 112, 1, 1, 1] [2018-09-26 08:14:45,798 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:45,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1484657309, now seen corresponding path program 121 times [2018-09-26 08:14:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 764624 backedges. 0 proven. 758464 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-09-26 08:14:47,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:47,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:14:47,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:14:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:14:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:14:47,583 INFO L87 Difference]: Start difference. First operand 1348 states and 1460 transitions. Second operand 115 states. [2018-09-26 08:14:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:49,820 INFO L93 Difference]: Finished difference Result 1373 states and 1487 transitions. [2018-09-26 08:14:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:14:49,820 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1347 [2018-09-26 08:14:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:49,822 INFO L225 Difference]: With dead ends: 1373 [2018-09-26 08:14:49,822 INFO L226 Difference]: Without dead ends: 1371 [2018-09-26 08:14:49,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:14:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-09-26 08:14:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1360. [2018-09-26 08:14:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-09-26 08:14:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1473 transitions. [2018-09-26 08:14:51,868 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1473 transitions. Word has length 1347 [2018-09-26 08:14:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:51,869 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1473 transitions. [2018-09-26 08:14:51,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:14:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1473 transitions. [2018-09-26 08:14:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-09-26 08:14:51,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:51,879 INFO L375 BasicCegarLoop]: trace histogram [1130, 113, 113, 1, 1, 1] [2018-09-26 08:14:51,879 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:51,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -910084947, now seen corresponding path program 122 times [2018-09-26 08:14:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 778344 backedges. 0 proven. 772129 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-09-26 08:14:53,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:53,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:14:53,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:14:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:14:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:14:53,697 INFO L87 Difference]: Start difference. First operand 1360 states and 1473 transitions. Second operand 116 states. [2018-09-26 08:14:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:56,144 INFO L93 Difference]: Finished difference Result 1385 states and 1500 transitions. [2018-09-26 08:14:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:14:56,145 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 1359 [2018-09-26 08:14:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:56,146 INFO L225 Difference]: With dead ends: 1385 [2018-09-26 08:14:56,146 INFO L226 Difference]: Without dead ends: 1383 [2018-09-26 08:14:56,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:14:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-09-26 08:14:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1372. [2018-09-26 08:14:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-09-26 08:14:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1486 transitions. [2018-09-26 08:14:58,246 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1486 transitions. Word has length 1359 [2018-09-26 08:14:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:58,246 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1486 transitions. [2018-09-26 08:14:58,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:14:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1486 transitions. [2018-09-26 08:14:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2018-09-26 08:14:58,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:58,256 INFO L375 BasicCegarLoop]: trace histogram [1140, 114, 114, 1, 1, 1] [2018-09-26 08:14:58,256 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:58,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash -835855113, now seen corresponding path program 123 times [2018-09-26 08:14:58,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 792186 backedges. 0 proven. 785916 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-09-26 08:15:00,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:00,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:15:00,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:15:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:15:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:15:00,119 INFO L87 Difference]: Start difference. First operand 1372 states and 1486 transitions. Second operand 117 states. [2018-09-26 08:15:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:02,626 INFO L93 Difference]: Finished difference Result 1397 states and 1513 transitions. [2018-09-26 08:15:02,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:15:02,626 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1371 [2018-09-26 08:15:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:02,628 INFO L225 Difference]: With dead ends: 1397 [2018-09-26 08:15:02,628 INFO L226 Difference]: Without dead ends: 1395 [2018-09-26 08:15:02,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:15:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-09-26 08:15:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1384. [2018-09-26 08:15:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-09-26 08:15:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1499 transitions. [2018-09-26 08:15:04,828 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1499 transitions. Word has length 1371 [2018-09-26 08:15:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:04,829 INFO L480 AbstractCegarLoop]: Abstraction has 1384 states and 1499 transitions. [2018-09-26 08:15:04,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:15:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1499 transitions. [2018-09-26 08:15:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1384 [2018-09-26 08:15:04,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:04,839 INFO L375 BasicCegarLoop]: trace histogram [1150, 115, 115, 1, 1, 1] [2018-09-26 08:15:04,839 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:04,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2126407233, now seen corresponding path program 124 times [2018-09-26 08:15:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:15:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 806150 backedges. 0 proven. 799825 refuted. 0 times theorem prover too weak. 6325 trivial. 0 not checked. [2018-09-26 08:15:06,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:06,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:15:06,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:15:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:15:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:15:06,843 INFO L87 Difference]: Start difference. First operand 1384 states and 1499 transitions. Second operand 118 states. [2018-09-26 08:15:06,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-26 08:15:06,845 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:15:06,852 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:15:06,853 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:15:06 BoogieIcfgContainer [2018-09-26 08:15:06,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:15:06,855 INFO L168 Benchmark]: Toolchain (without parser) took 251439.55 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.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 680.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:15:06,857 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:15:06,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.25 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:15:06,858 INFO L168 Benchmark]: Boogie Preprocessor took 19.85 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:15:06,859 INFO L168 Benchmark]: RCFGBuilder took 259.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 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:15:06,860 INFO L168 Benchmark]: TraceAbstraction took 251108.56 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.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 669.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:15:06,863 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 43.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.85 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 259.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251108.56 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.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 669.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (1384states) and FLOYD_HOARE automaton (currently 2 states, 118 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 251.0s OverallTime, 126 OverallIterations, 1150 TraceHistogramMax, 86.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 510 SDtfs, 13340 SDslu, 9358 SDs, 0 SdLazy, 16291 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6977 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6841 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1384occurred in iteration=125, 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: 77.5s AutomataMinimizationTime, 125 MinimizatonAttempts, 1224 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 80659 NumberOfCodeBlocks, 80659 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 80533 ConstructedInterpolants, 0 QuantifiedInterpolants, 222673283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 126 InterpolantComputations, 2 PerfectInterpolantSequences, 374152/31300116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-15-06-884.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-15-06-884.csv Completed graceful shutdown