java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:12:28,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:12:28,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:12:28,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:12:28,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:12:28,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:12:28,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:12:28,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:12:28,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:12:28,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:12:28,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:12:28,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:12:28,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:12:28,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:12:28,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:12:28,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:12:28,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:12:28,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:12:28,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:12:28,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:12:28,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:12:28,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:12:28,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:12:28,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:12:28,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:12:28,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:12:28,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:12:28,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:12:28,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:12:28,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:12:28,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:12:28,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:12:28,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:12:28,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:12:28,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:12:28,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:12:28,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:12:28,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:12:28,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:12:28,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:12:28,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:12:28,452 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:12:28,452 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:12:28,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:12:28,454 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:12:28,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:12:28,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:12:28,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:12:28,454 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:12:28,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:12:28,455 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:12:28,456 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:12:28,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:12:28,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:12:28,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:12:28,536 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:12:28,537 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:12:28,538 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl [2018-10-15 13:12:28,538 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_false-unreach-call4.i_3.bpl' [2018-10-15 13:12:28,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:12:28,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:12:28,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:12:28,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:12:28,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:12:28,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:12:28,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:12:28,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:12:28,660 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:12:28,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:12:28,742 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:12:28,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:12:28,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:12:28,944 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:12:28,945 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:28 BoogieIcfgContainer [2018-10-15 13:12:28,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:12:28,946 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:12:28,946 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:12:28,947 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:12:28,950 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:28" (1/1) ... [2018-10-15 13:12:28,955 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:12:28,969 INFO L202 PluginConnector]: Adding new model simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:28 BasicIcfg [2018-10-15 13:12:28,969 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:12:28,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:12:28,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:12:28,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:12:28,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:12:28" (1/3) ... [2018-10-15 13:12:28,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2332 and model type simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:12:28, skipping insertion in model container [2018-10-15 13:12:28,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:12:28" (2/3) ... [2018-10-15 13:12:28,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2332 and model type simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:12:28, skipping insertion in model container [2018-10-15 13:12:28,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_false-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:12:28" (3/3) ... [2018-10-15 13:12:28,978 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call4.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:12:28,988 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:12:28,996 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:12:29,014 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:12:29,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:12:29,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:12:29,045 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:12:29,046 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:12:29,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:12:29,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:12:29,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:12:29,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:12:29,047 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:12:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-15 13:12:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:12:29,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:29,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:29,072 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:29,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1367695513, now seen corresponding path program 1 times [2018-10-15 13:12:29,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:29,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:12:29,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:12:29,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:12:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:12:29,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:12:29,387 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-15 13:12:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:29,488 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-15 13:12:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:12:29,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:12:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:29,502 INFO L225 Difference]: With dead ends: 14 [2018-10-15 13:12:29,502 INFO L226 Difference]: Without dead ends: 14 [2018-10-15 13:12:29,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:12:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-15 13:12:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-15 13:12:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-15 13:12:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-15 13:12:29,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-15 13:12:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:29,540 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-15 13:12:29,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:12:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-15 13:12:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:12:29,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:29,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:29,542 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:29,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash 497117989, now seen corresponding path program 1 times [2018-10-15 13:12:29,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:29,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:29,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 13:12:29,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:12:29,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:12:29,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:12:29,648 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-10-15 13:12:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:29,724 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 13:12:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:12:29,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-15 13:12:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:29,726 INFO L225 Difference]: With dead ends: 16 [2018-10-15 13:12:29,726 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 13:12:29,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:12:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 13:12:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 13:12:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 13:12:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 13:12:29,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-15 13:12:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:29,733 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 13:12:29,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:12:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 13:12:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 13:12:29,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:29,734 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:29,735 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:29,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1581530979, now seen corresponding path program 2 times [2018-10-15 13:12:29,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:29,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:29,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:12:29,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:12:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:12:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:12:29,876 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-15 13:12:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:30,077 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 13:12:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:12:30,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-15 13:12:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:30,080 INFO L225 Difference]: With dead ends: 18 [2018-10-15 13:12:30,080 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 13:12:30,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:12:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 13:12:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 13:12:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 13:12:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 13:12:30,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-15 13:12:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:30,086 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 13:12:30,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:12:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 13:12:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 13:12:30,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:30,087 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:30,087 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:30,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash 25361441, now seen corresponding path program 3 times [2018-10-15 13:12:30,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:30,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:30,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:12:30,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:12:30,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:12:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:12:30,253 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-10-15 13:12:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:30,591 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-15 13:12:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:12:30,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-15 13:12:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:30,593 INFO L225 Difference]: With dead ends: 20 [2018-10-15 13:12:30,593 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 13:12:30,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:12:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 13:12:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 13:12:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 13:12:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 13:12:30,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-15 13:12:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:30,600 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 13:12:30,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:12:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 13:12:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 13:12:30,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:30,601 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:30,602 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:30,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -804945569, now seen corresponding path program 4 times [2018-10-15 13:12:30,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:30,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:30,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:12:30,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:12:30,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:12:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:30,851 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-10-15 13:12:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:31,042 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 13:12:31,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:12:31,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-15 13:12:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:31,044 INFO L225 Difference]: With dead ends: 22 [2018-10-15 13:12:31,044 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 13:12:31,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:12:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 13:12:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 13:12:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:12:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:12:31,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-15 13:12:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:31,049 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:12:31,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:12:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:12:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:12:31,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:31,050 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:31,050 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:31,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 133934877, now seen corresponding path program 5 times [2018-10-15 13:12:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:31,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:31,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:12:31,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:12:31,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:12:31,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:12:31,446 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-10-15 13:12:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:31,755 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:12:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:12:31,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-15 13:12:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:31,756 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:12:31,757 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:12:31,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:12:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:12:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-10-15 13:12:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 13:12:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 13:12:31,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-15 13:12:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:31,761 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 13:12:31,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:12:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 13:12:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 13:12:31,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:31,762 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:31,763 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:31,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 454911323, now seen corresponding path program 6 times [2018-10-15 13:12:31,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:32,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:32,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:12:32,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:12:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:12:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:12:32,253 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-10-15 13:12:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:32,464 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 13:12:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:12:32,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-15 13:12:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:32,466 INFO L225 Difference]: With dead ends: 26 [2018-10-15 13:12:32,466 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 13:12:32,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:12:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 13:12:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 13:12:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 13:12:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 13:12:32,470 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-15 13:12:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:32,471 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 13:12:32,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:12:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 13:12:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:12:32,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:32,472 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:32,472 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:32,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash -324369383, now seen corresponding path program 7 times [2018-10-15 13:12:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:32,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:12:32,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:12:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:12:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:12:32,768 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-10-15 13:12:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:33,043 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 13:12:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:12:33,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-15 13:12:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:33,045 INFO L225 Difference]: With dead ends: 28 [2018-10-15 13:12:33,047 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 13:12:33,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:12:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 13:12:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 13:12:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 13:12:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 13:12:33,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-15 13:12:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:33,054 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 13:12:33,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:12:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 13:12:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:12:33,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:33,055 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:33,055 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:33,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1888818345, now seen corresponding path program 8 times [2018-10-15 13:12:33,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:33,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:33,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:12:33,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:12:33,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:12:33,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:33,496 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-10-15 13:12:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:33,741 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 13:12:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:12:33,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-15 13:12:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:33,743 INFO L225 Difference]: With dead ends: 30 [2018-10-15 13:12:33,744 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 13:12:33,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:12:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 13:12:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-15 13:12:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 13:12:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 13:12:33,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-15 13:12:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:33,749 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 13:12:33,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:12:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 13:12:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:12:33,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:33,750 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:33,750 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:33,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2085717227, now seen corresponding path program 9 times [2018-10-15 13:12:33,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:33,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:33,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:12:33,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:12:33,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:12:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:12:33,964 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-10-15 13:12:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:34,231 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 13:12:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:12:34,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-15 13:12:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:34,237 INFO L225 Difference]: With dead ends: 32 [2018-10-15 13:12:34,237 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 13:12:34,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:12:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 13:12:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 13:12:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:12:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:12:34,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-15 13:12:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:34,247 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:12:34,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:12:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:12:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:12:34,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:34,249 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:34,250 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:34,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1967985491, now seen corresponding path program 10 times [2018-10-15 13:12:34,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:34,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:34,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:12:34,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:12:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:12:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:12:34,605 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-10-15 13:12:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:34,983 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:12:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:12:34,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-15 13:12:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:34,987 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:12:34,988 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:12:34,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:12:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:12:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 13:12:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:12:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 13:12:34,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-15 13:12:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:34,993 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 13:12:34,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:12:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 13:12:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 13:12:34,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:34,995 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:34,995 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:34,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2040960017, now seen corresponding path program 11 times [2018-10-15 13:12:34,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:35,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:35,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:12:35,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:12:35,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:12:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:12:35,418 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-10-15 13:12:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:35,767 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:12:35,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:12:35,768 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-15 13:12:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:35,769 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:12:35,770 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:12:35,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:12:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:12:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-15 13:12:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 13:12:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 13:12:35,776 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-15 13:12:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:35,776 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 13:12:35,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:12:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 13:12:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:12:35,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:35,778 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:35,778 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:35,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:35,778 INFO L82 PathProgramCache]: Analyzing trace with hash -844964529, now seen corresponding path program 12 times [2018-10-15 13:12:35,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:36,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:36,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:12:36,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:12:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:12:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:36,215 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-10-15 13:12:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:36,666 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 13:12:36,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:12:36,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-10-15 13:12:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:36,668 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:12:36,668 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 13:12:36,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:12:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 13:12:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 13:12:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 13:12:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 13:12:36,673 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-15 13:12:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:36,674 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 13:12:36,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:12:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 13:12:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 13:12:36,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:36,675 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:36,675 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:36,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash 330419981, now seen corresponding path program 13 times [2018-10-15 13:12:36,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:37,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:37,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:12:37,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:12:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:12:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:12:37,112 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-10-15 13:12:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:37,647 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 13:12:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:12:37,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-10-15 13:12:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:37,649 INFO L225 Difference]: With dead ends: 40 [2018-10-15 13:12:37,649 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 13:12:37,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:12:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 13:12:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 13:12:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 13:12:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 13:12:37,654 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-15 13:12:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:37,654 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 13:12:37,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:12:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 13:12:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 13:12:37,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:37,655 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:37,655 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:37,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash 298535243, now seen corresponding path program 14 times [2018-10-15 13:12:37,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:37,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:37,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:12:37,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:12:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:12:37,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:12:37,978 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-10-15 13:12:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:38,396 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 13:12:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:12:38,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-10-15 13:12:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:38,397 INFO L225 Difference]: With dead ends: 42 [2018-10-15 13:12:38,398 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 13:12:38,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:12:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 13:12:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-15 13:12:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:12:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:12:38,402 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-15 13:12:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:38,402 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:12:38,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:12:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:12:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:12:38,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:38,403 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:38,404 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:38,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash -277926903, now seen corresponding path program 15 times [2018-10-15 13:12:38,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:38,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:12:38,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:12:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:12:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:12:38,728 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-10-15 13:12:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:39,295 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:12:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:12:39,295 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-10-15 13:12:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:39,296 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:12:39,296 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:12:39,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:12:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:12:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 13:12:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:12:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 13:12:39,301 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-15 13:12:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:39,302 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 13:12:39,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:12:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 13:12:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:12:39,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:39,303 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:39,303 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:39,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash -207268025, now seen corresponding path program 16 times [2018-10-15 13:12:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:39,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:39,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:12:39,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:12:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:12:39,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:12:39,636 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-10-15 13:12:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:40,584 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 13:12:40,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:12:40,585 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-10-15 13:12:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:40,586 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:12:40,586 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:12:40,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:12:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:12:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 13:12:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 13:12:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 13:12:40,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-15 13:12:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:40,591 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 13:12:40,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:12:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 13:12:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 13:12:40,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:40,592 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:40,592 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:40,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1023563003, now seen corresponding path program 17 times [2018-10-15 13:12:40,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:40,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:40,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:12:40,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:12:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:12:40,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:12:40,928 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-10-15 13:12:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:41,912 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 13:12:41,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:12:41,914 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-10-15 13:12:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:41,915 INFO L225 Difference]: With dead ends: 48 [2018-10-15 13:12:41,915 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 13:12:41,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:12:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 13:12:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-15 13:12:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:12:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:12:41,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-15 13:12:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:41,920 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:12:41,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:12:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:12:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:12:41,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:41,921 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:41,921 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:41,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash 495978307, now seen corresponding path program 18 times [2018-10-15 13:12:41,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:43,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:12:43,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:12:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:12:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:12:43,046 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-10-15 13:12:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:43,726 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 13:12:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:12:43,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-10-15 13:12:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:43,728 INFO L225 Difference]: With dead ends: 50 [2018-10-15 13:12:43,728 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 13:12:43,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:12:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 13:12:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 13:12:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 13:12:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 13:12:43,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-15 13:12:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:43,732 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 13:12:43,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:12:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 13:12:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 13:12:43,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:43,734 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:43,734 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:43,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 486296577, now seen corresponding path program 19 times [2018-10-15 13:12:43,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:44,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:44,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:12:44,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:12:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:12:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:12:44,181 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-10-15 13:12:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:44,858 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 13:12:44,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:12:44,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-15 13:12:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:44,859 INFO L225 Difference]: With dead ends: 52 [2018-10-15 13:12:44,859 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 13:12:44,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:12:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 13:12:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 13:12:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:12:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:12:44,866 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-15 13:12:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:44,866 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:12:44,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:12:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:12:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:12:44,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:44,867 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:44,868 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:44,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash -227911361, now seen corresponding path program 20 times [2018-10-15 13:12:44,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:45,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:12:45,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:12:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:12:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:45,385 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-10-15 13:12:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:46,105 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:12:46,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:12:46,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-15 13:12:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:46,107 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:12:46,107 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:12:46,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:12:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:12:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-15 13:12:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:12:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 13:12:46,111 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-15 13:12:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:46,111 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 13:12:46,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:12:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 13:12:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:12:46,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:46,112 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:46,113 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:46,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 613027581, now seen corresponding path program 21 times [2018-10-15 13:12:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:46,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:46,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:12:46,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:12:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:12:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:12:46,949 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-10-15 13:12:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:47,772 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:12:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:12:47,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-10-15 13:12:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:47,775 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:12:47,775 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:12:47,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:12:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:12:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 13:12:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 13:12:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 13:12:47,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-15 13:12:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:47,780 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 13:12:47,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:12:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 13:12:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 13:12:47,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:47,782 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:47,782 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:47,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1301499195, now seen corresponding path program 22 times [2018-10-15 13:12:47,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:12:48,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:12:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:12:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:12:48,252 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-10-15 13:12:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:49,138 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 13:12:49,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:12:49,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-10-15 13:12:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:49,140 INFO L225 Difference]: With dead ends: 58 [2018-10-15 13:12:49,140 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 13:12:49,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:12:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 13:12:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 13:12:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 13:12:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 13:12:49,144 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-15 13:12:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:49,144 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 13:12:49,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:12:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 13:12:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 13:12:49,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:49,145 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:49,146 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1497756665, now seen corresponding path program 23 times [2018-10-15 13:12:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:49,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 13:12:49,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 13:12:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 13:12:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:12:49,795 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-15 13:12:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:50,783 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 13:12:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:12:50,784 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-15 13:12:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:50,785 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:12:50,785 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 13:12:50,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:12:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 13:12:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-15 13:12:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 13:12:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 13:12:50,788 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-15 13:12:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:50,788 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 13:12:50,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 13:12:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 13:12:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 13:12:50,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:50,789 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:50,789 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:50,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1122624311, now seen corresponding path program 24 times [2018-10-15 13:12:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:51,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:51,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:12:51,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:12:51,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:12:51,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:51,389 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-10-15 13:12:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:52,564 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 13:12:52,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:12:52,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-10-15 13:12:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:52,565 INFO L225 Difference]: With dead ends: 62 [2018-10-15 13:12:52,566 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 13:12:52,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:12:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 13:12:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 13:12:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:12:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:12:52,569 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-15 13:12:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:52,569 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:12:52,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:12:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:12:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:12:52,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:52,570 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:52,571 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:52,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1397684981, now seen corresponding path program 25 times [2018-10-15 13:12:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 13:12:54,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 13:12:54,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 13:12:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:12:54,082 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-15 13:12:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:55,187 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:12:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:12:55,188 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-15 13:12:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:55,189 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:12:55,189 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 13:12:55,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:12:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 13:12:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 13:12:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 13:12:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 13:12:55,192 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-15 13:12:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:55,192 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 13:12:55,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 13:12:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 13:12:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 13:12:55,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:55,193 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:55,193 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:55,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -556983501, now seen corresponding path program 26 times [2018-10-15 13:12:55,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:57,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:12:57,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:12:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:12:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:12:57,219 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-10-15 13:12:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:58,407 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 13:12:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:12:58,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-10-15 13:12:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:58,408 INFO L225 Difference]: With dead ends: 66 [2018-10-15 13:12:58,408 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 13:12:58,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:12:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 13:12:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-15 13:12:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:12:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 13:12:58,411 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-15 13:12:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:58,412 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 13:12:58,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:12:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 13:12:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:12:58,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:58,412 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:58,413 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:58,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2092686351, now seen corresponding path program 27 times [2018-10-15 13:12:58,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:12:59,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:12:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:12:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:12:59,515 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-10-15 13:13:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:00,859 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 13:13:00,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:13:00,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-10-15 13:13:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:00,860 INFO L225 Difference]: With dead ends: 68 [2018-10-15 13:13:00,861 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 13:13:00,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:13:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 13:13:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 13:13:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 13:13:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 13:13:00,864 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-15 13:13:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:00,865 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 13:13:00,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:13:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 13:13:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 13:13:00,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:00,866 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:00,866 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:00,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash -434375377, now seen corresponding path program 28 times [2018-10-15 13:13:00,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:01,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:01,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:13:01,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:13:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:13:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:01,567 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-10-15 13:13:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:03,029 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 13:13:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:13:03,029 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-10-15 13:13:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:03,030 INFO L225 Difference]: With dead ends: 70 [2018-10-15 13:13:03,030 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 13:13:03,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 13:13:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 13:13:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 13:13:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 13:13:03,035 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-15 13:13:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:03,035 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 13:13:03,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:13:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 13:13:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 13:13:03,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:03,036 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:03,036 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -230396179, now seen corresponding path program 29 times [2018-10-15 13:13:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:03,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:03,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 13:13:03,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 13:13:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 13:13:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:13:03,653 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-10-15 13:13:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:05,059 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 13:13:05,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:13:05,059 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-10-15 13:13:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:05,060 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:13:05,060 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:13:05,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:13:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:13:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-10-15 13:13:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:13:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 13:13:05,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-15 13:13:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:05,064 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 13:13:05,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 13:13:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 13:13:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:13:05,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:05,065 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:05,065 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:05,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1774882517, now seen corresponding path program 30 times [2018-10-15 13:13:05,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:05,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:13:05,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:13:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:13:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:05,972 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-10-15 13:13:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:08,084 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:13:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:13:08,085 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-10-15 13:13:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:08,086 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:13:08,086 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:13:08,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:13:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 13:13:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 13:13:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 13:13:08,089 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-15 13:13:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:08,089 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 13:13:08,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:13:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 13:13:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 13:13:08,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:08,090 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:08,090 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:08,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 32431081, now seen corresponding path program 31 times [2018-10-15 13:13:08,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:09,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:09,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 13:13:09,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 13:13:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 13:13:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:13:09,890 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-10-15 13:13:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:12,446 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 13:13:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:13:12,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-10-15 13:13:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:12,448 INFO L225 Difference]: With dead ends: 76 [2018-10-15 13:13:12,448 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 13:13:12,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:13:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 13:13:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 13:13:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 13:13:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 13:13:12,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-15 13:13:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:12,452 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 13:13:12,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 13:13:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 13:13:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 13:13:12,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:12,453 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:12,453 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:12,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1694011175, now seen corresponding path program 32 times [2018-10-15 13:13:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:13:14,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:13:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:13:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:14,035 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-10-15 13:13:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:15,665 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 13:13:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:13:15,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-10-15 13:13:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:15,667 INFO L225 Difference]: With dead ends: 78 [2018-10-15 13:13:15,667 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 13:13:15,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 13:13:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-15 13:13:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 13:13:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-15 13:13:15,670 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-15 13:13:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:15,670 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-15 13:13:15,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:13:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-15 13:13:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 13:13:15,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:15,671 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:15,671 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:15,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash 744647397, now seen corresponding path program 33 times [2018-10-15 13:13:15,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:13:16,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:13:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:13:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:13:16,579 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-10-15 13:13:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:18,508 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-15 13:13:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:13:18,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-10-15 13:13:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:18,510 INFO L225 Difference]: With dead ends: 80 [2018-10-15 13:13:18,510 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 13:13:18,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:13:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 13:13:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 13:13:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:13:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 13:13:18,513 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-15 13:13:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:18,513 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 13:13:18,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:13:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 13:13:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:13:18,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:18,514 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:18,515 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:18,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1060876509, now seen corresponding path program 34 times [2018-10-15 13:13:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:13:19,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:13:19,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:13:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:19,568 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-10-15 13:13:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:21,387 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 13:13:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:13:21,391 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-10-15 13:13:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:21,392 INFO L225 Difference]: With dead ends: 82 [2018-10-15 13:13:21,392 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 13:13:21,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 13:13:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 13:13:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 13:13:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 13:13:21,394 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-15 13:13:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:21,395 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 13:13:21,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:13:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 13:13:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 13:13:21,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:21,396 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:21,396 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:21,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1002562591, now seen corresponding path program 35 times [2018-10-15 13:13:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:23,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:13:23,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:13:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:13:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:13:23,107 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-10-15 13:13:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:25,034 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:13:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:13:25,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-10-15 13:13:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:25,036 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:13:25,036 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:13:25,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:13:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:13:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-10-15 13:13:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 13:13:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 13:13:25,039 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-15 13:13:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:25,039 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 13:13:25,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:13:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 13:13:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:13:25,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:25,040 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:25,040 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:25,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash -797462241, now seen corresponding path program 36 times [2018-10-15 13:13:25,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:26,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:26,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:13:26,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:13:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:13:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:26,534 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-10-15 13:13:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:28,665 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 13:13:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:13:28,666 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-10-15 13:13:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:28,667 INFO L225 Difference]: With dead ends: 86 [2018-10-15 13:13:28,667 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 13:13:28,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 13:13:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 13:13:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 13:13:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 13:13:28,671 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-15 13:13:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:28,671 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 13:13:28,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:13:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 13:13:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 13:13:28,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:28,672 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:28,672 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:28,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1264521507, now seen corresponding path program 37 times [2018-10-15 13:13:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:29,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:29,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 13:13:29,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 13:13:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 13:13:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:13:29,599 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-10-15 13:13:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:31,750 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 13:13:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:13:31,750 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-10-15 13:13:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:31,751 INFO L225 Difference]: With dead ends: 88 [2018-10-15 13:13:31,752 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 13:13:31,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:13:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 13:13:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 13:13:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 13:13:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 13:13:31,755 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-15 13:13:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:31,756 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 13:13:31,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 13:13:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 13:13:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 13:13:31,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:31,757 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:31,757 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:31,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash 863089947, now seen corresponding path program 38 times [2018-10-15 13:13:31,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:33,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:33,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:13:33,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:13:33,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:13:33,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:13:33,152 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-10-15 13:13:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:35,395 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 13:13:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:13:35,396 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-10-15 13:13:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:35,397 INFO L225 Difference]: With dead ends: 90 [2018-10-15 13:13:35,397 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:13:35,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:13:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:13:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-15 13:13:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 13:13:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-15 13:13:35,400 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-15 13:13:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:35,400 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-15 13:13:35,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:13:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-15 13:13:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:13:35,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:35,401 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:35,401 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:35,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1093264345, now seen corresponding path program 39 times [2018-10-15 13:13:35,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:36,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:13:36,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:13:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:13:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:13:36,348 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-10-15 13:13:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:38,911 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 13:13:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:13:38,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-10-15 13:13:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:38,912 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:13:38,912 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 13:13:38,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:13:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 13:13:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 13:13:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:13:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:13:38,917 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-15 13:13:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:38,917 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:13:38,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:13:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:13:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:13:38,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:38,918 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:38,918 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:38,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1047438569, now seen corresponding path program 40 times [2018-10-15 13:13:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:40,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:40,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:13:40,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:13:40,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:13:40,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:13:40,501 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-10-15 13:13:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:43,142 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 13:13:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:13:43,142 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-10-15 13:13:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:43,143 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:13:43,143 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 13:13:43,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:13:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 13:13:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 13:13:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 13:13:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 13:13:43,147 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-15 13:13:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:43,148 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 13:13:43,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:13:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 13:13:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 13:13:43,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:43,149 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:43,149 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -973604139, now seen corresponding path program 41 times [2018-10-15 13:13:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:44,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:44,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 13:13:44,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 13:13:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 13:13:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:13:44,204 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2018-10-15 13:13:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:46,777 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 13:13:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:13:46,778 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-10-15 13:13:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:46,779 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:13:46,779 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 13:13:46,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:13:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 13:13:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-10-15 13:13:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 13:13:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 13:13:46,783 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-15 13:13:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:46,784 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 13:13:46,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 13:13:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 13:13:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:13:46,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,784 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:46,785 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1261806355, now seen corresponding path program 42 times [2018-10-15 13:13:46,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:13:47,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:13:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:13:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:13:47,816 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-10-15 13:13:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:50,696 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 13:13:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:13:50,696 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-10-15 13:13:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:50,697 INFO L225 Difference]: With dead ends: 98 [2018-10-15 13:13:50,698 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 13:13:50,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:13:50,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 13:13:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 13:13:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:13:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 13:13:50,701 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-15 13:13:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:50,702 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 13:13:50,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:13:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 13:13:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:13:50,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:50,702 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:50,702 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:50,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2007643089, now seen corresponding path program 43 times [2018-10-15 13:13:50,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:51,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:51,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 13:13:51,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 13:13:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 13:13:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:13:51,917 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2018-10-15 13:13:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:54,858 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 13:13:54,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:13:54,858 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-10-15 13:13:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:54,859 INFO L225 Difference]: With dead ends: 100 [2018-10-15 13:13:54,859 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 13:13:54,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:13:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 13:13:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 13:13:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 13:13:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 13:13:54,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-15 13:13:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:54,863 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 13:13:54,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 13:13:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 13:13:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 13:13:54,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:54,864 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:54,864 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:54,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:54,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1497206031, now seen corresponding path program 44 times [2018-10-15 13:13:54,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:56,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:56,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:13:56,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:13:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:13:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:13:56,332 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-10-15 13:13:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,462 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 13:13:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:13:59,462 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-10-15 13:13:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,463 INFO L225 Difference]: With dead ends: 102 [2018-10-15 13:13:59,463 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:13:59,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:13:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:13:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-15 13:13:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:13:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:13:59,467 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-15 13:13:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,467 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:13:59,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:13:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:13:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:13:59,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,468 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,468 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash 593465037, now seen corresponding path program 45 times [2018-10-15 13:13:59,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:00,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:14:00,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:14:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:14:00,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:00,711 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2018-10-15 13:14:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:04,064 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:14:04,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:14:04,065 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-10-15 13:14:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:04,066 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:14:04,066 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:14:04,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:14:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 13:14:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 13:14:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 13:14:04,069 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-15 13:14:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:04,070 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 13:14:04,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:14:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 13:14:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 13:14:04,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:04,071 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:04,071 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:04,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash -318236405, now seen corresponding path program 46 times [2018-10-15 13:14:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:05,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:05,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:14:05,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:14:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:14:05,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:05,493 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-10-15 13:14:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:08,938 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 13:14:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:14:08,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-10-15 13:14:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:08,940 INFO L225 Difference]: With dead ends: 106 [2018-10-15 13:14:08,940 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:14:08,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:14:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 13:14:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 13:14:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 13:14:08,944 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-15 13:14:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:08,944 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 13:14:08,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:14:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 13:14:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 13:14:08,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:08,945 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:08,945 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:08,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -289993783, now seen corresponding path program 47 times [2018-10-15 13:14:08,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 13:14:10,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 13:14:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 13:14:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:10,279 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2018-10-15 13:14:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:13,840 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 13:14:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:14:13,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-10-15 13:14:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:13,842 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:14:13,842 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 13:14:13,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 13:14:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-10-15 13:14:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 13:14:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 13:14:13,848 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-15 13:14:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:13,849 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 13:14:13,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 13:14:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 13:14:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:13,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:13,851 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:13,851 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:13,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1081362183, now seen corresponding path program 48 times [2018-10-15 13:14:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:15,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:15,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:14:15,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:14:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:14:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:15,596 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-10-15 13:14:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:19,237 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 13:14:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:14:19,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-10-15 13:14:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:19,238 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:14:19,238 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 13:14:19,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 13:14:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 13:14:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 13:14:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 13:14:19,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-15 13:14:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:19,243 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 13:14:19,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:14:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 13:14:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 13:14:19,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:19,244 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:19,244 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:19,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 399485637, now seen corresponding path program 49 times [2018-10-15 13:14:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 13:14:20,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 13:14:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 13:14:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:14:20,911 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2018-10-15 13:14:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:24,638 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 13:14:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:14:24,638 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2018-10-15 13:14:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:24,640 INFO L225 Difference]: With dead ends: 112 [2018-10-15 13:14:24,640 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 13:14:24,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:14:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 13:14:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 13:14:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 13:14:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 13:14:24,644 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-15 13:14:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:24,644 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 13:14:24,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 13:14:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 13:14:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 13:14:24,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:24,645 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:24,645 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:24,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2048846077, now seen corresponding path program 50 times [2018-10-15 13:14:24,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:26,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:26,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:14:26,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:14:26,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:14:26,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:26,517 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2018-10-15 13:14:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,396 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:14:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:14:30,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2018-10-15 13:14:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,398 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:14:30,398 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:14:30,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:14:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-15 13:14:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 13:14:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 13:14:30,400 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-15 13:14:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,401 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 13:14:30,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:14:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 13:14:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:14:30,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,402 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:30,402 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1253545023, now seen corresponding path program 51 times [2018-10-15 13:14:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:31,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:31,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:14:31,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:14:31,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:14:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:14:31,884 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2018-10-15 13:14:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:36,336 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 13:14:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:14:36,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2018-10-15 13:14:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:36,337 INFO L225 Difference]: With dead ends: 116 [2018-10-15 13:14:36,338 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 13:14:36,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:14:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 13:14:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 13:14:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:14:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 13:14:36,341 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-15 13:14:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:36,342 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 13:14:36,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:14:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 13:14:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:14:36,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:36,343 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:36,343 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:36,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1473410817, now seen corresponding path program 52 times [2018-10-15 13:14:36,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:14:37,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:14:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:14:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:37,972 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2018-10-15 13:14:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:42,117 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 13:14:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:14:42,117 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2018-10-15 13:14:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:42,118 INFO L225 Difference]: With dead ends: 118 [2018-10-15 13:14:42,118 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 13:14:42,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 13:14:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 13:14:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 13:14:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 13:14:42,122 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-15 13:14:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:42,123 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 13:14:42,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:14:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 13:14:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 13:14:42,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:42,124 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:42,124 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:42,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1983925949, now seen corresponding path program 53 times [2018-10-15 13:14:42,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 13:14:43,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 13:14:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 13:14:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:14:43,691 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2018-10-15 13:14:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:48,043 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 13:14:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:14:48,043 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2018-10-15 13:14:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:48,044 INFO L225 Difference]: With dead ends: 120 [2018-10-15 13:14:48,044 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 13:14:48,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:14:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 13:14:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-10-15 13:14:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:14:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 13:14:48,047 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-15 13:14:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:48,047 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 13:14:48,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 13:14:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 13:14:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:14:48,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:48,048 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:48,049 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:48,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash 179870971, now seen corresponding path program 54 times [2018-10-15 13:14:48,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:14:50,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:14:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:14:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:14:50,082 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2018-10-15 13:14:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:54,374 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 13:14:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:14:54,375 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2018-10-15 13:14:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:54,375 INFO L225 Difference]: With dead ends: 122 [2018-10-15 13:14:54,376 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 13:14:54,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:14:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 13:14:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 13:14:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:14:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:14:54,379 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-15 13:14:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:54,380 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:14:54,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:14:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:14:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:14:54,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:54,381 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:54,381 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:54,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1649824697, now seen corresponding path program 55 times [2018-10-15 13:14:54,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:56,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:56,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 13:14:56,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 13:14:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 13:14:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:14:56,126 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2018-10-15 13:15:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:00,916 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 13:15:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:15:00,917 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2018-10-15 13:15:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:00,918 INFO L225 Difference]: With dead ends: 124 [2018-10-15 13:15:00,918 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:15:00,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:15:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:15:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 13:15:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 13:15:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 13:15:00,921 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-15 13:15:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:00,921 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 13:15:00,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 13:15:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 13:15:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 13:15:00,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:00,922 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:00,923 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:00,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1231114999, now seen corresponding path program 56 times [2018-10-15 13:15:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:02,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:02,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:15:02,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:15:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:15:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:02,684 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2018-10-15 13:15:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:07,530 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:15:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:15:07,530 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2018-10-15 13:15:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:07,531 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:15:07,531 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:15:07,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:15:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-15 13:15:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 13:15:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 13:15:07,534 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-15 13:15:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:07,535 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 13:15:07,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:15:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 13:15:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:07,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:07,536 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:07,536 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:07,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1716946251, now seen corresponding path program 57 times [2018-10-15 13:15:07,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:15:09,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:15:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:15:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:15:09,374 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2018-10-15 13:15:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:14,277 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 13:15:14,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:15:14,278 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2018-10-15 13:15:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:14,279 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:15:14,279 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:15:14,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:15:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:15:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 13:15:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 13:15:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 13:15:14,281 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-15 13:15:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:14,282 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 13:15:14,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:15:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 13:15:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 13:15:14,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:14,282 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:14,283 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:14,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash -125392141, now seen corresponding path program 58 times [2018-10-15 13:15:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:15:16,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:15:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:15:16,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:15:16,283 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2018-10-15 13:15:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:21,384 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 13:15:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:15:21,385 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2018-10-15 13:15:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:21,386 INFO L225 Difference]: With dead ends: 130 [2018-10-15 13:15:21,386 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 13:15:21,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:15:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 13:15:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 13:15:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 13:15:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 13:15:21,389 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-15 13:15:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:21,390 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 13:15:21,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:15:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 13:15:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 13:15:21,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:21,390 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:21,391 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:21,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash 349750193, now seen corresponding path program 59 times [2018-10-15 13:15:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:23,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 13:15:23,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 13:15:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 13:15:23,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:15:23,704 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2018-10-15 13:15:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:28,922 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 13:15:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:15:28,922 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2018-10-15 13:15:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:28,923 INFO L225 Difference]: With dead ends: 132 [2018-10-15 13:15:28,923 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 13:15:28,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:15:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 13:15:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-15 13:15:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:15:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 13:15:28,926 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-15 13:15:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:28,927 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 13:15:28,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 13:15:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 13:15:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:28,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:28,928 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:28,928 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:28,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1694999791, now seen corresponding path program 60 times [2018-10-15 13:15:28,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:31,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:31,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:15:31,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:15:31,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:15:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:15:31,928 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2018-10-15 13:15:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:37,283 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 13:15:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:15:37,284 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2018-10-15 13:15:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:37,285 INFO L225 Difference]: With dead ends: 134 [2018-10-15 13:15:37,285 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:15:37,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:15:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:15:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 13:15:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:15:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 13:15:37,289 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-15 13:15:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:37,289 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 13:15:37,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:15:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 13:15:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:15:37,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:37,290 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:37,290 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:37,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1694707373, now seen corresponding path program 61 times [2018-10-15 13:15:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:39,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:39,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 13:15:39,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 13:15:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 13:15:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:15:39,292 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2018-10-15 13:15:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:44,814 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 13:15:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:15:44,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2018-10-15 13:15:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:44,815 INFO L225 Difference]: With dead ends: 136 [2018-10-15 13:15:44,816 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 13:15:44,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:15:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 13:15:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 13:15:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 13:15:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 13:15:44,819 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-15 13:15:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:44,819 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 13:15:44,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 13:15:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 13:15:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 13:15:44,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:44,820 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:44,820 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1413693675, now seen corresponding path program 62 times [2018-10-15 13:15:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:47,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:47,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:15:47,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:15:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:15:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:15:47,208 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2018-10-15 13:15:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:52,861 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 13:15:52,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:15:52,862 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2018-10-15 13:15:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:52,863 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:15:52,863 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:15:52,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:15:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:15:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-15 13:15:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 13:15:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 13:15:52,866 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-15 13:15:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:52,867 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 13:15:52,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:15:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 13:15:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:52,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:52,867 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:52,868 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:52,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:52,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1942469545, now seen corresponding path program 63 times [2018-10-15 13:15:52,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:55,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:15:55,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:15:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:15:55,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:15:55,005 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2018-10-15 13:16:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:00,906 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-15 13:16:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:16:00,907 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2018-10-15 13:16:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:00,908 INFO L225 Difference]: With dead ends: 140 [2018-10-15 13:16:00,908 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 13:16:00,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:16:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 13:16:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 13:16:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 13:16:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 13:16:00,911 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-15 13:16:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:00,911 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 13:16:00,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:16:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 13:16:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 13:16:00,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:00,912 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:00,913 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:00,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1005027609, now seen corresponding path program 64 times [2018-10-15 13:16:00,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:03,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:03,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:16:03,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:16:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:16:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:16:03,314 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2018-10-15 13:16:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:09,357 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 13:16:09,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:16:09,358 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2018-10-15 13:16:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:09,359 INFO L225 Difference]: With dead ends: 142 [2018-10-15 13:16:09,359 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 13:16:09,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:16:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 13:16:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 13:16:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 13:16:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 13:16:09,362 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-15 13:16:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:09,362 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 13:16:09,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:16:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 13:16:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 13:16:09,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:09,363 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:09,363 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:09,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1128622757, now seen corresponding path program 65 times [2018-10-15 13:16:09,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 13:16:11,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 13:16:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 13:16:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:16:11,859 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2018-10-15 13:16:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:18,141 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:16:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:16:18,141 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2018-10-15 13:16:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:18,142 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:16:18,142 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:16:18,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:16:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:16:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-15 13:16:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 13:16:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 13:16:18,145 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-15 13:16:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:18,145 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 13:16:18,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 13:16:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 13:16:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:18,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:18,146 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:18,146 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:18,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1427743005, now seen corresponding path program 66 times [2018-10-15 13:16:18,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:20,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:16:20,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:16:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:16:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:16:20,330 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2018-10-15 13:16:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:27,035 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 13:16:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:16:27,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2018-10-15 13:16:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:27,037 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:16:27,037 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 13:16:27,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:16:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 13:16:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 13:16:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 13:16:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 13:16:27,041 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-15 13:16:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:27,041 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 13:16:27,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:16:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 13:16:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 13:16:27,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:27,042 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:27,042 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:27,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1373946975, now seen corresponding path program 67 times [2018-10-15 13:16:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:29,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:29,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 13:16:29,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 13:16:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 13:16:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:16:29,327 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2018-10-15 13:16:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:35,965 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 13:16:35,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:16:35,966 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2018-10-15 13:16:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:35,967 INFO L225 Difference]: With dead ends: 148 [2018-10-15 13:16:35,967 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 13:16:35,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:16:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 13:16:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 13:16:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 13:16:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 13:16:35,971 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-15 13:16:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:35,971 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 13:16:35,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 13:16:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 13:16:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 13:16:35,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:35,972 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:35,972 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:35,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1215569697, now seen corresponding path program 68 times [2018-10-15 13:16:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:38,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:16:38,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:16:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:16:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:16:38,534 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2018-10-15 13:16:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:45,460 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 13:16:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:16:45,460 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2018-10-15 13:16:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:45,462 INFO L225 Difference]: With dead ends: 150 [2018-10-15 13:16:45,462 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 13:16:45,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:16:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 13:16:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-15 13:16:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 13:16:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 13:16:45,466 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-15 13:16:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:45,466 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 13:16:45,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:16:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 13:16:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:45,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:45,467 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:45,467 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:45,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 661139101, now seen corresponding path program 69 times [2018-10-15 13:16:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:48,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:48,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:16:48,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:16:48,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:16:48,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:16:48,142 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2018-10-15 13:16:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:55,206 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 13:16:55,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:16:55,206 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2018-10-15 13:16:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:55,207 INFO L225 Difference]: With dead ends: 152 [2018-10-15 13:16:55,207 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 13:16:55,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:16:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 13:16:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 13:16:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:16:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:16:55,210 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-15 13:16:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:55,211 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:16:55,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:16:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:16:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:16:55,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:55,212 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:55,212 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:55,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 292029659, now seen corresponding path program 70 times [2018-10-15 13:16:55,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:16:58,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:16:58,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:16:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:16:58,314 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2018-10-15 13:17:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:05,527 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 13:17:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:17:05,528 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2018-10-15 13:17:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:05,529 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:17:05,529 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 13:17:05,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:17:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 13:17:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 13:17:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 13:17:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 13:17:05,532 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-15 13:17:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:05,532 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 13:17:05,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:17:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 13:17:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 13:17:05,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:05,533 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:05,533 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:05,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2060141465, now seen corresponding path program 71 times [2018-10-15 13:17:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:08,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 13:17:08,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 13:17:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 13:17:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:17:08,414 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2018-10-15 13:17:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:15,722 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 13:17:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:17:15,723 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2018-10-15 13:17:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:15,724 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:17:15,724 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:17:15,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:17:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:17:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-10-15 13:17:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 13:17:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 13:17:15,728 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-15 13:17:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:15,728 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 13:17:15,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 13:17:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 13:17:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:17:15,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:15,729 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:15,730 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:15,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 408537815, now seen corresponding path program 72 times [2018-10-15 13:17:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:18,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:18,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:17:18,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:17:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:17:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:17:18,613 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2018-10-15 13:17:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:26,100 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 13:17:26,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:17:26,100 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2018-10-15 13:17:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:26,102 INFO L225 Difference]: With dead ends: 158 [2018-10-15 13:17:26,102 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 13:17:26,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:17:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 13:17:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 13:17:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 13:17:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 13:17:26,105 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-15 13:17:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:26,105 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 13:17:26,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:17:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 13:17:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 13:17:26,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:26,106 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:26,106 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:26,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:26,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1939637611, now seen corresponding path program 73 times [2018-10-15 13:17:26,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:28,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:28,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 13:17:28,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 13:17:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 13:17:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:17:28,960 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2018-10-15 13:17:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:36,699 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 13:17:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:17:36,700 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2018-10-15 13:17:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:36,701 INFO L225 Difference]: With dead ends: 160 [2018-10-15 13:17:36,701 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 13:17:36,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:17:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 13:17:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 13:17:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 13:17:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 13:17:36,704 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-15 13:17:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:36,705 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 13:17:36,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 13:17:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 13:17:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 13:17:36,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:36,705 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:36,706 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:36,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash 616575699, now seen corresponding path program 74 times [2018-10-15 13:17:36,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:39,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:17:39,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:17:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:17:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:17:39,638 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2018-10-15 13:17:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:47,565 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 13:17:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:17:47,565 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2018-10-15 13:17:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:47,566 INFO L225 Difference]: With dead ends: 162 [2018-10-15 13:17:47,566 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:17:47,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:17:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:17:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-15 13:17:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:17:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:17:47,570 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-15 13:17:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:47,570 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:17:47,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:17:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:17:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:47,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:47,572 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:47,572 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:47,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 416273297, now seen corresponding path program 75 times [2018-10-15 13:17:47,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:50,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:50,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:17:50,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:17:50,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:17:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:17:50,662 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2018-10-15 13:17:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:58,917 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:17:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:17:58,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2018-10-15 13:17:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:58,918 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:17:58,918 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:17:58,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:17:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:17:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 13:17:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 13:17:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 13:17:58,922 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-15 13:17:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:58,922 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 13:17:58,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:17:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 13:17:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 13:17:58,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:58,923 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:58,923 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1199193295, now seen corresponding path program 76 times [2018-10-15 13:17:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:18:01,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:18:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:18:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:18:01,872 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2018-10-15 13:18:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:10,378 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 13:18:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:18:10,379 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2018-10-15 13:18:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:10,380 INFO L225 Difference]: With dead ends: 166 [2018-10-15 13:18:10,380 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 13:18:10,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:18:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 13:18:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 13:18:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 13:18:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 13:18:10,383 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-15 13:18:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:10,383 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 13:18:10,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:18:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 13:18:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 13:18:10,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:10,384 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:10,384 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:10,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1966034573, now seen corresponding path program 77 times [2018-10-15 13:18:10,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:13,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:13,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 13:18:13,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 13:18:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 13:18:13,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:18:13,304 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2018-10-15 13:18:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:21,987 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 13:18:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:18:21,987 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2018-10-15 13:18:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:21,988 INFO L225 Difference]: With dead ends: 168 [2018-10-15 13:18:21,988 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 13:18:21,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:18:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 13:18:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-10-15 13:18:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 13:18:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 13:18:21,991 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-15 13:18:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:21,992 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 13:18:21,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 13:18:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 13:18:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:18:21,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:21,992 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:21,993 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:21,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash 166127819, now seen corresponding path program 78 times [2018-10-15 13:18:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:18:25,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:18:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:18:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:18:25,249 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2018-10-15 13:18:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:34,073 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 13:18:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:18:34,074 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2018-10-15 13:18:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:34,075 INFO L225 Difference]: With dead ends: 170 [2018-10-15 13:18:34,075 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:18:34,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:18:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:18:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 13:18:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 13:18:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 13:18:34,078 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-15 13:18:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:34,078 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 13:18:34,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:18:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 13:18:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 13:18:34,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:34,079 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:34,079 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:34,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1327557513, now seen corresponding path program 79 times [2018-10-15 13:18:34,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:37,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 13:18:37,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 13:18:37,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 13:18:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:18:37,478 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2018-10-15 13:18:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:46,614 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 13:18:46,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:18:46,614 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2018-10-15 13:18:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:46,615 INFO L225 Difference]: With dead ends: 172 [2018-10-15 13:18:46,615 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 13:18:46,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:18:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 13:18:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 13:18:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 13:18:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 13:18:46,618 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-15 13:18:46,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:46,619 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 13:18:46,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 13:18:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 13:18:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 13:18:46,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:46,619 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:46,620 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:46,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 769996487, now seen corresponding path program 80 times [2018-10-15 13:18:46,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:49,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:49,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:18:49,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:18:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:18:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:18:49,762 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2018-10-15 13:18:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:59,174 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 13:18:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:18:59,180 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2018-10-15 13:18:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:59,181 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:18:59,181 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:18:59,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:18:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:18:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-15 13:18:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 13:18:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 13:18:59,183 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-15 13:18:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:59,184 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 13:18:59,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:18:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 13:18:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:59,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:59,185 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:59,185 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:59,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1824762501, now seen corresponding path program 81 times [2018-10-15 13:18:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:19:02,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:19:02,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:19:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:19:02,593 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2018-10-15 13:19:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:12,214 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 13:19:12,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:19:12,215 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2018-10-15 13:19:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:12,216 INFO L225 Difference]: With dead ends: 176 [2018-10-15 13:19:12,216 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 13:19:12,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:19:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 13:19:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 13:19:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 13:19:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 13:19:12,219 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-15 13:19:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:12,220 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 13:19:12,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:19:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 13:19:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 13:19:12,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:12,221 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:12,221 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:12,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1842620099, now seen corresponding path program 82 times [2018-10-15 13:19:12,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:16,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:16,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:19:16,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:19:16,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:19:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:19:16,022 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2018-10-15 13:19:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:25,884 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 13:19:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:19:25,884 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2018-10-15 13:19:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:25,885 INFO L225 Difference]: With dead ends: 178 [2018-10-15 13:19:25,886 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 13:19:25,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:19:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 13:19:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 13:19:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 13:19:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 13:19:25,888 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-15 13:19:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:25,888 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 13:19:25,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:19:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 13:19:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 13:19:25,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:25,890 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:25,890 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:25,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1823902593, now seen corresponding path program 83 times [2018-10-15 13:19:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:29,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:29,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 13:19:29,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 13:19:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 13:19:29,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:19:29,362 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2018-10-15 13:19:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:39,347 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 13:19:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:19:39,347 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2018-10-15 13:19:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:39,349 INFO L225 Difference]: With dead ends: 180 [2018-10-15 13:19:39,349 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 13:19:39,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:19:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 13:19:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-10-15 13:19:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 13:19:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 13:19:39,351 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-15 13:19:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:39,352 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 13:19:39,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 13:19:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 13:19:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:19:39,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:39,352 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:39,353 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:39,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1016248511, now seen corresponding path program 84 times [2018-10-15 13:19:39,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:43,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:43,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:19:43,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:19:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:19:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:19:43,096 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2018-10-15 13:19:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:53,375 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 13:19:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:19:53,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2018-10-15 13:19:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:53,376 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:19:53,377 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 13:19:53,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:19:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 13:19:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 13:19:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:19:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 13:19:53,380 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-15 13:19:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:53,380 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 13:19:53,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:19:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 13:19:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:19:53,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:53,382 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:53,382 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:53,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2045211011, now seen corresponding path program 85 times [2018-10-15 13:19:53,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:57,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:57,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 13:19:57,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 13:19:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 13:19:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:19:57,111 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2018-10-15 13:20:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:07,626 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 13:20:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:20:07,626 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2018-10-15 13:20:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:07,627 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:20:07,628 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:20:07,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:20:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:20:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 13:20:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 13:20:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 13:20:07,631 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-15 13:20:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:07,632 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 13:20:07,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 13:20:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 13:20:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 13:20:07,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:07,633 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:07,633 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2055213893, now seen corresponding path program 86 times [2018-10-15 13:20:07,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:11,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:11,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:20:11,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:20:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:20:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:20:11,303 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2018-10-15 13:20:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:22,059 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-15 13:20:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:20:22,060 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2018-10-15 13:20:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:22,060 INFO L225 Difference]: With dead ends: 186 [2018-10-15 13:20:22,061 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 13:20:22,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:20:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 13:20:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-15 13:20:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 13:20:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 13:20:22,063 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-15 13:20:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:22,064 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 13:20:22,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:20:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 13:20:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:20:22,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:22,065 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:22,065 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:22,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1216918393, now seen corresponding path program 87 times [2018-10-15 13:20:22,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:25,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:25,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:20:25,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:20:25,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:20:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:20:25,911 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2018-10-15 13:20:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:36,821 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 13:20:36,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:20:36,822 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2018-10-15 13:20:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:36,823 INFO L225 Difference]: With dead ends: 188 [2018-10-15 13:20:36,823 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 13:20:36,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:20:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 13:20:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-10-15 13:20:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:20:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 13:20:36,827 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-10-15 13:20:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:36,827 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 13:20:36,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:20:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 13:20:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:20:36,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:36,828 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:36,828 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:36,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1819984567, now seen corresponding path program 88 times [2018-10-15 13:20:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:40,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:40,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:20:40,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:20:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:20:40,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:20:40,784 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2018-10-15 13:20:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:51,837 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 13:20:51,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:20:51,837 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2018-10-15 13:20:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:51,838 INFO L225 Difference]: With dead ends: 190 [2018-10-15 13:20:51,839 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 13:20:51,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:20:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 13:20:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-15 13:20:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 13:20:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-15 13:20:51,842 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-10-15 13:20:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:51,843 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-15 13:20:51,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:20:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-15 13:20:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 13:20:51,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:51,844 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:51,844 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:51,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1545992821, now seen corresponding path program 89 times [2018-10-15 13:20:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:55,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 13:20:55,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 13:20:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 13:20:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:20:55,766 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states.