java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:48:29,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:48:29,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:48:29,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:48:29,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:48:29,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:48:29,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:48:29,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:48:29,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:48:29,388 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:48:29,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:48:29,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:48:29,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:48:29,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:48:29,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:48:29,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:48:29,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:48:29,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:48:29,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:48:29,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:48:29,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:48:29,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:48:29,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:48:29,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:48:29,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:48:29,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:48:29,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:48:29,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:48:29,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:48:29,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:48:29,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:48:29,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:48:29,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:48:29,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:48:29,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:48:29,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:48:29,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:48:29,444 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:48:29,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:48:29,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:48:29,446 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:48:29,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:48:29,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:48:29,447 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:48:29,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:48:29,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:48:29,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:48:29,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:48:29,507 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:48:29,508 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:48:29,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl [2018-07-25 08:48:29,509 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl' [2018-07-25 08:48:29,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:48:29,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:48:29,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:48:29,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:48:29,564 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:48:29,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:48:29,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:48:29,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:48:29,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:48:29,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:48:29,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:48:29,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:48:29,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:48:29,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/1) ... [2018-07-25 08:48:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:48:29,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:48:29,909 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:48:29,910 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:48:29 BoogieIcfgContainer [2018-07-25 08:48:29,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:48:29,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:48:29,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:48:29,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:48:29,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:48:29" (1/2) ... [2018-07-25 08:48:29,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ae9fbf and model type overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:48:29, skipping insertion in model container [2018-07-25 08:48:29,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:48:29" (2/2) ... [2018-07-25 08:48:29,924 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bpl [2018-07-25 08:48:29,935 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:48:29,944 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:48:29,997 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:48:29,998 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:48:29,999 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:48:29,999 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:48:29,999 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:48:29,999 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:48:30,000 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:48:30,000 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:48:30,000 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:48:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:48:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:48:30,026 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,027 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:48:30,028 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 08:48:30,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,133 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:48:30,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:48:30,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:48:30,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:48:30,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:48:30,153 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:48:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,192 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 08:48:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:48:30,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 08:48:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,205 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:48:30,206 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:48:30,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:48:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:48:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:48:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:48:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:48:30,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:48:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,248 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:48:30,248 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:48:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:48:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:48:30,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,249 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:48:30,249 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 08:48:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:30,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:48:30,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:48:30,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:48:30,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:48:30,304 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 08:48:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,339 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:48:30,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:48:30,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 08:48:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,341 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:48:30,341 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:48:30,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:48:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:48:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:48:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:48:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:48:30,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:48:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,347 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:48:30,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:48:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:48:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:48:30,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,348 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:48:30,348 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 08:48:30,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:30,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:48:30,396 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:48:30,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:48:30,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:48:30,397 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 08:48:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,434 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:48:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:48:30,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 08:48:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,436 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:48:30,436 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:48:30,437 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:48:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:48:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:48:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:48:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:48:30,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:48:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,442 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:48:30,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:48:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:48:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:48:30,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,443 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:48:30,443 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 08:48:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:30,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:48:30,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:48:30,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:48:30,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:48:30,502 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 08:48:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,578 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:48:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:48:30,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 08:48:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,583 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:48:30,583 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:48:30,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:48:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:48:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:48:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:48:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:48:30,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:48:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,589 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:48:30,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:48:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:48:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:48:30,590 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,590 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:48:30,591 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 08:48:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:30,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:48:30,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:48:30,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:48:30,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:48:30,648 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 08:48:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,727 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:48:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:48:30,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:48:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,729 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:48:30,729 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:48:30,729 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:48:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:48:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:48:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:48:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:48:30,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:48:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,736 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:48:30,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:48:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:48:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:48:30,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,737 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:48:30,737 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 08:48:30,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:30,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:30,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:48:30,791 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:48:30,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:48:30,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:48:30,792 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 08:48:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:30,886 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:48:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:48:30,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:48:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:30,892 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:48:30,893 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:48:30,895 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:48:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:48:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:48:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:48:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:48:30,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:48:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:30,908 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:48:30,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:48:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:48:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:48:30,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:30,909 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:48:30,910 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 08:48:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,014 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:48:31,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:48:31,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:48:31,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:48:31,022 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 08:48:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,095 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:48:31,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:48:31,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:48:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,100 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:48:31,100 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:48:31,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:48:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:48:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:48:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:48:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:48:31,116 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:48:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,116 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:48:31,117 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:48:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:48:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:48:31,117 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,118 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:48:31,118 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 08:48:31,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:48:31,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:48:31,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:48:31,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:48:31,211 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 08:48:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,295 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:48:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:48:31,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:48:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,298 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:48:31,298 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:48:31,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:48:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:48:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:48:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:48:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:48:31,310 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:48:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,310 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:48:31,310 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:48:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:48:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:48:31,311 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,312 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:48:31,312 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 08:48:31,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:48:31,377 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:48:31,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:48:31,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:48:31,378 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 08:48:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,428 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:48:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:48:31,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:48:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,429 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:48:31,430 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:48:31,432 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:48:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:48:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:48:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:48:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:48:31,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:48:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,442 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:48:31,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:48:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:48:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:48:31,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,444 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:48:31,446 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 08:48:31,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:48:31,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:48:31,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:48:31,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:48:31,515 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 08:48:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,565 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:48:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:48:31,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 08:48:31,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,566 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:48:31,566 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:48:31,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:48:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:48:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:48:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:48:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:48:31,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 08:48:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,575 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:48:31,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:48:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:48:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:48:31,576 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,577 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 08:48:31,577 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 08:48:31,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:48:31,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:48:31,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:48:31,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:48:31,667 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 08:48:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,747 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:48:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:48:31,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 08:48:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,749 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:48:31,749 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:48:31,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:48:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:48:31,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:48:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:48:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:48:31,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 08:48:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,762 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:48:31,763 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:48:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:48:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:48:31,764 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,764 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 08:48:31,764 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 08:48:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:31,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:31,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:48:31,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:48:31,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:48:31,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:48:31,849 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 08:48:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,914 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:48:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:48:31,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 08:48:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,917 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:48:31,917 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:48:31,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:48:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:48:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:48:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:48:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:48:31,925 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 08:48:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,926 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:48:31,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:48:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:48:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:48:31,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,927 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 08:48:31,927 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 08:48:31,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:32,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:32,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:48:32,013 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:48:32,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:48:32,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:48:32,014 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 08:48:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:32,095 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:48:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:48:32,096 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 08:48:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:32,097 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:48:32,097 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:48:32,098 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:48:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:48:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:48:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:48:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:48:32,107 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 08:48:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:32,107 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:48:32,107 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:48:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:48:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:48:32,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:32,108 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 08:48:32,109 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 08:48:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:32,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:32,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:48:32,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:48:32,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:48:32,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:48:32,190 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 08:48:32,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:32,269 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:48:32,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:48:32,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 08:48:32,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:32,273 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:48:32,273 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:48:32,274 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:48:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:48:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:48:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:48:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:48:32,284 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 08:48:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:32,285 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:48:32,285 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:48:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:48:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:48:32,287 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:32,287 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 08:48:32,287 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 08:48:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:32,400 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:32,400 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:48:32,400 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:48:32,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:48:32,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:48:32,403 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 08:48:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:32,495 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:48:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:48:32,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 08:48:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:32,497 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:48:32,497 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:48:32,498 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:48:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:48:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:48:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:48:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:48:32,506 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 08:48:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:32,506 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:48:32,507 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:48:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:48:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:48:32,508 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:32,508 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 08:48:32,508 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 08:48:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:32,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:32,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:48:32,618 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:48:32,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:48:32,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:48:32,619 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 08:48:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:32,721 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:48:32,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:48:32,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 08:48:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:32,722 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:48:32,722 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:48:32,723 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:48:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:48:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:48:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:48:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:48:32,730 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 08:48:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:32,730 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:48:32,730 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:48:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:48:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:48:32,732 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:32,732 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 08:48:32,733 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 08:48:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:32,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:32,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:48:32,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:48:32,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:48:32,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:48:32,853 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 08:48:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:32,951 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:48:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:48:32,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 08:48:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:32,954 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:48:32,954 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:48:32,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:48:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:48:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:48:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:48:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:48:32,966 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 08:48:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:32,966 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:48:32,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:48:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:48:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:48:32,969 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:32,969 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 08:48:32,969 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 08:48:32,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:33,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:33,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:48:33,086 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:48:33,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:48:33,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:48:33,087 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 08:48:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:33,206 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:48:33,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:48:33,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 08:48:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:33,211 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:48:33,211 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:48:33,212 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:48:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:48:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:48:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:48:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:48:33,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 08:48:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:33,221 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:48:33,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:48:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:48:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:48:33,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:33,226 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 08:48:33,226 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 08:48:33,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:33,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:33,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:48:33,357 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:48:33,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:48:33,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:48:33,358 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 08:48:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:33,485 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:48:33,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:48:33,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 08:48:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:33,486 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:48:33,487 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:48:33,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:48:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:48:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:48:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:48:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:48:33,504 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 08:48:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:33,504 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:48:33,504 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:48:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:48:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:48:33,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:33,506 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 08:48:33,506 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 08:48:33,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:33,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:33,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:48:33,639 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:48:33,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:48:33,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:48:33,640 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 08:48:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:33,769 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:48:33,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:48:33,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 08:48:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:33,770 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:48:33,771 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:48:33,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:48:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:48:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:48:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:48:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:48:33,778 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 08:48:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:33,778 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:48:33,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:48:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:48:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:48:33,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:33,779 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 08:48:33,780 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 08:48:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:33,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:33,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:48:33,912 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:48:33,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:48:33,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:48:33,913 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 08:48:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:34,084 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:48:34,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:48:34,085 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 08:48:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:34,091 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:48:34,092 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:48:34,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:48:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:48:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:48:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:48:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:48:34,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 08:48:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:34,102 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:48:34,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:48:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:48:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:48:34,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:34,103 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 08:48:34,103 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 08:48:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:34,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:34,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:48:34,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:48:34,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:48:34,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:48:34,269 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 08:48:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:34,400 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:48:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:48:34,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 08:48:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:34,402 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:48:34,402 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:48:34,402 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:48:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:48:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:48:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:48:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:48:34,410 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 08:48:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:34,411 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:48:34,411 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:48:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:48:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:48:34,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:34,413 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 08:48:34,413 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 08:48:34,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:34,560 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:34,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:48:34,561 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:48:34,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:48:34,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:48:34,562 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 08:48:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:34,687 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:48:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:48:34,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 08:48:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:34,688 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:48:34,688 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:48:34,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:48:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:48:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:48:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:48:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:48:34,699 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 08:48:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:34,699 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:48:34,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:48:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:48:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:48:34,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:34,700 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 08:48:34,700 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 08:48:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:34,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:34,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:48:34,844 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:48:34,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:48:34,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:48:34,845 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 08:48:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:34,987 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:48:34,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:48:34,989 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 08:48:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:34,990 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:48:34,990 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:48:34,990 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:48:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:48:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:48:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:48:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:48:34,996 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 08:48:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:34,996 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:48:34,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:48:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:48:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:48:34,997 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:34,997 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 08:48:34,997 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 08:48:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:35,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:35,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:48:35,135 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:48:35,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:48:35,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:48:35,136 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 08:48:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:35,296 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:48:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:48:35,296 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 08:48:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:35,297 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:48:35,297 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:48:35,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:48:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:48:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:48:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:48:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:48:35,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 08:48:35,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:35,312 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:48:35,312 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:48:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:48:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:48:35,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:35,315 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 08:48:35,315 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:35,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 08:48:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:35,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:35,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:48:35,479 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:48:35,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:48:35,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:48:35,481 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 08:48:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:35,646 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:48:35,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:48:35,647 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 08:48:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:35,647 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:48:35,647 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:48:35,648 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:48:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:48:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:48:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:48:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:48:35,653 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 08:48:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:35,654 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:48:35,654 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:48:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:48:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:48:35,655 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:35,655 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 08:48:35,655 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 08:48:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:35,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:35,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:48:35,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:48:35,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:48:35,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:48:35,828 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 08:48:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:35,999 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:48:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:48:35,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 08:48:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:36,000 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:48:36,000 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:48:36,001 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:48:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:48:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:48:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:48:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:48:36,006 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 08:48:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:36,006 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:48:36,007 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:48:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:48:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:48:36,007 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:36,007 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 08:48:36,008 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 08:48:36,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:36,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:36,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:48:36,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:48:36,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:48:36,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:48:36,205 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 08:48:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:36,394 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:48:36,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:48:36,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 08:48:36,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:36,395 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:48:36,395 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:48:36,396 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:48:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:48:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:48:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:48:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:48:36,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 08:48:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:36,402 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:48:36,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:48:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:48:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:48:36,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:36,403 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 08:48:36,403 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 08:48:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:36,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:36,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:48:36,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:48:36,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:48:36,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:48:36,607 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 08:48:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:36,825 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:48:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:48:36,825 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 08:48:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:36,826 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:48:36,826 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:48:36,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:48:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:48:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:48:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:48:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:48:36,837 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 08:48:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:36,838 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:48:36,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:48:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:48:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:48:36,839 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:36,839 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 08:48:36,839 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 08:48:36,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:37,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:37,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:48:37,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:48:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:48:37,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:48:37,077 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 08:48:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:37,268 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:48:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:48:37,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 08:48:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:37,269 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:48:37,269 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:48:37,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:48:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:48:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:48:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:48:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:48:37,276 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 08:48:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:37,278 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:48:37,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:48:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:48:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:48:37,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:37,279 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 08:48:37,280 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 08:48:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:37,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:37,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:48:37,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:48:37,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:48:37,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:48:37,485 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 08:48:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:37,709 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:48:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:48:37,709 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 08:48:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:37,710 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:48:37,711 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:48:37,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:48:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:48:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:48:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:48:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:48:37,718 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 08:48:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:37,718 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:48:37,718 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:48:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:48:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:48:37,719 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:37,719 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 08:48:37,719 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 08:48:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:37,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:37,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:48:37,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:48:37,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:48:37,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:48:37,923 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 08:48:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:38,141 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:48:38,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:48:38,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 08:48:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:38,142 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:48:38,142 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:48:38,143 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:48:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:48:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:48:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:48:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:48:38,148 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 08:48:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:38,148 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:48:38,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:48:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:48:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:48:38,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:38,149 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 08:48:38,150 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 08:48:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:38,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:38,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:48:38,357 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:48:38,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:48:38,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:48:38,359 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 08:48:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:38,575 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:48:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:48:38,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 08:48:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:38,576 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:48:38,576 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:48:38,577 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:48:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:48:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:48:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:48:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:48:38,582 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 08:48:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:38,583 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:48:38,583 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:48:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:48:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:48:38,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:38,584 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 08:48:38,584 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 08:48:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:38,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:38,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:48:38,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:48:38,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:48:38,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:48:38,781 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 08:48:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:39,004 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:48:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:48:39,004 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 08:48:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:39,005 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:48:39,005 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:48:39,006 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:48:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:48:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:48:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:48:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:48:39,011 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 08:48:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:39,011 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:48:39,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:48:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:48:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:48:39,012 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:39,012 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 08:48:39,013 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 08:48:39,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:39,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:39,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:48:39,233 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:48:39,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:48:39,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:48:39,235 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 08:48:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:39,469 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:48:39,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:48:39,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 08:48:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:39,470 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:48:39,471 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:48:39,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:48:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:48:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:48:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:48:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:48:39,477 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 08:48:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:39,477 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:48:39,477 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:48:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:48:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:48:39,478 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:39,478 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 08:48:39,478 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 08:48:39,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:39,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:39,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:48:39,734 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:48:39,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:48:39,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:48:39,735 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 08:48:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:40,017 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:48:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:48:40,018 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 08:48:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:40,019 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:48:40,019 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:48:40,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:48:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:48:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:48:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:48:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:48:40,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 08:48:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:40,027 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:48:40,027 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:48:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:48:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:48:40,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:40,028 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 08:48:40,029 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 08:48:40,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:40,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:40,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:48:40,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:48:40,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:48:40,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:48:40,287 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 08:48:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:40,540 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:48:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:48:40,540 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 08:48:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:40,541 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:48:40,541 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:48:40,543 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:48:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:48:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:48:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:48:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:48:40,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 08:48:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:40,549 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:48:40,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:48:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:48:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:48:40,550 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:40,550 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 08:48:40,550 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 08:48:40,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:40,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:40,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:48:40,777 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:48:40,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:48:40,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:48:40,779 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 08:48:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:41,043 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:48:41,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:48:41,043 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 08:48:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:41,044 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:48:41,044 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:48:41,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:48:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:48:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:48:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:48:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:48:41,052 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 08:48:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:41,052 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:48:41,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:48:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:48:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:48:41,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:41,053 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 08:48:41,053 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 08:48:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:41,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:41,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:48:41,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:48:41,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:48:41,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:48:41,291 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 08:48:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:41,563 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:48:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:48:41,564 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 08:48:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:41,564 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:48:41,565 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:48:41,566 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:48:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:48:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:48:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:48:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:48:41,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 08:48:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:41,573 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:48:41,573 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:48:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:48:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:48:41,574 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:41,574 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 08:48:41,574 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 08:48:41,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:41,818 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:41,818 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:48:41,819 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:48:41,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:48:41,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:48:41,820 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 08:48:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:42,105 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:48:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:48:42,105 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 08:48:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:42,106 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:48:42,106 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:48:42,107 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:48:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:48:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:48:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:48:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:48:42,114 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 08:48:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:42,114 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:48:42,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:48:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:48:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:48:42,115 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:42,115 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 08:48:42,115 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 08:48:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:42,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:42,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:48:42,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:48:42,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:48:42,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:48:42,370 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 08:48:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:42,666 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:48:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:48:42,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 08:48:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:42,668 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:48:42,668 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:48:42,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:48:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:48:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:48:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:48:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:48:42,675 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 08:48:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:42,675 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:48:42,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:48:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:48:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:48:42,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:42,677 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 08:48:42,677 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 08:48:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:42,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:42,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:48:42,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:48:42,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:48:42,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:48:42,993 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 08:48:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:43,338 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:48:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:48:43,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 08:48:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:43,339 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:48:43,339 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:48:43,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:48:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:48:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:48:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:48:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:48:43,349 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 08:48:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:43,349 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:48:43,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:48:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:48:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:48:43,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:43,351 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 08:48:43,351 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 08:48:43,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:43,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:43,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:48:43,679 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:48:43,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:48:43,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:48:43,680 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 08:48:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:43,982 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:48:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:48:43,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 08:48:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:43,984 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:48:43,984 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:48:43,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:48:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:48:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:48:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:48:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:48:43,992 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 08:48:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:43,992 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:48:43,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:48:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:48:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:48:43,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:43,993 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 08:48:43,994 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 08:48:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:44,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:44,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:48:44,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:48:44,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:48:44,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:48:44,261 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 08:48:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:44,571 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:48:44,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:48:44,572 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 08:48:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:44,573 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:48:44,573 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:48:44,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:48:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:48:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:48:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:48:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:48:44,580 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 08:48:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:44,580 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:48:44,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:48:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:48:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:48:44,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:44,581 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 08:48:44,582 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 08:48:44,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:44,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:44,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:48:44,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:48:44,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:48:44,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:48:44,851 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 08:48:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:45,167 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:48:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:48:45,167 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 08:48:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:45,168 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:48:45,169 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:48:45,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:48:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:48:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:48:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:48:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:48:45,177 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 08:48:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:45,177 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:48:45,177 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:48:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:48:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:48:45,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:45,178 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 08:48:45,179 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 08:48:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:45,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:45,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:48:45,451 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:48:45,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:48:45,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:48:45,452 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 08:48:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:45,781 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:48:45,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:48:45,782 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 08:48:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:45,783 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:48:45,783 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:48:45,784 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:48:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:48:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:48:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:48:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:48:45,791 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 08:48:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:45,791 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:48:45,791 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:48:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:48:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:48:45,792 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:45,793 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 08:48:45,793 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 08:48:45,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:46,070 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:46,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:48:46,070 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:48:46,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:48:46,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:48:46,071 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 08:48:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:46,397 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:48:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:48:46,398 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 08:48:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:46,399 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:48:46,399 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:48:46,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:48:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:48:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:48:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:48:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:48:46,407 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 08:48:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:46,407 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:48:46,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:48:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:48:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:48:46,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:46,409 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 08:48:46,409 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 08:48:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:46,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:46,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:48:46,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:48:46,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:48:46,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:48:46,698 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 08:48:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:47,026 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:48:47,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:48:47,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 08:48:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:47,027 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:48:47,027 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:48:47,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:48:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:48:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:48:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:48:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:48:47,037 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 08:48:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:47,037 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:48:47,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:48:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:48:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:48:47,038 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:47,039 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 08:48:47,039 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 08:48:47,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:47,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:47,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:48:47,307 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:48:47,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:48:47,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:48:47,308 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 08:48:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:47,650 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:48:47,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:48:47,651 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 08:48:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:47,652 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:48:47,652 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:48:47,653 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:48:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:48:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:48:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:48:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:48:47,659 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 08:48:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:47,660 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:48:47,660 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:48:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:48:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:48:47,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:47,661 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 08:48:47,661 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 08:48:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:47,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:47,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:48:47,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:48:47,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:48:47,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:48:47,943 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 08:48:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:48,296 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:48:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:48:48,296 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 08:48:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:48,297 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:48:48,297 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:48:48,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:48:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:48:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:48:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:48:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:48:48,305 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 08:48:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:48,306 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:48:48,306 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:48:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:48:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:48:48,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:48,307 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 08:48:48,307 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 08:48:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:48,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:48,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:48:48,600 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:48:48,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:48:48,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:48:48,601 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 08:48:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:48,955 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:48:48,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:48:48,955 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 08:48:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:48,956 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:48:48,956 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:48:48,957 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:48:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:48:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:48:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:48:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:48:48,966 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 08:48:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:48,966 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:48:48,966 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:48:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:48:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:48:48,967 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:48,967 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 08:48:48,968 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 08:48:48,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:49,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:49,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:48:49,308 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:48:49,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:48:49,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:48:49,309 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 08:48:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:49,727 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:48:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:48:49,727 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 08:48:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:49,728 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:48:49,728 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:48:49,729 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:48:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:48:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:48:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:48:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:48:49,737 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 08:48:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:49,738 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:48:49,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:48:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:48:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:48:49,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:49,739 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 08:48:49,739 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 08:48:49,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:50,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:50,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:48:50,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:48:50,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:48:50,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:48:50,028 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 08:48:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:50,374 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:48:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:48:50,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 08:48:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:50,375 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:48:50,375 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:48:50,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:48:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:48:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:48:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:48:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:48:50,383 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 08:48:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:50,383 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:48:50,383 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:48:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:48:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:48:50,384 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:50,385 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 08:48:50,385 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 08:48:50,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:50,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:50,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:48:50,679 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:48:50,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:48:50,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:48:50,680 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 08:48:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:51,034 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:48:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:48:51,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 08:48:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:51,035 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:48:51,035 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:48:51,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:48:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:48:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:48:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:48:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:48:51,044 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 08:48:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:51,044 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:48:51,044 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:48:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:48:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:48:51,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:51,045 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 08:48:51,046 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 08:48:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:51,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:51,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:48:51,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:48:51,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:48:51,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:48:51,354 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 08:48:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:51,713 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:48:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:48:51,714 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 08:48:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:51,715 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:48:51,715 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:48:51,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:48:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:48:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:48:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:48:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:48:51,725 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 08:48:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:51,726 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:48:51,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:48:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:48:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:48:51,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:51,727 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 08:48:51,728 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 08:48:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:52,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:52,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:48:52,055 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:48:52,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:48:52,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:48:52,056 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 08:48:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:52,431 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:48:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:48:52,431 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 08:48:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:52,432 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:48:52,432 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:48:52,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:48:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:48:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:48:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:48:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:48:52,441 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 08:48:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:52,441 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:48:52,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:48:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:48:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:48:52,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:52,443 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 08:48:52,443 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 08:48:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:52,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:52,769 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:48:52,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:48:52,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:48:52,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:48:52,771 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 08:48:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:53,158 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:48:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:48:53,158 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 08:48:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:53,159 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:48:53,159 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:48:53,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:48:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:48:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:48:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:48:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:48:53,167 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 08:48:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:53,167 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:48:53,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:48:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:48:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:48:53,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:53,169 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 08:48:53,169 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 08:48:53,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:53,491 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:53,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:48:53,492 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:48:53,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:48:53,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:48:53,493 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 08:48:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:53,888 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:48:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:48:53,888 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 08:48:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:53,889 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:48:53,889 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:48:53,890 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:48:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:48:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:48:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:48:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:48:53,896 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 08:48:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:53,897 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:48:53,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:48:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:48:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:48:53,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:53,898 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 08:48:53,898 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:53,899 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 08:48:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:54,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:54,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:48:54,244 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:48:54,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:48:54,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:48:54,245 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 08:48:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:54,656 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:48:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:48:54,656 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 08:48:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:54,657 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:48:54,657 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:48:54,658 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:48:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:48:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:48:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:48:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:48:54,665 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 08:48:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:54,665 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:48:54,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:48:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:48:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:48:54,666 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:54,666 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 08:48:54,667 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 08:48:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:55,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:55,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:48:55,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:48:55,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:48:55,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:48:55,018 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 08:48:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:55,494 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:48:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:48:55,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 08:48:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:55,495 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:48:55,495 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:48:55,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:48:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:48:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:48:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:48:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:48:55,507 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 08:48:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:55,508 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:48:55,508 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:48:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:48:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:48:55,509 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:55,509 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 08:48:55,509 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 08:48:55,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:55,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:55,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:48:55,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:48:55,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:48:55,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:48:55,898 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 08:48:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:56,203 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:48:56,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:48:56,204 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 08:48:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:56,205 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:48:56,205 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:48:56,206 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:48:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:48:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:48:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:48:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:48:56,213 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 08:48:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:56,214 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:48:56,214 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:48:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:48:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:48:56,215 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:56,215 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 08:48:56,215 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 08:48:56,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:56,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:56,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:48:56,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:48:56,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:48:56,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:48:56,567 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 08:48:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:56,984 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:48:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:48:56,984 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 08:48:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:56,985 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:48:56,985 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:48:56,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:48:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:48:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:48:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:48:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:48:56,993 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 08:48:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:56,993 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:48:56,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:48:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:48:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:48:56,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:56,996 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 08:48:56,997 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 08:48:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:57,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:57,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:48:57,359 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:48:57,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:48:57,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:48:57,361 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 08:48:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:57,725 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:48:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:48:57,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 08:48:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:57,727 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:48:57,727 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:48:57,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:48:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:48:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:48:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:48:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:48:57,735 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 08:48:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:57,735 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:48:57,735 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:48:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:48:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:48:57,736 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:57,736 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 08:48:57,736 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 08:48:57,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:58,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:58,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:48:58,110 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:48:58,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:48:58,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:48:58,115 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 08:48:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:58,545 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:48:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:48:58,545 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 08:48:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:58,546 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:48:58,546 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:48:58,547 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:48:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:48:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:48:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:48:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:48:58,554 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 08:48:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:58,554 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:48:58,554 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:48:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:48:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:48:58,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:58,555 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 08:48:58,555 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 08:48:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:58,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:58,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:48:58,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:48:58,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:48:58,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:48:58,878 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 08:48:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:59,194 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:48:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:48:59,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 08:48:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:59,195 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:48:59,195 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:48:59,196 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:48:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:48:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:48:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:48:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:48:59,203 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 08:48:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:59,203 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:48:59,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:48:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:48:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:48:59,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:59,204 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 08:48:59,205 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 08:48:59,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:48:59,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:59,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:48:59,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:48:59,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:48:59,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:48:59,575 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 08:48:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:59,895 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:48:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:48:59,895 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 08:48:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:59,896 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:48:59,897 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:48:59,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:48:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:48:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:48:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:48:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:48:59,904 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 08:48:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:59,904 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:48:59,905 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:48:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:48:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:48:59,905 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:59,905 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 08:48:59,906 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 08:48:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:00,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:00,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:49:00,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:49:00,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:49:00,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:49:00,354 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 08:49:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:00,901 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:49:00,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:49:00,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 08:49:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:00,903 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:49:00,903 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:49:00,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:49:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:49:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:49:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:49:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:49:00,914 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 08:49:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:00,914 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:49:00,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:49:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:49:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:49:00,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:00,915 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 08:49:00,916 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 08:49:00,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:01,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:01,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:49:01,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:49:01,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:49:01,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:49:01,481 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 08:49:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:01,846 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:49:01,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:49:01,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 08:49:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:01,847 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:49:01,847 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:49:01,848 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:49:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:49:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:49:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:49:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:49:01,855 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 08:49:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:01,856 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:49:01,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:49:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:49:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:49:01,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:01,857 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 08:49:01,857 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 08:49:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:02,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:02,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:49:02,300 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:49:02,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:49:02,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:49:02,301 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 08:49:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:02,732 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:49:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:49:02,732 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 08:49:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:02,733 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:49:02,733 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:49:02,734 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:49:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:49:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:49:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:49:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:49:02,741 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 08:49:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:02,742 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:49:02,742 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:49:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:49:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:49:02,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:02,743 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 08:49:02,743 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 08:49:02,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:03,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:03,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:49:03,175 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:49:03,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:49:03,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:49:03,176 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 08:49:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:03,668 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:49:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:49:03,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 08:49:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:03,669 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:49:03,669 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:49:03,670 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:49:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:49:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:49:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:49:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:49:03,677 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 08:49:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:03,678 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:49:03,678 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:49:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:49:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:49:03,678 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:03,679 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 08:49:03,679 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 08:49:03,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:04,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:04,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:49:04,017 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:49:04,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:49:04,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:49:04,017 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 08:49:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:04,397 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:49:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:49:04,398 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 08:49:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:04,399 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:49:04,399 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:49:04,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:49:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:49:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:49:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:49:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:49:04,407 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 08:49:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:04,407 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:49:04,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:49:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:49:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:49:04,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:04,409 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 08:49:04,409 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 08:49:04,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:04,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:04,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:49:04,766 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:49:04,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:49:04,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:49:04,767 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 08:49:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:05,181 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:49:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:49:05,182 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 08:49:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:05,183 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:49:05,183 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:49:05,184 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:49:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:49:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:49:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:49:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:49:05,191 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 08:49:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:05,192 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:49:05,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:49:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:49:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:49:05,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:05,193 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 08:49:05,193 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 08:49:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:05,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:05,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:49:05,620 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:49:05,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:49:05,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:49:05,621 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 08:49:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:06,007 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:49:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:49:06,007 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 08:49:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:06,008 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:49:06,008 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:49:06,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:49:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:49:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:49:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:49:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:49:06,015 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 08:49:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:06,015 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:49:06,015 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:49:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:49:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:49:06,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:06,016 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 08:49:06,016 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 08:49:06,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:06,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:06,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:49:06,369 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:49:06,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:49:06,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:49:06,369 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 08:49:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:06,768 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:49:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:49:06,769 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 08:49:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:06,770 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:49:06,770 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:49:06,770 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:49:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:49:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:49:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:49:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:49:06,778 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 08:49:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:06,778 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:49:06,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:49:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:49:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:49:06,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:06,779 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 08:49:06,779 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 08:49:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:07,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:07,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:49:07,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:49:07,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:49:07,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:49:07,232 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 08:49:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:07,640 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:49:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:49:07,641 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 08:49:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:07,642 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:49:07,642 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:49:07,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:49:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:49:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:49:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:49:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:49:07,650 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 08:49:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:07,651 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:49:07,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:49:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:49:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:49:07,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:07,652 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 08:49:07,652 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 08:49:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:08,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:08,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:49:08,023 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:49:08,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:49:08,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:49:08,024 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 08:49:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:08,447 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:49:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:49:08,447 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 08:49:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:08,448 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:49:08,448 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:49:08,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:49:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:49:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:49:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:49:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:49:08,457 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 08:49:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:08,458 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:49:08,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:49:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:49:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:49:08,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:08,459 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 08:49:08,459 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 08:49:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:08,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:08,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:49:08,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:49:08,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:49:08,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:49:08,839 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 08:49:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:09,261 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:49:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:49:09,261 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 08:49:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:09,263 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:49:09,263 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:49:09,263 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:49:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:49:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:49:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:49:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:49:09,272 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 08:49:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:09,272 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:49:09,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:49:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:49:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:49:09,273 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:09,274 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 08:49:09,274 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:09,274 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 08:49:09,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:09,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:09,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:49:09,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:49:09,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:49:09,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:49:09,674 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 08:49:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:10,097 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:49:10,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:49:10,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 08:49:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:10,099 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:49:10,099 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:49:10,100 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:49:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:49:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:49:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:49:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:49:10,108 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 08:49:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:10,109 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:49:10,109 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:49:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:49:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:49:10,110 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:10,110 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 08:49:10,110 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:10,111 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 08:49:10,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:10,560 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:10,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:49:10,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:49:10,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:49:10,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:49:10,561 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 08:49:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:11,003 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:49:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:49:11,003 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 08:49:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:11,004 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:49:11,004 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:49:11,005 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:49:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:49:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:49:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:49:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:49:11,013 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 08:49:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:11,013 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:49:11,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:49:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:49:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:49:11,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:11,014 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 08:49:11,015 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 08:49:11,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:11,423 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:11,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:49:11,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:49:11,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:49:11,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:49:11,425 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 08:49:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:11,894 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:49:11,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:49:11,895 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 08:49:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:11,896 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:49:11,896 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:49:11,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:49:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:49:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:49:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:49:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:49:11,905 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 08:49:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:11,906 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:49:11,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:49:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:49:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:49:11,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:11,907 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 08:49:11,908 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 08:49:11,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:12,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:12,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:49:12,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:49:12,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:49:12,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:49:12,454 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 08:49:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:12,955 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:49:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:49:12,955 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 08:49:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:12,957 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:49:12,957 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:49:12,957 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:49:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:49:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:49:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:49:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:49:12,966 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 08:49:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:12,967 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:49:12,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:49:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:49:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:49:12,968 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:12,968 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 08:49:12,969 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 08:49:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:13,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:13,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:49:13,595 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:49:13,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:49:13,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:49:13,597 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 08:49:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:14,178 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:49:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:49:14,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 08:49:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:14,180 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:49:14,180 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:49:14,181 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:49:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:49:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:49:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:49:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:49:14,190 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 08:49:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:14,190 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:49:14,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:49:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:49:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:49:14,191 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:14,192 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 08:49:14,192 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 08:49:14,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:14,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:14,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:49:14,662 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:49:14,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:49:14,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:49:14,662 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 08:49:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:15,161 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:49:15,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:49:15,162 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 08:49:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:15,163 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:49:15,163 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:49:15,164 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:49:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:49:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:49:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:49:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:49:15,172 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 08:49:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:15,173 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:49:15,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:49:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:49:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:49:15,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:15,174 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 08:49:15,174 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 08:49:15,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:15,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:15,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:49:15,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:49:15,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:49:15,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:49:15,644 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 08:49:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:16,125 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:49:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:49:16,125 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 08:49:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:16,126 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:49:16,126 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:49:16,126 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:49:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:49:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:49:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:49:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:49:16,135 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 08:49:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:16,135 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:49:16,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:49:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:49:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:49:16,136 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:16,136 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 08:49:16,137 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 08:49:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:16,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:16,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:49:16,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:49:16,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:49:16,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:49:16,572 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 08:49:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:17,227 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:49:17,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:49:17,227 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 08:49:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:17,229 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:49:17,229 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:49:17,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:49:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:49:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:49:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:49:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:49:17,240 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 08:49:17,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:17,241 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:49:17,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:49:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:49:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:49:17,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:17,242 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 08:49:17,242 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 08:49:17,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:17,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:17,747 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:49:17,747 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:49:17,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:49:17,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:49:17,748 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 08:49:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:18,281 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:49:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:49:18,282 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 08:49:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:18,283 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:49:18,283 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:49:18,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:49:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:49:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:49:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:49:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:49:18,294 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 08:49:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:18,295 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:49:18,295 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:49:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:49:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:49:18,296 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:18,296 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 08:49:18,296 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 08:49:18,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:19,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:19,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:49:19,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:49:19,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:49:19,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:49:19,122 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 08:49:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:19,611 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:49:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:49:19,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 08:49:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:19,612 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:49:19,612 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:49:19,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:49:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:49:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:49:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:49:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:49:19,621 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 08:49:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:19,622 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:49:19,622 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:49:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:49:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:49:19,623 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:19,623 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 08:49:19,623 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:19,623 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 08:49:19,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:20,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:20,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:49:20,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:49:20,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:49:20,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:49:20,099 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 08:49:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:20,636 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:49:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:49:20,636 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 08:49:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:20,637 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:49:20,637 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:49:20,638 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:49:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:49:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:49:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:49:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:49:20,647 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 08:49:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:20,648 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:49:20,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:49:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:49:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:49:20,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:20,649 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 08:49:20,649 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 08:49:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:21,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:21,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:49:21,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:49:21,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:49:21,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:49:21,123 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 08:49:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:21,717 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:49:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:49:21,717 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 08:49:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:21,718 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:49:21,718 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:49:21,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:49:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:49:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:49:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:49:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:49:21,728 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 08:49:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:21,729 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:49:21,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:49:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:49:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:49:21,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:21,730 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 08:49:21,730 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 08:49:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:22,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:22,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:49:22,276 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:49:22,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:49:22,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:49:22,277 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 08:49:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:22,828 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 08:49:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:49:22,828 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 08:49:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:22,829 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:49:22,829 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:49:22,830 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:49:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:49:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:49:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:49:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:49:22,838 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 08:49:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:22,839 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:49:22,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:49:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:49:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:49:22,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:22,840 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 08:49:22,840 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:22,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 08:49:22,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:23,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:23,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:49:23,343 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:49:23,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:49:23,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:49:23,344 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 08:49:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:23,864 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 08:49:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:49:23,864 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 08:49:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:23,865 INFO L225 Difference]: With dead ends: 189 [2018-07-25 08:49:23,865 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 08:49:23,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:49:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 08:49:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 08:49:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 08:49:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 08:49:23,876 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 08:49:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:23,876 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 08:49:23,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:49:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 08:49:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 08:49:23,877 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:23,878 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 08:49:23,878 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 08:49:23,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:24,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:24,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:49:24,443 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:49:24,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:49:24,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:49:24,443 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 08:49:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:25,034 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 08:49:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:49:25,035 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 08:49:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:25,036 INFO L225 Difference]: With dead ends: 191 [2018-07-25 08:49:25,036 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 08:49:25,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:49:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 08:49:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 08:49:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 08:49:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 08:49:25,045 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 08:49:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:25,046 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 08:49:25,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:49:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 08:49:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 08:49:25,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:25,047 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 08:49:25,047 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-25 08:49:25,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:25,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:25,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:49:25,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:49:25,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:49:25,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:49:25,645 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 08:49:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:26,239 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 08:49:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:49:26,239 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 08:49:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:26,240 INFO L225 Difference]: With dead ends: 193 [2018-07-25 08:49:26,240 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 08:49:26,241 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:49:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 08:49:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 08:49:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 08:49:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 08:49:26,247 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 08:49:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:26,247 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 08:49:26,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:49:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 08:49:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 08:49:26,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:26,249 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 08:49:26,249 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-25 08:49:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:26,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:26,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:49:26,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:49:26,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:49:26,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:49:26,809 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 08:49:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:27,419 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 08:49:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:49:27,420 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 08:49:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:27,420 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:49:27,420 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 08:49:27,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:49:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 08:49:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 08:49:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 08:49:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 08:49:27,429 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 08:49:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:27,430 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 08:49:27,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:49:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 08:49:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 08:49:27,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:27,431 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 08:49:27,431 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-25 08:49:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:27,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:27,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:49:27,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:49:27,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:49:27,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:49:27,974 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 08:49:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:28,660 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 08:49:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:49:28,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 08:49:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:28,662 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:49:28,662 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:49:28,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:49:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:49:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 08:49:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 08:49:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 08:49:28,670 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 08:49:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:28,671 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 08:49:28,671 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:49:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 08:49:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 08:49:28,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:28,672 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 08:49:28,672 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-25 08:49:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:29,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:29,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:49:29,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:49:29,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:49:29,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:49:29,221 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 08:49:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:29,873 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 08:49:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:49:29,873 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 08:49:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:29,874 INFO L225 Difference]: With dead ends: 199 [2018-07-25 08:49:29,874 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:49:29,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:49:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:49:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 08:49:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 08:49:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 08:49:29,881 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 08:49:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:29,882 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 08:49:29,882 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:49:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 08:49:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 08:49:29,883 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:29,883 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 08:49:29,883 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-25 08:49:29,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:30,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:30,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:49:30,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:49:30,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:49:30,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:49:30,441 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 08:49:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:31,094 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 08:49:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:49:31,094 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 08:49:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:31,095 INFO L225 Difference]: With dead ends: 201 [2018-07-25 08:49:31,095 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:49:31,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:49:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:49:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 08:49:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 08:49:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 08:49:31,102 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 08:49:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:31,102 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 08:49:31,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:49:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 08:49:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 08:49:31,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:31,103 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 08:49:31,104 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-25 08:49:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:31,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:31,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:49:31,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:49:31,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:49:31,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:49:31,767 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 08:49:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:32,442 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 08:49:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:49:32,443 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 08:49:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:32,444 INFO L225 Difference]: With dead ends: 203 [2018-07-25 08:49:32,444 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 08:49:32,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:49:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 08:49:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 08:49:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 08:49:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 08:49:32,450 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 08:49:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:32,450 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 08:49:32,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:49:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 08:49:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 08:49:32,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:32,451 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 08:49:32,452 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-25 08:49:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:33,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:33,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:49:33,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:49:33,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:49:33,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:49:33,038 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 08:49:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:33,703 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 08:49:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:49:33,704 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 08:49:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:33,704 INFO L225 Difference]: With dead ends: 205 [2018-07-25 08:49:33,704 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 08:49:33,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:49:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 08:49:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 08:49:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:49:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 08:49:33,711 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 08:49:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:33,712 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 08:49:33,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:49:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 08:49:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 08:49:33,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:33,713 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 08:49:33,713 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-25 08:49:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:34,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:34,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:49:34,287 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:49:34,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:49:34,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:49:34,288 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 08:49:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:34,983 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 08:49:34,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:49:34,983 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 08:49:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:34,984 INFO L225 Difference]: With dead ends: 207 [2018-07-25 08:49:34,984 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 08:49:34,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:49:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 08:49:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 08:49:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 08:49:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 08:49:34,993 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 08:49:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:34,994 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 08:49:34,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:49:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 08:49:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 08:49:34,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:34,995 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 08:49:34,995 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-07-25 08:49:34,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:35,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:35,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:49:35,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:49:35,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:49:35,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:49:35,623 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 08:49:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:36,335 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 08:49:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:49:36,336 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 08:49:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:36,337 INFO L225 Difference]: With dead ends: 209 [2018-07-25 08:49:36,337 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 08:49:36,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:49:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 08:49:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 08:49:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 08:49:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 08:49:36,347 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 08:49:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:36,347 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 08:49:36,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:49:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 08:49:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 08:49:36,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:36,348 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 08:49:36,348 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-07-25 08:49:36,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:36,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:36,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:49:36,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:49:36,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:49:36,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:49:36,964 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 08:49:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:37,684 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 08:49:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:49:37,685 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 08:49:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:37,685 INFO L225 Difference]: With dead ends: 211 [2018-07-25 08:49:37,686 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 08:49:37,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:49:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 08:49:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 08:49:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 08:49:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 08:49:37,694 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 08:49:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:37,695 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 08:49:37,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:49:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 08:49:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 08:49:37,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:37,696 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 08:49:37,696 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-07-25 08:49:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:38,316 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:38,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:49:38,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:49:38,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:49:38,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:49:38,318 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 08:49:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:39,139 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 08:49:39,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:49:39,140 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 08:49:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:39,141 INFO L225 Difference]: With dead ends: 213 [2018-07-25 08:49:39,141 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 08:49:39,141 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:49:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 08:49:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 08:49:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 08:49:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 08:49:39,149 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 08:49:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:39,150 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 08:49:39,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:49:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 08:49:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 08:49:39,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:39,151 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 08:49:39,151 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-07-25 08:49:39,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:39,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:39,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:49:39,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:49:39,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:49:39,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:49:39,791 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 08:49:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:40,553 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 08:49:40,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:49:40,554 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 08:49:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:40,554 INFO L225 Difference]: With dead ends: 215 [2018-07-25 08:49:40,555 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 08:49:40,556 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:49:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 08:49:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 08:49:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 08:49:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 08:49:40,564 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 08:49:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:40,565 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 08:49:40,565 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:49:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 08:49:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 08:49:40,566 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:40,566 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 08:49:40,566 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-07-25 08:49:40,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:41,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:41,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:49:41,240 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:49:41,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:49:41,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:49:41,241 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 08:49:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:42,018 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 08:49:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:49:42,018 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 08:49:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:42,019 INFO L225 Difference]: With dead ends: 217 [2018-07-25 08:49:42,019 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 08:49:42,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:49:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 08:49:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 08:49:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 08:49:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 08:49:42,029 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 08:49:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:42,029 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 08:49:42,029 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:49:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 08:49:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 08:49:42,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:42,030 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 08:49:42,030 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:42,031 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-07-25 08:49:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:42,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:42,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:49:42,730 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:49:42,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:49:42,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:49:42,731 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 08:49:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:43,479 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 08:49:43,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:49:43,479 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 08:49:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:43,480 INFO L225 Difference]: With dead ends: 219 [2018-07-25 08:49:43,480 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 08:49:43,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:49:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 08:49:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 08:49:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 08:49:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 08:49:43,489 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 08:49:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:43,489 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 08:49:43,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:49:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 08:49:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 08:49:43,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:43,490 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 08:49:43,490 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-07-25 08:49:43,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:44,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:44,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:49:44,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:49:44,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:49:44,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:49:44,191 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 08:49:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:44,942 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 08:49:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:49:44,942 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 08:49:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:44,943 INFO L225 Difference]: With dead ends: 221 [2018-07-25 08:49:44,943 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 08:49:44,944 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:49:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 08:49:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 08:49:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 08:49:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 08:49:44,953 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 08:49:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:44,953 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 08:49:44,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:49:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 08:49:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 08:49:44,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:44,954 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 08:49:44,954 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-07-25 08:49:44,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:45,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:45,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:49:45,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:49:45,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:49:45,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:49:45,666 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 08:49:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:46,542 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 08:49:46,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:49:46,542 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 08:49:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:46,543 INFO L225 Difference]: With dead ends: 223 [2018-07-25 08:49:46,543 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 08:49:46,543 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:49:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 08:49:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 08:49:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 08:49:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 08:49:46,550 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 08:49:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:46,550 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 08:49:46,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:49:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 08:49:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 08:49:46,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:46,551 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 08:49:46,552 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-07-25 08:49:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:47,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:47,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:49:47,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:49:47,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:49:47,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:49:47,258 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 08:49:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:48,001 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 08:49:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:49:48,001 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 08:49:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:48,002 INFO L225 Difference]: With dead ends: 225 [2018-07-25 08:49:48,002 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 08:49:48,003 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:49:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 08:49:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 08:49:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 08:49:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 08:49:48,012 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 08:49:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:48,013 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 08:49:48,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:49:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 08:49:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 08:49:48,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:48,014 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 08:49:48,014 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-07-25 08:49:48,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:48,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:48,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:49:48,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:49:48,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:49:48,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:49:48,757 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 08:49:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:49,593 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 08:49:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:49:49,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 08:49:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:49,594 INFO L225 Difference]: With dead ends: 227 [2018-07-25 08:49:49,594 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 08:49:49,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:49:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 08:49:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 08:49:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 08:49:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 08:49:49,603 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 08:49:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:49,603 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 08:49:49,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:49:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 08:49:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 08:49:49,605 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:49,605 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 08:49:49,605 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-07-25 08:49:49,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:50,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:50,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:49:50,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:49:50,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:49:50,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:49:50,346 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 08:49:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:51,213 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 08:49:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:49:51,213 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 08:49:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:51,214 INFO L225 Difference]: With dead ends: 229 [2018-07-25 08:49:51,214 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 08:49:51,215 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:49:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 08:49:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 08:49:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 08:49:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 08:49:51,221 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 08:49:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:51,222 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 08:49:51,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:49:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 08:49:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 08:49:51,222 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:51,222 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 08:49:51,223 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-07-25 08:49:51,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:51,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:51,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:49:51,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:49:51,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:49:51,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:49:51,974 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 08:49:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:52,841 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 08:49:52,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:49:52,841 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 08:49:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:52,842 INFO L225 Difference]: With dead ends: 231 [2018-07-25 08:49:52,842 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 08:49:52,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:49:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 08:49:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 08:49:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 08:49:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 08:49:52,849 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 08:49:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:52,849 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 08:49:52,850 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:49:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 08:49:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 08:49:52,850 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:52,850 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 08:49:52,851 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:52,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-07-25 08:49:52,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:53,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:53,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:49:53,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:49:53,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:49:53,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:49:53,701 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 08:49:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,545 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 08:49:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:49:54,545 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 08:49:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,546 INFO L225 Difference]: With dead ends: 233 [2018-07-25 08:49:54,546 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 08:49:54,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:49:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 08:49:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 08:49:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 08:49:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 08:49:54,556 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 08:49:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,556 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 08:49:54,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:49:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 08:49:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 08:49:54,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,557 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 08:49:54,557 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-07-25 08:49:54,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:55,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:55,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:49:55,387 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:49:55,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:49:55,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:49:55,389 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 08:49:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:56,338 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 08:49:56,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:49:56,339 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 08:49:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:56,339 INFO L225 Difference]: With dead ends: 235 [2018-07-25 08:49:56,339 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 08:49:56,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:49:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 08:49:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 08:49:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 08:49:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 08:49:56,349 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 08:49:56,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:56,350 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 08:49:56,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:49:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 08:49:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 08:49:56,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:56,351 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 08:49:56,351 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-07-25 08:49:56,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:57,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:57,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:49:57,197 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:49:57,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:49:57,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:49:57,198 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 08:49:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:58,148 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 08:49:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:49:58,149 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 08:49:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:58,149 INFO L225 Difference]: With dead ends: 237 [2018-07-25 08:49:58,149 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 08:49:58,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:49:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 08:49:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 08:49:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 08:49:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 08:49:58,156 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 08:49:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:58,156 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 08:49:58,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:49:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 08:49:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 08:49:58,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:58,157 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 08:49:58,157 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-07-25 08:49:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:58,994 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:58,994 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:49:58,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:49:58,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:49:58,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:49:58,995 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 08:49:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:59,976 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 08:49:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:49:59,976 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 08:49:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:59,977 INFO L225 Difference]: With dead ends: 239 [2018-07-25 08:49:59,977 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 08:49:59,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:49:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 08:49:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 08:49:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 08:49:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 08:49:59,984 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 08:49:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:59,985 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 08:49:59,985 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:49:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 08:49:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 08:49:59,986 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:59,986 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 08:49:59,986 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-07-25 08:49:59,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:00,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:00,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:50:00,856 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:50:00,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:50:00,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:50:00,858 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 08:50:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:01,872 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 08:50:01,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:50:01,873 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 08:50:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:01,873 INFO L225 Difference]: With dead ends: 241 [2018-07-25 08:50:01,873 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 08:50:01,874 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:50:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 08:50:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 08:50:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 08:50:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 08:50:01,881 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 08:50:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:01,881 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 08:50:01,881 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:50:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 08:50:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 08:50:01,882 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:01,882 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 08:50:01,882 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-07-25 08:50:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:02,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:02,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:50:02,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:50:02,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:50:02,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:50:02,775 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 08:50:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:03,818 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 08:50:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:50:03,818 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 08:50:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:03,819 INFO L225 Difference]: With dead ends: 243 [2018-07-25 08:50:03,819 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 08:50:03,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:50:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 08:50:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 08:50:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 08:50:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 08:50:03,829 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 08:50:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:03,830 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 08:50:03,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:50:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 08:50:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 08:50:03,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:03,831 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 08:50:03,831 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-07-25 08:50:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:04,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:04,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:50:04,760 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:50:04,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:50:04,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:50:04,762 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 08:50:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:05,788 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 08:50:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:50:05,788 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 08:50:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:05,789 INFO L225 Difference]: With dead ends: 245 [2018-07-25 08:50:05,789 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 08:50:05,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:50:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 08:50:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 08:50:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 08:50:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 08:50:05,797 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 08:50:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:05,797 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 08:50:05,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:50:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 08:50:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 08:50:05,798 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:05,798 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 08:50:05,799 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:05,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-07-25 08:50:05,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:06,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:06,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:50:06,720 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:50:06,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:50:06,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:50:06,722 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 08:50:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:07,769 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 08:50:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:50:07,769 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 08:50:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:07,770 INFO L225 Difference]: With dead ends: 247 [2018-07-25 08:50:07,770 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 08:50:07,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:50:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 08:50:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 08:50:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 08:50:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 08:50:07,777 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 08:50:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:07,778 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 08:50:07,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:50:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 08:50:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 08:50:07,778 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:07,779 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 08:50:07,779 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-07-25 08:50:07,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:08,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:08,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:50:08,722 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:50:08,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:50:08,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:50:08,723 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 08:50:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:09,791 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 08:50:09,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:50:09,791 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 08:50:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:09,792 INFO L225 Difference]: With dead ends: 249 [2018-07-25 08:50:09,792 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 08:50:09,793 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:50:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 08:50:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 08:50:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 08:50:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 08:50:09,800 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 08:50:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:09,800 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 08:50:09,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:50:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 08:50:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 08:50:09,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:09,801 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 08:50:09,801 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-07-25 08:50:09,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:10,780 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:10,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:50:10,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:50:10,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:50:10,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:50:10,782 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 08:50:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:11,855 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 08:50:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:50:11,855 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 08:50:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:11,856 INFO L225 Difference]: With dead ends: 251 [2018-07-25 08:50:11,856 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 08:50:11,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:50:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 08:50:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 08:50:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 08:50:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 08:50:11,867 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 08:50:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:11,867 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 08:50:11,867 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:50:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 08:50:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 08:50:11,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:11,868 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 08:50:11,869 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-07-25 08:50:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:12,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:12,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:50:12,865 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:50:12,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:50:12,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:50:12,867 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 08:50:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:13,967 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 08:50:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:50:13,967 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 08:50:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:13,968 INFO L225 Difference]: With dead ends: 253 [2018-07-25 08:50:13,968 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 08:50:13,969 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:50:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 08:50:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 08:50:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 08:50:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 08:50:13,976 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 08:50:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:13,976 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 08:50:13,976 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:50:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 08:50:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 08:50:13,977 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:13,977 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 08:50:13,978 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-07-25 08:50:13,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:14,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:14,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:50:14,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:50:14,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:50:14,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:50:14,964 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 08:50:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:16,081 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 08:50:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:50:16,081 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 08:50:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:16,082 INFO L225 Difference]: With dead ends: 255 [2018-07-25 08:50:16,082 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 08:50:16,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:50:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 08:50:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 08:50:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 08:50:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 08:50:16,090 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 08:50:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:16,090 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 08:50:16,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:50:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 08:50:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 08:50:16,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:16,092 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 08:50:16,092 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-07-25 08:50:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:17,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:17,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:50:17,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:50:17,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:50:17,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:50:17,099 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 08:50:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:18,243 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 08:50:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:50:18,243 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 08:50:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:18,244 INFO L225 Difference]: With dead ends: 257 [2018-07-25 08:50:18,244 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 08:50:18,245 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:50:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 08:50:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 08:50:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 08:50:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 08:50:18,252 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 08:50:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:18,252 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 08:50:18,252 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:50:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 08:50:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 08:50:18,253 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:18,253 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 08:50:18,254 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-07-25 08:50:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:19,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:19,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:50:19,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:50:19,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:50:19,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:50:19,250 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 08:50:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,404 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 08:50:20,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:50:20,404 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 08:50:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,405 INFO L225 Difference]: With dead ends: 259 [2018-07-25 08:50:20,405 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 08:50:20,407 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:50:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 08:50:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 08:50:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 08:50:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 08:50:20,416 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 08:50:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,416 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 08:50:20,416 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:50:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 08:50:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 08:50:20,417 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,417 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 08:50:20,418 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-07-25 08:50:20,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:50:21,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:50:21,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:50:21,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:50:21,516 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 08:50:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:22,718 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 08:50:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:50:22,718 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 08:50:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:22,719 INFO L225 Difference]: With dead ends: 261 [2018-07-25 08:50:22,719 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 08:50:22,720 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:50:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 08:50:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 08:50:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 08:50:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 08:50:22,727 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 08:50:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:22,727 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 08:50:22,728 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:50:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 08:50:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 08:50:22,729 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:22,729 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 08:50:22,729 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-07-25 08:50:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:24,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:24,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:50:24,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:50:24,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:50:24,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:50:24,020 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 08:50:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:25,102 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 08:50:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:50:25,103 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 08:50:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:25,104 INFO L225 Difference]: With dead ends: 263 [2018-07-25 08:50:25,104 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 08:50:25,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:50:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 08:50:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 08:50:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 08:50:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 08:50:25,112 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 08:50:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:25,113 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 08:50:25,113 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:50:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 08:50:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 08:50:25,114 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:25,114 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 08:50:25,114 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-07-25 08:50:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:26,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:26,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:50:26,097 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:50:26,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:50:26,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:50:26,098 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 08:50:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:27,280 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 08:50:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:50:27,280 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 08:50:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:27,281 INFO L225 Difference]: With dead ends: 265 [2018-07-25 08:50:27,281 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 08:50:27,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:50:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 08:50:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 08:50:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 08:50:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 08:50:27,288 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 08:50:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:27,289 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 08:50:27,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:50:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 08:50:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 08:50:27,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:27,290 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 08:50:27,290 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-07-25 08:50:27,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:28,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:28,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:50:28,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:50:28,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:50:28,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:50:28,430 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 08:50:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:29,550 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 08:50:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:50:29,550 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 08:50:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:29,551 INFO L225 Difference]: With dead ends: 267 [2018-07-25 08:50:29,551 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 08:50:29,553 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:50:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 08:50:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 08:50:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 08:50:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 08:50:29,560 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 08:50:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:29,560 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 08:50:29,560 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:50:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 08:50:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 08:50:29,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:29,562 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 08:50:29,562 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-07-25 08:50:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:30,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:30,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:50:30,701 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:50:30,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:50:30,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:50:30,702 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 08:50:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:31,819 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 08:50:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:50:31,819 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 08:50:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:31,819 INFO L225 Difference]: With dead ends: 269 [2018-07-25 08:50:31,819 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 08:50:31,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:50:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 08:50:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 08:50:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 08:50:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 08:50:31,827 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 08:50:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:31,827 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 08:50:31,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:50:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 08:50:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 08:50:31,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:31,828 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 08:50:31,828 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-07-25 08:50:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:32,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:32,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:50:32,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:50:32,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:50:32,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:50:32,896 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 08:50:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:34,075 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 08:50:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:50:34,075 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 08:50:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:34,076 INFO L225 Difference]: With dead ends: 271 [2018-07-25 08:50:34,076 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 08:50:34,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:50:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 08:50:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 08:50:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 08:50:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 08:50:34,083 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 08:50:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:34,083 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 08:50:34,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:50:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 08:50:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 08:50:34,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:34,084 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 08:50:34,085 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-07-25 08:50:34,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:35,220 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:35,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:50:35,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:50:35,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:50:35,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:50:35,221 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 08:50:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:36,391 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 08:50:36,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:50:36,391 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 08:50:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:36,391 INFO L225 Difference]: With dead ends: 273 [2018-07-25 08:50:36,392 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 08:50:36,393 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:50:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 08:50:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 08:50:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 08:50:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 08:50:36,399 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 08:50:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:36,399 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 08:50:36,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:50:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 08:50:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 08:50:36,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:36,400 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 08:50:36,401 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-07-25 08:50:36,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:37,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:37,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:50:37,535 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:50:37,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:50:37,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:50:37,537 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 08:50:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:38,818 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 08:50:38,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:50:38,818 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 08:50:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:38,819 INFO L225 Difference]: With dead ends: 275 [2018-07-25 08:50:38,819 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 08:50:38,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:50:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 08:50:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 08:50:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 08:50:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 08:50:38,827 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 08:50:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:38,827 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 08:50:38,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:50:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 08:50:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 08:50:38,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:38,828 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 08:50:38,828 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-07-25 08:50:38,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:50:40,047 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:50:40,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:50:40,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:50:40,048 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 08:50:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,267 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 08:50:41,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:50:41,268 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 08:50:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,268 INFO L225 Difference]: With dead ends: 277 [2018-07-25 08:50:41,268 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 08:50:41,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:50:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 08:50:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 08:50:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 08:50:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 08:50:41,280 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 08:50:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,280 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 08:50:41,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:50:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 08:50:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 08:50:41,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,282 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 08:50:41,282 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-07-25 08:50:41,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:50:42,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:50:42,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:50:42,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:50:42,496 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 08:50:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,802 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 08:50:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:50:43,803 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 08:50:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,803 INFO L225 Difference]: With dead ends: 279 [2018-07-25 08:50:43,803 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 08:50:43,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:50:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 08:50:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 08:50:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 08:50:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 08:50:43,815 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 08:50:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,815 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 08:50:43,816 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:50:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 08:50:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 08:50:43,817 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,817 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 08:50:43,817 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-07-25 08:50:43,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:45,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:45,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:50:45,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:50:45,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:50:45,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:50:45,015 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-25 08:50:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:46,356 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-25 08:50:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:50:46,357 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-25 08:50:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:46,357 INFO L225 Difference]: With dead ends: 281 [2018-07-25 08:50:46,358 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 08:50:46,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:50:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 08:50:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 08:50:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 08:50:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-25 08:50:46,367 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-25 08:50:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,367 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-25 08:50:46,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:50:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-25 08:50:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 08:50:46,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,368 INFO L354 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-25 08:50:46,368 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-07-25 08:50:46,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,599 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:50:47,599 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:50:47,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:50:47,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:50:47,601 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-25 08:50:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:48,909 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-25 08:50:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:50:48,909 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-25 08:50:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:48,910 INFO L225 Difference]: With dead ends: 283 [2018-07-25 08:50:48,910 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 08:50:48,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:50:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 08:50:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 08:50:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 08:50:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-25 08:50:48,921 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-25 08:50:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:48,921 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-25 08:50:48,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:50:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-25 08:50:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 08:50:48,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:48,922 INFO L354 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-25 08:50:48,923 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-07-25 08:50:48,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:50:50,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:50:50,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:50:50,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:50:50,125 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-25 08:50:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,413 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-25 08:50:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:50:51,414 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-25 08:50:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,414 INFO L225 Difference]: With dead ends: 285 [2018-07-25 08:50:51,414 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 08:50:51,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:50:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 08:50:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 08:50:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 08:50:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-25 08:50:51,422 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-25 08:50:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,422 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-25 08:50:51,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:50:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-25 08:50:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 08:50:51,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,423 INFO L354 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-25 08:50:51,423 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-07-25 08:50:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:50:52,654 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:50:52,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:50:52,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:50:52,655 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-25 08:50:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,040 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-25 08:50:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:50:54,040 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-25 08:50:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,041 INFO L225 Difference]: With dead ends: 287 [2018-07-25 08:50:54,041 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 08:50:54,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:50:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 08:50:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 08:50:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 08:50:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-25 08:50:54,050 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-25 08:50:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,050 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-25 08:50:54,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:50:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-25 08:50:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 08:50:54,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,051 INFO L354 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-25 08:50:54,051 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-07-25 08:50:54,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:50:55,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:50:55,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:50:55,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:50:55,296 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-25 08:50:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,685 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-25 08:50:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:50:56,685 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-25 08:50:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,686 INFO L225 Difference]: With dead ends: 289 [2018-07-25 08:50:56,686 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 08:50:56,688 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:50:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 08:50:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 08:50:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 08:50:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-25 08:50:56,695 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-25 08:50:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,695 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-25 08:50:56,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:50:56,696 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-25 08:50:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 08:50:56,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,697 INFO L354 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-25 08:50:56,697 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-07-25 08:50:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:50:58,028 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:50:58,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:50:58,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:50:58,030 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-07-25 08:50:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,416 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-25 08:50:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:50:59,416 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-25 08:50:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,417 INFO L225 Difference]: With dead ends: 291 [2018-07-25 08:50:59,417 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 08:50:59,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:50:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 08:50:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 08:50:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 08:50:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-25 08:50:59,425 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-07-25 08:50:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,426 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-25 08:50:59,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:50:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-25 08:50:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 08:50:59,427 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,427 INFO L354 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-07-25 08:50:59,427 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-07-25 08:50:59,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:51:00,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:51:00,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:51:00,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:51:00,711 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-07-25 08:51:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,112 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-25 08:51:02,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:51:02,112 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-07-25 08:51:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,113 INFO L225 Difference]: With dead ends: 293 [2018-07-25 08:51:02,113 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 08:51:02,114 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:51:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 08:51:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 08:51:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 08:51:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-25 08:51:02,125 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-07-25 08:51:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,126 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-25 08:51:02,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:51:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-25 08:51:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 08:51:02,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,127 INFO L354 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-07-25 08:51:02,127 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-07-25 08:51:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:03,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:51:03,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:51:03,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:51:03,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:51:03,446 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-07-25 08:51:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:04,886 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-25 08:51:04,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:51:04,886 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-25 08:51:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:04,887 INFO L225 Difference]: With dead ends: 295 [2018-07-25 08:51:04,887 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 08:51:04,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:51:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 08:51:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 08:51:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 08:51:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-25 08:51:04,895 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-07-25 08:51:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:04,895 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-25 08:51:04,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:51:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-25 08:51:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 08:51:04,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:04,896 INFO L354 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-07-25 08:51:04,896 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-07-25 08:51:04,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:06,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:06,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:51:06,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:51:06,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:51:06,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:51:06,217 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-07-25 08:51:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:07,691 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-25 08:51:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:51:07,691 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-07-25 08:51:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:07,692 INFO L225 Difference]: With dead ends: 297 [2018-07-25 08:51:07,692 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 08:51:07,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:51:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 08:51:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 08:51:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 08:51:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-07-25 08:51:07,700 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-07-25 08:51:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:07,700 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-07-25 08:51:07,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:51:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-07-25 08:51:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 08:51:07,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:07,701 INFO L354 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-07-25 08:51:07,702 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-07-25 08:51:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:09,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:09,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:51:09,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:51:09,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:51:09,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:51:09,056 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-07-25 08:51:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,562 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-25 08:51:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:51:10,562 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-25 08:51:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,563 INFO L225 Difference]: With dead ends: 299 [2018-07-25 08:51:10,563 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 08:51:10,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:51:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 08:51:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 08:51:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 08:51:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-25 08:51:10,571 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-07-25 08:51:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,571 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-25 08:51:10,571 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:51:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-25 08:51:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 08:51:10,572 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,572 INFO L354 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-07-25 08:51:10,572 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-07-25 08:51:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:11,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:11,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:51:11,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:51:11,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:51:11,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:51:11,926 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-07-25 08:51:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:13,463 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-25 08:51:13,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:51:13,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-07-25 08:51:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:13,464 INFO L225 Difference]: With dead ends: 301 [2018-07-25 08:51:13,464 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 08:51:13,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:51:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 08:51:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 08:51:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 08:51:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-25 08:51:13,476 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-07-25 08:51:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:13,477 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-25 08:51:13,477 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:51:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-25 08:51:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 08:51:13,478 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:13,478 INFO L354 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-07-25 08:51:13,478 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-07-25 08:51:13,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:14,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:14,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:51:14,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:51:14,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:51:14,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:51:14,881 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-07-25 08:51:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:16,386 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-25 08:51:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:51:16,387 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-25 08:51:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:16,387 INFO L225 Difference]: With dead ends: 303 [2018-07-25 08:51:16,388 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 08:51:16,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:51:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 08:51:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 08:51:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 08:51:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-25 08:51:16,401 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-07-25 08:51:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:16,402 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-25 08:51:16,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:51:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-25 08:51:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 08:51:16,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:16,403 INFO L354 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-07-25 08:51:16,403 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-07-25 08:51:16,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:17,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:17,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:51:17,842 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:51:17,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:51:17,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:51:17,844 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-07-25 08:51:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:19,433 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-25 08:51:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:51:19,434 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-07-25 08:51:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:19,434 INFO L225 Difference]: With dead ends: 305 [2018-07-25 08:51:19,434 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 08:51:19,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:51:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 08:51:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 08:51:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 08:51:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-07-25 08:51:19,444 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-07-25 08:51:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:19,444 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-07-25 08:51:19,444 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:51:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-07-25 08:51:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 08:51:19,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:19,445 INFO L354 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-07-25 08:51:19,445 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-07-25 08:51:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:20,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:20,872 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:51:20,872 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:51:20,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:51:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:51:20,874 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-07-25 08:51:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:22,458 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-25 08:51:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:51:22,458 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-25 08:51:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:22,459 INFO L225 Difference]: With dead ends: 307 [2018-07-25 08:51:22,459 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 08:51:22,461 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:51:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 08:51:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 08:51:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 08:51:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-25 08:51:22,469 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-07-25 08:51:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:22,469 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-25 08:51:22,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:51:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-25 08:51:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 08:51:22,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:22,470 INFO L354 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-07-25 08:51:22,470 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-07-25 08:51:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:24,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:24,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:51:24,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:51:24,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:51:24,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:51:24,004 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-07-25 08:51:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:25,588 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-25 08:51:25,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:51:25,588 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-07-25 08:51:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:25,589 INFO L225 Difference]: With dead ends: 309 [2018-07-25 08:51:25,589 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 08:51:25,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:51:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 08:51:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 08:51:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 08:51:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-07-25 08:51:25,597 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-07-25 08:51:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:25,598 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-07-25 08:51:25,598 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:51:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-07-25 08:51:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 08:51:25,599 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:25,599 INFO L354 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-07-25 08:51:25,599 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-07-25 08:51:25,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:27,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:27,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:51:27,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:51:27,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:51:27,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:51:27,082 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-07-25 08:51:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:28,672 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-25 08:51:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:51:28,673 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-07-25 08:51:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:28,674 INFO L225 Difference]: With dead ends: 311 [2018-07-25 08:51:28,674 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 08:51:28,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:51:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 08:51:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-25 08:51:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-25 08:51:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-25 08:51:28,687 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-07-25 08:51:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:28,687 INFO L472 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-25 08:51:28,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:51:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-25 08:51:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-25 08:51:28,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:28,688 INFO L354 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-07-25 08:51:28,689 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-07-25 08:51:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:30,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:30,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:51:30,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:51:30,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:51:30,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:51:30,221 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-07-25 08:51:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:31,868 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-25 08:51:31,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:51:31,869 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-07-25 08:51:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:31,869 INFO L225 Difference]: With dead ends: 313 [2018-07-25 08:51:31,869 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 08:51:31,870 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:51:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 08:51:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-25 08:51:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 08:51:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-25 08:51:31,878 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-07-25 08:51:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:31,878 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-25 08:51:31,878 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:51:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-25 08:51:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 08:51:31,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:31,879 INFO L354 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-07-25 08:51:31,879 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-07-25 08:51:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:33,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:33,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:51:33,391 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:51:33,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:51:33,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:51:33,393 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-07-25 08:51:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:35,080 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-25 08:51:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:51:35,081 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-07-25 08:51:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:35,081 INFO L225 Difference]: With dead ends: 315 [2018-07-25 08:51:35,081 INFO L226 Difference]: Without dead ends: 313 [2018-07-25 08:51:35,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:51:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-25 08:51:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-25 08:51:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-25 08:51:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-25 08:51:35,091 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-07-25 08:51:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:35,091 INFO L472 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-25 08:51:35,091 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:51:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-25 08:51:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-25 08:51:35,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:35,092 INFO L354 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-07-25 08:51:35,093 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-07-25 08:51:35,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:36,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:36,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:51:36,615 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:51:36,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:51:36,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:51:36,617 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-07-25 08:51:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:38,159 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-25 08:51:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:51:38,160 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-07-25 08:51:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:38,160 INFO L225 Difference]: With dead ends: 317 [2018-07-25 08:51:38,160 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 08:51:38,162 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:51:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 08:51:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-25 08:51:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 08:51:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-07-25 08:51:38,174 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-07-25 08:51:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:38,175 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-07-25 08:51:38,175 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:51:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-07-25 08:51:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-25 08:51:38,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:38,176 INFO L354 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-07-25 08:51:38,176 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-07-25 08:51:38,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:39,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:39,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:51:39,830 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:51:39,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:51:39,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:51:39,832 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-07-25 08:51:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,534 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-25 08:51:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:51:41,534 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-07-25 08:51:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,535 INFO L225 Difference]: With dead ends: 319 [2018-07-25 08:51:41,535 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 08:51:41,537 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:51:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 08:51:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-25 08:51:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-25 08:51:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-25 08:51:41,545 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-07-25 08:51:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,545 INFO L472 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-25 08:51:41,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:51:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-25 08:51:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-25 08:51:41,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,546 INFO L354 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-07-25 08:51:41,546 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-07-25 08:51:41,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:43,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:43,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:51:43,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:51:43,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:51:43,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:51:43,062 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-07-25 08:51:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:44,770 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-25 08:51:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:51:44,770 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-07-25 08:51:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:44,771 INFO L225 Difference]: With dead ends: 321 [2018-07-25 08:51:44,771 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 08:51:44,772 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:51:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 08:51:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-25 08:51:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 08:51:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-07-25 08:51:44,780 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-07-25 08:51:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:44,780 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-07-25 08:51:44,780 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:51:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-07-25 08:51:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-25 08:51:44,781 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:44,781 INFO L354 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-07-25 08:51:44,781 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-07-25 08:51:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:51:46,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:51:46,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:51:46,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:51:46,461 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-07-25 08:51:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:48,188 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-25 08:51:48,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:51:48,188 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-07-25 08:51:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:48,189 INFO L225 Difference]: With dead ends: 323 [2018-07-25 08:51:48,189 INFO L226 Difference]: Without dead ends: 321 [2018-07-25 08:51:48,190 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:51:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-25 08:51:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-25 08:51:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 08:51:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-25 08:51:48,198 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-07-25 08:51:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:48,198 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-25 08:51:48,198 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:51:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-25 08:51:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 08:51:48,199 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:48,199 INFO L354 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-07-25 08:51:48,199 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-07-25 08:51:48,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:49,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:49,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:51:49,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:51:49,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:51:49,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:51:49,879 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-07-25 08:51:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,632 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-25 08:51:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:51:51,632 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-07-25 08:51:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,633 INFO L225 Difference]: With dead ends: 325 [2018-07-25 08:51:51,633 INFO L226 Difference]: Without dead ends: 323 [2018-07-25 08:51:51,634 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:51:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-25 08:51:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-25 08:51:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-25 08:51:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-07-25 08:51:51,642 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-07-25 08:51:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,642 INFO L472 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-07-25 08:51:51,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:51:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-07-25 08:51:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-25 08:51:51,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,643 INFO L354 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-07-25 08:51:51,643 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-07-25 08:51:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:53,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:53,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:51:53,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:51:53,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:51:53,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:51:53,123 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-07-25 08:51:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:54,897 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-25 08:51:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:51:54,897 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-07-25 08:51:54,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:54,898 INFO L225 Difference]: With dead ends: 327 [2018-07-25 08:51:54,898 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 08:51:54,899 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:51:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 08:51:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-25 08:51:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-25 08:51:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-25 08:51:54,906 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-07-25 08:51:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:54,907 INFO L472 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-25 08:51:54,907 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:51:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-25 08:51:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-25 08:51:54,908 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:54,908 INFO L354 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-07-25 08:51:54,908 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-07-25 08:51:54,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:56,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:56,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:51:56,595 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:51:56,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:51:56,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:51:56,597 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-07-25 08:51:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,398 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-25 08:51:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:51:58,398 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-07-25 08:51:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,399 INFO L225 Difference]: With dead ends: 329 [2018-07-25 08:51:58,399 INFO L226 Difference]: Without dead ends: 327 [2018-07-25 08:51:58,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:51:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-25 08:51:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-25 08:51:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-25 08:51:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-07-25 08:51:58,407 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-07-25 08:51:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,408 INFO L472 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-07-25 08:51:58,408 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:51:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-07-25 08:51:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-25 08:51:58,409 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,409 INFO L354 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-07-25 08:51:58,409 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,409 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-07-25 08:51:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:00,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:00,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:52:00,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:52:00,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:52:00,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:52:00,150 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-07-25 08:52:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:01,850 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-25 08:52:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:52:01,850 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-07-25 08:52:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:01,851 INFO L225 Difference]: With dead ends: 331 [2018-07-25 08:52:01,851 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 08:52:01,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:52:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 08:52:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-07-25 08:52:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-25 08:52:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-25 08:52:01,860 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-07-25 08:52:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:01,860 INFO L472 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-25 08:52:01,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:52:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-25 08:52:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-25 08:52:01,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:01,861 INFO L354 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-07-25 08:52:01,862 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-07-25 08:52:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,618 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:52:03,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:52:03,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:52:03,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:52:03,620 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-07-25 08:52:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:05,395 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-07-25 08:52:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:52:05,395 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-07-25 08:52:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:05,396 INFO L225 Difference]: With dead ends: 333 [2018-07-25 08:52:05,396 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 08:52:05,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:52:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 08:52:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-07-25 08:52:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 08:52:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-07-25 08:52:05,405 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-07-25 08:52:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:05,405 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-07-25 08:52:05,405 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:52:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-07-25 08:52:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 08:52:05,406 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:05,406 INFO L354 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-07-25 08:52:05,407 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-07-25 08:52:05,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:07,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:07,191 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:52:07,191 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:52:07,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:52:07,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:52:07,193 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-07-25 08:52:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:09,065 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-25 08:52:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 08:52:09,065 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-07-25 08:52:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:09,066 INFO L225 Difference]: With dead ends: 335 [2018-07-25 08:52:09,066 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 08:52:09,067 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:52:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 08:52:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-07-25 08:52:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-25 08:52:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-25 08:52:09,080 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-07-25 08:52:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:09,080 INFO L472 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-25 08:52:09,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 08:52:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-25 08:52:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-25 08:52:09,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:09,082 INFO L354 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-07-25 08:52:09,082 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-07-25 08:52:09,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:11,061 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:11,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 08:52:11,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 08:52:11,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 08:52:11,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:52:11,064 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-07-25 08:52:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:13,026 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-07-25 08:52:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 08:52:13,026 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-07-25 08:52:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:13,027 INFO L225 Difference]: With dead ends: 337 [2018-07-25 08:52:13,027 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 08:52:13,029 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 08:52:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 08:52:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-07-25 08:52:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-07-25 08:52:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-07-25 08:52:13,037 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-07-25 08:52:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:13,037 INFO L472 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-07-25 08:52:13,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 08:52:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-07-25 08:52:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-25 08:52:13,038 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:13,039 INFO L354 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-07-25 08:52:13,039 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-07-25 08:52:13,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:14,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:14,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 08:52:14,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 08:52:14,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 08:52:14,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:52:14,692 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-07-25 08:52:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:16,636 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-25 08:52:16,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 08:52:16,636 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-07-25 08:52:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:16,637 INFO L225 Difference]: With dead ends: 339 [2018-07-25 08:52:16,637 INFO L226 Difference]: Without dead ends: 337 [2018-07-25 08:52:16,638 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 08:52:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-07-25 08:52:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-07-25 08:52:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 08:52:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-25 08:52:16,647 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-07-25 08:52:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:16,647 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-25 08:52:16,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 08:52:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-25 08:52:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-25 08:52:16,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:16,648 INFO L354 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-07-25 08:52:16,648 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-07-25 08:52:16,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:18,494 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:18,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 08:52:18,494 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 08:52:18,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 08:52:18,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:52:18,496 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-07-25 08:52:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:20,334 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-07-25 08:52:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 08:52:20,334 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-07-25 08:52:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:20,335 INFO L225 Difference]: With dead ends: 341 [2018-07-25 08:52:20,335 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 08:52:20,336 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 08:52:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 08:52:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-07-25 08:52:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 08:52:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-07-25 08:52:20,344 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-07-25 08:52:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:20,345 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-07-25 08:52:20,345 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 08:52:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-07-25 08:52:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-07-25 08:52:20,346 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:20,346 INFO L354 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-07-25 08:52:20,346 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-07-25 08:52:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:22,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:22,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 08:52:22,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 08:52:22,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 08:52:22,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:52:22,296 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-07-25 08:52:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:24,243 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-25 08:52:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 08:52:24,243 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-07-25 08:52:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:24,244 INFO L225 Difference]: With dead ends: 343 [2018-07-25 08:52:24,244 INFO L226 Difference]: Without dead ends: 341 [2018-07-25 08:52:24,245 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 08:52:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-25 08:52:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-07-25 08:52:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 08:52:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-25 08:52:24,253 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-07-25 08:52:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:24,253 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-25 08:52:24,253 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 08:52:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-25 08:52:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 08:52:24,254 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:24,254 INFO L354 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-07-25 08:52:24,254 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-07-25 08:52:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:26,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:26,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 08:52:26,020 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 08:52:26,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 08:52:26,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:52:26,022 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-07-25 08:52:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:27,960 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-25 08:52:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 08:52:27,960 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-07-25 08:52:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:27,960 INFO L225 Difference]: With dead ends: 345 [2018-07-25 08:52:27,960 INFO L226 Difference]: Without dead ends: 343 [2018-07-25 08:52:27,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 08:52:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-07-25 08:52:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-07-25 08:52:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 08:52:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-07-25 08:52:27,970 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-07-25 08:52:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:27,970 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-07-25 08:52:27,970 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 08:52:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-07-25 08:52:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-25 08:52:27,971 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:27,971 INFO L354 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-07-25 08:52:27,971 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-07-25 08:52:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:29,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:29,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 08:52:29,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 08:52:29,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 08:52:29,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:52:29,927 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-07-25 08:52:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:31,927 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-25 08:52:31,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 08:52:31,927 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-07-25 08:52:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:31,928 INFO L225 Difference]: With dead ends: 347 [2018-07-25 08:52:31,928 INFO L226 Difference]: Without dead ends: 345 [2018-07-25 08:52:31,929 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 08:52:31,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-25 08:52:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-07-25 08:52:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-25 08:52:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-25 08:52:31,937 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-07-25 08:52:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:31,937 INFO L472 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-25 08:52:31,937 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 08:52:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-25 08:52:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-25 08:52:31,938 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:31,938 INFO L354 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-07-25 08:52:31,938 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-07-25 08:52:31,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:33,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:33,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 08:52:33,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 08:52:33,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 08:52:33,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:52:33,976 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-07-25 08:52:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:36,006 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-07-25 08:52:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 08:52:36,007 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-07-25 08:52:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:36,007 INFO L225 Difference]: With dead ends: 349 [2018-07-25 08:52:36,007 INFO L226 Difference]: Without dead ends: 347 [2018-07-25 08:52:36,009 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 08:52:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-25 08:52:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-25 08:52:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-25 08:52:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-07-25 08:52:36,017 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-07-25 08:52:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:36,017 INFO L472 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-07-25 08:52:36,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 08:52:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-07-25 08:52:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-25 08:52:36,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:36,019 INFO L354 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-07-25 08:52:36,019 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-07-25 08:52:36,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:38,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:38,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 08:52:38,097 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 08:52:38,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 08:52:38,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:52:38,098 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-07-25 08:52:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:40,118 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-25 08:52:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 08:52:40,118 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-07-25 08:52:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:40,118 INFO L225 Difference]: With dead ends: 351 [2018-07-25 08:52:40,119 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 08:52:40,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 08:52:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 08:52:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-07-25 08:52:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-25 08:52:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-25 08:52:40,133 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-07-25 08:52:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:40,134 INFO L472 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-25 08:52:40,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 08:52:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-25 08:52:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-25 08:52:40,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:40,135 INFO L354 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-07-25 08:52:40,135 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-07-25 08:52:40,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 08:52:40,987 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:52:40,993 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:52:40,993 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:52:40 BoogieIcfgContainer [2018-07-25 08:52:40,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:52:40,994 INFO L168 Benchmark]: Toolchain (without parser) took 251432.75 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 64.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-25 08:52:40,996 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:52:40,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:52:40,996 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:52:40,997 INFO L168 Benchmark]: RCFGBuilder took 289.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:52:40,997 INFO L168 Benchmark]: TraceAbstraction took 251077.73 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-07-25 08:52:40,999 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.32 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 20.90 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 289.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251077.73 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 349 with TraceHistMax 173, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 44 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 251.0s OverallTime, 173 OverallIterations, 173 TraceHistogramMax, 128.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15394 SDtfs, 0 SDslu, 1710971 SDs, 0 SdLazy, 1740726 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15050 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 14878 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 172 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 24.0s SatisfiabilityAnalysisTime, 85.3s InterpolantComputationTime, 30100 NumberOfCodeBlocks, 30100 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 29928 ConstructedInterpolants, 0 QuantifiedInterpolants, 48145380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 172 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1696092 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/overflow1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-52-41-014.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/overflow1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-52-41-014.csv Completed graceful shutdown