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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_true-unreach-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:34:52,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:34:52,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:34:52,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:34:52,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:34:52,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:34:52,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:34:52,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:34:52,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:34:52,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:34:52,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:34:52,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:34:52,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:34:52,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:34:52,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:34:52,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:34:52,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:34:52,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:34:52,783 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:34:52,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:34:52,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:34:52,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:34:52,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:34:52,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:34:52,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:34:52,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:34:52,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:34:52,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:34:52,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:34:52,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:34:52,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:34:52,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:34:52,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:34:52,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:34:52,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:34:52,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:34:52,797 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 12:34:52,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:34:52,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:34:52,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:34:52,814 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:34:52,814 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:34:52,815 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:34:52,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:34:52,816 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:34:52,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:34:52,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:34:52,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:34:52,817 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:34:52,817 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:34:52,818 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:34:52,818 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:34:52,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:34:52,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:34:52,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:34:52,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:34:52,891 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:34:52,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:52,892 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/functions_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:34:52,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:34:52,939 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:34:52,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:34:52,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:34:52,940 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:34:52,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/1) ... [2018-10-15 12:34:52,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:34:52,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:34:52,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:34:52,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:34:52,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (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 12:34:53,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:34:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:34:53,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:34:53,347 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:34:53,348 INFO L202 PluginConnector]: Adding new model functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:53 BoogieIcfgContainer [2018-10-15 12:34:53,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:34:53,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:34:53,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:34:53,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:34:53,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:52" (1/2) ... [2018-10-15 12:34:53,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7ab1ed and model type functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:34:53, skipping insertion in model container [2018-10-15 12:34:53,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:34:53" (2/2) ... [2018-10-15 12:34:53,358 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:34:53,390 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:34:53,402 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:34:53,442 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:34:53,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:34:53,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:34:53,485 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:34:53,485 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:34:53,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:34:53,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:34:53,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:34:53,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:34:53,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:34:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-15 12:34:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:34:53,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:53,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:53,517 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:53,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2036427093, now seen corresponding path program 1 times [2018-10-15 12:34:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:53,850 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 12:34:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:34:53,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:34:53,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:34:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:34:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:53,876 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-15 12:34:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:53,949 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-15 12:34:53,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:34:53,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:34:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:53,961 INFO L225 Difference]: With dead ends: 27 [2018-10-15 12:34:53,961 INFO L226 Difference]: Without dead ends: 27 [2018-10-15 12:34:53,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:34:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-15 12:34:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-15 12:34:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 12:34:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 12:34:54,001 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-10-15 12:34:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:54,001 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 12:34:54,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:34:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 12:34:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:34:54,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:54,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:54,003 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:54,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 546142339, now seen corresponding path program 1 times [2018-10-15 12:34:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:54,300 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 12:34:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:34:54,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:34:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:34:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:34:54,306 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-10-15 12:34:54,761 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 12:34:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:54,985 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:34:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:34:54,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-10-15 12:34:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:54,987 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:34:54,987 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:34:54,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:34:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:34:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-10-15 12:34:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:34:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:34:54,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 12:34:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:54,995 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:34:54,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:34:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:34:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:34:54,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:54,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:54,997 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:54,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash -38494955, now seen corresponding path program 2 times [2018-10-15 12:34:54,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:55,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:55,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:34:55,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:34:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:34:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:34:55,907 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 13 states. [2018-10-15 12:34:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:56,701 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:34:56,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:34:56,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-15 12:34:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:56,704 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:34:56,704 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:34:56,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:34:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:34:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 12:34:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:34:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:34:56,712 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 12:34:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:56,712 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:34:56,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:34:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:34:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:34:56,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:56,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:56,715 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:56,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1573356349, now seen corresponding path program 3 times [2018-10-15 12:34:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:57,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:57,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:34:57,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:34:57,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:34:57,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:34:57,438 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 18 states. [2018-10-15 12:34:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:58,835 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:34:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:34:58,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-10-15 12:34:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:58,838 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:34:58,838 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:34:58,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:34:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:34:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-15 12:34:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:34:58,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:34:58,845 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 12:34:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:58,845 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:34:58,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:34:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:34:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:34:58,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:58,847 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:58,848 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:58,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1686790357, now seen corresponding path program 4 times [2018-10-15 12:34:58,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:59,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:34:59,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:34:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:34:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:34:59,270 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 23 states. [2018-10-15 12:35:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,839 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-15 12:35:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:35:00,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-10-15 12:35:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,841 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:35:00,841 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:35:00,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=2703, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:35:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:35:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-15 12:35:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:35:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:35:00,849 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 12:35:00,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,849 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:35:00,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:35:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:35:00,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,851 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,851 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1128460547, now seen corresponding path program 5 times [2018-10-15 12:35:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:35:01,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:35:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:35:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:01,463 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 28 states. [2018-10-15 12:35:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:03,623 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:35:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:35:03,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-10-15 12:35:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:03,624 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:35:03,624 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:35:03,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=333, Invalid=4223, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:35:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:35:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-10-15 12:35:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:35:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:35:03,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 12:35:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:03,633 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:35:03,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:35:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:35:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:35:03,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:03,635 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:03,635 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:03,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1470188395, now seen corresponding path program 6 times [2018-10-15 12:35:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:04,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:04,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:04,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:04,501 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-15 12:35:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,768 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:35:07,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:35:07,771 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-15 12:35:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,772 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:35:07,773 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:35:07,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=399, Invalid=6081, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:35:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:35:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-10-15 12:35:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:35:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 12:35:07,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 12:35:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,781 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 12:35:07,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 12:35:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:35:07,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,783 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,783 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 347133251, now seen corresponding path program 7 times [2018-10-15 12:35:07,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:08,995 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 12:35:08,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:08,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:35:08,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:35:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:35:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:08,997 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2018-10-15 12:35:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:12,280 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 12:35:12,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:35:12,280 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-10-15 12:35:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:12,282 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:35:12,282 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:35:12,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=465, Invalid=8277, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:35:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:35:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 12:35:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:35:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:35:12,291 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 12:35:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:12,292 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:35:12,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:35:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:35:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:35:12,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:12,293 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:12,294 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:12,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1666344875, now seen corresponding path program 8 times [2018-10-15 12:35:12,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:14,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:14,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:14,003 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-10-15 12:35:15,370 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 12:35:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:18,709 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:35:18,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:35:18,711 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-10-15 12:35:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:18,712 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:35:18,712 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:35:18,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=531, Invalid=10811, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:35:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:35:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-10-15 12:35:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 12:35:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 12:35:18,722 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 12:35:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:18,723 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 12:35:18,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:35:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 12:35:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:35:18,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:18,726 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:18,727 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:18,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1854286211, now seen corresponding path program 9 times [2018-10-15 12:35:18,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:35:20,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:35:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:35:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:35:20,305 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 48 states. [2018-10-15 12:35:21,192 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-15 12:35:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:25,519 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:35:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:35:25,520 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-10-15 12:35:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:25,521 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:35:25,521 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:35:25,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=597, Invalid=13683, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:35:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:35:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-10-15 12:35:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:35:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:35:25,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 12:35:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:25,531 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:35:25,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:35:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:35:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:35:25,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:25,533 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:25,533 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:25,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:25,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1376580587, now seen corresponding path program 10 times [2018-10-15 12:35:25,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:27,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:27,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:35:27,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:35:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:35:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:35:27,514 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2018-10-15 12:35:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:33,499 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:35:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:35:33,500 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2018-10-15 12:35:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:33,501 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:35:33,501 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:35:33,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=663, Invalid=16893, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:35:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:35:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-10-15 12:35:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:35:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:35:33,509 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 12:35:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:33,509 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:35:33,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:35:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:35:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:35:33,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:33,511 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:33,512 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:33,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash 801566147, now seen corresponding path program 11 times [2018-10-15 12:35:33,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:35,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:35,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 12:35:35,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 12:35:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 12:35:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:35:35,657 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 58 states. [2018-10-15 12:35:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:42,577 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:35:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:35:42,577 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 109 [2018-10-15 12:35:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:42,579 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:35:42,579 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:35:42,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=729, Invalid=20441, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 12:35:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:35:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-15 12:35:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:35:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:35:42,585 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 12:35:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:42,586 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:35:42,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 12:35:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:35:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:35:42,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:42,588 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:42,588 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:42,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1582624811, now seen corresponding path program 12 times [2018-10-15 12:35:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:44,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:44,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:35:44,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:35:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:35:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:35:44,926 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 63 states. [2018-10-15 12:35:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:52,555 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-15 12:35:52,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:35:52,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 118 [2018-10-15 12:35:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:52,559 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:35:52,559 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:35:52,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=795, Invalid=24327, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:35:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:35:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-10-15 12:35:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:35:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:35:52,571 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 12:35:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:52,571 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:35:52,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:35:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:35:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:35:52,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:52,573 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:52,574 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:52,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash -25746941, now seen corresponding path program 13 times [2018-10-15 12:35:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:55,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:55,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 12:35:55,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 12:35:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 12:35:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:35:55,165 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 68 states. [2018-10-15 12:36:03,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:03,972 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:36:03,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:36:03,973 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 127 [2018-10-15 12:36:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:03,974 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:36:03,974 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:36:03,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=861, Invalid=28551, Unknown=0, NotChecked=0, Total=29412 [2018-10-15 12:36:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:36:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-10-15 12:36:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:36:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:36:03,979 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 12:36:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:03,980 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:36:03,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 12:36:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:36:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:36:03,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:03,982 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:03,982 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:03,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1448190869, now seen corresponding path program 14 times [2018-10-15 12:36:03,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:06,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:06,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:36:06,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:36:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:36:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:36:06,785 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 73 states. [2018-10-15 12:36:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:17,075 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:36:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 12:36:17,075 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 136 [2018-10-15 12:36:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:17,076 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:36:17,076 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:36:17,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6132 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=927, Invalid=33113, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 12:36:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:36:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2018-10-15 12:36:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:36:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:36:17,082 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 12:36:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:17,082 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:36:17,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:36:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:36:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:36:17,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:17,083 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:17,083 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:17,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2019899837, now seen corresponding path program 15 times [2018-10-15 12:36:17,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:20,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:20,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:36:20,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:36:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:36:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:36:20,667 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 78 states. [2018-10-15 12:36:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:32,168 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:36:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 12:36:32,168 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 145 [2018-10-15 12:36:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:32,170 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:36:32,170 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:36:32,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7050 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=993, Invalid=38013, Unknown=0, NotChecked=0, Total=39006 [2018-10-15 12:36:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:36:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-10-15 12:36:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:36:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:36:32,175 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 12:36:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:32,175 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:36:32,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:36:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:36:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:36:32,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:32,177 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:32,177 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:32,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2090678443, now seen corresponding path program 16 times [2018-10-15 12:36:32,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:36,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:36,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:36:36,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:36:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:36:36,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:36:36,082 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 83 states. [2018-10-15 12:36:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:48,949 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-15 12:36:48,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:36:48,949 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 154 [2018-10-15 12:36:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:48,951 INFO L225 Difference]: With dead ends: 171 [2018-10-15 12:36:48,951 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:36:48,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8032 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1059, Invalid=43251, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:36:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:36:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-15 12:36:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:36:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 12:36:48,956 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 12:36:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:48,957 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 12:36:48,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:36:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 12:36:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:36:48,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:48,958 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:48,958 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:48,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1086989693, now seen corresponding path program 17 times [2018-10-15 12:36:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:52,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:52,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 12:36:52,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 12:36:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 12:36:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:36:52,968 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 88 states. [2018-10-15 12:37:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:07,657 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 12:37:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 12:37:07,658 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 163 [2018-10-15 12:37:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:07,660 INFO L225 Difference]: With dead ends: 180 [2018-10-15 12:37:07,660 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:37:07,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9078 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1125, Invalid=48827, Unknown=0, NotChecked=0, Total=49952 [2018-10-15 12:37:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:37:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 12:37:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:37:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:37:07,664 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 12:37:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:07,665 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:37:07,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 12:37:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:37:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:37:07,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:07,666 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:07,666 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2035972885, now seen corresponding path program 18 times [2018-10-15 12:37:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:12,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:12,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:37:12,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:37:12,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:37:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:37:12,428 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 93 states. [2018-10-15 12:37:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:28,662 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:37:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 12:37:28,663 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 172 [2018-10-15 12:37:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:28,665 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:37:28,665 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:37:28,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1191, Invalid=54741, Unknown=0, NotChecked=0, Total=55932 [2018-10-15 12:37:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:37:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-10-15 12:37:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:37:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 12:37:28,670 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 12:37:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:28,670 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 12:37:28,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:37:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 12:37:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:37:28,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:28,672 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:28,672 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:28,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 541875907, now seen corresponding path program 19 times [2018-10-15 12:37:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:33,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:33,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 12:37:33,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 12:37:33,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 12:37:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:37:33,478 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 98 states. [2018-10-15 12:37:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:51,373 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:37:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:37:51,374 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 181 [2018-10-15 12:37:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:51,375 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:37:51,375 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:37:51,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11362 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=1257, Invalid=60993, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 12:37:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:37:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-10-15 12:37:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:37:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:37:51,380 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 12:37:51,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:51,381 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:37:51,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 12:37:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:37:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:37:51,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:51,382 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:51,382 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:51,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -508248363, now seen corresponding path program 20 times [2018-10-15 12:37:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:37:57,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:37:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:37:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:37:57,389 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 103 states. [2018-10-15 12:38:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:16,866 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-15 12:38:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:38:16,866 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 190 [2018-10-15 12:38:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:16,867 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:38:16,867 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:38:16,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12600 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1323, Invalid=67583, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:38:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:38:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-10-15 12:38:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:38:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:38:16,872 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 12:38:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:16,873 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:38:16,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:38:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:38:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:38:16,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:16,874 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:16,874 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:16,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -320711933, now seen corresponding path program 21 times [2018-10-15 12:38:16,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:23,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:23,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:38:23,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:38:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:38:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:38:23,323 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 108 states. [2018-10-15 12:38:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:44,992 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 12:38:44,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-15 12:38:44,996 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 199 [2018-10-15 12:38:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:44,997 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:38:44,997 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:38:44,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13902 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1389, Invalid=74511, Unknown=0, NotChecked=0, Total=75900 [2018-10-15 12:38:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:38:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-15 12:38:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:38:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 12:38:45,003 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 12:38:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:45,003 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 12:38:45,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:38:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 12:38:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:38:45,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:45,005 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:45,005 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:45,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2129498773, now seen corresponding path program 22 times [2018-10-15 12:38:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:38:51,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:38:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:38:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:38:51,237 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 113 states. [2018-10-15 12:39:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:14,915 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:39:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:39:14,916 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 208 [2018-10-15 12:39:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:14,917 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:39:14,917 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:39:14,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1455, Invalid=81777, Unknown=0, NotChecked=0, Total=83232 [2018-10-15 12:39:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:39:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2018-10-15 12:39:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:39:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 12:39:14,924 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 12:39:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:14,925 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 12:39:14,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:39:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 12:39:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 12:39:14,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:14,926 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:14,926 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:14,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1845212995, now seen corresponding path program 23 times [2018-10-15 12:39:14,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:21,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 12:39:21,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 12:39:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 12:39:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:39:21,911 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 118 states. [2018-10-15 12:39:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:48,618 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 12:39:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 12:39:48,619 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 217 [2018-10-15 12:39:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:48,620 INFO L225 Difference]: With dead ends: 234 [2018-10-15 12:39:48,620 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:39:48,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16698 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=1521, Invalid=89381, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 12:39:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:39:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-10-15 12:39:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:39:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:39:48,627 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 12:39:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:48,627 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:39:48,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 12:39:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:39:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:39:48,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:48,629 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:48,629 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:48,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash -327092651, now seen corresponding path program 24 times [2018-10-15 12:39:48,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:49,134 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-10-15 12:39:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:56,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:56,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:39:56,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:39:56,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:39:56,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:39:56,297 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 123 states. [2018-10-15 12:40:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:24,270 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-15 12:40:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-10-15 12:40:24,271 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 226 [2018-10-15 12:40:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:24,272 INFO L225 Difference]: With dead ends: 243 [2018-10-15 12:40:24,273 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 12:40:24,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18192 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=1587, Invalid=97323, Unknown=0, NotChecked=0, Total=98910 [2018-10-15 12:40:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 12:40:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-10-15 12:40:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 12:40:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 12:40:24,280 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 12:40:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:24,280 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 12:40:24,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:40:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 12:40:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 12:40:24,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:24,282 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:24,282 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:24,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 865897347, now seen corresponding path program 25 times [2018-10-15 12:40:24,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:32,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:32,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 12:40:32,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 12:40:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 12:40:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:40:32,704 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 128 states. [2018-10-15 12:41:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:03,226 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 12:41:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:41:03,227 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 235 [2018-10-15 12:41:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:03,228 INFO L225 Difference]: With dead ends: 252 [2018-10-15 12:41:03,228 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 12:41:03,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19750 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=1653, Invalid=105603, Unknown=0, NotChecked=0, Total=107256 [2018-10-15 12:41:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 12:41:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-10-15 12:41:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:41:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 12:41:03,234 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 12:41:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:03,234 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 12:41:03,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 12:41:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 12:41:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 12:41:03,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:03,236 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:03,236 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1592453653, now seen corresponding path program 26 times [2018-10-15 12:41:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:11,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:11,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:41:11,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:41:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:41:11,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:41:11,635 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 133 states. [2018-10-15 12:41:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:44,247 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-15 12:41:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 12:41:44,247 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 244 [2018-10-15 12:41:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:44,248 INFO L225 Difference]: With dead ends: 261 [2018-10-15 12:41:44,248 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 12:41:44,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21372 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1719, Invalid=114221, Unknown=0, NotChecked=0, Total=115940 [2018-10-15 12:41:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 12:41:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2018-10-15 12:41:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:41:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 12:41:44,254 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 12:41:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:44,254 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 12:41:44,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:41:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 12:41:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 12:41:44,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:44,256 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:44,256 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:44,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1422446531, now seen corresponding path program 27 times [2018-10-15 12:41:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:53,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:53,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 12:41:53,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 12:41:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 12:41:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 12:41:53,380 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 138 states. [2018-10-15 12:42:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:28,198 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-15 12:42:28,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 12:42:28,199 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 253 [2018-10-15 12:42:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:28,200 INFO L225 Difference]: With dead ends: 270 [2018-10-15 12:42:28,200 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 12:42:28,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23058 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=1785, Invalid=123177, Unknown=0, NotChecked=0, Total=124962 [2018-10-15 12:42:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 12:42:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 12:42:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 12:42:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 12:42:28,206 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 12:42:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:28,206 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 12:42:28,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 12:42:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 12:42:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 12:42:28,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:28,208 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:28,208 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:28,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1671917013, now seen corresponding path program 28 times [2018-10-15 12:42:28,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3430 backedges. 0 proven. 3430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:38,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:42:38,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:42:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:42:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:42:38,140 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 143 states. [2018-10-15 12:43:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:15,785 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-15 12:43:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-10-15 12:43:15,785 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 262 [2018-10-15 12:43:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:15,786 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:43:15,786 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:43:15,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24808 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=1851, Invalid=132471, Unknown=0, NotChecked=0, Total=134322 [2018-10-15 12:43:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:43:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-10-15 12:43:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 12:43:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 12:43:15,794 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 12:43:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:15,795 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 12:43:15,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:43:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 12:43:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 12:43:15,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:15,796 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:15,796 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:15,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1350269949, now seen corresponding path program 29 times [2018-10-15 12:43:15,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 0 proven. 3683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:27,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:27,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-10-15 12:43:27,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-15 12:43:27,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-15 12:43:27,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 12:43:27,777 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 148 states.