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/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:43:21,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:43:21,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:43:21,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:43:21,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:43:21,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:43:21,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:43:21,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:43:21,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:43:21,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:43:21,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:43:21,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:43:21,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:43:21,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:43:21,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:43:21,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:43:21,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:43:21,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:43:21,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:43:21,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:43:21,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:43:21,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:43:21,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:43:21,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:43:21,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:43:21,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:43:21,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:43:21,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:43:21,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:43:21,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:43:21,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:43:21,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:43:21,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:43:21,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:43:21,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:43:21,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:43:21,918 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:43:21,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:43:21,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:43:21,941 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:43:21,941 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:43:21,941 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:43:21,941 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:43:21,943 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:43:21,943 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:43:21,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:43:21,944 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:43:21,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:43:21,944 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:43:21,945 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:43:21,945 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:43:21,946 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:43:22,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:43:22,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:43:22,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:43:22,033 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:43:22,034 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:43:22,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl [2018-10-15 12:43:22,035 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl' [2018-10-15 12:43:22,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:43:22,119 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:43:22,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:43:22,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:43:22,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:43:22,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/1) ... [2018-10-15 12:43:22,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:43:22,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:43:22,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:43:22,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:43:22,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (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:43:22,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:43:22,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:43:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:43:22,792 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:43:22,793 INFO L202 PluginConnector]: Adding new model simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:22 BoogieIcfgContainer [2018-10-15 12:43:22,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:43:22,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:43:22,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:43:22,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:43:22,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:43:22" (1/2) ... [2018-10-15 12:43:22,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489ac040 and model type simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:43:22, skipping insertion in model container [2018-10-15 12:43:22,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:43:22" (2/2) ... [2018-10-15 12:43:22,801 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i_3.bpl [2018-10-15 12:43:22,810 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:43:22,819 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:43:22,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:43:22,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:43:22,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:43:22,864 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:43:22,864 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:43:22,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:43:22,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:43:22,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:43:22,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:43:22,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:43:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 12:43:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:43:22,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:22,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:22,893 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:22,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash 530674588, now seen corresponding path program 1 times [2018-10-15 12:43:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:23,089 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:43:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:43:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:43:23,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:43:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:43:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:43:23,113 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-10-15 12:43:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:23,216 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:43:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:43:23,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-15 12:43:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:23,231 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:43:23,231 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:43:23,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:43:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:43:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-10-15 12:43:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:43:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:43:23,275 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 28 [2018-10-15 12:43:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:23,275 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:43:23,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:43:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:43:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:43:23,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:23,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:23,278 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:23,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:23,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1327900719, now seen corresponding path program 1 times [2018-10-15 12:43:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:23,460 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:43:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:23,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:43:23,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:43:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:43:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:43:23,464 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-15 12:43:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:23,835 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 12:43:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:43:23,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:43:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:23,838 INFO L225 Difference]: With dead ends: 60 [2018-10-15 12:43:23,838 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 12:43:23,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 12:43:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-10-15 12:43:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:43:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:43:23,847 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 39 [2018-10-15 12:43:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:23,847 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:43:23,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:43:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:43:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:43:23,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:23,850 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:23,850 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:23,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1483401660, now seen corresponding path program 2 times [2018-10-15 12:43:23,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:43:24,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:43:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:43:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:43:24,079 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 7 states. [2018-10-15 12:43:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:24,497 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 12:43:24,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:43:24,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-15 12:43:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:24,500 INFO L225 Difference]: With dead ends: 71 [2018-10-15 12:43:24,500 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 12:43:24,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 12:43:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-10-15 12:43:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 12:43:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-15 12:43:24,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 50 [2018-10-15 12:43:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:24,511 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-15 12:43:24,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:43:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-15 12:43:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 12:43:24,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:24,514 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:24,514 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:24,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash -953442801, now seen corresponding path program 3 times [2018-10-15 12:43:24,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:25,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:25,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:43:25,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:43:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:43:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:43:25,071 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 9 states. [2018-10-15 12:43:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:25,549 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 12:43:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:43:25,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-15 12:43:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:25,552 INFO L225 Difference]: With dead ends: 82 [2018-10-15 12:43:25,552 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 12:43:25,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 12:43:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2018-10-15 12:43:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:43:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:43:25,561 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 61 [2018-10-15 12:43:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:25,562 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:43:25,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:43:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:43:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:43:25,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:25,565 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:25,565 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:25,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash 122357724, now seen corresponding path program 4 times [2018-10-15 12:43:25,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:43:25,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:43:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:43:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:43:25,996 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 11 states. [2018-10-15 12:43:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:26,809 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 12:43:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:43:26,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-10-15 12:43:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:26,812 INFO L225 Difference]: With dead ends: 93 [2018-10-15 12:43:26,813 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 12:43:26,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:43:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 12:43:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-10-15 12:43:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:43:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-15 12:43:26,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 72 [2018-10-15 12:43:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:26,822 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-15 12:43:26,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:43:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-15 12:43:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 12:43:26,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:26,824 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:26,824 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:26,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:26,825 INFO L82 PathProgramCache]: Analyzing trace with hash -740201489, now seen corresponding path program 5 times [2018-10-15 12:43:26,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:27,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:27,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:43:27,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:43:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:43:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:43:27,203 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 13 states. [2018-10-15 12:43:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:27,878 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 12:43:27,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:43:27,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-10-15 12:43:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:27,882 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:43:27,882 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:43:27,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:43:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:43:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2018-10-15 12:43:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:43:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 12:43:27,892 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 83 [2018-10-15 12:43:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:27,892 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 12:43:27,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:43:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 12:43:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:43:27,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:27,895 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:27,895 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:27,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1683213820, now seen corresponding path program 6 times [2018-10-15 12:43:27,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:28,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:28,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:43:28,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:43:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:43:28,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:43:28,486 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 15 states. [2018-10-15 12:43:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:29,280 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-15 12:43:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:43:29,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2018-10-15 12:43:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:29,283 INFO L225 Difference]: With dead ends: 115 [2018-10-15 12:43:29,283 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 12:43:29,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 12:43:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-10-15 12:43:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 12:43:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 12:43:29,292 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 94 [2018-10-15 12:43:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:29,292 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 12:43:29,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:43:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 12:43:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 12:43:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:29,295 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:29,295 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:29,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -571108913, now seen corresponding path program 7 times [2018-10-15 12:43:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:43:29,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:43:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:43:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:43:29,771 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 17 states. [2018-10-15 12:43:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:31,933 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:43:31,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:43:31,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2018-10-15 12:43:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:31,935 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:43:31,936 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:43:31,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:43:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:43:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2018-10-15 12:43:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 12:43:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 12:43:31,944 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 105 [2018-10-15 12:43:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:31,945 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 12:43:31,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:43:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 12:43:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 12:43:31,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:31,947 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:31,947 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:31,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1847016476, now seen corresponding path program 8 times [2018-10-15 12:43:31,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:32,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:32,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:43:32,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:43:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:43:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:43:32,458 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 19 states. [2018-10-15 12:43:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:33,470 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:43:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:43:33,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2018-10-15 12:43:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:33,472 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:43:33,472 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:43:33,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:43:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:43:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-10-15 12:43:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:43:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:43:33,480 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 116 [2018-10-15 12:43:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:33,481 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:43:33,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:43:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:43:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:43:33,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:33,483 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:33,484 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:33,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2006323119, now seen corresponding path program 9 times [2018-10-15 12:43:33,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:33,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:33,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:43:33,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:43:33,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:43:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:43:33,945 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 21 states. [2018-10-15 12:43:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:35,338 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:43:35,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:43:35,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 127 [2018-10-15 12:43:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:35,341 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:43:35,341 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:43:35,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:43:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:43:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-10-15 12:43:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:43:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:43:35,348 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 127 [2018-10-15 12:43:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:35,349 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:43:35,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:43:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:43:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:43:35,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:35,352 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:35,352 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:35,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash 161960508, now seen corresponding path program 10 times [2018-10-15 12:43:35,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:43:36,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:43:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:43:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:43:36,137 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 23 states. [2018-10-15 12:43:38,596 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:43:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:39,294 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:43:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:43:39,295 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 138 [2018-10-15 12:43:39,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:39,296 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:43:39,296 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:43:39,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:43:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:43:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-10-15 12:43:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:43:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:43:39,303 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 138 [2018-10-15 12:43:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:39,303 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:43:39,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:43:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:43:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:43:39,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:39,306 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:39,306 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:39,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1014031759, now seen corresponding path program 11 times [2018-10-15 12:43:39,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:39,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:39,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:43:39,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:43:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:43:39,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:43:39,809 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 25 states. [2018-10-15 12:43:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:41,674 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 12:43:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:43:41,674 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2018-10-15 12:43:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:41,676 INFO L225 Difference]: With dead ends: 170 [2018-10-15 12:43:41,676 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 12:43:41,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:43:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 12:43:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2018-10-15 12:43:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:43:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 12:43:41,681 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 149 [2018-10-15 12:43:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:41,681 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 12:43:41,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:43:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 12:43:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:43:41,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:41,684 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:41,684 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:41,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash 580259932, now seen corresponding path program 12 times [2018-10-15 12:43:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:43,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:43,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:43:43,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:43:43,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:43:43,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:43:43,032 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 27 states. [2018-10-15 12:43:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:44,954 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 12:43:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:43:44,955 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 160 [2018-10-15 12:43:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:44,957 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:43:44,957 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 12:43:44,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:43:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 12:43:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2018-10-15 12:43:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-15 12:43:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-15 12:43:44,963 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 160 [2018-10-15 12:43:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:44,963 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-15 12:43:44,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:43:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-15 12:43:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 12:43:44,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:44,965 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:44,965 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:44,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1313598609, now seen corresponding path program 13 times [2018-10-15 12:43:44,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:46,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:46,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:43:46,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:43:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:43:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:43:46,608 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 29 states. [2018-10-15 12:43:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:48,754 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 12:43:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:43:48,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 171 [2018-10-15 12:43:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:48,757 INFO L225 Difference]: With dead ends: 192 [2018-10-15 12:43:48,757 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 12:43:48,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:43:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 12:43:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 183. [2018-10-15 12:43:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 12:43:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 12:43:48,761 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 171 [2018-10-15 12:43:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:48,762 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 12:43:48,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:43:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 12:43:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 12:43:48,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:48,763 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:48,763 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:48,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash -889883012, now seen corresponding path program 14 times [2018-10-15 12:43:48,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 0 proven. 1015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:43:49,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:43:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:43:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:43:49,594 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 31 states. [2018-10-15 12:43:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:52,178 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-15 12:43:52,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:43:52,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 182 [2018-10-15 12:43:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:52,180 INFO L225 Difference]: With dead ends: 203 [2018-10-15 12:43:52,180 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 12:43:52,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:43:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 12:43:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2018-10-15 12:43:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 12:43:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-15 12:43:52,187 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 182 [2018-10-15 12:43:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:52,187 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-15 12:43:52,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:43:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-15 12:43:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 12:43:52,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:52,189 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:52,189 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:52,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash 638425423, now seen corresponding path program 15 times [2018-10-15 12:43:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:54,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:54,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:43:54,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:43:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:43:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:43:54,035 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 33 states. [2018-10-15 12:43:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:57,252 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 12:43:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:43:57,255 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 193 [2018-10-15 12:43:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:57,256 INFO L225 Difference]: With dead ends: 214 [2018-10-15 12:43:57,257 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 12:43:57,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:43:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 12:43:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2018-10-15 12:43:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:43:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 12:43:57,261 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 193 [2018-10-15 12:43:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:57,262 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 12:43:57,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:43:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 12:43:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 12:43:57,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:57,264 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:57,264 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:57,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:57,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1532462236, now seen corresponding path program 16 times [2018-10-15 12:43:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 1336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:43:58,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:43:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:43:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:43:58,677 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 35 states. [2018-10-15 12:44:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:02,289 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:44:02,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:44:02,290 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 204 [2018-10-15 12:44:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:02,293 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:44:02,293 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:44:02,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:44:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:44:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2018-10-15 12:44:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 12:44:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 12:44:02,299 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 204 [2018-10-15 12:44:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:02,299 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 12:44:02,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:44:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 12:44:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 12:44:02,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:02,301 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:02,301 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:02,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1851033809, now seen corresponding path program 17 times [2018-10-15 12:44:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 1513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:03,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:44:03,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:44:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:44:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:44:03,893 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 37 states. [2018-10-15 12:44:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:07,532 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 12:44:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:44:07,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 215 [2018-10-15 12:44:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:07,535 INFO L225 Difference]: With dead ends: 236 [2018-10-15 12:44:07,535 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 12:44:07,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:44:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 12:44:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2018-10-15 12:44:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:44:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:44:07,541 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 215 [2018-10-15 12:44:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:07,542 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:44:07,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:44:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:44:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:44:07,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:07,543 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:07,543 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:07,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1831978308, now seen corresponding path program 18 times [2018-10-15 12:44:07,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:44:08,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:44:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:44:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:44:08,660 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 39 states. [2018-10-15 12:44:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:12,663 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 12:44:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:44:12,664 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 226 [2018-10-15 12:44:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:12,666 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:44:12,666 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 12:44:12,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:44:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 12:44:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2018-10-15 12:44:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 12:44:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-15 12:44:12,674 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 226 [2018-10-15 12:44:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:12,674 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-15 12:44:12,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:44:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-15 12:44:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-15 12:44:12,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:12,676 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:12,676 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:12,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1983622415, now seen corresponding path program 19 times [2018-10-15 12:44:12,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:14,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:14,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:44:14,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:44:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:44:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:44:14,583 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 41 states. [2018-10-15 12:44:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:18,917 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 12:44:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:44:18,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-10-15 12:44:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:18,920 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:44:18,920 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:44:18,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:44:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:44:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2018-10-15 12:44:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 12:44:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-15 12:44:18,928 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 237 [2018-10-15 12:44:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:18,929 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-15 12:44:18,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:44:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-15 12:44:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 12:44:18,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:18,932 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:18,932 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:18,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1226073892, now seen corresponding path program 20 times [2018-10-15 12:44:18,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 0 proven. 2110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:21,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:21,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:44:21,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:44:21,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:44:21,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:44:21,905 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 43 states. [2018-10-15 12:44:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:26,756 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 12:44:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:44:26,756 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 248 [2018-10-15 12:44:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:26,758 INFO L225 Difference]: With dead ends: 269 [2018-10-15 12:44:26,759 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 12:44:26,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:44:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 12:44:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-10-15 12:44:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:44:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 12:44:26,766 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 248 [2018-10-15 12:44:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:26,767 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 12:44:26,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:44:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 12:44:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:44:26,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:26,768 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:26,768 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:26,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1091814673, now seen corresponding path program 21 times [2018-10-15 12:44:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 0 proven. 2331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:28,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:28,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:44:28,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:44:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:44:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:44:28,802 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 45 states. [2018-10-15 12:44:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:35,089 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 12:44:35,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:44:35,093 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 259 [2018-10-15 12:44:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:35,096 INFO L225 Difference]: With dead ends: 280 [2018-10-15 12:44:35,096 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 12:44:35,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:44:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 12:44:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 271. [2018-10-15 12:44:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 12:44:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 12:44:35,102 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 259 [2018-10-15 12:44:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:35,102 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 12:44:35,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:44:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 12:44:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 12:44:35,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:35,104 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:35,105 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:35,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:35,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1279156484, now seen corresponding path program 22 times [2018-10-15 12:44:35,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2563 backedges. 0 proven. 2563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:36,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:44:36,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:44:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:44:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:44:36,945 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 47 states. [2018-10-15 12:44:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:42,493 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-15 12:44:42,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:44:42,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 270 [2018-10-15 12:44:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:42,495 INFO L225 Difference]: With dead ends: 291 [2018-10-15 12:44:42,495 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 12:44:42,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:44:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 12:44:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 282. [2018-10-15 12:44:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 12:44:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-15 12:44:42,501 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 270 [2018-10-15 12:44:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:42,502 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-15 12:44:42,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:44:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-15 12:44:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-15 12:44:42,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:42,504 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:42,504 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:42,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:42,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1603591985, now seen corresponding path program 23 times [2018-10-15 12:44:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2806 backedges. 0 proven. 2806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:44,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:44,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:44:44,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:44:44,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:44:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:44:44,003 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 49 states. [2018-10-15 12:44:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:50,134 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 12:44:50,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:44:50,135 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 281 [2018-10-15 12:44:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:50,136 INFO L225 Difference]: With dead ends: 302 [2018-10-15 12:44:50,136 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 12:44:50,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:44:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 12:44:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 293. [2018-10-15 12:44:50,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 12:44:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-15 12:44:50,143 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 281 [2018-10-15 12:44:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:50,144 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-15 12:44:50,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:44:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-15 12:44:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 12:44:50,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:50,146 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:50,147 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:50,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1004686620, now seen corresponding path program 24 times [2018-10-15 12:44:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:52,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:44:52,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:44:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:44:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:44:52,304 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 51 states. [2018-10-15 12:44:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:59,014 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-15 12:44:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:44:59,014 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 292 [2018-10-15 12:44:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:59,017 INFO L225 Difference]: With dead ends: 313 [2018-10-15 12:44:59,017 INFO L226 Difference]: Without dead ends: 313 [2018-10-15 12:44:59,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:44:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-15 12:44:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 304. [2018-10-15 12:44:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 12:44:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-15 12:44:59,023 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 292 [2018-10-15 12:44:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:59,023 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-15 12:44:59,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:44:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-15 12:44:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-15 12:44:59,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:59,025 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:59,025 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:59,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2028363439, now seen corresponding path program 25 times [2018-10-15 12:44:59,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3325 backedges. 0 proven. 3325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:02,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:02,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:45:02,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:45:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:45:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:45:02,053 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 53 states. [2018-10-15 12:45:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:09,247 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-15 12:45:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:45:09,247 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 303 [2018-10-15 12:45:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:09,250 INFO L225 Difference]: With dead ends: 324 [2018-10-15 12:45:09,250 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 12:45:09,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:45:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 12:45:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 315. [2018-10-15 12:45:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:45:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-15 12:45:09,256 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 303 [2018-10-15 12:45:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:09,256 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-15 12:45:09,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:45:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-15 12:45:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 12:45:09,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:09,258 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:09,258 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:09,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash -396385476, now seen corresponding path program 26 times [2018-10-15 12:45:09,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 0 proven. 3601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:11,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:11,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:45:11,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:45:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:45:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:45:11,564 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 55 states. [2018-10-15 12:45:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:19,418 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 12:45:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:45:19,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 314 [2018-10-15 12:45:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:19,420 INFO L225 Difference]: With dead ends: 335 [2018-10-15 12:45:19,420 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 12:45:19,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:45:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 12:45:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 326. [2018-10-15 12:45:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:45:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 12:45:19,424 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 314 [2018-10-15 12:45:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:19,425 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 12:45:19,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:45:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 12:45:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 12:45:19,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:19,426 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:19,427 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:19,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1341393777, now seen corresponding path program 27 times [2018-10-15 12:45:19,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 3888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:21,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:21,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:45:21,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:45:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:45:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:45:21,243 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 57 states. [2018-10-15 12:45:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:29,525 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-15 12:45:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:45:29,526 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 325 [2018-10-15 12:45:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:29,528 INFO L225 Difference]: With dead ends: 346 [2018-10-15 12:45:29,528 INFO L226 Difference]: Without dead ends: 346 [2018-10-15 12:45:29,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:45:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-15 12:45:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 337. [2018-10-15 12:45:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 12:45:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-15 12:45:29,534 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 325 [2018-10-15 12:45:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:29,534 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-15 12:45:29,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:45:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-15 12:45:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 12:45:29,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:29,536 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:29,537 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:29,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1489740124, now seen corresponding path program 28 times [2018-10-15 12:45:29,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:31,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:31,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:45:31,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:45:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:45:31,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:45:31,574 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 59 states. [2018-10-15 12:45:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:40,433 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-15 12:45:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:45:40,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 336 [2018-10-15 12:45:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:40,436 INFO L225 Difference]: With dead ends: 357 [2018-10-15 12:45:40,436 INFO L226 Difference]: Without dead ends: 357 [2018-10-15 12:45:40,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:45:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-15 12:45:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 348. [2018-10-15 12:45:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 12:45:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-15 12:45:40,442 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 336 [2018-10-15 12:45:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:40,442 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-15 12:45:40,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:45:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-15 12:45:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 12:45:40,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:40,444 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:40,445 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:40,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1760959889, now seen corresponding path program 29 times [2018-10-15 12:45:40,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4495 backedges. 0 proven. 4495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:43,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:43,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:45:43,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:45:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:45:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:45:43,114 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 61 states. [2018-10-15 12:45:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:52,408 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 12:45:52,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:45:52,409 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 347 [2018-10-15 12:45:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:52,411 INFO L225 Difference]: With dead ends: 368 [2018-10-15 12:45:52,411 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:45:52,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:45:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:45:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 359. [2018-10-15 12:45:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 12:45:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-15 12:45:52,417 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 347 [2018-10-15 12:45:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:52,417 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-15 12:45:52,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:45:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-15 12:45:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 12:45:52,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:52,420 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:52,420 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:52,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1396197244, now seen corresponding path program 30 times [2018-10-15 12:45:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4815 backedges. 0 proven. 4815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:45:55,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:45:55,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:45:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:45:55,019 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 63 states. [2018-10-15 12:46:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:05,161 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-15 12:46:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:46:05,161 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 358 [2018-10-15 12:46:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:05,164 INFO L225 Difference]: With dead ends: 379 [2018-10-15 12:46:05,164 INFO L226 Difference]: Without dead ends: 379 [2018-10-15 12:46:05,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:46:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-15 12:46:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 370. [2018-10-15 12:46:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 12:46:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 12:46:05,170 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 358 [2018-10-15 12:46:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:05,170 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 12:46:05,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:46:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 12:46:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:46:05,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:05,173 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:05,173 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:05,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1217275983, now seen corresponding path program 31 times [2018-10-15 12:46:05,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5146 backedges. 0 proven. 5146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:07,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:07,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:46:07,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:46:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:46:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:46:07,948 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 65 states. [2018-10-15 12:46:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:18,530 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-10-15 12:46:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:46:18,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 369 [2018-10-15 12:46:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:18,532 INFO L225 Difference]: With dead ends: 390 [2018-10-15 12:46:18,532 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 12:46:18,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:46:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 12:46:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 381. [2018-10-15 12:46:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-15 12:46:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-15 12:46:18,539 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 369 [2018-10-15 12:46:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:18,539 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-15 12:46:18,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:46:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-15 12:46:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-15 12:46:18,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:18,542 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:18,542 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:18,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -466119268, now seen corresponding path program 32 times [2018-10-15 12:46:18,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5488 backedges. 0 proven. 5488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:21,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:46:21,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:46:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:46:21,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:46:21,168 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 67 states. [2018-10-15 12:46:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:32,333 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 12:46:32,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:46:32,333 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 380 [2018-10-15 12:46:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:32,335 INFO L225 Difference]: With dead ends: 401 [2018-10-15 12:46:32,336 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 12:46:32,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:46:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 12:46:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 392. [2018-10-15 12:46:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 12:46:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-15 12:46:32,341 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 380 [2018-10-15 12:46:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:32,341 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-15 12:46:32,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:46:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-15 12:46:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 12:46:32,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:32,344 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:32,344 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:32,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2000239057, now seen corresponding path program 33 times [2018-10-15 12:46:32,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:35,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:35,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:46:35,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:46:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:46:35,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:46:35,587 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 69 states. [2018-10-15 12:46:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:46:47,618 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-15 12:46:47,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:46:47,619 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 391 [2018-10-15 12:46:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:46:47,621 INFO L225 Difference]: With dead ends: 412 [2018-10-15 12:46:47,621 INFO L226 Difference]: Without dead ends: 412 [2018-10-15 12:46:47,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:46:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-15 12:46:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 403. [2018-10-15 12:46:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 12:46:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 12:46:47,627 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 391 [2018-10-15 12:46:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:46:47,628 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 12:46:47,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:46:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 12:46:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 12:46:47,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:46:47,630 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:46:47,631 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:46:47,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:46:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2128317372, now seen corresponding path program 34 times [2018-10-15 12:46:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:46:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6205 backedges. 0 proven. 6205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:50,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:50,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:46:50,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:46:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:46:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:46:50,917 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 71 states. [2018-10-15 12:47:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:03,445 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-10-15 12:47:03,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:47:03,445 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 402 [2018-10-15 12:47:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:03,447 INFO L225 Difference]: With dead ends: 423 [2018-10-15 12:47:03,447 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 12:47:03,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:47:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 12:47:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 414. [2018-10-15 12:47:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 12:47:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-15 12:47:03,452 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 402 [2018-10-15 12:47:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:03,453 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-15 12:47:03,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:47:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-15 12:47:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 12:47:03,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:03,465 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:03,465 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:03,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1520321521, now seen corresponding path program 35 times [2018-10-15 12:47:03,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:06,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:06,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:47:06,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:47:06,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:47:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:47:06,550 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 73 states. [2018-10-15 12:47:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:19,826 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 12:47:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:47:19,834 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 413 [2018-10-15 12:47:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:19,835 INFO L225 Difference]: With dead ends: 434 [2018-10-15 12:47:19,835 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 12:47:19,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:47:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 12:47:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2018-10-15 12:47:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 12:47:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-15 12:47:19,839 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 413 [2018-10-15 12:47:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:19,840 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-15 12:47:19,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:47:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-15 12:47:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 12:47:19,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:19,842 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:19,842 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:19,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:19,842 INFO L82 PathProgramCache]: Analyzing trace with hash 481700316, now seen corresponding path program 36 times [2018-10-15 12:47:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6966 backedges. 0 proven. 6966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:23,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:47:23,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:47:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:47:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:47:23,118 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 75 states. [2018-10-15 12:47:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:37,077 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-15 12:47:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:47:37,078 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 424 [2018-10-15 12:47:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:37,080 INFO L225 Difference]: With dead ends: 445 [2018-10-15 12:47:37,080 INFO L226 Difference]: Without dead ends: 445 [2018-10-15 12:47:37,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:47:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-15 12:47:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 436. [2018-10-15 12:47:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 12:47:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-10-15 12:47:37,086 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 424 [2018-10-15 12:47:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:37,087 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-10-15 12:47:37,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:47:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-10-15 12:47:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-15 12:47:37,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:37,090 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:37,090 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:37,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1435306479, now seen corresponding path program 37 times [2018-10-15 12:47:37,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7363 backedges. 0 proven. 7363 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:40,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:47:40,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:47:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:47:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:47:40,219 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 77 states. [2018-10-15 12:47:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:47:55,189 INFO L93 Difference]: Finished difference Result 456 states and 456 transitions. [2018-10-15 12:47:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:47:55,189 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 435 [2018-10-15 12:47:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:47:55,191 INFO L225 Difference]: With dead ends: 456 [2018-10-15 12:47:55,191 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 12:47:55,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:47:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 12:47:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 447. [2018-10-15 12:47:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-15 12:47:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-15 12:47:55,197 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 435 [2018-10-15 12:47:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:47:55,197 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-15 12:47:55,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:47:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-15 12:47:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-15 12:47:55,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:47:55,200 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:47:55,200 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:47:55,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:47:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1574531068, now seen corresponding path program 38 times [2018-10-15 12:47:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:47:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:47:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7771 backedges. 0 proven. 7771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:47:58,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:47:58,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:47:58,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:47:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:47:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:47:58,631 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 79 states. [2018-10-15 12:48:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:14,206 INFO L93 Difference]: Finished difference Result 467 states and 467 transitions. [2018-10-15 12:48:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:48:14,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 446 [2018-10-15 12:48:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:14,208 INFO L225 Difference]: With dead ends: 467 [2018-10-15 12:48:14,208 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 12:48:14,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:48:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 12:48:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 458. [2018-10-15 12:48:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-15 12:48:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-10-15 12:48:14,214 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 446 [2018-10-15 12:48:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:14,215 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-10-15 12:48:14,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:48:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-10-15 12:48:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 12:48:14,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:14,218 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:14,218 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:14,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1711886385, now seen corresponding path program 39 times [2018-10-15 12:48:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:17,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:17,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:48:17,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:48:17,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:48:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:48:17,959 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 81 states. [2018-10-15 12:48:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:34,287 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-10-15 12:48:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:48:34,288 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 457 [2018-10-15 12:48:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:34,290 INFO L225 Difference]: With dead ends: 478 [2018-10-15 12:48:34,290 INFO L226 Difference]: Without dead ends: 478 [2018-10-15 12:48:34,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:48:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-15 12:48:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 469. [2018-10-15 12:48:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-15 12:48:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 469 transitions. [2018-10-15 12:48:34,302 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 469 transitions. Word has length 457 [2018-10-15 12:48:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:34,303 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 469 transitions. [2018-10-15 12:48:34,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:48:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 469 transitions. [2018-10-15 12:48:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-15 12:48:34,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:34,306 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:34,306 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:34,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1462280676, now seen corresponding path program 40 times [2018-10-15 12:48:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8620 backedges. 0 proven. 8620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:38,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:48:38,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:48:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:48:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:48:38,195 INFO L87 Difference]: Start difference. First operand 469 states and 469 transitions. Second operand 83 states. [2018-10-15 12:48:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:48:55,464 INFO L93 Difference]: Finished difference Result 489 states and 489 transitions. [2018-10-15 12:48:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:48:55,465 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 468 [2018-10-15 12:48:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:48:55,466 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:48:55,466 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 12:48:55,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:48:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 12:48:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 480. [2018-10-15 12:48:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 12:48:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2018-10-15 12:48:55,471 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 468 [2018-10-15 12:48:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:48:55,471 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2018-10-15 12:48:55,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:48:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2018-10-15 12:48:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:48:55,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:48:55,473 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:48:55,474 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:48:55,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:48:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1664307793, now seen corresponding path program 41 times [2018-10-15 12:48:55,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:48:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:48:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9061 backedges. 0 proven. 9061 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:48:59,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:48:59,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:48:59,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:48:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:48:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:48:59,491 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand 85 states. [2018-10-15 12:49:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:17,480 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-10-15 12:49:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:49:17,480 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 479 [2018-10-15 12:49:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:17,482 INFO L225 Difference]: With dead ends: 500 [2018-10-15 12:49:17,482 INFO L226 Difference]: Without dead ends: 500 [2018-10-15 12:49:17,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:49:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-15 12:49:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 491. [2018-10-15 12:49:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-15 12:49:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-10-15 12:49:17,488 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 479 [2018-10-15 12:49:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:17,489 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-10-15 12:49:17,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:49:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-10-15 12:49:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-15 12:49:17,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:17,492 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:17,492 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:17,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1254224956, now seen corresponding path program 42 times [2018-10-15 12:49:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 0 proven. 9513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:21,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:21,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:49:21,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:49:21,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:49:21,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:49:21,638 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 87 states. [2018-10-15 12:49:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:49:40,523 INFO L93 Difference]: Finished difference Result 511 states and 511 transitions. [2018-10-15 12:49:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:49:40,524 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 490 [2018-10-15 12:49:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:49:40,526 INFO L225 Difference]: With dead ends: 511 [2018-10-15 12:49:40,526 INFO L226 Difference]: Without dead ends: 511 [2018-10-15 12:49:40,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:49:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-15 12:49:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2018-10-15 12:49:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-15 12:49:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 502 transitions. [2018-10-15 12:49:40,531 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 502 transitions. Word has length 490 [2018-10-15 12:49:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:49:40,532 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 502 transitions. [2018-10-15 12:49:40,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:49:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 502 transitions. [2018-10-15 12:49:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-15 12:49:40,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:49:40,534 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:49:40,534 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:49:40,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:49:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1849883761, now seen corresponding path program 43 times [2018-10-15 12:49:40,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:49:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:49:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9976 backedges. 0 proven. 9976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:49:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:49:44,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:49:44,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:49:44,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:49:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:49:44,838 INFO L87 Difference]: Start difference. First operand 502 states and 502 transitions. Second operand 89 states. [2018-10-15 12:50:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:04,684 INFO L93 Difference]: Finished difference Result 522 states and 522 transitions. [2018-10-15 12:50:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:50:04,684 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 501 [2018-10-15 12:50:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:04,687 INFO L225 Difference]: With dead ends: 522 [2018-10-15 12:50:04,688 INFO L226 Difference]: Without dead ends: 522 [2018-10-15 12:50:04,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:50:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-15 12:50:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 513. [2018-10-15 12:50:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 12:50:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-10-15 12:50:04,693 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 501 [2018-10-15 12:50:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:04,693 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-10-15 12:50:04,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:50:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-10-15 12:50:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 12:50:04,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:04,697 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:04,697 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:04,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1758776740, now seen corresponding path program 44 times [2018-10-15 12:50:04,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10450 backedges. 0 proven. 10450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:08,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:08,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:50:08,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:50:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:50:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:50:08,957 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 91 states. [2018-10-15 12:50:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:29,522 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-15 12:50:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:50:29,524 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 512 [2018-10-15 12:50:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:29,525 INFO L225 Difference]: With dead ends: 533 [2018-10-15 12:50:29,526 INFO L226 Difference]: Without dead ends: 533 [2018-10-15 12:50:29,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:50:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-15 12:50:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-10-15 12:50:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 12:50:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 524 transitions. [2018-10-15 12:50:29,530 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 524 transitions. Word has length 512 [2018-10-15 12:50:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:29,531 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 524 transitions. [2018-10-15 12:50:29,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:50:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 524 transitions. [2018-10-15 12:50:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 12:50:29,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:29,533 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:29,533 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1779060369, now seen corresponding path program 45 times [2018-10-15 12:50:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:50:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 0 proven. 10935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:50:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:50:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:50:34,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:50:34,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:50:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:50:34,043 INFO L87 Difference]: Start difference. First operand 524 states and 524 transitions. Second operand 93 states. [2018-10-15 12:50:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:50:55,624 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 12:50:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:50:55,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 523 [2018-10-15 12:50:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:50:55,627 INFO L225 Difference]: With dead ends: 544 [2018-10-15 12:50:55,628 INFO L226 Difference]: Without dead ends: 544 [2018-10-15 12:50:55,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:50:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-15 12:50:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 535. [2018-10-15 12:50:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-15 12:50:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-15 12:50:55,633 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 523 [2018-10-15 12:50:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:50:55,633 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-15 12:50:55,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:50:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-15 12:50:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-15 12:50:55,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:50:55,637 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:50:55,637 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:50:55,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:50:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 136648828, now seen corresponding path program 46 times [2018-10-15 12:50:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:50:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11431 backedges. 0 proven. 11431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:00,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:00,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:51:00,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:51:00,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:51:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:51:00,167 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 95 states. [2018-10-15 12:51:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:22,623 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-15 12:51:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:51:22,623 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 534 [2018-10-15 12:51:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:22,626 INFO L225 Difference]: With dead ends: 555 [2018-10-15 12:51:22,626 INFO L226 Difference]: Without dead ends: 555 [2018-10-15 12:51:22,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:51:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-15 12:51:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 546. [2018-10-15 12:51:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 12:51:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 546 transitions. [2018-10-15 12:51:22,631 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 546 transitions. Word has length 534 [2018-10-15 12:51:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:22,632 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 546 transitions. [2018-10-15 12:51:22,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:51:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 546 transitions. [2018-10-15 12:51:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-10-15 12:51:22,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:22,634 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:22,635 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:22,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1876641969, now seen corresponding path program 47 times [2018-10-15 12:51:22,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:51:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11938 backedges. 0 proven. 11938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:51:27,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:51:27,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:51:27,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:51:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:51:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:51:27,428 INFO L87 Difference]: Start difference. First operand 546 states and 546 transitions. Second operand 97 states. [2018-10-15 12:51:30,921 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:51:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:51:50,979 INFO L93 Difference]: Finished difference Result 566 states and 566 transitions. [2018-10-15 12:51:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:51:50,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 545 [2018-10-15 12:51:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:51:50,981 INFO L225 Difference]: With dead ends: 566 [2018-10-15 12:51:50,981 INFO L226 Difference]: Without dead ends: 566 [2018-10-15 12:51:50,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:51:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-10-15 12:51:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2018-10-15 12:51:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-15 12:51:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 557 transitions. [2018-10-15 12:51:50,987 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 557 transitions. Word has length 545 [2018-10-15 12:51:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:51:50,987 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 557 transitions. [2018-10-15 12:51:50,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:51:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 557 transitions. [2018-10-15 12:51:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-15 12:51:50,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:51:50,991 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:51:50,991 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:51:50,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:51:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1581360796, now seen corresponding path program 48 times [2018-10-15 12:51:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:51:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat