java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 20:53:55,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 20:53:55,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 20:53:55,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 20:53:55,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 20:53:55,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 20:53:55,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 20:53:55,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 20:53:55,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 20:53:55,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 20:53:55,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 20:53:55,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 20:53:55,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 20:53:55,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 20:53:55,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 20:53:55,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 20:53:55,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 20:53:55,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 20:53:55,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 20:53:55,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 20:53:55,057 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 20:53:55,057 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 20:53:55,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 20:53:55,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 20:53:55,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 20:53:55,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 20:53:55,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 20:53:55,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 20:53:55,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 20:53:55,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 20:53:55,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 20:53:55,062 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-12 20:53:55,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 20:53:55,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 20:53:55,072 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 20:53:55,072 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 20:53:55,073 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 20:53:55,073 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 20:53:55,073 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 20:53:55,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 20:53:55,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 20:53:55,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 20:53:55,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 20:53:55,074 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 20:53:55,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 20:53:55,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 20:53:55,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 20:53:55,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 20:53:55,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 20:53:55,116 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 20:53:55,118 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 20:53:55,119 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 20:53:55,120 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 20:53:55,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-04-12 20:53:55,402 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7ef1e8efe [2018-04-12 20:53:55,490 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 20:53:55,490 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 20:53:55,491 INFO L168 CDTParser]: Scanning standard_strcpy_original_false-valid-deref.i [2018-04-12 20:53:55,491 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 20:53:55,491 INFO L215 ultiparseSymbolTable]: [2018-04-12 20:53:55,491 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 20:53:55,491 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_original_false-valid-deref.i [2018-04-12 20:53:55,491 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_original_false-valid-deref.i [2018-04-12 20:53:55,492 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 20:53:55,492 INFO L233 ultiparseSymbolTable]: [2018-04-12 20:53:55,516 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7ef1e8efe [2018-04-12 20:53:55,520 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 20:53:55,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 20:53:55,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 20:53:55,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 20:53:55,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 20:53:55,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b2f446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55, skipping insertion in model container [2018-04-12 20:53:55,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,540 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 20:53:55,550 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 20:53:55,652 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 20:53:55,664 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 20:53:55,667 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-12 20:53:55,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55 WrapperNode [2018-04-12 20:53:55,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 20:53:55,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 20:53:55,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 20:53:55,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 20:53:55,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... [2018-04-12 20:53:55,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 20:53:55,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 20:53:55,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 20:53:55,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 20:53:55,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 20:53:55,727 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 20:53:55,727 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 20:53:55,727 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-12 20:53:55,727 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 20:53:55,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 20:53:55,728 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-12 20:53:55,728 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 20:53:55,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 20:53:55,728 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 20:53:55,866 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 20:53:55,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 08:53:55 BoogieIcfgContainer [2018-04-12 20:53:55,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 20:53:55,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 20:53:55,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 20:53:55,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 20:53:55,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 08:53:55" (1/3) ... [2018-04-12 20:53:55,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e22ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 08:53:55, skipping insertion in model container [2018-04-12 20:53:55,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 08:53:55" (2/3) ... [2018-04-12 20:53:55,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e22ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 08:53:55, skipping insertion in model container [2018-04-12 20:53:55,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 08:53:55" (3/3) ... [2018-04-12 20:53:55,871 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-04-12 20:53:55,876 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 20:53:55,881 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-12 20:53:55,902 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 20:53:55,903 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 20:53:55,903 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 20:53:55,903 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 20:53:55,903 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 20:53:55,903 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 20:53:55,903 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 20:53:55,903 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 20:53:55,903 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 20:53:55,904 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 20:53:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-04-12 20:53:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-12 20:53:55,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:55,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:55,921 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1734705512, now seen corresponding path program 1 times [2018-04-12 20:53:55,959 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:55,978 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 20:53:56,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 20:53:56,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,010 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-12 20:53:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 20:53:56,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 20:53:56,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 20:53:56,025 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-04-12 20:53:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:56,080 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-12 20:53:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 20:53:56,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-12 20:53:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:56,086 INFO L225 Difference]: With dead ends: 50 [2018-04-12 20:53:56,086 INFO L226 Difference]: Without dead ends: 41 [2018-04-12 20:53:56,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 20:53:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-12 20:53:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-04-12 20:53:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-12 20:53:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-12 20:53:56,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-04-12 20:53:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:56,113 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-12 20:53:56,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 20:53:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-12 20:53:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-12 20:53:56,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:56,114 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:56,114 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1166772373, now seen corresponding path program 1 times [2018-04-12 20:53:56,114 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:56,121 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:56,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-12 20:53:56,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,139 INFO L182 omatonBuilderFactory]: Interpolants [128#true, 129#false, 130#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 131#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 20:53:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 20:53:56,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 20:53:56,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 20:53:56,141 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-04-12 20:53:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:56,222 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-12 20:53:56,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 20:53:56,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-12 20:53:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:56,224 INFO L225 Difference]: With dead ends: 54 [2018-04-12 20:53:56,224 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 20:53:56,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 20:53:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 20:53:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-04-12 20:53:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 20:53:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-12 20:53:56,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-04-12 20:53:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:56,231 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-12 20:53:56,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 20:53:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-12 20:53:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 20:53:56,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:56,232 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:56,233 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1914964600, now seen corresponding path program 2 times [2018-04-12 20:53:56,234 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:56,241 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:56,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 20:53:56,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,280 INFO L182 omatonBuilderFactory]: Interpolants [240#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 236#true, 237#false, 238#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 239#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-12 20:53:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 20:53:56,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 20:53:56,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 20:53:56,281 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-04-12 20:53:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:56,382 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-04-12 20:53:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 20:53:56,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 20:53:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:56,384 INFO L225 Difference]: With dead ends: 67 [2018-04-12 20:53:56,384 INFO L226 Difference]: Without dead ends: 67 [2018-04-12 20:53:56,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 20:53:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-12 20:53:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-04-12 20:53:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-12 20:53:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-12 20:53:56,392 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-04-12 20:53:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:56,392 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-12 20:53:56,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 20:53:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-12 20:53:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 20:53:56,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:56,393 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:56,393 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -510089099, now seen corresponding path program 3 times [2018-04-12 20:53:56,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:56,403 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:56,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 20:53:56,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,447 INFO L182 omatonBuilderFactory]: Interpolants [370#true, 371#false, 372#(<= main_~i~0 0), 373#(<= main_~i~0 1), 374#(<= main_~i~0 2), 375#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 376#(and (<= main_~i~0 3) (<= 1 main_~i~0))] [2018-04-12 20:53:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 20:53:56,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 20:53:56,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-12 20:53:56,448 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-04-12 20:53:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:56,564 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-04-12 20:53:56,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 20:53:56,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-12 20:53:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:56,565 INFO L225 Difference]: With dead ends: 80 [2018-04-12 20:53:56,565 INFO L226 Difference]: Without dead ends: 80 [2018-04-12 20:53:56,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-12 20:53:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-12 20:53:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-04-12 20:53:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-12 20:53:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-12 20:53:56,572 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-04-12 20:53:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:56,572 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-12 20:53:56,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 20:53:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-12 20:53:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 20:53:56,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:56,573 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:56,573 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -697843288, now seen corresponding path program 4 times [2018-04-12 20:53:56,574 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:56,583 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:56,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 20:53:56,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,648 INFO L182 omatonBuilderFactory]: Interpolants [537#true, 538#false, 539#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 540#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 541#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 542#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 543#(and (<= 4 main_~i~0) (<= main_~i~0 4))] [2018-04-12 20:53:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 20:53:56,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 20:53:56,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 20:53:56,649 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-04-12 20:53:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:56,835 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-04-12 20:53:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 20:53:56,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-12 20:53:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:56,837 INFO L225 Difference]: With dead ends: 93 [2018-04-12 20:53:56,837 INFO L226 Difference]: Without dead ends: 93 [2018-04-12 20:53:56,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 20:53:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-12 20:53:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-04-12 20:53:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-12 20:53:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-12 20:53:56,843 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-04-12 20:53:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:56,844 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-12 20:53:56,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 20:53:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-12 20:53:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 20:53:56,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:56,845 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:56,845 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1960349611, now seen corresponding path program 5 times [2018-04-12 20:53:56,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:56,855 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:56,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 20:53:56,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,913 INFO L182 omatonBuilderFactory]: Interpolants [723#true, 724#false, 725#(<= main_~i~0 0), 726#(<= main_~i~0 1), 727#(<= main_~i~0 2), 728#(<= main_~i~0 3), 729#(<= main_~i~0 4), 730#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 731#(and (<= 1 main_~i~0) (<= main_~i~0 5))] [2018-04-12 20:53:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:56,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 20:53:56,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 20:53:56,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-12 20:53:56,914 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 9 states. [2018-04-12 20:53:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:57,060 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-04-12 20:53:57,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 20:53:57,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 20:53:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:57,061 INFO L225 Difference]: With dead ends: 106 [2018-04-12 20:53:57,062 INFO L226 Difference]: Without dead ends: 106 [2018-04-12 20:53:57,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-12 20:53:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-12 20:53:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-04-12 20:53:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-12 20:53:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-04-12 20:53:57,068 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-04-12 20:53:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:57,069 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-04-12 20:53:57,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 20:53:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-04-12 20:53:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-12 20:53:57,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:57,070 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:57,070 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash 138077640, now seen corresponding path program 6 times [2018-04-12 20:53:57,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:57,080 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:57,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 20:53:57,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,134 INFO L182 omatonBuilderFactory]: Interpolants [946#true, 947#false, 948#(<= main_~i~0 0), 949#(<= main_~i~0 1), 950#(<= main_~i~0 2), 951#(<= main_~i~0 3), 952#(<= main_~i~0 4), 953#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 954#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 955#(and (<= 2 main_~i~0) (<= main_~i~0 6))] [2018-04-12 20:53:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 20:53:57,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 20:53:57,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 20:53:57,135 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-04-12 20:53:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:57,287 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-04-12 20:53:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 20:53:57,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-12 20:53:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:57,292 INFO L225 Difference]: With dead ends: 119 [2018-04-12 20:53:57,292 INFO L226 Difference]: Without dead ends: 119 [2018-04-12 20:53:57,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-04-12 20:53:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-12 20:53:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-04-12 20:53:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-12 20:53:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-04-12 20:53:57,298 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-04-12 20:53:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:57,299 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-04-12 20:53:57,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 20:53:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-04-12 20:53:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 20:53:57,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:57,300 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:57,300 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash 709222453, now seen corresponding path program 7 times [2018-04-12 20:53:57,301 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:57,309 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:57,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 20:53:57,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,373 INFO L182 omatonBuilderFactory]: Interpolants [1200#(<= main_~i~0 1), 1201#(<= main_~i~0 2), 1202#(<= main_~i~0 3), 1203#(<= main_~i~0 4), 1204#(<= main_~i~0 5), 1205#(<= main_~i~0 6), 1206#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1207#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1197#true, 1198#false, 1199#(<= main_~i~0 0)] [2018-04-12 20:53:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 20:53:57,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 20:53:57,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-12 20:53:57,374 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-04-12 20:53:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:57,556 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-04-12 20:53:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 20:53:57,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-12 20:53:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:57,557 INFO L225 Difference]: With dead ends: 132 [2018-04-12 20:53:57,557 INFO L226 Difference]: Without dead ends: 132 [2018-04-12 20:53:57,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-12 20:53:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-12 20:53:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-04-12 20:53:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-12 20:53:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-04-12 20:53:57,561 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-04-12 20:53:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:57,561 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-04-12 20:53:57,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 20:53:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-04-12 20:53:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 20:53:57,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:57,562 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:57,562 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash 336028136, now seen corresponding path program 8 times [2018-04-12 20:53:57,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:57,568 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:57,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 20:53:57,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,639 INFO L182 omatonBuilderFactory]: Interpolants [1476#true, 1477#false, 1478#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1479#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1480#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1481#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1482#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1483#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1484#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1485#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1486#(and (<= 8 main_~i~0) (<= main_~i~0 8))] [2018-04-12 20:53:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:57,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 20:53:57,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 20:53:57,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 20:53:57,640 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-04-12 20:53:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:58,020 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-04-12 20:53:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 20:53:58,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-12 20:53:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:58,021 INFO L225 Difference]: With dead ends: 145 [2018-04-12 20:53:58,021 INFO L226 Difference]: Without dead ends: 145 [2018-04-12 20:53:58,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 20:53:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-12 20:53:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-04-12 20:53:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 20:53:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-12 20:53:58,025 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-04-12 20:53:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:58,026 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-12 20:53:58,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 20:53:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-12 20:53:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 20:53:58,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:58,027 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:58,031 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1837234197, now seen corresponding path program 9 times [2018-04-12 20:53:58,032 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:58,040 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:58,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 20:53:58,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,136 INFO L182 omatonBuilderFactory]: Interpolants [1766#true, 1767#false, 1768#(<= main_~i~0 0), 1769#(<= main_~i~0 1), 1770#(<= main_~i~0 2), 1771#(<= main_~i~0 3), 1772#(<= main_~i~0 4), 1773#(<= main_~i~0 5), 1774#(<= main_~i~0 6), 1775#(<= main_~i~0 7), 1776#(<= main_~i~0 8), 1777#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1778#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-04-12 20:53:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 20:53:58,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 20:53:58,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-12 20:53:58,137 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 13 states. [2018-04-12 20:53:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:58,390 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-04-12 20:53:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 20:53:58,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-12 20:53:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:58,392 INFO L225 Difference]: With dead ends: 158 [2018-04-12 20:53:58,392 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 20:53:58,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-04-12 20:53:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 20:53:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-04-12 20:53:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-12 20:53:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-04-12 20:53:58,398 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-04-12 20:53:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:58,399 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-04-12 20:53:58,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 20:53:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-04-12 20:53:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-12 20:53:58,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:58,401 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:58,401 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 872363528, now seen corresponding path program 10 times [2018-04-12 20:53:58,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:58,410 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:58,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 20:53:58,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,510 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2113#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2114#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2101#true, 2102#false, 2103#(<= main_~i~0 0), 2104#(<= main_~i~0 1), 2105#(<= main_~i~0 2), 2106#(<= main_~i~0 3), 2107#(<= main_~i~0 4), 2108#(<= main_~i~0 5), 2109#(<= main_~i~0 6), 2110#(<= main_~i~0 7), 2111#(<= main_~i~0 8)] [2018-04-12 20:53:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 20:53:58,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 20:53:58,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-12 20:53:58,512 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-04-12 20:53:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:58,813 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-04-12 20:53:58,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 20:53:58,813 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-12 20:53:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:58,814 INFO L225 Difference]: With dead ends: 171 [2018-04-12 20:53:58,814 INFO L226 Difference]: Without dead ends: 171 [2018-04-12 20:53:58,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-12 20:53:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-12 20:53:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-12 20:53:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-12 20:53:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-04-12 20:53:58,819 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-04-12 20:53:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:58,819 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-04-12 20:53:58,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 20:53:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-04-12 20:53:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 20:53:58,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:58,821 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:58,821 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1444300811, now seen corresponding path program 11 times [2018-04-12 20:53:58,822 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:58,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:58,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 20:53:58,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,910 INFO L182 omatonBuilderFactory]: Interpolants [2464#true, 2465#false, 2466#(<= main_~i~0 0), 2467#(<= main_~i~0 1), 2468#(<= main_~i~0 2), 2469#(<= main_~i~0 3), 2470#(<= main_~i~0 4), 2471#(<= main_~i~0 5), 2472#(<= main_~i~0 6), 2473#(<= main_~i~0 7), 2474#(<= main_~i~0 8), 2475#(<= main_~i~0 9), 2476#(<= main_~i~0 10), 2477#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 2478#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-04-12 20:53:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:58,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 20:53:58,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 20:53:58,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-04-12 20:53:58,911 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 15 states. [2018-04-12 20:53:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:59,129 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-04-12 20:53:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 20:53:59,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-04-12 20:53:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:59,130 INFO L225 Difference]: With dead ends: 184 [2018-04-12 20:53:59,130 INFO L226 Difference]: Without dead ends: 184 [2018-04-12 20:53:59,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-04-12 20:53:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-12 20:53:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-04-12 20:53:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-12 20:53:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-04-12 20:53:59,135 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-04-12 20:53:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:59,135 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-04-12 20:53:59,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 20:53:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-04-12 20:53:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 20:53:59,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:59,136 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:59,136 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash 198468136, now seen corresponding path program 12 times [2018-04-12 20:53:59,137 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:59,145 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:59,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 20:53:59,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,251 INFO L182 omatonBuilderFactory]: Interpolants [2855#true, 2856#false, 2857#(<= main_~i~0 0), 2858#(<= main_~i~0 1), 2859#(<= main_~i~0 2), 2860#(<= main_~i~0 3), 2861#(<= main_~i~0 4), 2862#(<= main_~i~0 5), 2863#(<= main_~i~0 6), 2864#(<= main_~i~0 7), 2865#(<= main_~i~0 8), 2866#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2867#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2868#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2869#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2870#(and (<= 4 main_~i~0) (<= main_~i~0 12))] [2018-04-12 20:53:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 20:53:59,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 20:53:59,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-12 20:53:59,252 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 16 states. [2018-04-12 20:53:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:59,628 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-04-12 20:53:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 20:53:59,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-12 20:53:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:59,630 INFO L225 Difference]: With dead ends: 197 [2018-04-12 20:53:59,630 INFO L226 Difference]: Without dead ends: 197 [2018-04-12 20:53:59,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-12 20:53:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-12 20:53:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-04-12 20:53:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-12 20:53:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-04-12 20:53:59,635 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-04-12 20:53:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:59,635 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-04-12 20:53:59,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 20:53:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-04-12 20:53:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-12 20:53:59,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:59,636 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:59,636 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1156898859, now seen corresponding path program 13 times [2018-04-12 20:53:59,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:59,646 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:53:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:53:59,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 20:53:59,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:53:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,726 INFO L182 omatonBuilderFactory]: Interpolants [3274#true, 3275#false, 3276#(<= main_~i~0 0), 3277#(<= main_~i~0 1), 3278#(<= main_~i~0 2), 3279#(<= main_~i~0 3), 3280#(<= main_~i~0 4), 3281#(<= main_~i~0 5), 3282#(<= main_~i~0 6), 3283#(<= main_~i~0 7), 3284#(<= main_~i~0 8), 3285#(<= main_~i~0 9), 3286#(<= main_~i~0 10), 3287#(<= main_~i~0 11), 3288#(<= main_~i~0 12), 3289#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3290#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-04-12 20:53:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:53:59,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 20:53:59,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 20:53:59,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-12 20:53:59,727 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-04-12 20:53:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:53:59,983 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-04-12 20:53:59,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 20:53:59,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-12 20:53:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:53:59,984 INFO L225 Difference]: With dead ends: 210 [2018-04-12 20:53:59,984 INFO L226 Difference]: Without dead ends: 210 [2018-04-12 20:53:59,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-12 20:53:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-12 20:53:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-04-12 20:53:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 20:53:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-04-12 20:53:59,989 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-04-12 20:53:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:53:59,989 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-04-12 20:53:59,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 20:53:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-04-12 20:53:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-12 20:53:59,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:53:59,990 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-12 20:53:59,990 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:53:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash -927406520, now seen corresponding path program 14 times [2018-04-12 20:53:59,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:53:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:53:59,997 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:00,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 20:54:00,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,137 INFO L182 omatonBuilderFactory]: Interpolants [3721#true, 3722#false, 3723#(<= main_~i~0 0), 3724#(<= main_~i~0 1), 3725#(<= main_~i~0 2), 3726#(<= main_~i~0 3), 3727#(<= main_~i~0 4), 3728#(<= main_~i~0 5), 3729#(<= main_~i~0 6), 3730#(<= main_~i~0 7), 3731#(<= main_~i~0 8), 3732#(<= main_~i~0 9), 3733#(<= main_~i~0 10), 3734#(<= main_~i~0 11), 3735#(<= main_~i~0 12), 3736#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 3737#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 3738#(and (<= 2 main_~i~0) (<= main_~i~0 14))] [2018-04-12 20:54:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 20:54:00,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 20:54:00,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-12 20:54:00,138 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-04-12 20:54:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:00,477 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-04-12 20:54:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 20:54:00,477 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-12 20:54:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:00,478 INFO L225 Difference]: With dead ends: 223 [2018-04-12 20:54:00,478 INFO L226 Difference]: Without dead ends: 223 [2018-04-12 20:54:00,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-12 20:54:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-12 20:54:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-04-12 20:54:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-12 20:54:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-04-12 20:54:00,482 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-04-12 20:54:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:00,482 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-04-12 20:54:00,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 20:54:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-04-12 20:54:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-12 20:54:00,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:00,482 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:00,483 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -487313483, now seen corresponding path program 15 times [2018-04-12 20:54:00,483 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:00,488 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:00,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 20:54:00,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,586 INFO L182 omatonBuilderFactory]: Interpolants [4196#true, 4197#false, 4198#(<= main_~i~0 0), 4199#(<= main_~i~0 1), 4200#(<= main_~i~0 2), 4201#(<= main_~i~0 3), 4202#(<= main_~i~0 4), 4203#(<= main_~i~0 5), 4204#(<= main_~i~0 6), 4205#(<= main_~i~0 7), 4206#(<= main_~i~0 8), 4207#(<= main_~i~0 9), 4208#(<= main_~i~0 10), 4209#(<= main_~i~0 11), 4210#(<= main_~i~0 12), 4211#(<= main_~i~0 13), 4212#(<= main_~i~0 14), 4213#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 4214#(and (<= 1 main_~i~0) (<= main_~i~0 15))] [2018-04-12 20:54:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:00,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 20:54:00,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 20:54:00,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-04-12 20:54:00,587 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 19 states. [2018-04-12 20:54:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:00,878 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-04-12 20:54:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 20:54:00,878 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-04-12 20:54:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:00,879 INFO L225 Difference]: With dead ends: 236 [2018-04-12 20:54:00,879 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 20:54:00,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 20:54:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 20:54:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-12 20:54:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-12 20:54:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-04-12 20:54:00,885 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-04-12 20:54:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:00,885 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-04-12 20:54:00,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 20:54:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-04-12 20:54:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-12 20:54:00,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:00,886 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:00,886 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1096729192, now seen corresponding path program 16 times [2018-04-12 20:54:00,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:00,895 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:01,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:01,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 20:54:01,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:01,061 INFO L182 omatonBuilderFactory]: Interpolants [4704#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 4705#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 4706#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 4707#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 4708#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 4709#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 4710#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 4711#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 4712#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 4713#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 4714#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 4715#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 4716#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 4717#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 4699#true, 4700#false, 4701#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 4702#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 4703#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-04-12 20:54:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:01,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 20:54:01,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 20:54:01,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 20:54:01,062 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-04-12 20:54:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:02,483 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-04-12 20:54:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 20:54:02,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-12 20:54:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:02,484 INFO L225 Difference]: With dead ends: 249 [2018-04-12 20:54:02,484 INFO L226 Difference]: Without dead ends: 249 [2018-04-12 20:54:02,484 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 20:54:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-12 20:54:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-04-12 20:54:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-12 20:54:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-12 20:54:02,488 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-04-12 20:54:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:02,488 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-12 20:54:02,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 20:54:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-12 20:54:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-12 20:54:02,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:02,489 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:02,489 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1439504491, now seen corresponding path program 17 times [2018-04-12 20:54:02,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:02,495 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:02,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:02,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 20:54:02,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:02,694 INFO L182 omatonBuilderFactory]: Interpolants [5216#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5217#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5197#true, 5198#false, 5199#(<= main_~i~0 0), 5200#(<= main_~i~0 1), 5201#(<= main_~i~0 2), 5202#(<= main_~i~0 3), 5203#(<= main_~i~0 4), 5204#(<= main_~i~0 5), 5205#(<= main_~i~0 6), 5206#(<= main_~i~0 7), 5207#(<= main_~i~0 8), 5208#(<= main_~i~0 9), 5209#(<= main_~i~0 10), 5210#(<= main_~i~0 11), 5211#(<= main_~i~0 12), 5212#(<= main_~i~0 13), 5213#(<= main_~i~0 14), 5214#(<= main_~i~0 15), 5215#(<= main_~i~0 16)] [2018-04-12 20:54:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:02,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 20:54:02,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 20:54:02,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-04-12 20:54:02,695 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 21 states. [2018-04-12 20:54:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:03,159 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-04-12 20:54:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 20:54:03,160 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-12 20:54:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:03,162 INFO L225 Difference]: With dead ends: 262 [2018-04-12 20:54:03,162 INFO L226 Difference]: Without dead ends: 262 [2018-04-12 20:54:03,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 20:54:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-12 20:54:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-04-12 20:54:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-12 20:54:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-04-12 20:54:03,166 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-04-12 20:54:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:03,177 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-04-12 20:54:03,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 20:54:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-04-12 20:54:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-12 20:54:03,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:03,178 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:03,178 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:03,179 INFO L82 PathProgramCache]: Analyzing trace with hash 368572040, now seen corresponding path program 18 times [2018-04-12 20:54:03,179 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:03,186 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:03,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:03,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 20:54:03,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:03,326 INFO L182 omatonBuilderFactory]: Interpolants [5760#(<= main_~i~0 2), 5761#(<= main_~i~0 3), 5762#(<= main_~i~0 4), 5763#(<= main_~i~0 5), 5764#(<= main_~i~0 6), 5765#(<= main_~i~0 7), 5766#(<= main_~i~0 8), 5767#(<= main_~i~0 9), 5768#(<= main_~i~0 10), 5769#(<= main_~i~0 11), 5770#(<= main_~i~0 12), 5771#(<= main_~i~0 13), 5772#(<= main_~i~0 14), 5773#(<= main_~i~0 15), 5774#(<= main_~i~0 16), 5775#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5776#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5777#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5756#true, 5757#false, 5758#(<= main_~i~0 0), 5759#(<= main_~i~0 1)] [2018-04-12 20:54:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:03,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 20:54:03,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 20:54:03,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-12 20:54:03,327 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 22 states. [2018-04-12 20:54:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:03,852 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-04-12 20:54:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 20:54:03,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-04-12 20:54:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:03,854 INFO L225 Difference]: With dead ends: 275 [2018-04-12 20:54:03,854 INFO L226 Difference]: Without dead ends: 275 [2018-04-12 20:54:03,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 20:54:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-12 20:54:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-04-12 20:54:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-12 20:54:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-04-12 20:54:03,860 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-04-12 20:54:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:03,860 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-04-12 20:54:03,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 20:54:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-04-12 20:54:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-12 20:54:03,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:03,861 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:03,861 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1076541579, now seen corresponding path program 19 times [2018-04-12 20:54:03,862 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:03,871 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:04,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 20:54:04,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,041 INFO L182 omatonBuilderFactory]: Interpolants [6343#true, 6344#false, 6345#(<= main_~i~0 0), 6346#(<= main_~i~0 1), 6347#(<= main_~i~0 2), 6348#(<= main_~i~0 3), 6349#(<= main_~i~0 4), 6350#(<= main_~i~0 5), 6351#(<= main_~i~0 6), 6352#(<= main_~i~0 7), 6353#(<= main_~i~0 8), 6354#(<= main_~i~0 9), 6355#(<= main_~i~0 10), 6356#(<= main_~i~0 11), 6357#(<= main_~i~0 12), 6358#(<= main_~i~0 13), 6359#(<= main_~i~0 14), 6360#(<= main_~i~0 15), 6361#(<= main_~i~0 16), 6362#(<= main_~i~0 17), 6363#(<= main_~i~0 18), 6364#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 6365#(and (<= 1 main_~i~0) (<= main_~i~0 19))] [2018-04-12 20:54:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 20:54:04,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 20:54:04,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-12 20:54:04,043 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-04-12 20:54:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:04,560 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-04-12 20:54:04,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 20:54:04,560 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-12 20:54:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:04,561 INFO L225 Difference]: With dead ends: 288 [2018-04-12 20:54:04,561 INFO L226 Difference]: Without dead ends: 288 [2018-04-12 20:54:04,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 20:54:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-12 20:54:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-04-12 20:54:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-12 20:54:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-12 20:54:04,565 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-04-12 20:54:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:04,566 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-12 20:54:04,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 20:54:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-12 20:54:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-12 20:54:04,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:04,566 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:04,566 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash -801733976, now seen corresponding path program 20 times [2018-04-12 20:54:04,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:04,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:04,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 20:54:04,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,722 INFO L182 omatonBuilderFactory]: Interpolants [6976#(<= main_~i~0 16), 6977#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 6978#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 6979#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 6980#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 6981#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 6958#true, 6959#false, 6960#(<= main_~i~0 0), 6961#(<= main_~i~0 1), 6962#(<= main_~i~0 2), 6963#(<= main_~i~0 3), 6964#(<= main_~i~0 4), 6965#(<= main_~i~0 5), 6966#(<= main_~i~0 6), 6967#(<= main_~i~0 7), 6968#(<= main_~i~0 8), 6969#(<= main_~i~0 9), 6970#(<= main_~i~0 10), 6971#(<= main_~i~0 11), 6972#(<= main_~i~0 12), 6973#(<= main_~i~0 13), 6974#(<= main_~i~0 14), 6975#(<= main_~i~0 15)] [2018-04-12 20:54:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:04,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 20:54:04,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 20:54:04,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-12 20:54:04,723 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-04-12 20:54:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:05,317 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-04-12 20:54:05,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 20:54:05,318 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-12 20:54:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:05,318 INFO L225 Difference]: With dead ends: 301 [2018-04-12 20:54:05,318 INFO L226 Difference]: Without dead ends: 301 [2018-04-12 20:54:05,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 20:54:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-12 20:54:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-04-12 20:54:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-12 20:54:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-04-12 20:54:05,323 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-04-12 20:54:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:05,324 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-04-12 20:54:05,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 20:54:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-04-12 20:54:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-12 20:54:05,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:05,324 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:05,325 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -647409835, now seen corresponding path program 21 times [2018-04-12 20:54:05,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:05,333 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:05,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:05,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 20:54:05,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:05,524 INFO L182 omatonBuilderFactory]: Interpolants [7616#(<= main_~i~0 13), 7617#(<= main_~i~0 14), 7618#(<= main_~i~0 15), 7619#(<= main_~i~0 16), 7620#(<= main_~i~0 17), 7621#(<= main_~i~0 18), 7622#(<= main_~i~0 19), 7623#(<= main_~i~0 20), 7624#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 7625#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 7601#true, 7602#false, 7603#(<= main_~i~0 0), 7604#(<= main_~i~0 1), 7605#(<= main_~i~0 2), 7606#(<= main_~i~0 3), 7607#(<= main_~i~0 4), 7608#(<= main_~i~0 5), 7609#(<= main_~i~0 6), 7610#(<= main_~i~0 7), 7611#(<= main_~i~0 8), 7612#(<= main_~i~0 9), 7613#(<= main_~i~0 10), 7614#(<= main_~i~0 11), 7615#(<= main_~i~0 12)] [2018-04-12 20:54:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:05,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 20:54:05,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 20:54:05,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-12 20:54:05,525 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-04-12 20:54:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:06,059 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-04-12 20:54:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 20:54:06,059 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-12 20:54:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:06,060 INFO L225 Difference]: With dead ends: 314 [2018-04-12 20:54:06,060 INFO L226 Difference]: Without dead ends: 314 [2018-04-12 20:54:06,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 20:54:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-12 20:54:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-04-12 20:54:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-12 20:54:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-04-12 20:54:06,065 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-04-12 20:54:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:06,065 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-04-12 20:54:06,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 20:54:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-04-12 20:54:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-12 20:54:06,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:06,066 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:06,066 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 55338696, now seen corresponding path program 22 times [2018-04-12 20:54:06,067 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:06,077 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:06,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:06,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 20:54:06,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:06,294 INFO L182 omatonBuilderFactory]: Interpolants [8272#true, 8273#false, 8274#(<= main_~i~0 0), 8275#(<= main_~i~0 1), 8276#(<= main_~i~0 2), 8277#(<= main_~i~0 3), 8278#(<= main_~i~0 4), 8279#(<= main_~i~0 5), 8280#(<= main_~i~0 6), 8281#(<= main_~i~0 7), 8282#(<= main_~i~0 8), 8283#(<= main_~i~0 9), 8284#(<= main_~i~0 10), 8285#(<= main_~i~0 11), 8286#(<= main_~i~0 12), 8287#(<= main_~i~0 13), 8288#(<= main_~i~0 14), 8289#(<= main_~i~0 15), 8290#(<= main_~i~0 16), 8291#(<= main_~i~0 17), 8292#(<= main_~i~0 18), 8293#(<= main_~i~0 19), 8294#(<= main_~i~0 20), 8295#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 8296#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 8297#(and (<= 2 main_~i~0) (<= main_~i~0 22))] [2018-04-12 20:54:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:06,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 20:54:06,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 20:54:06,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-12 20:54:06,295 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-04-12 20:54:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:06,840 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-04-12 20:54:06,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 20:54:06,840 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-12 20:54:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:06,841 INFO L225 Difference]: With dead ends: 327 [2018-04-12 20:54:06,841 INFO L226 Difference]: Without dead ends: 327 [2018-04-12 20:54:06,842 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 20:54:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-12 20:54:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-12 20:54:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-12 20:54:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-04-12 20:54:06,846 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-04-12 20:54:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:06,846 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-04-12 20:54:06,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 20:54:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-04-12 20:54:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-12 20:54:06,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:06,847 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:06,847 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1828913355, now seen corresponding path program 23 times [2018-04-12 20:54:06,848 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:06,857 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:07,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 20:54:07,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,059 INFO L182 omatonBuilderFactory]: Interpolants [8971#true, 8972#false, 8973#(<= main_~i~0 0), 8974#(<= main_~i~0 1), 8975#(<= main_~i~0 2), 8976#(<= main_~i~0 3), 8977#(<= main_~i~0 4), 8978#(<= main_~i~0 5), 8979#(<= main_~i~0 6), 8980#(<= main_~i~0 7), 8981#(<= main_~i~0 8), 8982#(<= main_~i~0 9), 8983#(<= main_~i~0 10), 8984#(<= main_~i~0 11), 8985#(<= main_~i~0 12), 8986#(<= main_~i~0 13), 8987#(<= main_~i~0 14), 8988#(<= main_~i~0 15), 8989#(<= main_~i~0 16), 8990#(<= main_~i~0 17), 8991#(<= main_~i~0 18), 8992#(<= main_~i~0 19), 8993#(<= main_~i~0 20), 8994#(<= main_~i~0 21), 8995#(<= main_~i~0 22), 8996#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 8997#(and (<= 1 main_~i~0) (<= main_~i~0 23))] [2018-04-12 20:54:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 20:54:07,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 20:54:07,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-04-12 20:54:07,060 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 27 states. [2018-04-12 20:54:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:07,673 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-04-12 20:54:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 20:54:07,673 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-04-12 20:54:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:07,674 INFO L225 Difference]: With dead ends: 340 [2018-04-12 20:54:07,674 INFO L226 Difference]: Without dead ends: 340 [2018-04-12 20:54:07,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 20:54:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-12 20:54:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-04-12 20:54:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-12 20:54:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-04-12 20:54:07,678 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-04-12 20:54:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:07,678 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-04-12 20:54:07,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 20:54:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-04-12 20:54:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-12 20:54:07,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:07,679 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:07,679 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:07,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1810604776, now seen corresponding path program 24 times [2018-04-12 20:54:07,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:07,685 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:07,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 20:54:07,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,870 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(<= main_~i~0 0), 9701#(<= main_~i~0 1), 9702#(<= main_~i~0 2), 9703#(<= main_~i~0 3), 9704#(<= main_~i~0 4), 9705#(<= main_~i~0 5), 9706#(<= main_~i~0 6), 9707#(<= main_~i~0 7), 9708#(<= main_~i~0 8), 9709#(<= main_~i~0 9), 9710#(<= main_~i~0 10), 9711#(<= main_~i~0 11), 9712#(<= main_~i~0 12), 9713#(<= main_~i~0 13), 9714#(<= main_~i~0 14), 9715#(<= main_~i~0 15), 9716#(<= main_~i~0 16), 9717#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 9718#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 9719#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 9720#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 9721#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 9722#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 9723#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 9724#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 9725#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-04-12 20:54:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:07,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 20:54:07,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 20:54:07,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-12 20:54:07,871 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 28 states. [2018-04-12 20:54:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:08,784 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-04-12 20:54:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 20:54:08,784 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-04-12 20:54:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:08,785 INFO L225 Difference]: With dead ends: 353 [2018-04-12 20:54:08,786 INFO L226 Difference]: Without dead ends: 353 [2018-04-12 20:54:08,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 20:54:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-12 20:54:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-04-12 20:54:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-12 20:54:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-04-12 20:54:08,792 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-04-12 20:54:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:08,792 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-04-12 20:54:08,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 20:54:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-04-12 20:54:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-12 20:54:08,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:08,793 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:08,793 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1327388437, now seen corresponding path program 25 times [2018-04-12 20:54:08,794 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:08,803 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:09,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 20:54:09,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,001 INFO L182 omatonBuilderFactory]: Interpolants [10453#true, 10454#false, 10455#(<= main_~i~0 0), 10456#(<= main_~i~0 1), 10457#(<= main_~i~0 2), 10458#(<= main_~i~0 3), 10459#(<= main_~i~0 4), 10460#(<= main_~i~0 5), 10461#(<= main_~i~0 6), 10462#(<= main_~i~0 7), 10463#(<= main_~i~0 8), 10464#(<= main_~i~0 9), 10465#(<= main_~i~0 10), 10466#(<= main_~i~0 11), 10467#(<= main_~i~0 12), 10468#(<= main_~i~0 13), 10469#(<= main_~i~0 14), 10470#(<= main_~i~0 15), 10471#(<= main_~i~0 16), 10472#(<= main_~i~0 17), 10473#(<= main_~i~0 18), 10474#(<= main_~i~0 19), 10475#(<= main_~i~0 20), 10476#(<= main_~i~0 21), 10477#(<= main_~i~0 22), 10478#(<= main_~i~0 23), 10479#(<= main_~i~0 24), 10480#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 10481#(and (<= main_~i~0 25) (<= 1 main_~i~0))] [2018-04-12 20:54:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 20:54:09,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 20:54:09,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-12 20:54:09,002 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-04-12 20:54:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:09,572 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-04-12 20:54:09,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 20:54:09,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-12 20:54:09,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:09,573 INFO L225 Difference]: With dead ends: 366 [2018-04-12 20:54:09,573 INFO L226 Difference]: Without dead ends: 366 [2018-04-12 20:54:09,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 20:54:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-12 20:54:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-04-12 20:54:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-12 20:54:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-04-12 20:54:09,578 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-04-12 20:54:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:09,578 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-04-12 20:54:09,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 20:54:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-04-12 20:54:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-12 20:54:09,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:09,579 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:09,579 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 273037064, now seen corresponding path program 26 times [2018-04-12 20:54:09,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:09,585 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:09,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 20:54:09,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,790 INFO L182 omatonBuilderFactory]: Interpolants [11264#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 11265#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 11236#true, 11237#false, 11238#(<= main_~i~0 0), 11239#(<= main_~i~0 1), 11240#(<= main_~i~0 2), 11241#(<= main_~i~0 3), 11242#(<= main_~i~0 4), 11243#(<= main_~i~0 5), 11244#(<= main_~i~0 6), 11245#(<= main_~i~0 7), 11246#(<= main_~i~0 8), 11247#(<= main_~i~0 9), 11248#(<= main_~i~0 10), 11249#(<= main_~i~0 11), 11250#(<= main_~i~0 12), 11251#(<= main_~i~0 13), 11252#(<= main_~i~0 14), 11253#(<= main_~i~0 15), 11254#(<= main_~i~0 16), 11255#(<= main_~i~0 17), 11256#(<= main_~i~0 18), 11257#(<= main_~i~0 19), 11258#(<= main_~i~0 20), 11259#(<= main_~i~0 21), 11260#(<= main_~i~0 22), 11261#(<= main_~i~0 23), 11262#(<= main_~i~0 24), 11263#(and (<= 0 main_~i~0) (<= main_~i~0 24))] [2018-04-12 20:54:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:09,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 20:54:09,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 20:54:09,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-12 20:54:09,791 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-04-12 20:54:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:10,446 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-12 20:54:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 20:54:10,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-12 20:54:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:10,448 INFO L225 Difference]: With dead ends: 379 [2018-04-12 20:54:10,448 INFO L226 Difference]: Without dead ends: 379 [2018-04-12 20:54:10,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 20:54:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-12 20:54:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-04-12 20:54:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-12 20:54:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-04-12 20:54:10,452 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-04-12 20:54:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:10,452 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-04-12 20:54:10,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 20:54:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-04-12 20:54:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-12 20:54:10,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:10,453 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:10,453 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 383473397, now seen corresponding path program 27 times [2018-04-12 20:54:10,454 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:10,459 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:10,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:10,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 20:54:10,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:10,764 INFO L182 omatonBuilderFactory]: Interpolants [12047#true, 12048#false, 12049#(<= main_~i~0 0), 12050#(<= main_~i~0 1), 12051#(<= main_~i~0 2), 12052#(<= main_~i~0 3), 12053#(<= main_~i~0 4), 12054#(<= main_~i~0 5), 12055#(<= main_~i~0 6), 12056#(<= main_~i~0 7), 12057#(<= main_~i~0 8), 12058#(<= main_~i~0 9), 12059#(<= main_~i~0 10), 12060#(<= main_~i~0 11), 12061#(<= main_~i~0 12), 12062#(<= main_~i~0 13), 12063#(<= main_~i~0 14), 12064#(<= main_~i~0 15), 12065#(<= main_~i~0 16), 12066#(<= main_~i~0 17), 12067#(<= main_~i~0 18), 12068#(<= main_~i~0 19), 12069#(<= main_~i~0 20), 12070#(<= main_~i~0 21), 12071#(<= main_~i~0 22), 12072#(<= main_~i~0 23), 12073#(<= main_~i~0 24), 12074#(<= main_~i~0 25), 12075#(<= main_~i~0 26), 12076#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 12077#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-04-12 20:54:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:10,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 20:54:10,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 20:54:10,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-12 20:54:10,765 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-04-12 20:54:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:11,502 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-04-12 20:54:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 20:54:11,503 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-12 20:54:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:11,504 INFO L225 Difference]: With dead ends: 392 [2018-04-12 20:54:11,504 INFO L226 Difference]: Without dead ends: 392 [2018-04-12 20:54:11,504 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 20:54:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-12 20:54:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-04-12 20:54:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-12 20:54:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-04-12 20:54:11,508 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-04-12 20:54:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:11,508 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-04-12 20:54:11,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 20:54:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-04-12 20:54:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-12 20:54:11,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:11,509 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:11,509 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1611539240, now seen corresponding path program 28 times [2018-04-12 20:54:11,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:11,515 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:11,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:11,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 20:54:11,766 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:11,766 INFO L182 omatonBuilderFactory]: Interpolants [12886#true, 12887#false, 12888#(<= main_~i~0 0), 12889#(<= main_~i~0 1), 12890#(<= main_~i~0 2), 12891#(<= main_~i~0 3), 12892#(<= main_~i~0 4), 12893#(<= main_~i~0 5), 12894#(<= main_~i~0 6), 12895#(<= main_~i~0 7), 12896#(<= main_~i~0 8), 12897#(<= main_~i~0 9), 12898#(<= main_~i~0 10), 12899#(<= main_~i~0 11), 12900#(<= main_~i~0 12), 12901#(<= main_~i~0 13), 12902#(<= main_~i~0 14), 12903#(<= main_~i~0 15), 12904#(<= main_~i~0 16), 12905#(<= main_~i~0 17), 12906#(<= main_~i~0 18), 12907#(<= main_~i~0 19), 12908#(<= main_~i~0 20), 12909#(<= main_~i~0 21), 12910#(<= main_~i~0 22), 12911#(<= main_~i~0 23), 12912#(<= main_~i~0 24), 12913#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 12914#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 12915#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 12916#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 12917#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-04-12 20:54:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:11,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 20:54:11,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 20:54:11,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-04-12 20:54:11,768 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 32 states. [2018-04-12 20:54:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:12,719 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-04-12 20:54:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 20:54:12,719 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-04-12 20:54:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:12,720 INFO L225 Difference]: With dead ends: 405 [2018-04-12 20:54:12,720 INFO L226 Difference]: Without dead ends: 405 [2018-04-12 20:54:12,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 20:54:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-12 20:54:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-04-12 20:54:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-12 20:54:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-04-12 20:54:12,730 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-04-12 20:54:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:12,730 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-04-12 20:54:12,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 20:54:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-04-12 20:54:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-12 20:54:12,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:12,732 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:12,732 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2042756821, now seen corresponding path program 29 times [2018-04-12 20:54:12,733 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:12,742 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:12,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:12,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 20:54:12,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:12,982 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 5), 13761#(<= main_~i~0 6), 13762#(<= main_~i~0 7), 13763#(<= main_~i~0 8), 13764#(<= main_~i~0 9), 13765#(<= main_~i~0 10), 13766#(<= main_~i~0 11), 13767#(<= main_~i~0 12), 13768#(<= main_~i~0 13), 13769#(<= main_~i~0 14), 13770#(<= main_~i~0 15), 13771#(<= main_~i~0 16), 13772#(<= main_~i~0 17), 13773#(<= main_~i~0 18), 13774#(<= main_~i~0 19), 13775#(<= main_~i~0 20), 13776#(<= main_~i~0 21), 13777#(<= main_~i~0 22), 13778#(<= main_~i~0 23), 13779#(<= main_~i~0 24), 13780#(<= main_~i~0 25), 13781#(<= main_~i~0 26), 13782#(<= main_~i~0 27), 13783#(<= main_~i~0 28), 13784#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 13785#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 13753#true, 13754#false, 13755#(<= main_~i~0 0), 13756#(<= main_~i~0 1), 13757#(<= main_~i~0 2), 13758#(<= main_~i~0 3), 13759#(<= main_~i~0 4)] [2018-04-12 20:54:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 20:54:12,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 20:54:12,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 20:54:12,983 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 33 states. [2018-04-12 20:54:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:13,709 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-04-12 20:54:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 20:54:13,709 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-04-12 20:54:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:13,710 INFO L225 Difference]: With dead ends: 418 [2018-04-12 20:54:13,710 INFO L226 Difference]: Without dead ends: 418 [2018-04-12 20:54:13,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 20:54:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-12 20:54:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-04-12 20:54:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-12 20:54:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-04-12 20:54:13,714 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-04-12 20:54:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:13,715 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-04-12 20:54:13,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 20:54:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-04-12 20:54:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-12 20:54:13,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:13,715 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:13,715 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1416980296, now seen corresponding path program 30 times [2018-04-12 20:54:13,716 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:13,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:14,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:14,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 20:54:14,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:14,050 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 6), 14657#(<= main_~i~0 7), 14658#(<= main_~i~0 8), 14659#(<= main_~i~0 9), 14660#(<= main_~i~0 10), 14661#(<= main_~i~0 11), 14662#(<= main_~i~0 12), 14663#(<= main_~i~0 13), 14664#(<= main_~i~0 14), 14665#(<= main_~i~0 15), 14666#(<= main_~i~0 16), 14667#(<= main_~i~0 17), 14668#(<= main_~i~0 18), 14669#(<= main_~i~0 19), 14670#(<= main_~i~0 20), 14671#(<= main_~i~0 21), 14672#(<= main_~i~0 22), 14673#(<= main_~i~0 23), 14674#(<= main_~i~0 24), 14675#(<= main_~i~0 25), 14676#(<= main_~i~0 26), 14677#(<= main_~i~0 27), 14678#(<= main_~i~0 28), 14679#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 14680#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 14681#(and (<= 2 main_~i~0) (<= main_~i~0 30)), 14648#true, 14649#false, 14650#(<= main_~i~0 0), 14651#(<= main_~i~0 1), 14652#(<= main_~i~0 2), 14653#(<= main_~i~0 3), 14654#(<= main_~i~0 4), 14655#(<= main_~i~0 5)] [2018-04-12 20:54:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:14,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 20:54:14,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 20:54:14,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 20:54:14,051 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 34 states. [2018-04-12 20:54:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:14,896 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-04-12 20:54:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 20:54:14,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-04-12 20:54:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:14,898 INFO L225 Difference]: With dead ends: 431 [2018-04-12 20:54:14,898 INFO L226 Difference]: Without dead ends: 431 [2018-04-12 20:54:14,898 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 20:54:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-12 20:54:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-04-12 20:54:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-12 20:54:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-04-12 20:54:14,902 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-04-12 20:54:14,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:14,902 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-04-12 20:54:14,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 20:54:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-04-12 20:54:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-12 20:54:14,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:14,903 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:14,903 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1843416757, now seen corresponding path program 31 times [2018-04-12 20:54:14,904 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:14,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:15,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:15,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 20:54:15,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:15,238 INFO L182 omatonBuilderFactory]: Interpolants [15571#true, 15572#false, 15573#(<= main_~i~0 0), 15574#(<= main_~i~0 1), 15575#(<= main_~i~0 2), 15576#(<= main_~i~0 3), 15577#(<= main_~i~0 4), 15578#(<= main_~i~0 5), 15579#(<= main_~i~0 6), 15580#(<= main_~i~0 7), 15581#(<= main_~i~0 8), 15582#(<= main_~i~0 9), 15583#(<= main_~i~0 10), 15584#(<= main_~i~0 11), 15585#(<= main_~i~0 12), 15586#(<= main_~i~0 13), 15587#(<= main_~i~0 14), 15588#(<= main_~i~0 15), 15589#(<= main_~i~0 16), 15590#(<= main_~i~0 17), 15591#(<= main_~i~0 18), 15592#(<= main_~i~0 19), 15593#(<= main_~i~0 20), 15594#(<= main_~i~0 21), 15595#(<= main_~i~0 22), 15596#(<= main_~i~0 23), 15597#(<= main_~i~0 24), 15598#(<= main_~i~0 25), 15599#(<= main_~i~0 26), 15600#(<= main_~i~0 27), 15601#(<= main_~i~0 28), 15602#(<= main_~i~0 29), 15603#(<= main_~i~0 30), 15604#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 15605#(and (<= 1 main_~i~0) (<= main_~i~0 31))] [2018-04-12 20:54:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:15,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 20:54:15,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 20:54:15,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 20:54:15,241 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-04-12 20:54:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:16,100 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-04-12 20:54:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 20:54:16,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-12 20:54:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:16,102 INFO L225 Difference]: With dead ends: 444 [2018-04-12 20:54:16,102 INFO L226 Difference]: Without dead ends: 444 [2018-04-12 20:54:16,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 20:54:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-12 20:54:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-04-12 20:54:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-12 20:54:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-04-12 20:54:16,108 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-04-12 20:54:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:16,108 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-04-12 20:54:16,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 20:54:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-04-12 20:54:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-12 20:54:16,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:16,110 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:16,110 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1876032664, now seen corresponding path program 32 times [2018-04-12 20:54:16,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:16,120 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:16,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:16,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 20:54:16,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:16,608 INFO L182 omatonBuilderFactory]: Interpolants [16522#true, 16523#false, 16524#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 16525#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 16526#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 16527#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 16528#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 16529#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 16530#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 16531#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 16532#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 16533#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 16534#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 16535#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 16536#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 16537#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 16538#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 16539#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 16540#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 16541#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 16542#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 16543#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 16544#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 16545#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 16546#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 16547#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 16548#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 16549#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 16550#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 16551#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 16552#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 16553#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 16554#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 16555#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 16556#(and (<= 32 main_~i~0) (<= main_~i~0 32))] [2018-04-12 20:54:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:16,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 20:54:16,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 20:54:16,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 20:54:16,609 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-04-12 20:54:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:19,800 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-04-12 20:54:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 20:54:19,801 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-12 20:54:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:19,802 INFO L225 Difference]: With dead ends: 457 [2018-04-12 20:54:19,802 INFO L226 Difference]: Without dead ends: 457 [2018-04-12 20:54:19,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 20:54:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-12 20:54:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-04-12 20:54:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-12 20:54:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-04-12 20:54:19,806 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-04-12 20:54:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:19,806 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-04-12 20:54:19,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 20:54:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-04-12 20:54:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-12 20:54:19,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:19,807 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:19,807 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash 801392277, now seen corresponding path program 33 times [2018-04-12 20:54:19,808 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:19,819 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:20,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:20,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 20:54:20,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:20,147 INFO L182 omatonBuilderFactory]: Interpolants [17472#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17436#true, 17437#false, 17438#(<= main_~i~0 0), 17439#(<= main_~i~0 1), 17440#(<= main_~i~0 2), 17441#(<= main_~i~0 3), 17442#(<= main_~i~0 4), 17443#(<= main_~i~0 5), 17444#(<= main_~i~0 6), 17445#(<= main_~i~0 7), 17446#(<= main_~i~0 8), 17447#(<= main_~i~0 9), 17448#(<= main_~i~0 10), 17449#(<= main_~i~0 11), 17450#(<= main_~i~0 12), 17451#(<= main_~i~0 13), 17452#(<= main_~i~0 14), 17453#(<= main_~i~0 15), 17454#(<= main_~i~0 16), 17455#(<= main_~i~0 17), 17456#(<= main_~i~0 18), 17457#(<= main_~i~0 19), 17458#(<= main_~i~0 20), 17459#(<= main_~i~0 21), 17460#(<= main_~i~0 22), 17461#(<= main_~i~0 23), 17462#(<= main_~i~0 24), 17463#(<= main_~i~0 25), 17464#(<= main_~i~0 26), 17465#(<= main_~i~0 27), 17466#(<= main_~i~0 28), 17467#(<= main_~i~0 29), 17468#(<= main_~i~0 30), 17469#(<= main_~i~0 31), 17470#(<= main_~i~0 32), 17471#(and (<= 0 main_~i~0) (<= main_~i~0 32))] [2018-04-12 20:54:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:20,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 20:54:20,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 20:54:20,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 20:54:20,148 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-04-12 20:54:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:21,028 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-04-12 20:54:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 20:54:21,029 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-12 20:54:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:21,030 INFO L225 Difference]: With dead ends: 470 [2018-04-12 20:54:21,030 INFO L226 Difference]: Without dead ends: 470 [2018-04-12 20:54:21,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 20:54:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-12 20:54:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-04-12 20:54:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-12 20:54:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-04-12 20:54:21,033 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-04-12 20:54:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:21,034 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-04-12 20:54:21,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 20:54:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-04-12 20:54:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-12 20:54:21,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:21,035 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:21,035 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2137651080, now seen corresponding path program 34 times [2018-04-12 20:54:21,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:21,044 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:21,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:21,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-12 20:54:21,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:21,384 INFO L182 omatonBuilderFactory]: Interpolants [18443#true, 18444#false, 18445#(<= main_~i~0 0), 18446#(<= main_~i~0 1), 18447#(<= main_~i~0 2), 18448#(<= main_~i~0 3), 18449#(<= main_~i~0 4), 18450#(<= main_~i~0 5), 18451#(<= main_~i~0 6), 18452#(<= main_~i~0 7), 18453#(<= main_~i~0 8), 18454#(<= main_~i~0 9), 18455#(<= main_~i~0 10), 18456#(<= main_~i~0 11), 18457#(<= main_~i~0 12), 18458#(<= main_~i~0 13), 18459#(<= main_~i~0 14), 18460#(<= main_~i~0 15), 18461#(<= main_~i~0 16), 18462#(<= main_~i~0 17), 18463#(<= main_~i~0 18), 18464#(<= main_~i~0 19), 18465#(<= main_~i~0 20), 18466#(<= main_~i~0 21), 18467#(<= main_~i~0 22), 18468#(<= main_~i~0 23), 18469#(<= main_~i~0 24), 18470#(<= main_~i~0 25), 18471#(<= main_~i~0 26), 18472#(<= main_~i~0 27), 18473#(<= main_~i~0 28), 18474#(<= main_~i~0 29), 18475#(<= main_~i~0 30), 18476#(<= main_~i~0 31), 18477#(<= main_~i~0 32), 18478#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 18479#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 18480#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-04-12 20:54:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:21,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 20:54:21,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 20:54:21,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 20:54:21,385 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-04-12 20:54:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:22,282 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-04-12 20:54:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 20:54:22,283 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-12 20:54:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:22,284 INFO L225 Difference]: With dead ends: 483 [2018-04-12 20:54:22,284 INFO L226 Difference]: Without dead ends: 483 [2018-04-12 20:54:22,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 20:54:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-12 20:54:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-04-12 20:54:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-12 20:54:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-04-12 20:54:22,288 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-04-12 20:54:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:22,288 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-04-12 20:54:22,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 20:54:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-04-12 20:54:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-12 20:54:22,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:22,289 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:22,289 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 578545269, now seen corresponding path program 35 times [2018-04-12 20:54:22,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:22,296 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:22,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:22,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 20:54:22,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:22,632 INFO L182 omatonBuilderFactory]: Interpolants [19478#true, 19479#false, 19480#(<= main_~i~0 0), 19481#(<= main_~i~0 1), 19482#(<= main_~i~0 2), 19483#(<= main_~i~0 3), 19484#(<= main_~i~0 4), 19485#(<= main_~i~0 5), 19486#(<= main_~i~0 6), 19487#(<= main_~i~0 7), 19488#(<= main_~i~0 8), 19489#(<= main_~i~0 9), 19490#(<= main_~i~0 10), 19491#(<= main_~i~0 11), 19492#(<= main_~i~0 12), 19493#(<= main_~i~0 13), 19494#(<= main_~i~0 14), 19495#(<= main_~i~0 15), 19496#(<= main_~i~0 16), 19497#(<= main_~i~0 17), 19498#(<= main_~i~0 18), 19499#(<= main_~i~0 19), 19500#(<= main_~i~0 20), 19501#(<= main_~i~0 21), 19502#(<= main_~i~0 22), 19503#(<= main_~i~0 23), 19504#(<= main_~i~0 24), 19505#(<= main_~i~0 25), 19506#(<= main_~i~0 26), 19507#(<= main_~i~0 27), 19508#(<= main_~i~0 28), 19509#(<= main_~i~0 29), 19510#(<= main_~i~0 30), 19511#(<= main_~i~0 31), 19512#(<= main_~i~0 32), 19513#(<= main_~i~0 33), 19514#(<= main_~i~0 34), 19515#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 19516#(and (<= 1 main_~i~0) (<= main_~i~0 35))] [2018-04-12 20:54:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:22,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 20:54:22,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 20:54:22,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 20:54:22,632 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 39 states. [2018-04-12 20:54:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:23,559 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-04-12 20:54:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 20:54:23,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-04-12 20:54:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:23,561 INFO L225 Difference]: With dead ends: 496 [2018-04-12 20:54:23,561 INFO L226 Difference]: Without dead ends: 496 [2018-04-12 20:54:23,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 20:54:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-12 20:54:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-04-12 20:54:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-12 20:54:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-04-12 20:54:23,565 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-04-12 20:54:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:23,565 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-04-12 20:54:23,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 20:54:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-04-12 20:54:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-12 20:54:23,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:23,567 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:23,567 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2010858408, now seen corresponding path program 36 times [2018-04-12 20:54:23,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:23,576 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:23,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:23,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-12 20:54:23,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:23,953 INFO L182 omatonBuilderFactory]: Interpolants [20544#(<= main_~i~0 1), 20545#(<= main_~i~0 2), 20546#(<= main_~i~0 3), 20547#(<= main_~i~0 4), 20548#(<= main_~i~0 5), 20549#(<= main_~i~0 6), 20550#(<= main_~i~0 7), 20551#(<= main_~i~0 8), 20552#(<= main_~i~0 9), 20553#(<= main_~i~0 10), 20554#(<= main_~i~0 11), 20555#(<= main_~i~0 12), 20556#(<= main_~i~0 13), 20557#(<= main_~i~0 14), 20558#(<= main_~i~0 15), 20559#(<= main_~i~0 16), 20560#(<= main_~i~0 17), 20561#(<= main_~i~0 18), 20562#(<= main_~i~0 19), 20563#(<= main_~i~0 20), 20564#(<= main_~i~0 21), 20565#(<= main_~i~0 22), 20566#(<= main_~i~0 23), 20567#(<= main_~i~0 24), 20568#(<= main_~i~0 25), 20569#(<= main_~i~0 26), 20570#(<= main_~i~0 27), 20571#(<= main_~i~0 28), 20572#(<= main_~i~0 29), 20573#(<= main_~i~0 30), 20574#(<= main_~i~0 31), 20575#(<= main_~i~0 32), 20576#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 20577#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 20578#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 20579#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 20580#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 20541#true, 20542#false, 20543#(<= main_~i~0 0)] [2018-04-12 20:54:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:23,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 20:54:23,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 20:54:23,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 20:54:23,953 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 40 states. [2018-04-12 20:54:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:25,107 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-04-12 20:54:25,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-12 20:54:25,107 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-04-12 20:54:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:25,108 INFO L225 Difference]: With dead ends: 509 [2018-04-12 20:54:25,108 INFO L226 Difference]: Without dead ends: 509 [2018-04-12 20:54:25,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 20:54:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-12 20:54:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-04-12 20:54:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-04-12 20:54:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-04-12 20:54:25,149 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-04-12 20:54:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:25,149 INFO L459 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-04-12 20:54:25,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 20:54:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-04-12 20:54:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-12 20:54:25,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:25,150 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:25,150 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1349177771, now seen corresponding path program 37 times [2018-04-12 20:54:25,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:25,161 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:25,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:25,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 20:54:25,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:25,555 INFO L182 omatonBuilderFactory]: Interpolants [21632#true, 21633#false, 21634#(<= main_~i~0 0), 21635#(<= main_~i~0 1), 21636#(<= main_~i~0 2), 21637#(<= main_~i~0 3), 21638#(<= main_~i~0 4), 21639#(<= main_~i~0 5), 21640#(<= main_~i~0 6), 21641#(<= main_~i~0 7), 21642#(<= main_~i~0 8), 21643#(<= main_~i~0 9), 21644#(<= main_~i~0 10), 21645#(<= main_~i~0 11), 21646#(<= main_~i~0 12), 21647#(<= main_~i~0 13), 21648#(<= main_~i~0 14), 21649#(<= main_~i~0 15), 21650#(<= main_~i~0 16), 21651#(<= main_~i~0 17), 21652#(<= main_~i~0 18), 21653#(<= main_~i~0 19), 21654#(<= main_~i~0 20), 21655#(<= main_~i~0 21), 21656#(<= main_~i~0 22), 21657#(<= main_~i~0 23), 21658#(<= main_~i~0 24), 21659#(<= main_~i~0 25), 21660#(<= main_~i~0 26), 21661#(<= main_~i~0 27), 21662#(<= main_~i~0 28), 21663#(<= main_~i~0 29), 21664#(<= main_~i~0 30), 21665#(<= main_~i~0 31), 21666#(<= main_~i~0 32), 21667#(<= main_~i~0 33), 21668#(<= main_~i~0 34), 21669#(<= main_~i~0 35), 21670#(<= main_~i~0 36), 21671#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 21672#(and (<= 1 main_~i~0) (<= main_~i~0 37))] [2018-04-12 20:54:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:25,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-12 20:54:25,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-12 20:54:25,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 20:54:25,556 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-04-12 20:54:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:26,580 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-04-12 20:54:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 20:54:26,580 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-12 20:54:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:26,581 INFO L225 Difference]: With dead ends: 522 [2018-04-12 20:54:26,581 INFO L226 Difference]: Without dead ends: 522 [2018-04-12 20:54:26,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 20:54:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-12 20:54:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-04-12 20:54:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-12 20:54:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-04-12 20:54:26,586 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-04-12 20:54:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:26,586 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-04-12 20:54:26,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-12 20:54:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-04-12 20:54:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-12 20:54:26,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:26,588 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:26,588 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash -659298360, now seen corresponding path program 38 times [2018-04-12 20:54:26,589 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:26,599 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:27,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:27,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-12 20:54:27,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:27,054 INFO L182 omatonBuilderFactory]: Interpolants [22784#(<= main_~i~0 31), 22785#(<= main_~i~0 32), 22786#(<= main_~i~0 33), 22787#(<= main_~i~0 34), 22788#(<= main_~i~0 35), 22789#(<= main_~i~0 36), 22790#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 22791#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 22792#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 22751#true, 22752#false, 22753#(<= main_~i~0 0), 22754#(<= main_~i~0 1), 22755#(<= main_~i~0 2), 22756#(<= main_~i~0 3), 22757#(<= main_~i~0 4), 22758#(<= main_~i~0 5), 22759#(<= main_~i~0 6), 22760#(<= main_~i~0 7), 22761#(<= main_~i~0 8), 22762#(<= main_~i~0 9), 22763#(<= main_~i~0 10), 22764#(<= main_~i~0 11), 22765#(<= main_~i~0 12), 22766#(<= main_~i~0 13), 22767#(<= main_~i~0 14), 22768#(<= main_~i~0 15), 22769#(<= main_~i~0 16), 22770#(<= main_~i~0 17), 22771#(<= main_~i~0 18), 22772#(<= main_~i~0 19), 22773#(<= main_~i~0 20), 22774#(<= main_~i~0 21), 22775#(<= main_~i~0 22), 22776#(<= main_~i~0 23), 22777#(<= main_~i~0 24), 22778#(<= main_~i~0 25), 22779#(<= main_~i~0 26), 22780#(<= main_~i~0 27), 22781#(<= main_~i~0 28), 22782#(<= main_~i~0 29), 22783#(<= main_~i~0 30)] [2018-04-12 20:54:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:27,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 20:54:27,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 20:54:27,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 20:54:27,055 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-04-12 20:54:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:28,237 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-04-12 20:54:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 20:54:28,237 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-12 20:54:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:28,238 INFO L225 Difference]: With dead ends: 535 [2018-04-12 20:54:28,238 INFO L226 Difference]: Without dead ends: 535 [2018-04-12 20:54:28,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 20:54:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-12 20:54:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-04-12 20:54:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-12 20:54:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-04-12 20:54:28,242 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-04-12 20:54:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:28,242 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-04-12 20:54:28,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 20:54:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-04-12 20:54:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-12 20:54:28,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:28,243 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:28,243 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 656285237, now seen corresponding path program 39 times [2018-04-12 20:54:28,244 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:28,250 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:28,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:28,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 20:54:28,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:28,725 INFO L182 omatonBuilderFactory]: Interpolants [23936#(<= main_~i~0 36), 23937#(<= main_~i~0 37), 23938#(<= main_~i~0 38), 23939#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 23940#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 23898#true, 23899#false, 23900#(<= main_~i~0 0), 23901#(<= main_~i~0 1), 23902#(<= main_~i~0 2), 23903#(<= main_~i~0 3), 23904#(<= main_~i~0 4), 23905#(<= main_~i~0 5), 23906#(<= main_~i~0 6), 23907#(<= main_~i~0 7), 23908#(<= main_~i~0 8), 23909#(<= main_~i~0 9), 23910#(<= main_~i~0 10), 23911#(<= main_~i~0 11), 23912#(<= main_~i~0 12), 23913#(<= main_~i~0 13), 23914#(<= main_~i~0 14), 23915#(<= main_~i~0 15), 23916#(<= main_~i~0 16), 23917#(<= main_~i~0 17), 23918#(<= main_~i~0 18), 23919#(<= main_~i~0 19), 23920#(<= main_~i~0 20), 23921#(<= main_~i~0 21), 23922#(<= main_~i~0 22), 23923#(<= main_~i~0 23), 23924#(<= main_~i~0 24), 23925#(<= main_~i~0 25), 23926#(<= main_~i~0 26), 23927#(<= main_~i~0 27), 23928#(<= main_~i~0 28), 23929#(<= main_~i~0 29), 23930#(<= main_~i~0 30), 23931#(<= main_~i~0 31), 23932#(<= main_~i~0 32), 23933#(<= main_~i~0 33), 23934#(<= main_~i~0 34), 23935#(<= main_~i~0 35)] [2018-04-12 20:54:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:28,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 20:54:28,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 20:54:28,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 20:54:28,727 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-04-12 20:54:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:29,887 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-04-12 20:54:29,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 20:54:29,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-12 20:54:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:29,888 INFO L225 Difference]: With dead ends: 548 [2018-04-12 20:54:29,888 INFO L226 Difference]: Without dead ends: 548 [2018-04-12 20:54:29,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 20:54:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-12 20:54:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-04-12 20:54:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-12 20:54:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-04-12 20:54:29,896 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-04-12 20:54:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:29,896 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-04-12 20:54:29,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 20:54:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-04-12 20:54:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-12 20:54:29,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:29,897 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:29,897 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash 715514856, now seen corresponding path program 40 times [2018-04-12 20:54:29,898 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:29,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:30,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:30,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-12 20:54:30,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:30,337 INFO L182 omatonBuilderFactory]: Interpolants [25088#(<= main_~i~0 13), 25089#(<= main_~i~0 14), 25090#(<= main_~i~0 15), 25091#(<= main_~i~0 16), 25092#(<= main_~i~0 17), 25093#(<= main_~i~0 18), 25094#(<= main_~i~0 19), 25095#(<= main_~i~0 20), 25096#(<= main_~i~0 21), 25097#(<= main_~i~0 22), 25098#(<= main_~i~0 23), 25099#(<= main_~i~0 24), 25100#(<= main_~i~0 25), 25101#(<= main_~i~0 26), 25102#(<= main_~i~0 27), 25103#(<= main_~i~0 28), 25104#(<= main_~i~0 29), 25105#(<= main_~i~0 30), 25106#(<= main_~i~0 31), 25107#(<= main_~i~0 32), 25108#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 25109#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 25110#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 25111#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 25112#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 25113#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 25114#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 25115#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 25116#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 25073#true, 25074#false, 25075#(<= main_~i~0 0), 25076#(<= main_~i~0 1), 25077#(<= main_~i~0 2), 25078#(<= main_~i~0 3), 25079#(<= main_~i~0 4), 25080#(<= main_~i~0 5), 25081#(<= main_~i~0 6), 25082#(<= main_~i~0 7), 25083#(<= main_~i~0 8), 25084#(<= main_~i~0 9), 25085#(<= main_~i~0 10), 25086#(<= main_~i~0 11), 25087#(<= main_~i~0 12)] [2018-04-12 20:54:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:30,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 20:54:30,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 20:54:30,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 20:54:30,338 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-04-12 20:54:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:31,955 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-04-12 20:54:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 20:54:31,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-12 20:54:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:31,956 INFO L225 Difference]: With dead ends: 561 [2018-04-12 20:54:31,956 INFO L226 Difference]: Without dead ends: 561 [2018-04-12 20:54:31,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 20:54:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-12 20:54:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-04-12 20:54:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-12 20:54:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-04-12 20:54:31,960 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-04-12 20:54:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:31,960 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-04-12 20:54:31,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 20:54:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-04-12 20:54:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-12 20:54:31,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:31,961 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:31,961 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1616595435, now seen corresponding path program 41 times [2018-04-12 20:54:31,962 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:31,968 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:32,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:32,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 20:54:32,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:32,406 INFO L182 omatonBuilderFactory]: Interpolants [26304#(<= main_~i~0 26), 26305#(<= main_~i~0 27), 26306#(<= main_~i~0 28), 26307#(<= main_~i~0 29), 26308#(<= main_~i~0 30), 26309#(<= main_~i~0 31), 26310#(<= main_~i~0 32), 26311#(<= main_~i~0 33), 26312#(<= main_~i~0 34), 26313#(<= main_~i~0 35), 26314#(<= main_~i~0 36), 26315#(<= main_~i~0 37), 26316#(<= main_~i~0 38), 26317#(<= main_~i~0 39), 26318#(<= main_~i~0 40), 26319#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 26320#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 26276#true, 26277#false, 26278#(<= main_~i~0 0), 26279#(<= main_~i~0 1), 26280#(<= main_~i~0 2), 26281#(<= main_~i~0 3), 26282#(<= main_~i~0 4), 26283#(<= main_~i~0 5), 26284#(<= main_~i~0 6), 26285#(<= main_~i~0 7), 26286#(<= main_~i~0 8), 26287#(<= main_~i~0 9), 26288#(<= main_~i~0 10), 26289#(<= main_~i~0 11), 26290#(<= main_~i~0 12), 26291#(<= main_~i~0 13), 26292#(<= main_~i~0 14), 26293#(<= main_~i~0 15), 26294#(<= main_~i~0 16), 26295#(<= main_~i~0 17), 26296#(<= main_~i~0 18), 26297#(<= main_~i~0 19), 26298#(<= main_~i~0 20), 26299#(<= main_~i~0 21), 26300#(<= main_~i~0 22), 26301#(<= main_~i~0 23), 26302#(<= main_~i~0 24), 26303#(<= main_~i~0 25)] [2018-04-12 20:54:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:32,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-12 20:54:32,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-12 20:54:32,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 20:54:32,407 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 45 states. [2018-04-12 20:54:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:33,515 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-04-12 20:54:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 20:54:33,516 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-04-12 20:54:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:33,517 INFO L225 Difference]: With dead ends: 574 [2018-04-12 20:54:33,517 INFO L226 Difference]: Without dead ends: 574 [2018-04-12 20:54:33,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 20:54:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-12 20:54:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-04-12 20:54:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-12 20:54:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-04-12 20:54:33,520 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-04-12 20:54:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:33,521 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-04-12 20:54:33,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-12 20:54:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-04-12 20:54:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-12 20:54:33,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:33,521 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:33,521 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1071855624, now seen corresponding path program 42 times [2018-04-12 20:54:33,522 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:33,528 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:33,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:33,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-12 20:54:33,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:33,946 INFO L182 omatonBuilderFactory]: Interpolants [27520#(<= main_~i~0 11), 27521#(<= main_~i~0 12), 27522#(<= main_~i~0 13), 27523#(<= main_~i~0 14), 27524#(<= main_~i~0 15), 27525#(<= main_~i~0 16), 27526#(<= main_~i~0 17), 27527#(<= main_~i~0 18), 27528#(<= main_~i~0 19), 27529#(<= main_~i~0 20), 27530#(<= main_~i~0 21), 27531#(<= main_~i~0 22), 27532#(<= main_~i~0 23), 27533#(<= main_~i~0 24), 27534#(<= main_~i~0 25), 27535#(<= main_~i~0 26), 27536#(<= main_~i~0 27), 27537#(<= main_~i~0 28), 27538#(<= main_~i~0 29), 27539#(<= main_~i~0 30), 27540#(<= main_~i~0 31), 27541#(<= main_~i~0 32), 27542#(<= main_~i~0 33), 27543#(<= main_~i~0 34), 27544#(<= main_~i~0 35), 27545#(<= main_~i~0 36), 27546#(<= main_~i~0 37), 27547#(<= main_~i~0 38), 27548#(<= main_~i~0 39), 27549#(<= main_~i~0 40), 27550#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 27551#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 27552#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 27507#true, 27508#false, 27509#(<= main_~i~0 0), 27510#(<= main_~i~0 1), 27511#(<= main_~i~0 2), 27512#(<= main_~i~0 3), 27513#(<= main_~i~0 4), 27514#(<= main_~i~0 5), 27515#(<= main_~i~0 6), 27516#(<= main_~i~0 7), 27517#(<= main_~i~0 8), 27518#(<= main_~i~0 9), 27519#(<= main_~i~0 10)] [2018-04-12 20:54:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:33,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 20:54:33,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 20:54:33,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 20:54:33,947 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 46 states. [2018-04-12 20:54:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:35,190 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-04-12 20:54:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-12 20:54:35,190 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-04-12 20:54:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:35,192 INFO L225 Difference]: With dead ends: 587 [2018-04-12 20:54:35,192 INFO L226 Difference]: Without dead ends: 587 [2018-04-12 20:54:35,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-04-12 20:54:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-12 20:54:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-04-12 20:54:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-12 20:54:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-04-12 20:54:35,197 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-04-12 20:54:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:35,198 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-04-12 20:54:35,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 20:54:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-04-12 20:54:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-12 20:54:35,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:35,199 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:35,199 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash -701041163, now seen corresponding path program 43 times [2018-04-12 20:54:35,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:35,206 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:35,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:35,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 20:54:35,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:35,671 INFO L182 omatonBuilderFactory]: Interpolants [28800#(<= main_~i~0 32), 28801#(<= main_~i~0 33), 28802#(<= main_~i~0 34), 28803#(<= main_~i~0 35), 28804#(<= main_~i~0 36), 28805#(<= main_~i~0 37), 28806#(<= main_~i~0 38), 28807#(<= main_~i~0 39), 28808#(<= main_~i~0 40), 28809#(<= main_~i~0 41), 28810#(<= main_~i~0 42), 28811#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 28812#(and (<= 1 main_~i~0) (<= main_~i~0 43)), 28766#true, 28767#false, 28768#(<= main_~i~0 0), 28769#(<= main_~i~0 1), 28770#(<= main_~i~0 2), 28771#(<= main_~i~0 3), 28772#(<= main_~i~0 4), 28773#(<= main_~i~0 5), 28774#(<= main_~i~0 6), 28775#(<= main_~i~0 7), 28776#(<= main_~i~0 8), 28777#(<= main_~i~0 9), 28778#(<= main_~i~0 10), 28779#(<= main_~i~0 11), 28780#(<= main_~i~0 12), 28781#(<= main_~i~0 13), 28782#(<= main_~i~0 14), 28783#(<= main_~i~0 15), 28784#(<= main_~i~0 16), 28785#(<= main_~i~0 17), 28786#(<= main_~i~0 18), 28787#(<= main_~i~0 19), 28788#(<= main_~i~0 20), 28789#(<= main_~i~0 21), 28790#(<= main_~i~0 22), 28791#(<= main_~i~0 23), 28792#(<= main_~i~0 24), 28793#(<= main_~i~0 25), 28794#(<= main_~i~0 26), 28795#(<= main_~i~0 27), 28796#(<= main_~i~0 28), 28797#(<= main_~i~0 29), 28798#(<= main_~i~0 30), 28799#(<= main_~i~0 31)] [2018-04-12 20:54:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:35,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-12 20:54:35,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-12 20:54:35,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 20:54:35,672 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-04-12 20:54:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:36,875 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-04-12 20:54:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 20:54:36,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-12 20:54:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:36,876 INFO L225 Difference]: With dead ends: 600 [2018-04-12 20:54:36,877 INFO L226 Difference]: Without dead ends: 600 [2018-04-12 20:54:36,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 20:54:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-12 20:54:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-04-12 20:54:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-12 20:54:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-04-12 20:54:36,880 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-04-12 20:54:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:36,880 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-04-12 20:54:36,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-12 20:54:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-04-12 20:54:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-12 20:54:36,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:36,881 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:36,881 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1411245096, now seen corresponding path program 44 times [2018-04-12 20:54:36,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:36,888 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:37,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:37,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-12 20:54:37,383 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:37,383 INFO L182 omatonBuilderFactory]: Interpolants [30080#(<= main_~i~0 25), 30081#(<= main_~i~0 26), 30082#(<= main_~i~0 27), 30083#(<= main_~i~0 28), 30084#(<= main_~i~0 29), 30085#(<= main_~i~0 30), 30086#(<= main_~i~0 31), 30087#(<= main_~i~0 32), 30088#(<= main_~i~0 33), 30089#(<= main_~i~0 34), 30090#(<= main_~i~0 35), 30091#(<= main_~i~0 36), 30092#(<= main_~i~0 37), 30093#(<= main_~i~0 38), 30094#(<= main_~i~0 39), 30095#(<= main_~i~0 40), 30096#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 30097#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 30098#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 30099#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 30100#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 30053#true, 30054#false, 30055#(<= main_~i~0 0), 30056#(<= main_~i~0 1), 30057#(<= main_~i~0 2), 30058#(<= main_~i~0 3), 30059#(<= main_~i~0 4), 30060#(<= main_~i~0 5), 30061#(<= main_~i~0 6), 30062#(<= main_~i~0 7), 30063#(<= main_~i~0 8), 30064#(<= main_~i~0 9), 30065#(<= main_~i~0 10), 30066#(<= main_~i~0 11), 30067#(<= main_~i~0 12), 30068#(<= main_~i~0 13), 30069#(<= main_~i~0 14), 30070#(<= main_~i~0 15), 30071#(<= main_~i~0 16), 30072#(<= main_~i~0 17), 30073#(<= main_~i~0 18), 30074#(<= main_~i~0 19), 30075#(<= main_~i~0 20), 30076#(<= main_~i~0 21), 30077#(<= main_~i~0 22), 30078#(<= main_~i~0 23), 30079#(<= main_~i~0 24)] [2018-04-12 20:54:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:37,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 20:54:37,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 20:54:37,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 20:54:37,384 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 48 states. [2018-04-12 20:54:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:38,808 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-04-12 20:54:38,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 20:54:38,808 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-04-12 20:54:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:38,809 INFO L225 Difference]: With dead ends: 613 [2018-04-12 20:54:38,809 INFO L226 Difference]: Without dead ends: 613 [2018-04-12 20:54:38,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 20:54:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-12 20:54:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-04-12 20:54:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-04-12 20:54:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-04-12 20:54:38,814 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-04-12 20:54:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:38,814 INFO L459 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-04-12 20:54:38,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 20:54:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-04-12 20:54:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-12 20:54:38,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:38,816 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:38,816 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 241360341, now seen corresponding path program 45 times [2018-04-12 20:54:38,817 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:38,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:39,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:39,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 20:54:39,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:39,340 INFO L182 omatonBuilderFactory]: Interpolants [31368#true, 31369#false, 31370#(<= main_~i~0 0), 31371#(<= main_~i~0 1), 31372#(<= main_~i~0 2), 31373#(<= main_~i~0 3), 31374#(<= main_~i~0 4), 31375#(<= main_~i~0 5), 31376#(<= main_~i~0 6), 31377#(<= main_~i~0 7), 31378#(<= main_~i~0 8), 31379#(<= main_~i~0 9), 31380#(<= main_~i~0 10), 31381#(<= main_~i~0 11), 31382#(<= main_~i~0 12), 31383#(<= main_~i~0 13), 31384#(<= main_~i~0 14), 31385#(<= main_~i~0 15), 31386#(<= main_~i~0 16), 31387#(<= main_~i~0 17), 31388#(<= main_~i~0 18), 31389#(<= main_~i~0 19), 31390#(<= main_~i~0 20), 31391#(<= main_~i~0 21), 31392#(<= main_~i~0 22), 31393#(<= main_~i~0 23), 31394#(<= main_~i~0 24), 31395#(<= main_~i~0 25), 31396#(<= main_~i~0 26), 31397#(<= main_~i~0 27), 31398#(<= main_~i~0 28), 31399#(<= main_~i~0 29), 31400#(<= main_~i~0 30), 31401#(<= main_~i~0 31), 31402#(<= main_~i~0 32), 31403#(<= main_~i~0 33), 31404#(<= main_~i~0 34), 31405#(<= main_~i~0 35), 31406#(<= main_~i~0 36), 31407#(<= main_~i~0 37), 31408#(<= main_~i~0 38), 31409#(<= main_~i~0 39), 31410#(<= main_~i~0 40), 31411#(<= main_~i~0 41), 31412#(<= main_~i~0 42), 31413#(<= main_~i~0 43), 31414#(<= main_~i~0 44), 31415#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 31416#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-04-12 20:54:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:39,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 20:54:39,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 20:54:39,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 20:54:39,341 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-04-12 20:54:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:40,744 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-04-12 20:54:40,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 20:54:40,779 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-12 20:54:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:40,781 INFO L225 Difference]: With dead ends: 626 [2018-04-12 20:54:40,781 INFO L226 Difference]: Without dead ends: 626 [2018-04-12 20:54:40,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 20:54:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-12 20:54:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-04-12 20:54:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-12 20:54:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-04-12 20:54:40,787 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-04-12 20:54:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:40,788 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-04-12 20:54:40,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 20:54:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-04-12 20:54:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-12 20:54:40,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:40,789 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:40,789 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 747104328, now seen corresponding path program 46 times [2018-04-12 20:54:40,790 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:40,800 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:41,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:41,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-12 20:54:41,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:41,271 INFO L182 omatonBuilderFactory]: Interpolants [32711#true, 32712#false, 32713#(<= main_~i~0 0), 32714#(<= main_~i~0 1), 32715#(<= main_~i~0 2), 32716#(<= main_~i~0 3), 32717#(<= main_~i~0 4), 32718#(<= main_~i~0 5), 32719#(<= main_~i~0 6), 32720#(<= main_~i~0 7), 32721#(<= main_~i~0 8), 32722#(<= main_~i~0 9), 32723#(<= main_~i~0 10), 32724#(<= main_~i~0 11), 32725#(<= main_~i~0 12), 32726#(<= main_~i~0 13), 32727#(<= main_~i~0 14), 32728#(<= main_~i~0 15), 32729#(<= main_~i~0 16), 32730#(<= main_~i~0 17), 32731#(<= main_~i~0 18), 32732#(<= main_~i~0 19), 32733#(<= main_~i~0 20), 32734#(<= main_~i~0 21), 32735#(<= main_~i~0 22), 32736#(<= main_~i~0 23), 32737#(<= main_~i~0 24), 32738#(<= main_~i~0 25), 32739#(<= main_~i~0 26), 32740#(<= main_~i~0 27), 32741#(<= main_~i~0 28), 32742#(<= main_~i~0 29), 32743#(<= main_~i~0 30), 32744#(<= main_~i~0 31), 32745#(<= main_~i~0 32), 32746#(<= main_~i~0 33), 32747#(<= main_~i~0 34), 32748#(<= main_~i~0 35), 32749#(<= main_~i~0 36), 32750#(<= main_~i~0 37), 32751#(<= main_~i~0 38), 32752#(<= main_~i~0 39), 32753#(<= main_~i~0 40), 32754#(<= main_~i~0 41), 32755#(<= main_~i~0 42), 32756#(<= main_~i~0 43), 32757#(<= main_~i~0 44), 32758#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 32759#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 32760#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-04-12 20:54:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:41,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 20:54:41,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 20:54:41,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 20:54:41,272 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-04-12 20:54:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:42,799 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-04-12 20:54:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-12 20:54:42,800 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-12 20:54:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:42,801 INFO L225 Difference]: With dead ends: 639 [2018-04-12 20:54:42,801 INFO L226 Difference]: Without dead ends: 639 [2018-04-12 20:54:42,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 20:54:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-12 20:54:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-04-12 20:54:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-12 20:54:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-04-12 20:54:42,805 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-04-12 20:54:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:42,805 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-04-12 20:54:42,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 20:54:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-04-12 20:54:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-12 20:54:42,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:42,806 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:42,806 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash -231313995, now seen corresponding path program 47 times [2018-04-12 20:54:42,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:42,813 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:43,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:43,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 20:54:43,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:43,357 INFO L182 omatonBuilderFactory]: Interpolants [34082#true, 34083#false, 34084#(<= main_~i~0 0), 34085#(<= main_~i~0 1), 34086#(<= main_~i~0 2), 34087#(<= main_~i~0 3), 34088#(<= main_~i~0 4), 34089#(<= main_~i~0 5), 34090#(<= main_~i~0 6), 34091#(<= main_~i~0 7), 34092#(<= main_~i~0 8), 34093#(<= main_~i~0 9), 34094#(<= main_~i~0 10), 34095#(<= main_~i~0 11), 34096#(<= main_~i~0 12), 34097#(<= main_~i~0 13), 34098#(<= main_~i~0 14), 34099#(<= main_~i~0 15), 34100#(<= main_~i~0 16), 34101#(<= main_~i~0 17), 34102#(<= main_~i~0 18), 34103#(<= main_~i~0 19), 34104#(<= main_~i~0 20), 34105#(<= main_~i~0 21), 34106#(<= main_~i~0 22), 34107#(<= main_~i~0 23), 34108#(<= main_~i~0 24), 34109#(<= main_~i~0 25), 34110#(<= main_~i~0 26), 34111#(<= main_~i~0 27), 34112#(<= main_~i~0 28), 34113#(<= main_~i~0 29), 34114#(<= main_~i~0 30), 34115#(<= main_~i~0 31), 34116#(<= main_~i~0 32), 34117#(<= main_~i~0 33), 34118#(<= main_~i~0 34), 34119#(<= main_~i~0 35), 34120#(<= main_~i~0 36), 34121#(<= main_~i~0 37), 34122#(<= main_~i~0 38), 34123#(<= main_~i~0 39), 34124#(<= main_~i~0 40), 34125#(<= main_~i~0 41), 34126#(<= main_~i~0 42), 34127#(<= main_~i~0 43), 34128#(<= main_~i~0 44), 34129#(<= main_~i~0 45), 34130#(<= main_~i~0 46), 34131#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 34132#(and (<= 1 main_~i~0) (<= main_~i~0 47))] [2018-04-12 20:54:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:43,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-12 20:54:43,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-12 20:54:43,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 20:54:43,358 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 51 states. [2018-04-12 20:54:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:44,937 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-04-12 20:54:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 20:54:44,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-04-12 20:54:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:44,939 INFO L225 Difference]: With dead ends: 652 [2018-04-12 20:54:44,939 INFO L226 Difference]: Without dead ends: 652 [2018-04-12 20:54:44,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 20:54:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-12 20:54:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-04-12 20:54:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-12 20:54:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-04-12 20:54:44,943 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-04-12 20:54:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:44,943 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-04-12 20:54:44,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-12 20:54:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-04-12 20:54:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-12 20:54:44,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:44,944 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:44,944 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 936592488, now seen corresponding path program 48 times [2018-04-12 20:54:44,945 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:44,954 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:45,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:45,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-12 20:54:45,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:45,455 INFO L182 omatonBuilderFactory]: Interpolants [35481#true, 35482#false, 35483#(<= main_~i~0 0), 35484#(<= main_~i~0 1), 35485#(<= main_~i~0 2), 35486#(<= main_~i~0 3), 35487#(<= main_~i~0 4), 35488#(<= main_~i~0 5), 35489#(<= main_~i~0 6), 35490#(<= main_~i~0 7), 35491#(<= main_~i~0 8), 35492#(<= main_~i~0 9), 35493#(<= main_~i~0 10), 35494#(<= main_~i~0 11), 35495#(<= main_~i~0 12), 35496#(<= main_~i~0 13), 35497#(<= main_~i~0 14), 35498#(<= main_~i~0 15), 35499#(<= main_~i~0 16), 35500#(<= main_~i~0 17), 35501#(<= main_~i~0 18), 35502#(<= main_~i~0 19), 35503#(<= main_~i~0 20), 35504#(<= main_~i~0 21), 35505#(<= main_~i~0 22), 35506#(<= main_~i~0 23), 35507#(<= main_~i~0 24), 35508#(<= main_~i~0 25), 35509#(<= main_~i~0 26), 35510#(<= main_~i~0 27), 35511#(<= main_~i~0 28), 35512#(<= main_~i~0 29), 35513#(<= main_~i~0 30), 35514#(<= main_~i~0 31), 35515#(<= main_~i~0 32), 35516#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 35517#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 35518#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 35519#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 35520#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 35521#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 35522#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 35523#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 35524#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 35525#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 35526#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 35527#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 35528#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 35529#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 35530#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 35531#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 35532#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-04-12 20:54:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:45,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 20:54:45,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 20:54:45,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 20:54:45,456 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 52 states. [2018-04-12 20:54:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:48,528 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-04-12 20:54:48,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 20:54:48,528 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-04-12 20:54:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:48,529 INFO L225 Difference]: With dead ends: 665 [2018-04-12 20:54:48,529 INFO L226 Difference]: Without dead ends: 665 [2018-04-12 20:54:48,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 20:54:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-12 20:54:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-04-12 20:54:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-12 20:54:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-04-12 20:54:48,534 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-04-12 20:54:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:48,534 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-04-12 20:54:48,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 20:54:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-04-12 20:54:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-12 20:54:48,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:48,535 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:48,535 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1916773781, now seen corresponding path program 49 times [2018-04-12 20:54:48,535 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:48,542 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:49,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:49,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 20:54:49,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:49,168 INFO L182 omatonBuilderFactory]: Interpolants [36908#true, 36909#false, 36910#(<= main_~i~0 0), 36911#(<= main_~i~0 1), 36912#(<= main_~i~0 2), 36913#(<= main_~i~0 3), 36914#(<= main_~i~0 4), 36915#(<= main_~i~0 5), 36916#(<= main_~i~0 6), 36917#(<= main_~i~0 7), 36918#(<= main_~i~0 8), 36919#(<= main_~i~0 9), 36920#(<= main_~i~0 10), 36921#(<= main_~i~0 11), 36922#(<= main_~i~0 12), 36923#(<= main_~i~0 13), 36924#(<= main_~i~0 14), 36925#(<= main_~i~0 15), 36926#(<= main_~i~0 16), 36927#(<= main_~i~0 17), 36928#(<= main_~i~0 18), 36929#(<= main_~i~0 19), 36930#(<= main_~i~0 20), 36931#(<= main_~i~0 21), 36932#(<= main_~i~0 22), 36933#(<= main_~i~0 23), 36934#(<= main_~i~0 24), 36935#(<= main_~i~0 25), 36936#(<= main_~i~0 26), 36937#(<= main_~i~0 27), 36938#(<= main_~i~0 28), 36939#(<= main_~i~0 29), 36940#(<= main_~i~0 30), 36941#(<= main_~i~0 31), 36942#(<= main_~i~0 32), 36943#(<= main_~i~0 33), 36944#(<= main_~i~0 34), 36945#(<= main_~i~0 35), 36946#(<= main_~i~0 36), 36947#(<= main_~i~0 37), 36948#(<= main_~i~0 38), 36949#(<= main_~i~0 39), 36950#(<= main_~i~0 40), 36951#(<= main_~i~0 41), 36952#(<= main_~i~0 42), 36953#(<= main_~i~0 43), 36954#(<= main_~i~0 44), 36955#(<= main_~i~0 45), 36956#(<= main_~i~0 46), 36957#(<= main_~i~0 47), 36958#(<= main_~i~0 48), 36959#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 36960#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-04-12 20:54:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:49,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-12 20:54:49,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-12 20:54:49,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 20:54:49,169 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-04-12 20:54:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:50,751 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-04-12 20:54:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 20:54:50,751 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-12 20:54:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:50,753 INFO L225 Difference]: With dead ends: 678 [2018-04-12 20:54:50,753 INFO L226 Difference]: Without dead ends: 678 [2018-04-12 20:54:50,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 20:54:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-12 20:54:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-04-12 20:54:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-12 20:54:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-04-12 20:54:50,758 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-04-12 20:54:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:50,758 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-04-12 20:54:50,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-12 20:54:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-04-12 20:54:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-12 20:54:50,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:50,760 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:50,760 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1372456824, now seen corresponding path program 50 times [2018-04-12 20:54:50,760 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:50,771 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:51,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:51,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-12 20:54:51,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:51,384 INFO L182 omatonBuilderFactory]: Interpolants [38400#(<= main_~i~0 35), 38401#(<= main_~i~0 36), 38402#(<= main_~i~0 37), 38403#(<= main_~i~0 38), 38404#(<= main_~i~0 39), 38405#(<= main_~i~0 40), 38406#(<= main_~i~0 41), 38407#(<= main_~i~0 42), 38408#(<= main_~i~0 43), 38409#(<= main_~i~0 44), 38410#(<= main_~i~0 45), 38411#(<= main_~i~0 46), 38412#(<= main_~i~0 47), 38413#(<= main_~i~0 48), 38414#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 38415#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 38416#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 38363#true, 38364#false, 38365#(<= main_~i~0 0), 38366#(<= main_~i~0 1), 38367#(<= main_~i~0 2), 38368#(<= main_~i~0 3), 38369#(<= main_~i~0 4), 38370#(<= main_~i~0 5), 38371#(<= main_~i~0 6), 38372#(<= main_~i~0 7), 38373#(<= main_~i~0 8), 38374#(<= main_~i~0 9), 38375#(<= main_~i~0 10), 38376#(<= main_~i~0 11), 38377#(<= main_~i~0 12), 38378#(<= main_~i~0 13), 38379#(<= main_~i~0 14), 38380#(<= main_~i~0 15), 38381#(<= main_~i~0 16), 38382#(<= main_~i~0 17), 38383#(<= main_~i~0 18), 38384#(<= main_~i~0 19), 38385#(<= main_~i~0 20), 38386#(<= main_~i~0 21), 38387#(<= main_~i~0 22), 38388#(<= main_~i~0 23), 38389#(<= main_~i~0 24), 38390#(<= main_~i~0 25), 38391#(<= main_~i~0 26), 38392#(<= main_~i~0 27), 38393#(<= main_~i~0 28), 38394#(<= main_~i~0 29), 38395#(<= main_~i~0 30), 38396#(<= main_~i~0 31), 38397#(<= main_~i~0 32), 38398#(<= main_~i~0 33), 38399#(<= main_~i~0 34)] [2018-04-12 20:54:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:51,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 20:54:51,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 20:54:51,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 20:54:51,385 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 54 states. [2018-04-12 20:54:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:53,004 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-04-12 20:54:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 20:54:53,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-04-12 20:54:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:53,005 INFO L225 Difference]: With dead ends: 691 [2018-04-12 20:54:53,005 INFO L226 Difference]: Without dead ends: 691 [2018-04-12 20:54:53,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 20:54:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-12 20:54:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-04-12 20:54:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-12 20:54:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-04-12 20:54:53,009 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-04-12 20:54:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:53,009 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-04-12 20:54:53,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 20:54:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-04-12 20:54:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-12 20:54:53,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:53,010 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:53,010 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1517517451, now seen corresponding path program 51 times [2018-04-12 20:54:53,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:53,020 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:53,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:53,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 20:54:53,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:53,618 INFO L182 omatonBuilderFactory]: Interpolants [39846#true, 39847#false, 39848#(<= main_~i~0 0), 39849#(<= main_~i~0 1), 39850#(<= main_~i~0 2), 39851#(<= main_~i~0 3), 39852#(<= main_~i~0 4), 39853#(<= main_~i~0 5), 39854#(<= main_~i~0 6), 39855#(<= main_~i~0 7), 39856#(<= main_~i~0 8), 39857#(<= main_~i~0 9), 39858#(<= main_~i~0 10), 39859#(<= main_~i~0 11), 39860#(<= main_~i~0 12), 39861#(<= main_~i~0 13), 39862#(<= main_~i~0 14), 39863#(<= main_~i~0 15), 39864#(<= main_~i~0 16), 39865#(<= main_~i~0 17), 39866#(<= main_~i~0 18), 39867#(<= main_~i~0 19), 39868#(<= main_~i~0 20), 39869#(<= main_~i~0 21), 39870#(<= main_~i~0 22), 39871#(<= main_~i~0 23), 39872#(<= main_~i~0 24), 39873#(<= main_~i~0 25), 39874#(<= main_~i~0 26), 39875#(<= main_~i~0 27), 39876#(<= main_~i~0 28), 39877#(<= main_~i~0 29), 39878#(<= main_~i~0 30), 39879#(<= main_~i~0 31), 39880#(<= main_~i~0 32), 39881#(<= main_~i~0 33), 39882#(<= main_~i~0 34), 39883#(<= main_~i~0 35), 39884#(<= main_~i~0 36), 39885#(<= main_~i~0 37), 39886#(<= main_~i~0 38), 39887#(<= main_~i~0 39), 39888#(<= main_~i~0 40), 39889#(<= main_~i~0 41), 39890#(<= main_~i~0 42), 39891#(<= main_~i~0 43), 39892#(<= main_~i~0 44), 39893#(<= main_~i~0 45), 39894#(<= main_~i~0 46), 39895#(<= main_~i~0 47), 39896#(<= main_~i~0 48), 39897#(<= main_~i~0 49), 39898#(<= main_~i~0 50), 39899#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 39900#(and (<= 1 main_~i~0) (<= main_~i~0 51))] [2018-04-12 20:54:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:53,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 20:54:53,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 20:54:53,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 20:54:53,619 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-04-12 20:54:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:55,371 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-04-12 20:54:55,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 20:54:55,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-12 20:54:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:55,373 INFO L225 Difference]: With dead ends: 704 [2018-04-12 20:54:55,373 INFO L226 Difference]: Without dead ends: 704 [2018-04-12 20:54:55,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 20:54:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-12 20:54:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-04-12 20:54:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-04-12 20:54:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-04-12 20:54:55,378 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-04-12 20:54:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:55,378 INFO L459 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-04-12 20:54:55,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 20:54:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-04-12 20:54:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-12 20:54:55,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:55,379 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:55,379 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1319762776, now seen corresponding path program 52 times [2018-04-12 20:54:55,379 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:55,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:55,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:55,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-12 20:54:55,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:55,998 INFO L182 omatonBuilderFactory]: Interpolants [41357#true, 41358#false, 41359#(<= main_~i~0 0), 41360#(<= main_~i~0 1), 41361#(<= main_~i~0 2), 41362#(<= main_~i~0 3), 41363#(<= main_~i~0 4), 41364#(<= main_~i~0 5), 41365#(<= main_~i~0 6), 41366#(<= main_~i~0 7), 41367#(<= main_~i~0 8), 41368#(<= main_~i~0 9), 41369#(<= main_~i~0 10), 41370#(<= main_~i~0 11), 41371#(<= main_~i~0 12), 41372#(<= main_~i~0 13), 41373#(<= main_~i~0 14), 41374#(<= main_~i~0 15), 41375#(<= main_~i~0 16), 41376#(<= main_~i~0 17), 41377#(<= main_~i~0 18), 41378#(<= main_~i~0 19), 41379#(<= main_~i~0 20), 41380#(<= main_~i~0 21), 41381#(<= main_~i~0 22), 41382#(<= main_~i~0 23), 41383#(<= main_~i~0 24), 41384#(<= main_~i~0 25), 41385#(<= main_~i~0 26), 41386#(<= main_~i~0 27), 41387#(<= main_~i~0 28), 41388#(<= main_~i~0 29), 41389#(<= main_~i~0 30), 41390#(<= main_~i~0 31), 41391#(<= main_~i~0 32), 41392#(<= main_~i~0 33), 41393#(<= main_~i~0 34), 41394#(<= main_~i~0 35), 41395#(<= main_~i~0 36), 41396#(<= main_~i~0 37), 41397#(<= main_~i~0 38), 41398#(<= main_~i~0 39), 41399#(<= main_~i~0 40), 41400#(<= main_~i~0 41), 41401#(<= main_~i~0 42), 41402#(<= main_~i~0 43), 41403#(<= main_~i~0 44), 41404#(<= main_~i~0 45), 41405#(<= main_~i~0 46), 41406#(<= main_~i~0 47), 41407#(<= main_~i~0 48), 41408#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 41409#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 41410#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 41411#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 41412#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-04-12 20:54:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:55,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 20:54:55,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 20:54:55,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 20:54:55,999 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 56 states. [2018-04-12 20:54:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:54:58,064 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-04-12 20:54:58,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-12 20:54:58,065 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-04-12 20:54:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:54:58,066 INFO L225 Difference]: With dead ends: 717 [2018-04-12 20:54:58,066 INFO L226 Difference]: Without dead ends: 717 [2018-04-12 20:54:58,066 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-04-12 20:54:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-12 20:54:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-04-12 20:54:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-12 20:54:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-04-12 20:54:58,070 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-04-12 20:54:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:54:58,070 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-04-12 20:54:58,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 20:54:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-04-12 20:54:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-12 20:54:58,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:54:58,071 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-12 20:54:58,071 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:54:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1448407723, now seen corresponding path program 53 times [2018-04-12 20:54:58,072 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:54:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:54:58,078 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:54:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:58,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:54:58,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 20:54:58,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:54:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:58,712 INFO L182 omatonBuilderFactory]: Interpolants [42896#true, 42897#false, 42898#(<= main_~i~0 0), 42899#(<= main_~i~0 1), 42900#(<= main_~i~0 2), 42901#(<= main_~i~0 3), 42902#(<= main_~i~0 4), 42903#(<= main_~i~0 5), 42904#(<= main_~i~0 6), 42905#(<= main_~i~0 7), 42906#(<= main_~i~0 8), 42907#(<= main_~i~0 9), 42908#(<= main_~i~0 10), 42909#(<= main_~i~0 11), 42910#(<= main_~i~0 12), 42911#(<= main_~i~0 13), 42912#(<= main_~i~0 14), 42913#(<= main_~i~0 15), 42914#(<= main_~i~0 16), 42915#(<= main_~i~0 17), 42916#(<= main_~i~0 18), 42917#(<= main_~i~0 19), 42918#(<= main_~i~0 20), 42919#(<= main_~i~0 21), 42920#(<= main_~i~0 22), 42921#(<= main_~i~0 23), 42922#(<= main_~i~0 24), 42923#(<= main_~i~0 25), 42924#(<= main_~i~0 26), 42925#(<= main_~i~0 27), 42926#(<= main_~i~0 28), 42927#(<= main_~i~0 29), 42928#(<= main_~i~0 30), 42929#(<= main_~i~0 31), 42930#(<= main_~i~0 32), 42931#(<= main_~i~0 33), 42932#(<= main_~i~0 34), 42933#(<= main_~i~0 35), 42934#(<= main_~i~0 36), 42935#(<= main_~i~0 37), 42936#(<= main_~i~0 38), 42937#(<= main_~i~0 39), 42938#(<= main_~i~0 40), 42939#(<= main_~i~0 41), 42940#(<= main_~i~0 42), 42941#(<= main_~i~0 43), 42942#(<= main_~i~0 44), 42943#(<= main_~i~0 45), 42944#(<= main_~i~0 46), 42945#(<= main_~i~0 47), 42946#(<= main_~i~0 48), 42947#(<= main_~i~0 49), 42948#(<= main_~i~0 50), 42949#(<= main_~i~0 51), 42950#(<= main_~i~0 52), 42951#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 42952#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-04-12 20:54:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:54:58,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 20:54:58,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 20:54:58,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 20:54:58,712 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 57 states. [2018-04-12 20:55:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:00,575 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-04-12 20:55:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 20:55:00,575 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-04-12 20:55:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:00,576 INFO L225 Difference]: With dead ends: 730 [2018-04-12 20:55:00,576 INFO L226 Difference]: Without dead ends: 730 [2018-04-12 20:55:00,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 20:55:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-12 20:55:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-04-12 20:55:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-04-12 20:55:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-04-12 20:55:00,581 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-04-12 20:55:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:00,581 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-04-12 20:55:00,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 20:55:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-04-12 20:55:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-12 20:55:00,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:00,583 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:00,583 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1819371720, now seen corresponding path program 54 times [2018-04-12 20:55:00,583 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:00,595 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:01,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:01,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-12 20:55:01,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:01,246 INFO L182 omatonBuilderFactory]: Interpolants [44463#true, 44464#false, 44465#(<= main_~i~0 0), 44466#(<= main_~i~0 1), 44467#(<= main_~i~0 2), 44468#(<= main_~i~0 3), 44469#(<= main_~i~0 4), 44470#(<= main_~i~0 5), 44471#(<= main_~i~0 6), 44472#(<= main_~i~0 7), 44473#(<= main_~i~0 8), 44474#(<= main_~i~0 9), 44475#(<= main_~i~0 10), 44476#(<= main_~i~0 11), 44477#(<= main_~i~0 12), 44478#(<= main_~i~0 13), 44479#(<= main_~i~0 14), 44480#(<= main_~i~0 15), 44481#(<= main_~i~0 16), 44482#(<= main_~i~0 17), 44483#(<= main_~i~0 18), 44484#(<= main_~i~0 19), 44485#(<= main_~i~0 20), 44486#(<= main_~i~0 21), 44487#(<= main_~i~0 22), 44488#(<= main_~i~0 23), 44489#(<= main_~i~0 24), 44490#(<= main_~i~0 25), 44491#(<= main_~i~0 26), 44492#(<= main_~i~0 27), 44493#(<= main_~i~0 28), 44494#(<= main_~i~0 29), 44495#(<= main_~i~0 30), 44496#(<= main_~i~0 31), 44497#(<= main_~i~0 32), 44498#(<= main_~i~0 33), 44499#(<= main_~i~0 34), 44500#(<= main_~i~0 35), 44501#(<= main_~i~0 36), 44502#(<= main_~i~0 37), 44503#(<= main_~i~0 38), 44504#(<= main_~i~0 39), 44505#(<= main_~i~0 40), 44506#(<= main_~i~0 41), 44507#(<= main_~i~0 42), 44508#(<= main_~i~0 43), 44509#(<= main_~i~0 44), 44510#(<= main_~i~0 45), 44511#(<= main_~i~0 46), 44512#(<= main_~i~0 47), 44513#(<= main_~i~0 48), 44514#(<= main_~i~0 49), 44515#(<= main_~i~0 50), 44516#(<= main_~i~0 51), 44517#(<= main_~i~0 52), 44518#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 44519#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 44520#(and (<= 2 main_~i~0) (<= main_~i~0 54))] [2018-04-12 20:55:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 20:55:01,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 20:55:01,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 20:55:01,247 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 58 states. [2018-04-12 20:55:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:03,580 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-04-12 20:55:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 20:55:03,580 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-04-12 20:55:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:03,582 INFO L225 Difference]: With dead ends: 743 [2018-04-12 20:55:03,582 INFO L226 Difference]: Without dead ends: 743 [2018-04-12 20:55:03,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 20:55:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-12 20:55:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-04-12 20:55:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-12 20:55:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-04-12 20:55:03,586 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-04-12 20:55:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:03,586 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-04-12 20:55:03,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 20:55:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-04-12 20:55:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-12 20:55:03,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:03,587 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:03,587 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2102837963, now seen corresponding path program 55 times [2018-04-12 20:55:03,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:03,595 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:04,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:04,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 20:55:04,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:04,269 INFO L182 omatonBuilderFactory]: Interpolants [46080#(<= main_~i~0 20), 46081#(<= main_~i~0 21), 46082#(<= main_~i~0 22), 46083#(<= main_~i~0 23), 46084#(<= main_~i~0 24), 46085#(<= main_~i~0 25), 46086#(<= main_~i~0 26), 46087#(<= main_~i~0 27), 46088#(<= main_~i~0 28), 46089#(<= main_~i~0 29), 46090#(<= main_~i~0 30), 46091#(<= main_~i~0 31), 46092#(<= main_~i~0 32), 46093#(<= main_~i~0 33), 46094#(<= main_~i~0 34), 46095#(<= main_~i~0 35), 46096#(<= main_~i~0 36), 46097#(<= main_~i~0 37), 46098#(<= main_~i~0 38), 46099#(<= main_~i~0 39), 46100#(<= main_~i~0 40), 46101#(<= main_~i~0 41), 46102#(<= main_~i~0 42), 46103#(<= main_~i~0 43), 46104#(<= main_~i~0 44), 46105#(<= main_~i~0 45), 46106#(<= main_~i~0 46), 46107#(<= main_~i~0 47), 46108#(<= main_~i~0 48), 46109#(<= main_~i~0 49), 46110#(<= main_~i~0 50), 46111#(<= main_~i~0 51), 46112#(<= main_~i~0 52), 46113#(<= main_~i~0 53), 46114#(<= main_~i~0 54), 46115#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 46116#(and (<= main_~i~0 55) (<= 1 main_~i~0)), 46058#true, 46059#false, 46060#(<= main_~i~0 0), 46061#(<= main_~i~0 1), 46062#(<= main_~i~0 2), 46063#(<= main_~i~0 3), 46064#(<= main_~i~0 4), 46065#(<= main_~i~0 5), 46066#(<= main_~i~0 6), 46067#(<= main_~i~0 7), 46068#(<= main_~i~0 8), 46069#(<= main_~i~0 9), 46070#(<= main_~i~0 10), 46071#(<= main_~i~0 11), 46072#(<= main_~i~0 12), 46073#(<= main_~i~0 13), 46074#(<= main_~i~0 14), 46075#(<= main_~i~0 15), 46076#(<= main_~i~0 16), 46077#(<= main_~i~0 17), 46078#(<= main_~i~0 18), 46079#(<= main_~i~0 19)] [2018-04-12 20:55:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:04,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 20:55:04,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 20:55:04,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 20:55:04,269 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-04-12 20:55:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:06,141 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-04-12 20:55:06,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 20:55:06,141 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-12 20:55:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:06,142 INFO L225 Difference]: With dead ends: 756 [2018-04-12 20:55:06,142 INFO L226 Difference]: Without dead ends: 756 [2018-04-12 20:55:06,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 20:55:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-12 20:55:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-04-12 20:55:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-12 20:55:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-04-12 20:55:06,147 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-04-12 20:55:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:06,147 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-04-12 20:55:06,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 20:55:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-04-12 20:55:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-12 20:55:06,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:06,148 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:06,148 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash 875963624, now seen corresponding path program 56 times [2018-04-12 20:55:06,148 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:06,156 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:06,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:06,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-12 20:55:06,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:06,836 INFO L182 omatonBuilderFactory]: Interpolants [47681#true, 47682#false, 47683#(<= main_~i~0 0), 47684#(<= main_~i~0 1), 47685#(<= main_~i~0 2), 47686#(<= main_~i~0 3), 47687#(<= main_~i~0 4), 47688#(<= main_~i~0 5), 47689#(<= main_~i~0 6), 47690#(<= main_~i~0 7), 47691#(<= main_~i~0 8), 47692#(<= main_~i~0 9), 47693#(<= main_~i~0 10), 47694#(<= main_~i~0 11), 47695#(<= main_~i~0 12), 47696#(<= main_~i~0 13), 47697#(<= main_~i~0 14), 47698#(<= main_~i~0 15), 47699#(<= main_~i~0 16), 47700#(<= main_~i~0 17), 47701#(<= main_~i~0 18), 47702#(<= main_~i~0 19), 47703#(<= main_~i~0 20), 47704#(<= main_~i~0 21), 47705#(<= main_~i~0 22), 47706#(<= main_~i~0 23), 47707#(<= main_~i~0 24), 47708#(<= main_~i~0 25), 47709#(<= main_~i~0 26), 47710#(<= main_~i~0 27), 47711#(<= main_~i~0 28), 47712#(<= main_~i~0 29), 47713#(<= main_~i~0 30), 47714#(<= main_~i~0 31), 47715#(<= main_~i~0 32), 47716#(<= main_~i~0 33), 47717#(<= main_~i~0 34), 47718#(<= main_~i~0 35), 47719#(<= main_~i~0 36), 47720#(<= main_~i~0 37), 47721#(<= main_~i~0 38), 47722#(<= main_~i~0 39), 47723#(<= main_~i~0 40), 47724#(<= main_~i~0 41), 47725#(<= main_~i~0 42), 47726#(<= main_~i~0 43), 47727#(<= main_~i~0 44), 47728#(<= main_~i~0 45), 47729#(<= main_~i~0 46), 47730#(<= main_~i~0 47), 47731#(<= main_~i~0 48), 47732#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 47733#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 47734#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 47735#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 47736#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 47737#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 47738#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 47739#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 47740#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-04-12 20:55:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:06,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 20:55:06,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 20:55:06,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 20:55:06,836 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-04-12 20:55:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:09,679 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-04-12 20:55:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 20:55:09,679 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-12 20:55:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:09,680 INFO L225 Difference]: With dead ends: 769 [2018-04-12 20:55:09,680 INFO L226 Difference]: Without dead ends: 769 [2018-04-12 20:55:09,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 20:55:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-12 20:55:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-04-12 20:55:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-12 20:55:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-04-12 20:55:09,685 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-04-12 20:55:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:09,685 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-04-12 20:55:09,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 20:55:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-04-12 20:55:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-12 20:55:09,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:09,687 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:09,687 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -82504427, now seen corresponding path program 57 times [2018-04-12 20:55:09,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:09,699 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:10,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:10,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 20:55:10,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:10,409 INFO L182 omatonBuilderFactory]: Interpolants [49332#true, 49333#false, 49334#(<= main_~i~0 0), 49335#(<= main_~i~0 1), 49336#(<= main_~i~0 2), 49337#(<= main_~i~0 3), 49338#(<= main_~i~0 4), 49339#(<= main_~i~0 5), 49340#(<= main_~i~0 6), 49341#(<= main_~i~0 7), 49342#(<= main_~i~0 8), 49343#(<= main_~i~0 9), 49344#(<= main_~i~0 10), 49345#(<= main_~i~0 11), 49346#(<= main_~i~0 12), 49347#(<= main_~i~0 13), 49348#(<= main_~i~0 14), 49349#(<= main_~i~0 15), 49350#(<= main_~i~0 16), 49351#(<= main_~i~0 17), 49352#(<= main_~i~0 18), 49353#(<= main_~i~0 19), 49354#(<= main_~i~0 20), 49355#(<= main_~i~0 21), 49356#(<= main_~i~0 22), 49357#(<= main_~i~0 23), 49358#(<= main_~i~0 24), 49359#(<= main_~i~0 25), 49360#(<= main_~i~0 26), 49361#(<= main_~i~0 27), 49362#(<= main_~i~0 28), 49363#(<= main_~i~0 29), 49364#(<= main_~i~0 30), 49365#(<= main_~i~0 31), 49366#(<= main_~i~0 32), 49367#(<= main_~i~0 33), 49368#(<= main_~i~0 34), 49369#(<= main_~i~0 35), 49370#(<= main_~i~0 36), 49371#(<= main_~i~0 37), 49372#(<= main_~i~0 38), 49373#(<= main_~i~0 39), 49374#(<= main_~i~0 40), 49375#(<= main_~i~0 41), 49376#(<= main_~i~0 42), 49377#(<= main_~i~0 43), 49378#(<= main_~i~0 44), 49379#(<= main_~i~0 45), 49380#(<= main_~i~0 46), 49381#(<= main_~i~0 47), 49382#(<= main_~i~0 48), 49383#(<= main_~i~0 49), 49384#(<= main_~i~0 50), 49385#(<= main_~i~0 51), 49386#(<= main_~i~0 52), 49387#(<= main_~i~0 53), 49388#(<= main_~i~0 54), 49389#(<= main_~i~0 55), 49390#(<= main_~i~0 56), 49391#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 49392#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-12 20:55:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:10,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-12 20:55:10,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-12 20:55:10,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 20:55:10,410 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 61 states. [2018-04-12 20:55:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:12,564 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-04-12 20:55:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 20:55:12,564 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-04-12 20:55:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:12,566 INFO L225 Difference]: With dead ends: 782 [2018-04-12 20:55:12,566 INFO L226 Difference]: Without dead ends: 782 [2018-04-12 20:55:12,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 20:55:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-12 20:55:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-04-12 20:55:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-04-12 20:55:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-04-12 20:55:12,571 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-04-12 20:55:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:12,571 INFO L459 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-04-12 20:55:12,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-12 20:55:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-04-12 20:55:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-12 20:55:12,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:12,572 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:12,572 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1495910136, now seen corresponding path program 58 times [2018-04-12 20:55:12,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:12,579 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:13,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:13,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-12 20:55:13,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:13,315 INFO L182 omatonBuilderFactory]: Interpolants [51072#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 51011#true, 51012#false, 51013#(<= main_~i~0 0), 51014#(<= main_~i~0 1), 51015#(<= main_~i~0 2), 51016#(<= main_~i~0 3), 51017#(<= main_~i~0 4), 51018#(<= main_~i~0 5), 51019#(<= main_~i~0 6), 51020#(<= main_~i~0 7), 51021#(<= main_~i~0 8), 51022#(<= main_~i~0 9), 51023#(<= main_~i~0 10), 51024#(<= main_~i~0 11), 51025#(<= main_~i~0 12), 51026#(<= main_~i~0 13), 51027#(<= main_~i~0 14), 51028#(<= main_~i~0 15), 51029#(<= main_~i~0 16), 51030#(<= main_~i~0 17), 51031#(<= main_~i~0 18), 51032#(<= main_~i~0 19), 51033#(<= main_~i~0 20), 51034#(<= main_~i~0 21), 51035#(<= main_~i~0 22), 51036#(<= main_~i~0 23), 51037#(<= main_~i~0 24), 51038#(<= main_~i~0 25), 51039#(<= main_~i~0 26), 51040#(<= main_~i~0 27), 51041#(<= main_~i~0 28), 51042#(<= main_~i~0 29), 51043#(<= main_~i~0 30), 51044#(<= main_~i~0 31), 51045#(<= main_~i~0 32), 51046#(<= main_~i~0 33), 51047#(<= main_~i~0 34), 51048#(<= main_~i~0 35), 51049#(<= main_~i~0 36), 51050#(<= main_~i~0 37), 51051#(<= main_~i~0 38), 51052#(<= main_~i~0 39), 51053#(<= main_~i~0 40), 51054#(<= main_~i~0 41), 51055#(<= main_~i~0 42), 51056#(<= main_~i~0 43), 51057#(<= main_~i~0 44), 51058#(<= main_~i~0 45), 51059#(<= main_~i~0 46), 51060#(<= main_~i~0 47), 51061#(<= main_~i~0 48), 51062#(<= main_~i~0 49), 51063#(<= main_~i~0 50), 51064#(<= main_~i~0 51), 51065#(<= main_~i~0 52), 51066#(<= main_~i~0 53), 51067#(<= main_~i~0 54), 51068#(<= main_~i~0 55), 51069#(<= main_~i~0 56), 51070#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 51071#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-12 20:55:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:13,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 20:55:13,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 20:55:13,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 20:55:13,316 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 62 states. [2018-04-12 20:55:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:15,664 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-04-12 20:55:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-12 20:55:15,665 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-04-12 20:55:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:15,666 INFO L225 Difference]: With dead ends: 795 [2018-04-12 20:55:15,666 INFO L226 Difference]: Without dead ends: 795 [2018-04-12 20:55:15,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 20:55:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-04-12 20:55:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-04-12 20:55:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-12 20:55:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-04-12 20:55:15,671 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-04-12 20:55:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:15,671 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-04-12 20:55:15,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 20:55:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-04-12 20:55:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-12 20:55:15,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:15,672 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:15,672 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2080598795, now seen corresponding path program 59 times [2018-04-12 20:55:15,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:15,680 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:16,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:16,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 20:55:16,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:16,553 INFO L182 omatonBuilderFactory]: Interpolants [52736#(<= main_~i~0 16), 52737#(<= main_~i~0 17), 52738#(<= main_~i~0 18), 52739#(<= main_~i~0 19), 52740#(<= main_~i~0 20), 52741#(<= main_~i~0 21), 52742#(<= main_~i~0 22), 52743#(<= main_~i~0 23), 52744#(<= main_~i~0 24), 52745#(<= main_~i~0 25), 52746#(<= main_~i~0 26), 52747#(<= main_~i~0 27), 52748#(<= main_~i~0 28), 52749#(<= main_~i~0 29), 52750#(<= main_~i~0 30), 52751#(<= main_~i~0 31), 52752#(<= main_~i~0 32), 52753#(<= main_~i~0 33), 52754#(<= main_~i~0 34), 52755#(<= main_~i~0 35), 52756#(<= main_~i~0 36), 52757#(<= main_~i~0 37), 52758#(<= main_~i~0 38), 52759#(<= main_~i~0 39), 52760#(<= main_~i~0 40), 52761#(<= main_~i~0 41), 52762#(<= main_~i~0 42), 52763#(<= main_~i~0 43), 52764#(<= main_~i~0 44), 52765#(<= main_~i~0 45), 52766#(<= main_~i~0 46), 52767#(<= main_~i~0 47), 52768#(<= main_~i~0 48), 52769#(<= main_~i~0 49), 52770#(<= main_~i~0 50), 52771#(<= main_~i~0 51), 52772#(<= main_~i~0 52), 52773#(<= main_~i~0 53), 52774#(<= main_~i~0 54), 52775#(<= main_~i~0 55), 52776#(<= main_~i~0 56), 52777#(<= main_~i~0 57), 52778#(<= main_~i~0 58), 52779#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 52780#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 52718#true, 52719#false, 52720#(<= main_~i~0 0), 52721#(<= main_~i~0 1), 52722#(<= main_~i~0 2), 52723#(<= main_~i~0 3), 52724#(<= main_~i~0 4), 52725#(<= main_~i~0 5), 52726#(<= main_~i~0 6), 52727#(<= main_~i~0 7), 52728#(<= main_~i~0 8), 52729#(<= main_~i~0 9), 52730#(<= main_~i~0 10), 52731#(<= main_~i~0 11), 52732#(<= main_~i~0 12), 52733#(<= main_~i~0 13), 52734#(<= main_~i~0 14), 52735#(<= main_~i~0 15)] [2018-04-12 20:55:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:16,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-12 20:55:16,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-12 20:55:16,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 20:55:16,554 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 63 states. [2018-04-12 20:55:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:18,621 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-04-12 20:55:18,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-12 20:55:18,621 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-04-12 20:55:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:18,623 INFO L225 Difference]: With dead ends: 808 [2018-04-12 20:55:18,623 INFO L226 Difference]: Without dead ends: 808 [2018-04-12 20:55:18,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 20:55:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-12 20:55:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-04-12 20:55:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-12 20:55:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-04-12 20:55:18,629 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-04-12 20:55:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:18,629 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-04-12 20:55:18,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-12 20:55:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-04-12 20:55:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-12 20:55:18,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:18,630 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:18,631 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -872176344, now seen corresponding path program 60 times [2018-04-12 20:55:18,631 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:18,638 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:19,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:19,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-12 20:55:19,443 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:19,444 INFO L182 omatonBuilderFactory]: Interpolants [54453#true, 54454#false, 54455#(<= main_~i~0 0), 54456#(<= main_~i~0 1), 54457#(<= main_~i~0 2), 54458#(<= main_~i~0 3), 54459#(<= main_~i~0 4), 54460#(<= main_~i~0 5), 54461#(<= main_~i~0 6), 54462#(<= main_~i~0 7), 54463#(<= main_~i~0 8), 54464#(<= main_~i~0 9), 54465#(<= main_~i~0 10), 54466#(<= main_~i~0 11), 54467#(<= main_~i~0 12), 54468#(<= main_~i~0 13), 54469#(<= main_~i~0 14), 54470#(<= main_~i~0 15), 54471#(<= main_~i~0 16), 54472#(<= main_~i~0 17), 54473#(<= main_~i~0 18), 54474#(<= main_~i~0 19), 54475#(<= main_~i~0 20), 54476#(<= main_~i~0 21), 54477#(<= main_~i~0 22), 54478#(<= main_~i~0 23), 54479#(<= main_~i~0 24), 54480#(<= main_~i~0 25), 54481#(<= main_~i~0 26), 54482#(<= main_~i~0 27), 54483#(<= main_~i~0 28), 54484#(<= main_~i~0 29), 54485#(<= main_~i~0 30), 54486#(<= main_~i~0 31), 54487#(<= main_~i~0 32), 54488#(<= main_~i~0 33), 54489#(<= main_~i~0 34), 54490#(<= main_~i~0 35), 54491#(<= main_~i~0 36), 54492#(<= main_~i~0 37), 54493#(<= main_~i~0 38), 54494#(<= main_~i~0 39), 54495#(<= main_~i~0 40), 54496#(<= main_~i~0 41), 54497#(<= main_~i~0 42), 54498#(<= main_~i~0 43), 54499#(<= main_~i~0 44), 54500#(<= main_~i~0 45), 54501#(<= main_~i~0 46), 54502#(<= main_~i~0 47), 54503#(<= main_~i~0 48), 54504#(<= main_~i~0 49), 54505#(<= main_~i~0 50), 54506#(<= main_~i~0 51), 54507#(<= main_~i~0 52), 54508#(<= main_~i~0 53), 54509#(<= main_~i~0 54), 54510#(<= main_~i~0 55), 54511#(<= main_~i~0 56), 54512#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 54513#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 54514#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 54515#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 54516#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-04-12 20:55:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:19,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 20:55:19,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 20:55:19,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 20:55:19,445 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 64 states. [2018-04-12 20:55:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:22,204 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-04-12 20:55:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-12 20:55:22,204 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 307 [2018-04-12 20:55:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:22,206 INFO L225 Difference]: With dead ends: 821 [2018-04-12 20:55:22,206 INFO L226 Difference]: Without dead ends: 821 [2018-04-12 20:55:22,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 20:55:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-04-12 20:55:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-04-12 20:55:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-12 20:55:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-04-12 20:55:22,211 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-04-12 20:55:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:22,211 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-04-12 20:55:22,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 20:55:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-04-12 20:55:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-12 20:55:22,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:22,212 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:22,212 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 351124693, now seen corresponding path program 61 times [2018-04-12 20:55:22,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:22,220 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:23,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:23,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 20:55:23,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:23,010 INFO L182 omatonBuilderFactory]: Interpolants [56216#true, 56217#false, 56218#(<= main_~i~0 0), 56219#(<= main_~i~0 1), 56220#(<= main_~i~0 2), 56221#(<= main_~i~0 3), 56222#(<= main_~i~0 4), 56223#(<= main_~i~0 5), 56224#(<= main_~i~0 6), 56225#(<= main_~i~0 7), 56226#(<= main_~i~0 8), 56227#(<= main_~i~0 9), 56228#(<= main_~i~0 10), 56229#(<= main_~i~0 11), 56230#(<= main_~i~0 12), 56231#(<= main_~i~0 13), 56232#(<= main_~i~0 14), 56233#(<= main_~i~0 15), 56234#(<= main_~i~0 16), 56235#(<= main_~i~0 17), 56236#(<= main_~i~0 18), 56237#(<= main_~i~0 19), 56238#(<= main_~i~0 20), 56239#(<= main_~i~0 21), 56240#(<= main_~i~0 22), 56241#(<= main_~i~0 23), 56242#(<= main_~i~0 24), 56243#(<= main_~i~0 25), 56244#(<= main_~i~0 26), 56245#(<= main_~i~0 27), 56246#(<= main_~i~0 28), 56247#(<= main_~i~0 29), 56248#(<= main_~i~0 30), 56249#(<= main_~i~0 31), 56250#(<= main_~i~0 32), 56251#(<= main_~i~0 33), 56252#(<= main_~i~0 34), 56253#(<= main_~i~0 35), 56254#(<= main_~i~0 36), 56255#(<= main_~i~0 37), 56256#(<= main_~i~0 38), 56257#(<= main_~i~0 39), 56258#(<= main_~i~0 40), 56259#(<= main_~i~0 41), 56260#(<= main_~i~0 42), 56261#(<= main_~i~0 43), 56262#(<= main_~i~0 44), 56263#(<= main_~i~0 45), 56264#(<= main_~i~0 46), 56265#(<= main_~i~0 47), 56266#(<= main_~i~0 48), 56267#(<= main_~i~0 49), 56268#(<= main_~i~0 50), 56269#(<= main_~i~0 51), 56270#(<= main_~i~0 52), 56271#(<= main_~i~0 53), 56272#(<= main_~i~0 54), 56273#(<= main_~i~0 55), 56274#(<= main_~i~0 56), 56275#(<= main_~i~0 57), 56276#(<= main_~i~0 58), 56277#(<= main_~i~0 59), 56278#(<= main_~i~0 60), 56279#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 56280#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-04-12 20:55:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-12 20:55:23,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-12 20:55:23,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 20:55:23,011 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-04-12 20:55:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:25,589 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-04-12 20:55:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 20:55:25,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-12 20:55:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:25,591 INFO L225 Difference]: With dead ends: 834 [2018-04-12 20:55:25,591 INFO L226 Difference]: Without dead ends: 834 [2018-04-12 20:55:25,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 20:55:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-04-12 20:55:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-04-12 20:55:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-04-12 20:55:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-04-12 20:55:25,597 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-04-12 20:55:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:25,597 INFO L459 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-04-12 20:55:25,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-12 20:55:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-04-12 20:55:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-12 20:55:25,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:25,598 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:25,598 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:25,598 INFO L82 PathProgramCache]: Analyzing trace with hash 888170824, now seen corresponding path program 62 times [2018-04-12 20:55:25,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:25,606 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:26,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:26,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-12 20:55:26,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:26,465 INFO L182 omatonBuilderFactory]: Interpolants [58007#true, 58008#false, 58009#(<= main_~i~0 0), 58010#(<= main_~i~0 1), 58011#(<= main_~i~0 2), 58012#(<= main_~i~0 3), 58013#(<= main_~i~0 4), 58014#(<= main_~i~0 5), 58015#(<= main_~i~0 6), 58016#(<= main_~i~0 7), 58017#(<= main_~i~0 8), 58018#(<= main_~i~0 9), 58019#(<= main_~i~0 10), 58020#(<= main_~i~0 11), 58021#(<= main_~i~0 12), 58022#(<= main_~i~0 13), 58023#(<= main_~i~0 14), 58024#(<= main_~i~0 15), 58025#(<= main_~i~0 16), 58026#(<= main_~i~0 17), 58027#(<= main_~i~0 18), 58028#(<= main_~i~0 19), 58029#(<= main_~i~0 20), 58030#(<= main_~i~0 21), 58031#(<= main_~i~0 22), 58032#(<= main_~i~0 23), 58033#(<= main_~i~0 24), 58034#(<= main_~i~0 25), 58035#(<= main_~i~0 26), 58036#(<= main_~i~0 27), 58037#(<= main_~i~0 28), 58038#(<= main_~i~0 29), 58039#(<= main_~i~0 30), 58040#(<= main_~i~0 31), 58041#(<= main_~i~0 32), 58042#(<= main_~i~0 33), 58043#(<= main_~i~0 34), 58044#(<= main_~i~0 35), 58045#(<= main_~i~0 36), 58046#(<= main_~i~0 37), 58047#(<= main_~i~0 38), 58048#(<= main_~i~0 39), 58049#(<= main_~i~0 40), 58050#(<= main_~i~0 41), 58051#(<= main_~i~0 42), 58052#(<= main_~i~0 43), 58053#(<= main_~i~0 44), 58054#(<= main_~i~0 45), 58055#(<= main_~i~0 46), 58056#(<= main_~i~0 47), 58057#(<= main_~i~0 48), 58058#(<= main_~i~0 49), 58059#(<= main_~i~0 50), 58060#(<= main_~i~0 51), 58061#(<= main_~i~0 52), 58062#(<= main_~i~0 53), 58063#(<= main_~i~0 54), 58064#(<= main_~i~0 55), 58065#(<= main_~i~0 56), 58066#(<= main_~i~0 57), 58067#(<= main_~i~0 58), 58068#(<= main_~i~0 59), 58069#(<= main_~i~0 60), 58070#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 58071#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 58072#(and (<= 2 main_~i~0) (<= main_~i~0 62))] [2018-04-12 20:55:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:26,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 20:55:26,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 20:55:26,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 20:55:26,467 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-04-12 20:55:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:29,096 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-04-12 20:55:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 20:55:29,096 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-12 20:55:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:29,098 INFO L225 Difference]: With dead ends: 847 [2018-04-12 20:55:29,098 INFO L226 Difference]: Without dead ends: 847 [2018-04-12 20:55:29,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-12 20:55:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-04-12 20:55:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-04-12 20:55:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-12 20:55:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-04-12 20:55:29,104 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-04-12 20:55:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:29,104 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-04-12 20:55:29,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 20:55:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-04-12 20:55:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-12 20:55:29,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:29,105 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:29,105 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash 200707253, now seen corresponding path program 63 times [2018-04-12 20:55:29,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:29,114 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:29,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:29,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 20:55:29,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:29,989 INFO L182 omatonBuilderFactory]: Interpolants [59826#true, 59827#false, 59828#(<= main_~i~0 0), 59829#(<= main_~i~0 1), 59830#(<= main_~i~0 2), 59831#(<= main_~i~0 3), 59832#(<= main_~i~0 4), 59833#(<= main_~i~0 5), 59834#(<= main_~i~0 6), 59835#(<= main_~i~0 7), 59836#(<= main_~i~0 8), 59837#(<= main_~i~0 9), 59838#(<= main_~i~0 10), 59839#(<= main_~i~0 11), 59840#(<= main_~i~0 12), 59841#(<= main_~i~0 13), 59842#(<= main_~i~0 14), 59843#(<= main_~i~0 15), 59844#(<= main_~i~0 16), 59845#(<= main_~i~0 17), 59846#(<= main_~i~0 18), 59847#(<= main_~i~0 19), 59848#(<= main_~i~0 20), 59849#(<= main_~i~0 21), 59850#(<= main_~i~0 22), 59851#(<= main_~i~0 23), 59852#(<= main_~i~0 24), 59853#(<= main_~i~0 25), 59854#(<= main_~i~0 26), 59855#(<= main_~i~0 27), 59856#(<= main_~i~0 28), 59857#(<= main_~i~0 29), 59858#(<= main_~i~0 30), 59859#(<= main_~i~0 31), 59860#(<= main_~i~0 32), 59861#(<= main_~i~0 33), 59862#(<= main_~i~0 34), 59863#(<= main_~i~0 35), 59864#(<= main_~i~0 36), 59865#(<= main_~i~0 37), 59866#(<= main_~i~0 38), 59867#(<= main_~i~0 39), 59868#(<= main_~i~0 40), 59869#(<= main_~i~0 41), 59870#(<= main_~i~0 42), 59871#(<= main_~i~0 43), 59872#(<= main_~i~0 44), 59873#(<= main_~i~0 45), 59874#(<= main_~i~0 46), 59875#(<= main_~i~0 47), 59876#(<= main_~i~0 48), 59877#(<= main_~i~0 49), 59878#(<= main_~i~0 50), 59879#(<= main_~i~0 51), 59880#(<= main_~i~0 52), 59881#(<= main_~i~0 53), 59882#(<= main_~i~0 54), 59883#(<= main_~i~0 55), 59884#(<= main_~i~0 56), 59885#(<= main_~i~0 57), 59886#(<= main_~i~0 58), 59887#(<= main_~i~0 59), 59888#(<= main_~i~0 60), 59889#(<= main_~i~0 61), 59890#(<= main_~i~0 62), 59891#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 59892#(and (<= 1 main_~i~0) (<= main_~i~0 63))] [2018-04-12 20:55:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:29,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 20:55:29,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 20:55:29,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 20:55:29,990 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 67 states. [2018-04-12 20:55:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:32,615 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-04-12 20:55:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-12 20:55:32,615 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-04-12 20:55:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:32,617 INFO L225 Difference]: With dead ends: 860 [2018-04-12 20:55:32,618 INFO L226 Difference]: Without dead ends: 860 [2018-04-12 20:55:32,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 20:55:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-12 20:55:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-04-12 20:55:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-04-12 20:55:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-04-12 20:55:32,625 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-04-12 20:55:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:32,625 INFO L459 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-04-12 20:55:32,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 20:55:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-04-12 20:55:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-12 20:55:32,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:32,627 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:32,627 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 474908008, now seen corresponding path program 64 times [2018-04-12 20:55:32,628 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:32,637 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:34,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:34,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 20:55:34,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:34,054 INFO L182 omatonBuilderFactory]: Interpolants [61696#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 61697#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 61698#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 61699#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 61700#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 61701#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 61702#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 61703#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 61704#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 61705#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 61706#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 61707#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 61708#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 61709#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 61710#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 61711#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 61712#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 61713#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 61714#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 61715#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 61716#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 61717#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 61718#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 61719#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 61720#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 61721#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 61722#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 61723#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 61724#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 61725#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 61726#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 61727#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 61728#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 61729#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 61730#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 61731#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 61732#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 61733#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 61734#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 61735#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 61736#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 61737#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 61738#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 61739#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 61673#true, 61674#false, 61675#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 61676#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 61677#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 61678#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 61679#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 61680#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 61681#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 61682#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 61683#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 61684#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 61685#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 61686#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 61687#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 61688#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 61689#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 61690#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 61691#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 61692#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 61693#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 61694#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 61695#(and (<= 20 main_~i~0) (<= main_~i~0 20))] [2018-04-12 20:55:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:34,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-12 20:55:34,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-12 20:55:34,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 20:55:34,055 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-04-12 20:55:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:46,411 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-04-12 20:55:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-12 20:55:46,412 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-12 20:55:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:46,413 INFO L225 Difference]: With dead ends: 873 [2018-04-12 20:55:46,413 INFO L226 Difference]: Without dead ends: 873 [2018-04-12 20:55:46,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 20:55:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-04-12 20:55:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-04-12 20:55:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-04-12 20:55:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-04-12 20:55:46,418 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-04-12 20:55:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:46,418 INFO L459 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-04-12 20:55:46,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-12 20:55:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-04-12 20:55:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-12 20:55:46,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:46,420 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:46,420 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 228918421, now seen corresponding path program 65 times [2018-04-12 20:55:46,420 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:46,428 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:47,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:47,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-12 20:55:47,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:47,349 INFO L182 omatonBuilderFactory]: Interpolants [63419#true, 63420#false, 63421#(<= main_~i~0 0), 63422#(<= main_~i~0 1), 63423#(<= main_~i~0 2), 63424#(<= main_~i~0 3), 63425#(<= main_~i~0 4), 63426#(<= main_~i~0 5), 63427#(<= main_~i~0 6), 63428#(<= main_~i~0 7), 63429#(<= main_~i~0 8), 63430#(<= main_~i~0 9), 63431#(<= main_~i~0 10), 63432#(<= main_~i~0 11), 63433#(<= main_~i~0 12), 63434#(<= main_~i~0 13), 63435#(<= main_~i~0 14), 63436#(<= main_~i~0 15), 63437#(<= main_~i~0 16), 63438#(<= main_~i~0 17), 63439#(<= main_~i~0 18), 63440#(<= main_~i~0 19), 63441#(<= main_~i~0 20), 63442#(<= main_~i~0 21), 63443#(<= main_~i~0 22), 63444#(<= main_~i~0 23), 63445#(<= main_~i~0 24), 63446#(<= main_~i~0 25), 63447#(<= main_~i~0 26), 63448#(<= main_~i~0 27), 63449#(<= main_~i~0 28), 63450#(<= main_~i~0 29), 63451#(<= main_~i~0 30), 63452#(<= main_~i~0 31), 63453#(<= main_~i~0 32), 63454#(<= main_~i~0 33), 63455#(<= main_~i~0 34), 63456#(<= main_~i~0 35), 63457#(<= main_~i~0 36), 63458#(<= main_~i~0 37), 63459#(<= main_~i~0 38), 63460#(<= main_~i~0 39), 63461#(<= main_~i~0 40), 63462#(<= main_~i~0 41), 63463#(<= main_~i~0 42), 63464#(<= main_~i~0 43), 63465#(<= main_~i~0 44), 63466#(<= main_~i~0 45), 63467#(<= main_~i~0 46), 63468#(<= main_~i~0 47), 63469#(<= main_~i~0 48), 63470#(<= main_~i~0 49), 63471#(<= main_~i~0 50), 63472#(<= main_~i~0 51), 63473#(<= main_~i~0 52), 63474#(<= main_~i~0 53), 63475#(<= main_~i~0 54), 63476#(<= main_~i~0 55), 63477#(<= main_~i~0 56), 63478#(<= main_~i~0 57), 63479#(<= main_~i~0 58), 63480#(<= main_~i~0 59), 63481#(<= main_~i~0 60), 63482#(<= main_~i~0 61), 63483#(<= main_~i~0 62), 63484#(<= main_~i~0 63), 63485#(<= main_~i~0 64), 63486#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 63487#(and (<= 1 main_~i~0) (<= main_~i~0 65))] [2018-04-12 20:55:47,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:47,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-12 20:55:47,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-12 20:55:47,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 20:55:47,350 INFO L87 Difference]: Start difference. First operand 806 states and 936 transitions. Second operand 69 states. [2018-04-12 20:55:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:50,104 INFO L93 Difference]: Finished difference Result 886 states and 1019 transitions. [2018-04-12 20:55:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 20:55:50,105 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-04-12 20:55:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:50,107 INFO L225 Difference]: With dead ends: 886 [2018-04-12 20:55:50,107 INFO L226 Difference]: Without dead ends: 886 [2018-04-12 20:55:50,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 20:55:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-04-12 20:55:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 818. [2018-04-12 20:55:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-04-12 20:55:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 950 transitions. [2018-04-12 20:55:50,112 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 950 transitions. Word has length 332 [2018-04-12 20:55:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:50,113 INFO L459 AbstractCegarLoop]: Abstraction has 818 states and 950 transitions. [2018-04-12 20:55:50,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-12 20:55:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 950 transitions. [2018-04-12 20:55:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-12 20:55:50,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:50,114 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:50,114 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2041579128, now seen corresponding path program 66 times [2018-04-12 20:55:50,114 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:50,135 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:51,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:51,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-12 20:55:51,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:51,167 INFO L182 omatonBuilderFactory]: Interpolants [65322#true, 65323#false, 65324#(<= main_~i~0 0), 65325#(<= main_~i~0 1), 65326#(<= main_~i~0 2), 65327#(<= main_~i~0 3), 65328#(<= main_~i~0 4), 65329#(<= main_~i~0 5), 65330#(<= main_~i~0 6), 65331#(<= main_~i~0 7), 65332#(<= main_~i~0 8), 65333#(<= main_~i~0 9), 65334#(<= main_~i~0 10), 65335#(<= main_~i~0 11), 65336#(<= main_~i~0 12), 65337#(<= main_~i~0 13), 65338#(<= main_~i~0 14), 65339#(<= main_~i~0 15), 65340#(<= main_~i~0 16), 65341#(<= main_~i~0 17), 65342#(<= main_~i~0 18), 65343#(<= main_~i~0 19), 65344#(<= main_~i~0 20), 65345#(<= main_~i~0 21), 65346#(<= main_~i~0 22), 65347#(<= main_~i~0 23), 65348#(<= main_~i~0 24), 65349#(<= main_~i~0 25), 65350#(<= main_~i~0 26), 65351#(<= main_~i~0 27), 65352#(<= main_~i~0 28), 65353#(<= main_~i~0 29), 65354#(<= main_~i~0 30), 65355#(<= main_~i~0 31), 65356#(<= main_~i~0 32), 65357#(<= main_~i~0 33), 65358#(<= main_~i~0 34), 65359#(<= main_~i~0 35), 65360#(<= main_~i~0 36), 65361#(<= main_~i~0 37), 65362#(<= main_~i~0 38), 65363#(<= main_~i~0 39), 65364#(<= main_~i~0 40), 65365#(<= main_~i~0 41), 65366#(<= main_~i~0 42), 65367#(<= main_~i~0 43), 65368#(<= main_~i~0 44), 65369#(<= main_~i~0 45), 65370#(<= main_~i~0 46), 65371#(<= main_~i~0 47), 65372#(<= main_~i~0 48), 65373#(<= main_~i~0 49), 65374#(<= main_~i~0 50), 65375#(<= main_~i~0 51), 65376#(<= main_~i~0 52), 65377#(<= main_~i~0 53), 65378#(<= main_~i~0 54), 65379#(<= main_~i~0 55), 65380#(<= main_~i~0 56), 65381#(<= main_~i~0 57), 65382#(<= main_~i~0 58), 65383#(<= main_~i~0 59), 65384#(<= main_~i~0 60), 65385#(<= main_~i~0 61), 65386#(<= main_~i~0 62), 65387#(<= main_~i~0 63), 65388#(<= main_~i~0 64), 65389#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 65390#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 65391#(and (<= main_~i~0 66) (<= 2 main_~i~0))] [2018-04-12 20:55:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:51,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-12 20:55:51,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-12 20:55:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 20:55:51,168 INFO L87 Difference]: Start difference. First operand 818 states and 950 transitions. Second operand 70 states. [2018-04-12 20:55:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:54,117 INFO L93 Difference]: Finished difference Result 899 states and 1034 transitions. [2018-04-12 20:55:54,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-12 20:55:54,118 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-04-12 20:55:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:54,119 INFO L225 Difference]: With dead ends: 899 [2018-04-12 20:55:54,119 INFO L226 Difference]: Without dead ends: 899 [2018-04-12 20:55:54,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-04-12 20:55:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-12 20:55:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 830. [2018-04-12 20:55:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-12 20:55:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 964 transitions. [2018-04-12 20:55:54,125 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 964 transitions. Word has length 337 [2018-04-12 20:55:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:54,125 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 964 transitions. [2018-04-12 20:55:54,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-12 20:55:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 964 transitions. [2018-04-12 20:55:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-12 20:55:54,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:54,126 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:54,126 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash -452516747, now seen corresponding path program 67 times [2018-04-12 20:55:54,127 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:54,135 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:55,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:55,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-12 20:55:55,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:55,180 INFO L182 omatonBuilderFactory]: Interpolants [67253#true, 67255#(<= main_~i~0 0), 67254#false, 67257#(<= main_~i~0 2), 67256#(<= main_~i~0 1), 67259#(<= main_~i~0 4), 67258#(<= main_~i~0 3), 67261#(<= main_~i~0 6), 67260#(<= main_~i~0 5), 67263#(<= main_~i~0 8), 67262#(<= main_~i~0 7), 67265#(<= main_~i~0 10), 67264#(<= main_~i~0 9), 67267#(<= main_~i~0 12), 67266#(<= main_~i~0 11), 67269#(<= main_~i~0 14), 67268#(<= main_~i~0 13), 67271#(<= main_~i~0 16), 67270#(<= main_~i~0 15), 67273#(<= main_~i~0 18), 67272#(<= main_~i~0 17), 67275#(<= main_~i~0 20), 67274#(<= main_~i~0 19), 67277#(<= main_~i~0 22), 67276#(<= main_~i~0 21), 67279#(<= main_~i~0 24), 67278#(<= main_~i~0 23), 67281#(<= main_~i~0 26), 67280#(<= main_~i~0 25), 67283#(<= main_~i~0 28), 67282#(<= main_~i~0 27), 67285#(<= main_~i~0 30), 67284#(<= main_~i~0 29), 67287#(<= main_~i~0 32), 67286#(<= main_~i~0 31), 67289#(<= main_~i~0 34), 67288#(<= main_~i~0 33), 67291#(<= main_~i~0 36), 67290#(<= main_~i~0 35), 67293#(<= main_~i~0 38), 67292#(<= main_~i~0 37), 67295#(<= main_~i~0 40), 67294#(<= main_~i~0 39), 67297#(<= main_~i~0 42), 67296#(<= main_~i~0 41), 67299#(<= main_~i~0 44), 67298#(<= main_~i~0 43), 67301#(<= main_~i~0 46), 67300#(<= main_~i~0 45), 67303#(<= main_~i~0 48), 67302#(<= main_~i~0 47), 67305#(<= main_~i~0 50), 67304#(<= main_~i~0 49), 67307#(<= main_~i~0 52), 67306#(<= main_~i~0 51), 67309#(<= main_~i~0 54), 67308#(<= main_~i~0 53), 67311#(<= main_~i~0 56), 67310#(<= main_~i~0 55), 67313#(<= main_~i~0 58), 67312#(<= main_~i~0 57), 67315#(<= main_~i~0 60), 67314#(<= main_~i~0 59), 67317#(<= main_~i~0 62), 67316#(<= main_~i~0 61), 67319#(<= main_~i~0 64), 67318#(<= main_~i~0 63), 67321#(<= main_~i~0 66), 67320#(<= main_~i~0 65), 67323#(and (<= main_~i~0 67) (<= 1 main_~i~0)), 67322#(and (<= main_~i~0 66) (<= 0 main_~i~0))] [2018-04-12 20:55:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:55,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-12 20:55:55,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-12 20:55:55,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 20:55:55,181 INFO L87 Difference]: Start difference. First operand 830 states and 964 transitions. Second operand 71 states. [2018-04-12 20:55:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:55:57,785 INFO L93 Difference]: Finished difference Result 912 states and 1049 transitions. [2018-04-12 20:55:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-12 20:55:57,786 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-12 20:55:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:55:57,787 INFO L225 Difference]: With dead ends: 912 [2018-04-12 20:55:57,787 INFO L226 Difference]: Without dead ends: 912 [2018-04-12 20:55:57,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-12 20:55:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-04-12 20:55:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 842. [2018-04-12 20:55:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2018-04-12 20:55:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 978 transitions. [2018-04-12 20:55:57,791 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 978 transitions. Word has length 342 [2018-04-12 20:55:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:55:57,792 INFO L459 AbstractCegarLoop]: Abstraction has 842 states and 978 transitions. [2018-04-12 20:55:57,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-12 20:55:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 978 transitions. [2018-04-12 20:55:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-12 20:55:57,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:55:57,793 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-12 20:55:57,793 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:55:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1621542312, now seen corresponding path program 68 times [2018-04-12 20:55:57,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:55:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:55:57,801 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:55:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:58,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:55:58,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-12 20:55:58,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:55:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:58,800 INFO L182 omatonBuilderFactory]: Interpolants [69249#(<= main_~i~0 35), 69248#(<= main_~i~0 34), 69251#(<= main_~i~0 37), 69250#(<= main_~i~0 36), 69253#(<= main_~i~0 39), 69252#(<= main_~i~0 38), 69255#(<= main_~i~0 41), 69254#(<= main_~i~0 40), 69257#(<= main_~i~0 43), 69256#(<= main_~i~0 42), 69259#(<= main_~i~0 45), 69258#(<= main_~i~0 44), 69261#(<= main_~i~0 47), 69260#(<= main_~i~0 46), 69263#(<= main_~i~0 49), 69262#(<= main_~i~0 48), 69265#(<= main_~i~0 51), 69264#(<= main_~i~0 50), 69267#(<= main_~i~0 53), 69266#(<= main_~i~0 52), 69269#(<= main_~i~0 55), 69268#(<= main_~i~0 54), 69271#(<= main_~i~0 57), 69270#(<= main_~i~0 56), 69273#(<= main_~i~0 59), 69272#(<= main_~i~0 58), 69275#(<= main_~i~0 61), 69274#(<= main_~i~0 60), 69277#(<= main_~i~0 63), 69276#(<= main_~i~0 62), 69279#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 69278#(<= main_~i~0 64), 69281#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 69280#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 69283#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 69282#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 69213#false, 69212#true, 69215#(<= main_~i~0 1), 69214#(<= main_~i~0 0), 69217#(<= main_~i~0 3), 69216#(<= main_~i~0 2), 69219#(<= main_~i~0 5), 69218#(<= main_~i~0 4), 69221#(<= main_~i~0 7), 69220#(<= main_~i~0 6), 69223#(<= main_~i~0 9), 69222#(<= main_~i~0 8), 69225#(<= main_~i~0 11), 69224#(<= main_~i~0 10), 69227#(<= main_~i~0 13), 69226#(<= main_~i~0 12), 69229#(<= main_~i~0 15), 69228#(<= main_~i~0 14), 69231#(<= main_~i~0 17), 69230#(<= main_~i~0 16), 69233#(<= main_~i~0 19), 69232#(<= main_~i~0 18), 69235#(<= main_~i~0 21), 69234#(<= main_~i~0 20), 69237#(<= main_~i~0 23), 69236#(<= main_~i~0 22), 69239#(<= main_~i~0 25), 69238#(<= main_~i~0 24), 69241#(<= main_~i~0 27), 69240#(<= main_~i~0 26), 69243#(<= main_~i~0 29), 69242#(<= main_~i~0 28), 69245#(<= main_~i~0 31), 69244#(<= main_~i~0 30), 69247#(<= main_~i~0 33), 69246#(<= main_~i~0 32)] [2018-04-12 20:55:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:55:58,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-12 20:55:58,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-12 20:55:58,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 20:55:58,801 INFO L87 Difference]: Start difference. First operand 842 states and 978 transitions. Second operand 72 states. [2018-04-12 20:56:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:02,137 INFO L93 Difference]: Finished difference Result 925 states and 1064 transitions. [2018-04-12 20:56:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-12 20:56:02,137 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-12 20:56:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:02,139 INFO L225 Difference]: With dead ends: 925 [2018-04-12 20:56:02,139 INFO L226 Difference]: Without dead ends: 925 [2018-04-12 20:56:02,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-12 20:56:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-12 20:56:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 854. [2018-04-12 20:56:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-04-12 20:56:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 992 transitions. [2018-04-12 20:56:02,149 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 992 transitions. Word has length 347 [2018-04-12 20:56:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:02,149 INFO L459 AbstractCegarLoop]: Abstraction has 854 states and 992 transitions. [2018-04-12 20:56:02,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-12 20:56:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 992 transitions. [2018-04-12 20:56:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-12 20:56:02,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:02,151 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:02,151 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:02,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1672146005, now seen corresponding path program 69 times [2018-04-12 20:56:02,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:02,168 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:03,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:03,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-12 20:56:03,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:03,226 INFO L182 omatonBuilderFactory]: Interpolants [71199#true, 71201#(<= main_~i~0 0), 71200#false, 71203#(<= main_~i~0 2), 71202#(<= main_~i~0 1), 71205#(<= main_~i~0 4), 71204#(<= main_~i~0 3), 71207#(<= main_~i~0 6), 71206#(<= main_~i~0 5), 71209#(<= main_~i~0 8), 71208#(<= main_~i~0 7), 71211#(<= main_~i~0 10), 71210#(<= main_~i~0 9), 71213#(<= main_~i~0 12), 71212#(<= main_~i~0 11), 71215#(<= main_~i~0 14), 71214#(<= main_~i~0 13), 71217#(<= main_~i~0 16), 71216#(<= main_~i~0 15), 71219#(<= main_~i~0 18), 71218#(<= main_~i~0 17), 71221#(<= main_~i~0 20), 71220#(<= main_~i~0 19), 71223#(<= main_~i~0 22), 71222#(<= main_~i~0 21), 71225#(<= main_~i~0 24), 71224#(<= main_~i~0 23), 71227#(<= main_~i~0 26), 71226#(<= main_~i~0 25), 71229#(<= main_~i~0 28), 71228#(<= main_~i~0 27), 71231#(<= main_~i~0 30), 71230#(<= main_~i~0 29), 71233#(<= main_~i~0 32), 71232#(<= main_~i~0 31), 71235#(<= main_~i~0 34), 71234#(<= main_~i~0 33), 71237#(<= main_~i~0 36), 71236#(<= main_~i~0 35), 71239#(<= main_~i~0 38), 71238#(<= main_~i~0 37), 71241#(<= main_~i~0 40), 71240#(<= main_~i~0 39), 71243#(<= main_~i~0 42), 71242#(<= main_~i~0 41), 71245#(<= main_~i~0 44), 71244#(<= main_~i~0 43), 71247#(<= main_~i~0 46), 71246#(<= main_~i~0 45), 71249#(<= main_~i~0 48), 71248#(<= main_~i~0 47), 71251#(<= main_~i~0 50), 71250#(<= main_~i~0 49), 71253#(<= main_~i~0 52), 71252#(<= main_~i~0 51), 71255#(<= main_~i~0 54), 71254#(<= main_~i~0 53), 71257#(<= main_~i~0 56), 71256#(<= main_~i~0 55), 71259#(<= main_~i~0 58), 71258#(<= main_~i~0 57), 71261#(<= main_~i~0 60), 71260#(<= main_~i~0 59), 71263#(<= main_~i~0 62), 71262#(<= main_~i~0 61), 71265#(<= main_~i~0 64), 71264#(<= main_~i~0 63), 71267#(<= main_~i~0 66), 71266#(<= main_~i~0 65), 71269#(<= main_~i~0 68), 71268#(<= main_~i~0 67), 71271#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 71270#(and (<= 0 main_~i~0) (<= main_~i~0 68))] [2018-04-12 20:56:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:03,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-12 20:56:03,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-12 20:56:03,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-12 20:56:03,227 INFO L87 Difference]: Start difference. First operand 854 states and 992 transitions. Second operand 73 states. [2018-04-12 20:56:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:06,011 INFO L93 Difference]: Finished difference Result 938 states and 1079 transitions. [2018-04-12 20:56:06,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-12 20:56:06,011 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-12 20:56:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:06,012 INFO L225 Difference]: With dead ends: 938 [2018-04-12 20:56:06,012 INFO L226 Difference]: Without dead ends: 938 [2018-04-12 20:56:06,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-12 20:56:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-12 20:56:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 866. [2018-04-12 20:56:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-04-12 20:56:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1006 transitions. [2018-04-12 20:56:06,017 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1006 transitions. Word has length 352 [2018-04-12 20:56:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:06,018 INFO L459 AbstractCegarLoop]: Abstraction has 866 states and 1006 transitions. [2018-04-12 20:56:06,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-12 20:56:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1006 transitions. [2018-04-12 20:56:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-12 20:56:06,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:06,019 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:06,019 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1568347704, now seen corresponding path program 70 times [2018-04-12 20:56:06,019 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:06,028 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:07,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:07,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-12 20:56:07,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:07,106 INFO L182 omatonBuilderFactory]: Interpolants [73217#(<= main_~i~0 1), 73216#(<= main_~i~0 0), 73219#(<= main_~i~0 3), 73218#(<= main_~i~0 2), 73221#(<= main_~i~0 5), 73220#(<= main_~i~0 4), 73223#(<= main_~i~0 7), 73222#(<= main_~i~0 6), 73225#(<= main_~i~0 9), 73224#(<= main_~i~0 8), 73227#(<= main_~i~0 11), 73226#(<= main_~i~0 10), 73229#(<= main_~i~0 13), 73228#(<= main_~i~0 12), 73231#(<= main_~i~0 15), 73230#(<= main_~i~0 14), 73233#(<= main_~i~0 17), 73232#(<= main_~i~0 16), 73235#(<= main_~i~0 19), 73234#(<= main_~i~0 18), 73237#(<= main_~i~0 21), 73236#(<= main_~i~0 20), 73239#(<= main_~i~0 23), 73238#(<= main_~i~0 22), 73241#(<= main_~i~0 25), 73240#(<= main_~i~0 24), 73243#(<= main_~i~0 27), 73242#(<= main_~i~0 26), 73245#(<= main_~i~0 29), 73244#(<= main_~i~0 28), 73247#(<= main_~i~0 31), 73246#(<= main_~i~0 30), 73249#(<= main_~i~0 33), 73248#(<= main_~i~0 32), 73251#(<= main_~i~0 35), 73250#(<= main_~i~0 34), 73253#(<= main_~i~0 37), 73252#(<= main_~i~0 36), 73255#(<= main_~i~0 39), 73254#(<= main_~i~0 38), 73257#(<= main_~i~0 41), 73256#(<= main_~i~0 40), 73259#(<= main_~i~0 43), 73258#(<= main_~i~0 42), 73261#(<= main_~i~0 45), 73260#(<= main_~i~0 44), 73263#(<= main_~i~0 47), 73262#(<= main_~i~0 46), 73265#(<= main_~i~0 49), 73264#(<= main_~i~0 48), 73267#(<= main_~i~0 51), 73266#(<= main_~i~0 50), 73269#(<= main_~i~0 53), 73268#(<= main_~i~0 52), 73271#(<= main_~i~0 55), 73270#(<= main_~i~0 54), 73273#(<= main_~i~0 57), 73272#(<= main_~i~0 56), 73275#(<= main_~i~0 59), 73274#(<= main_~i~0 58), 73277#(<= main_~i~0 61), 73276#(<= main_~i~0 60), 73279#(<= main_~i~0 63), 73278#(<= main_~i~0 62), 73281#(<= main_~i~0 65), 73280#(<= main_~i~0 64), 73283#(<= main_~i~0 67), 73282#(<= main_~i~0 66), 73285#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 73284#(<= main_~i~0 68), 73287#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 73286#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 73215#false, 73214#true] [2018-04-12 20:56:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:07,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-12 20:56:07,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-12 20:56:07,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 20:56:07,107 INFO L87 Difference]: Start difference. First operand 866 states and 1006 transitions. Second operand 74 states. [2018-04-12 20:56:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:10,076 INFO L93 Difference]: Finished difference Result 951 states and 1094 transitions. [2018-04-12 20:56:10,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-12 20:56:10,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-12 20:56:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:10,078 INFO L225 Difference]: With dead ends: 951 [2018-04-12 20:56:10,078 INFO L226 Difference]: Without dead ends: 951 [2018-04-12 20:56:10,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-12 20:56:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-04-12 20:56:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 878. [2018-04-12 20:56:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-04-12 20:56:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1020 transitions. [2018-04-12 20:56:10,083 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1020 transitions. Word has length 357 [2018-04-12 20:56:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:10,084 INFO L459 AbstractCegarLoop]: Abstraction has 878 states and 1020 transitions. [2018-04-12 20:56:10,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-12 20:56:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1020 transitions. [2018-04-12 20:56:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-12 20:56:10,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:10,085 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:10,085 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1100897333, now seen corresponding path program 71 times [2018-04-12 20:56:10,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:10,095 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:11,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:11,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-12 20:56:11,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:11,191 INFO L182 omatonBuilderFactory]: Interpolants [75265#(<= main_~i~0 6), 75264#(<= main_~i~0 5), 75267#(<= main_~i~0 8), 75266#(<= main_~i~0 7), 75269#(<= main_~i~0 10), 75268#(<= main_~i~0 9), 75271#(<= main_~i~0 12), 75270#(<= main_~i~0 11), 75273#(<= main_~i~0 14), 75272#(<= main_~i~0 13), 75275#(<= main_~i~0 16), 75274#(<= main_~i~0 15), 75277#(<= main_~i~0 18), 75276#(<= main_~i~0 17), 75279#(<= main_~i~0 20), 75278#(<= main_~i~0 19), 75281#(<= main_~i~0 22), 75280#(<= main_~i~0 21), 75283#(<= main_~i~0 24), 75282#(<= main_~i~0 23), 75285#(<= main_~i~0 26), 75284#(<= main_~i~0 25), 75287#(<= main_~i~0 28), 75286#(<= main_~i~0 27), 75289#(<= main_~i~0 30), 75288#(<= main_~i~0 29), 75291#(<= main_~i~0 32), 75290#(<= main_~i~0 31), 75293#(<= main_~i~0 34), 75292#(<= main_~i~0 33), 75295#(<= main_~i~0 36), 75294#(<= main_~i~0 35), 75297#(<= main_~i~0 38), 75296#(<= main_~i~0 37), 75299#(<= main_~i~0 40), 75298#(<= main_~i~0 39), 75301#(<= main_~i~0 42), 75300#(<= main_~i~0 41), 75303#(<= main_~i~0 44), 75302#(<= main_~i~0 43), 75305#(<= main_~i~0 46), 75304#(<= main_~i~0 45), 75307#(<= main_~i~0 48), 75306#(<= main_~i~0 47), 75309#(<= main_~i~0 50), 75308#(<= main_~i~0 49), 75311#(<= main_~i~0 52), 75310#(<= main_~i~0 51), 75313#(<= main_~i~0 54), 75312#(<= main_~i~0 53), 75315#(<= main_~i~0 56), 75314#(<= main_~i~0 55), 75317#(<= main_~i~0 58), 75316#(<= main_~i~0 57), 75319#(<= main_~i~0 60), 75318#(<= main_~i~0 59), 75321#(<= main_~i~0 62), 75320#(<= main_~i~0 61), 75323#(<= main_~i~0 64), 75322#(<= main_~i~0 63), 75325#(<= main_~i~0 66), 75324#(<= main_~i~0 65), 75327#(<= main_~i~0 68), 75326#(<= main_~i~0 67), 75329#(<= main_~i~0 70), 75328#(<= main_~i~0 69), 75331#(and (<= 1 main_~i~0) (<= main_~i~0 71)), 75330#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 75257#true, 75259#(<= main_~i~0 0), 75258#false, 75261#(<= main_~i~0 2), 75260#(<= main_~i~0 1), 75263#(<= main_~i~0 4), 75262#(<= main_~i~0 3)] [2018-04-12 20:56:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:11,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-12 20:56:11,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-12 20:56:11,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 20:56:11,192 INFO L87 Difference]: Start difference. First operand 878 states and 1020 transitions. Second operand 75 states. [2018-04-12 20:56:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:14,030 INFO L93 Difference]: Finished difference Result 964 states and 1109 transitions. [2018-04-12 20:56:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 20:56:14,030 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-04-12 20:56:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:14,032 INFO L225 Difference]: With dead ends: 964 [2018-04-12 20:56:14,032 INFO L226 Difference]: Without dead ends: 964 [2018-04-12 20:56:14,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-04-12 20:56:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-04-12 20:56:14,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 890. [2018-04-12 20:56:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-12 20:56:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1034 transitions. [2018-04-12 20:56:14,041 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1034 transitions. Word has length 362 [2018-04-12 20:56:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:14,041 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 1034 transitions. [2018-04-12 20:56:14,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-12 20:56:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1034 transitions. [2018-04-12 20:56:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-12 20:56:14,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:14,043 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:14,043 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1822189032, now seen corresponding path program 72 times [2018-04-12 20:56:14,044 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:14,060 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:15,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:15,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-12 20:56:15,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:15,401 INFO L182 omatonBuilderFactory]: Interpolants [77329#false, 77328#true, 77331#(<= main_~i~0 1), 77330#(<= main_~i~0 0), 77333#(<= main_~i~0 3), 77332#(<= main_~i~0 2), 77335#(<= main_~i~0 5), 77334#(<= main_~i~0 4), 77337#(<= main_~i~0 7), 77336#(<= main_~i~0 6), 77339#(<= main_~i~0 9), 77338#(<= main_~i~0 8), 77341#(<= main_~i~0 11), 77340#(<= main_~i~0 10), 77343#(<= main_~i~0 13), 77342#(<= main_~i~0 12), 77345#(<= main_~i~0 15), 77344#(<= main_~i~0 14), 77347#(<= main_~i~0 17), 77346#(<= main_~i~0 16), 77349#(<= main_~i~0 19), 77348#(<= main_~i~0 18), 77351#(<= main_~i~0 21), 77350#(<= main_~i~0 20), 77353#(<= main_~i~0 23), 77352#(<= main_~i~0 22), 77355#(<= main_~i~0 25), 77354#(<= main_~i~0 24), 77357#(<= main_~i~0 27), 77356#(<= main_~i~0 26), 77359#(<= main_~i~0 29), 77358#(<= main_~i~0 28), 77361#(<= main_~i~0 31), 77360#(<= main_~i~0 30), 77363#(<= main_~i~0 33), 77362#(<= main_~i~0 32), 77365#(<= main_~i~0 35), 77364#(<= main_~i~0 34), 77367#(<= main_~i~0 37), 77366#(<= main_~i~0 36), 77369#(<= main_~i~0 39), 77368#(<= main_~i~0 38), 77371#(<= main_~i~0 41), 77370#(<= main_~i~0 40), 77373#(<= main_~i~0 43), 77372#(<= main_~i~0 42), 77375#(<= main_~i~0 45), 77374#(<= main_~i~0 44), 77377#(<= main_~i~0 47), 77376#(<= main_~i~0 46), 77379#(<= main_~i~0 49), 77378#(<= main_~i~0 48), 77381#(<= main_~i~0 51), 77380#(<= main_~i~0 50), 77383#(<= main_~i~0 53), 77382#(<= main_~i~0 52), 77385#(<= main_~i~0 55), 77384#(<= main_~i~0 54), 77387#(<= main_~i~0 57), 77386#(<= main_~i~0 56), 77389#(<= main_~i~0 59), 77388#(<= main_~i~0 58), 77391#(<= main_~i~0 61), 77390#(<= main_~i~0 60), 77393#(<= main_~i~0 63), 77392#(<= main_~i~0 62), 77395#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 77394#(<= main_~i~0 64), 77397#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 77396#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 77399#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 77398#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 77401#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 77400#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 77403#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 77402#(and (<= 7 main_~i~0) (<= main_~i~0 71))] [2018-04-12 20:56:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:15,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-12 20:56:15,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-12 20:56:15,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 20:56:15,402 INFO L87 Difference]: Start difference. First operand 890 states and 1034 transitions. Second operand 76 states. [2018-04-12 20:56:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:19,361 INFO L93 Difference]: Finished difference Result 977 states and 1124 transitions. [2018-04-12 20:56:19,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-12 20:56:19,361 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 367 [2018-04-12 20:56:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:19,363 INFO L225 Difference]: With dead ends: 977 [2018-04-12 20:56:19,363 INFO L226 Difference]: Without dead ends: 977 [2018-04-12 20:56:19,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-04-12 20:56:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-04-12 20:56:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 902. [2018-04-12 20:56:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-04-12 20:56:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1048 transitions. [2018-04-12 20:56:19,373 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1048 transitions. Word has length 367 [2018-04-12 20:56:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:19,373 INFO L459 AbstractCegarLoop]: Abstraction has 902 states and 1048 transitions. [2018-04-12 20:56:19,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-12 20:56:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1048 transitions. [2018-04-12 20:56:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-12 20:56:19,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:19,375 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:19,375 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -43027435, now seen corresponding path program 73 times [2018-04-12 20:56:19,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:19,392 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:20,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:20,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-12 20:56:20,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:20,671 INFO L182 omatonBuilderFactory]: Interpolants [79489#(<= main_~i~0 60), 79488#(<= main_~i~0 59), 79491#(<= main_~i~0 62), 79490#(<= main_~i~0 61), 79493#(<= main_~i~0 64), 79492#(<= main_~i~0 63), 79495#(<= main_~i~0 66), 79494#(<= main_~i~0 65), 79497#(<= main_~i~0 68), 79496#(<= main_~i~0 67), 79499#(<= main_~i~0 70), 79498#(<= main_~i~0 69), 79501#(<= main_~i~0 72), 79500#(<= main_~i~0 71), 79503#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 79502#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 79427#true, 79429#(<= main_~i~0 0), 79428#false, 79431#(<= main_~i~0 2), 79430#(<= main_~i~0 1), 79433#(<= main_~i~0 4), 79432#(<= main_~i~0 3), 79435#(<= main_~i~0 6), 79434#(<= main_~i~0 5), 79437#(<= main_~i~0 8), 79436#(<= main_~i~0 7), 79439#(<= main_~i~0 10), 79438#(<= main_~i~0 9), 79441#(<= main_~i~0 12), 79440#(<= main_~i~0 11), 79443#(<= main_~i~0 14), 79442#(<= main_~i~0 13), 79445#(<= main_~i~0 16), 79444#(<= main_~i~0 15), 79447#(<= main_~i~0 18), 79446#(<= main_~i~0 17), 79449#(<= main_~i~0 20), 79448#(<= main_~i~0 19), 79451#(<= main_~i~0 22), 79450#(<= main_~i~0 21), 79453#(<= main_~i~0 24), 79452#(<= main_~i~0 23), 79455#(<= main_~i~0 26), 79454#(<= main_~i~0 25), 79457#(<= main_~i~0 28), 79456#(<= main_~i~0 27), 79459#(<= main_~i~0 30), 79458#(<= main_~i~0 29), 79461#(<= main_~i~0 32), 79460#(<= main_~i~0 31), 79463#(<= main_~i~0 34), 79462#(<= main_~i~0 33), 79465#(<= main_~i~0 36), 79464#(<= main_~i~0 35), 79467#(<= main_~i~0 38), 79466#(<= main_~i~0 37), 79469#(<= main_~i~0 40), 79468#(<= main_~i~0 39), 79471#(<= main_~i~0 42), 79470#(<= main_~i~0 41), 79473#(<= main_~i~0 44), 79472#(<= main_~i~0 43), 79475#(<= main_~i~0 46), 79474#(<= main_~i~0 45), 79477#(<= main_~i~0 48), 79476#(<= main_~i~0 47), 79479#(<= main_~i~0 50), 79478#(<= main_~i~0 49), 79481#(<= main_~i~0 52), 79480#(<= main_~i~0 51), 79483#(<= main_~i~0 54), 79482#(<= main_~i~0 53), 79485#(<= main_~i~0 56), 79484#(<= main_~i~0 55), 79487#(<= main_~i~0 58), 79486#(<= main_~i~0 57)] [2018-04-12 20:56:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:20,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-12 20:56:20,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-12 20:56:20,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 20:56:20,672 INFO L87 Difference]: Start difference. First operand 902 states and 1048 transitions. Second operand 77 states. [2018-04-12 20:56:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:23,698 INFO L93 Difference]: Finished difference Result 990 states and 1139 transitions. [2018-04-12 20:56:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-12 20:56:23,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-12 20:56:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:23,700 INFO L225 Difference]: With dead ends: 990 [2018-04-12 20:56:23,700 INFO L226 Difference]: Without dead ends: 990 [2018-04-12 20:56:23,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-12 20:56:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-04-12 20:56:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 914. [2018-04-12 20:56:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-04-12 20:56:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1062 transitions. [2018-04-12 20:56:23,705 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1062 transitions. Word has length 372 [2018-04-12 20:56:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:23,705 INFO L459 AbstractCegarLoop]: Abstraction has 914 states and 1062 transitions. [2018-04-12 20:56:23,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-12 20:56:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1062 transitions. [2018-04-12 20:56:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-12 20:56:23,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:23,707 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:23,707 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash 689912328, now seen corresponding path program 74 times [2018-04-12 20:56:23,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:23,717 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:24,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-12 20:56:24,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:24,893 INFO L182 omatonBuilderFactory]: Interpolants [81555#false, 81554#true, 81557#(<= main_~i~0 1), 81556#(<= main_~i~0 0), 81559#(<= main_~i~0 3), 81558#(<= main_~i~0 2), 81561#(<= main_~i~0 5), 81560#(<= main_~i~0 4), 81563#(<= main_~i~0 7), 81562#(<= main_~i~0 6), 81565#(<= main_~i~0 9), 81564#(<= main_~i~0 8), 81567#(<= main_~i~0 11), 81566#(<= main_~i~0 10), 81569#(<= main_~i~0 13), 81568#(<= main_~i~0 12), 81571#(<= main_~i~0 15), 81570#(<= main_~i~0 14), 81573#(<= main_~i~0 17), 81572#(<= main_~i~0 16), 81575#(<= main_~i~0 19), 81574#(<= main_~i~0 18), 81577#(<= main_~i~0 21), 81576#(<= main_~i~0 20), 81579#(<= main_~i~0 23), 81578#(<= main_~i~0 22), 81581#(<= main_~i~0 25), 81580#(<= main_~i~0 24), 81583#(<= main_~i~0 27), 81582#(<= main_~i~0 26), 81585#(<= main_~i~0 29), 81584#(<= main_~i~0 28), 81587#(<= main_~i~0 31), 81586#(<= main_~i~0 30), 81589#(<= main_~i~0 33), 81588#(<= main_~i~0 32), 81591#(<= main_~i~0 35), 81590#(<= main_~i~0 34), 81593#(<= main_~i~0 37), 81592#(<= main_~i~0 36), 81595#(<= main_~i~0 39), 81594#(<= main_~i~0 38), 81597#(<= main_~i~0 41), 81596#(<= main_~i~0 40), 81599#(<= main_~i~0 43), 81598#(<= main_~i~0 42), 81601#(<= main_~i~0 45), 81600#(<= main_~i~0 44), 81603#(<= main_~i~0 47), 81602#(<= main_~i~0 46), 81605#(<= main_~i~0 49), 81604#(<= main_~i~0 48), 81607#(<= main_~i~0 51), 81606#(<= main_~i~0 50), 81609#(<= main_~i~0 53), 81608#(<= main_~i~0 52), 81611#(<= main_~i~0 55), 81610#(<= main_~i~0 54), 81613#(<= main_~i~0 57), 81612#(<= main_~i~0 56), 81615#(<= main_~i~0 59), 81614#(<= main_~i~0 58), 81617#(<= main_~i~0 61), 81616#(<= main_~i~0 60), 81619#(<= main_~i~0 63), 81618#(<= main_~i~0 62), 81621#(<= main_~i~0 65), 81620#(<= main_~i~0 64), 81623#(<= main_~i~0 67), 81622#(<= main_~i~0 66), 81625#(<= main_~i~0 69), 81624#(<= main_~i~0 68), 81627#(<= main_~i~0 71), 81626#(<= main_~i~0 70), 81629#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 81628#(<= main_~i~0 72), 81631#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 81630#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-04-12 20:56:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:24,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-12 20:56:24,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-12 20:56:24,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 20:56:24,894 INFO L87 Difference]: Start difference. First operand 914 states and 1062 transitions. Second operand 78 states. [2018-04-12 20:56:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:28,202 INFO L93 Difference]: Finished difference Result 1003 states and 1154 transitions. [2018-04-12 20:56:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-12 20:56:28,202 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-12 20:56:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:28,204 INFO L225 Difference]: With dead ends: 1003 [2018-04-12 20:56:28,204 INFO L226 Difference]: Without dead ends: 1003 [2018-04-12 20:56:28,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-12 20:56:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-04-12 20:56:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 926. [2018-04-12 20:56:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-04-12 20:56:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1076 transitions. [2018-04-12 20:56:28,214 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1076 transitions. Word has length 377 [2018-04-12 20:56:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:28,215 INFO L459 AbstractCegarLoop]: Abstraction has 926 states and 1076 transitions. [2018-04-12 20:56:28,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-12 20:56:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1076 transitions. [2018-04-12 20:56:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-12 20:56:28,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:28,217 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:28,217 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1137953803, now seen corresponding path program 75 times [2018-04-12 20:56:28,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:28,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:29,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:29,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-12 20:56:29,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:29,512 INFO L182 omatonBuilderFactory]: Interpolants [83713#(<= main_~i~0 2), 83712#(<= main_~i~0 1), 83715#(<= main_~i~0 4), 83714#(<= main_~i~0 3), 83717#(<= main_~i~0 6), 83716#(<= main_~i~0 5), 83719#(<= main_~i~0 8), 83718#(<= main_~i~0 7), 83721#(<= main_~i~0 10), 83720#(<= main_~i~0 9), 83723#(<= main_~i~0 12), 83722#(<= main_~i~0 11), 83725#(<= main_~i~0 14), 83724#(<= main_~i~0 13), 83727#(<= main_~i~0 16), 83726#(<= main_~i~0 15), 83729#(<= main_~i~0 18), 83728#(<= main_~i~0 17), 83731#(<= main_~i~0 20), 83730#(<= main_~i~0 19), 83733#(<= main_~i~0 22), 83732#(<= main_~i~0 21), 83735#(<= main_~i~0 24), 83734#(<= main_~i~0 23), 83737#(<= main_~i~0 26), 83736#(<= main_~i~0 25), 83739#(<= main_~i~0 28), 83738#(<= main_~i~0 27), 83741#(<= main_~i~0 30), 83740#(<= main_~i~0 29), 83743#(<= main_~i~0 32), 83742#(<= main_~i~0 31), 83745#(<= main_~i~0 34), 83744#(<= main_~i~0 33), 83747#(<= main_~i~0 36), 83746#(<= main_~i~0 35), 83749#(<= main_~i~0 38), 83748#(<= main_~i~0 37), 83751#(<= main_~i~0 40), 83750#(<= main_~i~0 39), 83753#(<= main_~i~0 42), 83752#(<= main_~i~0 41), 83755#(<= main_~i~0 44), 83754#(<= main_~i~0 43), 83757#(<= main_~i~0 46), 83756#(<= main_~i~0 45), 83759#(<= main_~i~0 48), 83758#(<= main_~i~0 47), 83761#(<= main_~i~0 50), 83760#(<= main_~i~0 49), 83763#(<= main_~i~0 52), 83762#(<= main_~i~0 51), 83765#(<= main_~i~0 54), 83764#(<= main_~i~0 53), 83767#(<= main_~i~0 56), 83766#(<= main_~i~0 55), 83769#(<= main_~i~0 58), 83768#(<= main_~i~0 57), 83771#(<= main_~i~0 60), 83770#(<= main_~i~0 59), 83773#(<= main_~i~0 62), 83772#(<= main_~i~0 61), 83775#(<= main_~i~0 64), 83774#(<= main_~i~0 63), 83777#(<= main_~i~0 66), 83776#(<= main_~i~0 65), 83779#(<= main_~i~0 68), 83778#(<= main_~i~0 67), 83781#(<= main_~i~0 70), 83780#(<= main_~i~0 69), 83783#(<= main_~i~0 72), 83782#(<= main_~i~0 71), 83785#(<= main_~i~0 74), 83784#(<= main_~i~0 73), 83787#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 83786#(and (<= 0 main_~i~0) (<= main_~i~0 74)), 83709#true, 83711#(<= main_~i~0 0), 83710#false] [2018-04-12 20:56:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:29,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-12 20:56:29,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-12 20:56:29,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-12 20:56:29,513 INFO L87 Difference]: Start difference. First operand 926 states and 1076 transitions. Second operand 79 states. [2018-04-12 20:56:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:32,751 INFO L93 Difference]: Finished difference Result 1016 states and 1169 transitions. [2018-04-12 20:56:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-12 20:56:32,751 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-12 20:56:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:32,753 INFO L225 Difference]: With dead ends: 1016 [2018-04-12 20:56:32,753 INFO L226 Difference]: Without dead ends: 1016 [2018-04-12 20:56:32,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-12 20:56:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-04-12 20:56:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 938. [2018-04-12 20:56:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-04-12 20:56:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1090 transitions. [2018-04-12 20:56:32,759 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1090 transitions. Word has length 382 [2018-04-12 20:56:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:32,759 INFO L459 AbstractCegarLoop]: Abstraction has 938 states and 1090 transitions. [2018-04-12 20:56:32,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-12 20:56:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1090 transitions. [2018-04-12 20:56:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-12 20:56:32,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:32,761 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:32,761 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1413519832, now seen corresponding path program 76 times [2018-04-12 20:56:32,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:32,771 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:34,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:34,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-12 20:56:34,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:34,067 INFO L182 omatonBuilderFactory]: Interpolants [85893#false, 85892#true, 85895#(<= main_~i~0 1), 85894#(<= main_~i~0 0), 85897#(<= main_~i~0 3), 85896#(<= main_~i~0 2), 85899#(<= main_~i~0 5), 85898#(<= main_~i~0 4), 85901#(<= main_~i~0 7), 85900#(<= main_~i~0 6), 85903#(<= main_~i~0 9), 85902#(<= main_~i~0 8), 85905#(<= main_~i~0 11), 85904#(<= main_~i~0 10), 85907#(<= main_~i~0 13), 85906#(<= main_~i~0 12), 85909#(<= main_~i~0 15), 85908#(<= main_~i~0 14), 85911#(<= main_~i~0 17), 85910#(<= main_~i~0 16), 85913#(<= main_~i~0 19), 85912#(<= main_~i~0 18), 85915#(<= main_~i~0 21), 85914#(<= main_~i~0 20), 85917#(<= main_~i~0 23), 85916#(<= main_~i~0 22), 85919#(<= main_~i~0 25), 85918#(<= main_~i~0 24), 85921#(<= main_~i~0 27), 85920#(<= main_~i~0 26), 85923#(<= main_~i~0 29), 85922#(<= main_~i~0 28), 85925#(<= main_~i~0 31), 85924#(<= main_~i~0 30), 85927#(<= main_~i~0 33), 85926#(<= main_~i~0 32), 85929#(<= main_~i~0 35), 85928#(<= main_~i~0 34), 85931#(<= main_~i~0 37), 85930#(<= main_~i~0 36), 85933#(<= main_~i~0 39), 85932#(<= main_~i~0 38), 85935#(<= main_~i~0 41), 85934#(<= main_~i~0 40), 85937#(<= main_~i~0 43), 85936#(<= main_~i~0 42), 85939#(<= main_~i~0 45), 85938#(<= main_~i~0 44), 85941#(<= main_~i~0 47), 85940#(<= main_~i~0 46), 85943#(<= main_~i~0 49), 85942#(<= main_~i~0 48), 85945#(<= main_~i~0 51), 85944#(<= main_~i~0 50), 85947#(<= main_~i~0 53), 85946#(<= main_~i~0 52), 85949#(<= main_~i~0 55), 85948#(<= main_~i~0 54), 85951#(<= main_~i~0 57), 85950#(<= main_~i~0 56), 85953#(<= main_~i~0 59), 85952#(<= main_~i~0 58), 85955#(<= main_~i~0 61), 85954#(<= main_~i~0 60), 85957#(<= main_~i~0 63), 85956#(<= main_~i~0 62), 85959#(<= main_~i~0 65), 85958#(<= main_~i~0 64), 85961#(<= main_~i~0 67), 85960#(<= main_~i~0 66), 85963#(<= main_~i~0 69), 85962#(<= main_~i~0 68), 85965#(<= main_~i~0 71), 85964#(<= main_~i~0 70), 85967#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 85966#(<= main_~i~0 72), 85969#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 85968#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 85971#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 85970#(and (<= main_~i~0 75) (<= 3 main_~i~0))] [2018-04-12 20:56:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:34,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-12 20:56:34,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-12 20:56:34,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 20:56:34,068 INFO L87 Difference]: Start difference. First operand 938 states and 1090 transitions. Second operand 80 states. [2018-04-12 20:56:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:37,776 INFO L93 Difference]: Finished difference Result 1029 states and 1184 transitions. [2018-04-12 20:56:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-12 20:56:37,776 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-12 20:56:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:37,777 INFO L225 Difference]: With dead ends: 1029 [2018-04-12 20:56:37,777 INFO L226 Difference]: Without dead ends: 1029 [2018-04-12 20:56:37,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-12 20:56:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-04-12 20:56:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 950. [2018-04-12 20:56:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2018-04-12 20:56:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1104 transitions. [2018-04-12 20:56:37,783 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1104 transitions. Word has length 387 [2018-04-12 20:56:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:37,783 INFO L459 AbstractCegarLoop]: Abstraction has 950 states and 1104 transitions. [2018-04-12 20:56:37,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-12 20:56:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1104 transitions. [2018-04-12 20:56:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-12 20:56:37,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:37,785 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:37,785 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 694328277, now seen corresponding path program 77 times [2018-04-12 20:56:37,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:37,794 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:39,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:39,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-12 20:56:39,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:39,189 INFO L182 omatonBuilderFactory]: Interpolants [88103#true, 88105#(<= main_~i~0 0), 88104#false, 88107#(<= main_~i~0 2), 88106#(<= main_~i~0 1), 88109#(<= main_~i~0 4), 88108#(<= main_~i~0 3), 88111#(<= main_~i~0 6), 88110#(<= main_~i~0 5), 88113#(<= main_~i~0 8), 88112#(<= main_~i~0 7), 88115#(<= main_~i~0 10), 88114#(<= main_~i~0 9), 88117#(<= main_~i~0 12), 88116#(<= main_~i~0 11), 88119#(<= main_~i~0 14), 88118#(<= main_~i~0 13), 88121#(<= main_~i~0 16), 88120#(<= main_~i~0 15), 88123#(<= main_~i~0 18), 88122#(<= main_~i~0 17), 88125#(<= main_~i~0 20), 88124#(<= main_~i~0 19), 88127#(<= main_~i~0 22), 88126#(<= main_~i~0 21), 88129#(<= main_~i~0 24), 88128#(<= main_~i~0 23), 88131#(<= main_~i~0 26), 88130#(<= main_~i~0 25), 88133#(<= main_~i~0 28), 88132#(<= main_~i~0 27), 88135#(<= main_~i~0 30), 88134#(<= main_~i~0 29), 88137#(<= main_~i~0 32), 88136#(<= main_~i~0 31), 88139#(<= main_~i~0 34), 88138#(<= main_~i~0 33), 88141#(<= main_~i~0 36), 88140#(<= main_~i~0 35), 88143#(<= main_~i~0 38), 88142#(<= main_~i~0 37), 88145#(<= main_~i~0 40), 88144#(<= main_~i~0 39), 88147#(<= main_~i~0 42), 88146#(<= main_~i~0 41), 88149#(<= main_~i~0 44), 88148#(<= main_~i~0 43), 88151#(<= main_~i~0 46), 88150#(<= main_~i~0 45), 88153#(<= main_~i~0 48), 88152#(<= main_~i~0 47), 88155#(<= main_~i~0 50), 88154#(<= main_~i~0 49), 88157#(<= main_~i~0 52), 88156#(<= main_~i~0 51), 88159#(<= main_~i~0 54), 88158#(<= main_~i~0 53), 88161#(<= main_~i~0 56), 88160#(<= main_~i~0 55), 88163#(<= main_~i~0 58), 88162#(<= main_~i~0 57), 88165#(<= main_~i~0 60), 88164#(<= main_~i~0 59), 88167#(<= main_~i~0 62), 88166#(<= main_~i~0 61), 88169#(<= main_~i~0 64), 88168#(<= main_~i~0 63), 88171#(<= main_~i~0 66), 88170#(<= main_~i~0 65), 88173#(<= main_~i~0 68), 88172#(<= main_~i~0 67), 88175#(<= main_~i~0 70), 88174#(<= main_~i~0 69), 88177#(<= main_~i~0 72), 88176#(<= main_~i~0 71), 88179#(<= main_~i~0 74), 88178#(<= main_~i~0 73), 88181#(<= main_~i~0 76), 88180#(<= main_~i~0 75), 88183#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 88182#(and (<= 0 main_~i~0) (<= main_~i~0 76))] [2018-04-12 20:56:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:39,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-12 20:56:39,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-12 20:56:39,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-04-12 20:56:39,190 INFO L87 Difference]: Start difference. First operand 950 states and 1104 transitions. Second operand 81 states. [2018-04-12 20:56:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:42,554 INFO L93 Difference]: Finished difference Result 1042 states and 1199 transitions. [2018-04-12 20:56:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-12 20:56:42,554 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-04-12 20:56:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:42,555 INFO L225 Difference]: With dead ends: 1042 [2018-04-12 20:56:42,556 INFO L226 Difference]: Without dead ends: 1042 [2018-04-12 20:56:42,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=9246, Invalid=15560, Unknown=0, NotChecked=0, Total=24806 [2018-04-12 20:56:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2018-04-12 20:56:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 962. [2018-04-12 20:56:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-04-12 20:56:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1118 transitions. [2018-04-12 20:56:42,564 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1118 transitions. Word has length 392 [2018-04-12 20:56:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:42,565 INFO L459 AbstractCegarLoop]: Abstraction has 962 states and 1118 transitions. [2018-04-12 20:56:42,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-12 20:56:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1118 transitions. [2018-04-12 20:56:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-12 20:56:42,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:42,567 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:42,567 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1370417736, now seen corresponding path program 78 times [2018-04-12 20:56:42,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:42,584 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:43,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:43,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-12 20:56:43,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:43,911 INFO L182 omatonBuilderFactory]: Interpolants [90369#(<= main_~i~0 25), 90368#(<= main_~i~0 24), 90371#(<= main_~i~0 27), 90370#(<= main_~i~0 26), 90373#(<= main_~i~0 29), 90372#(<= main_~i~0 28), 90375#(<= main_~i~0 31), 90374#(<= main_~i~0 30), 90377#(<= main_~i~0 33), 90376#(<= main_~i~0 32), 90379#(<= main_~i~0 35), 90378#(<= main_~i~0 34), 90381#(<= main_~i~0 37), 90380#(<= main_~i~0 36), 90383#(<= main_~i~0 39), 90382#(<= main_~i~0 38), 90385#(<= main_~i~0 41), 90384#(<= main_~i~0 40), 90387#(<= main_~i~0 43), 90386#(<= main_~i~0 42), 90389#(<= main_~i~0 45), 90388#(<= main_~i~0 44), 90391#(<= main_~i~0 47), 90390#(<= main_~i~0 46), 90393#(<= main_~i~0 49), 90392#(<= main_~i~0 48), 90395#(<= main_~i~0 51), 90394#(<= main_~i~0 50), 90397#(<= main_~i~0 53), 90396#(<= main_~i~0 52), 90399#(<= main_~i~0 55), 90398#(<= main_~i~0 54), 90401#(<= main_~i~0 57), 90400#(<= main_~i~0 56), 90403#(<= main_~i~0 59), 90402#(<= main_~i~0 58), 90405#(<= main_~i~0 61), 90404#(<= main_~i~0 60), 90407#(<= main_~i~0 63), 90406#(<= main_~i~0 62), 90409#(<= main_~i~0 65), 90408#(<= main_~i~0 64), 90411#(<= main_~i~0 67), 90410#(<= main_~i~0 66), 90413#(<= main_~i~0 69), 90412#(<= main_~i~0 68), 90415#(<= main_~i~0 71), 90414#(<= main_~i~0 70), 90417#(<= main_~i~0 73), 90416#(<= main_~i~0 72), 90419#(<= main_~i~0 75), 90418#(<= main_~i~0 74), 90421#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 90420#(<= main_~i~0 76), 90423#(and (<= 2 main_~i~0) (<= main_~i~0 78)), 90422#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 90343#false, 90342#true, 90345#(<= main_~i~0 1), 90344#(<= main_~i~0 0), 90347#(<= main_~i~0 3), 90346#(<= main_~i~0 2), 90349#(<= main_~i~0 5), 90348#(<= main_~i~0 4), 90351#(<= main_~i~0 7), 90350#(<= main_~i~0 6), 90353#(<= main_~i~0 9), 90352#(<= main_~i~0 8), 90355#(<= main_~i~0 11), 90354#(<= main_~i~0 10), 90357#(<= main_~i~0 13), 90356#(<= main_~i~0 12), 90359#(<= main_~i~0 15), 90358#(<= main_~i~0 14), 90361#(<= main_~i~0 17), 90360#(<= main_~i~0 16), 90363#(<= main_~i~0 19), 90362#(<= main_~i~0 18), 90365#(<= main_~i~0 21), 90364#(<= main_~i~0 20), 90367#(<= main_~i~0 23), 90366#(<= main_~i~0 22)] [2018-04-12 20:56:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:43,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-12 20:56:43,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-12 20:56:43,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-04-12 20:56:43,913 INFO L87 Difference]: Start difference. First operand 962 states and 1118 transitions. Second operand 82 states. [2018-04-12 20:56:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:47,424 INFO L93 Difference]: Finished difference Result 1055 states and 1214 transitions. [2018-04-12 20:56:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-12 20:56:47,425 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 397 [2018-04-12 20:56:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:47,425 INFO L225 Difference]: With dead ends: 1055 [2018-04-12 20:56:47,425 INFO L226 Difference]: Without dead ends: 1055 [2018-04-12 20:56:47,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9327, Invalid=16113, Unknown=0, NotChecked=0, Total=25440 [2018-04-12 20:56:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-04-12 20:56:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 974. [2018-04-12 20:56:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-04-12 20:56:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1132 transitions. [2018-04-12 20:56:47,431 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1132 transitions. Word has length 397 [2018-04-12 20:56:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:47,431 INFO L459 AbstractCegarLoop]: Abstraction has 974 states and 1132 transitions. [2018-04-12 20:56:47,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-12 20:56:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1132 transitions. [2018-04-12 20:56:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-12 20:56:47,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:47,433 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:47,433 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:47,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1461758901, now seen corresponding path program 79 times [2018-04-12 20:56:47,433 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:47,443 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:48,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:48,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-12 20:56:48,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:48,807 INFO L182 omatonBuilderFactory]: Interpolants [92673#(<= main_~i~0 62), 92672#(<= main_~i~0 61), 92675#(<= main_~i~0 64), 92674#(<= main_~i~0 63), 92677#(<= main_~i~0 66), 92676#(<= main_~i~0 65), 92679#(<= main_~i~0 68), 92678#(<= main_~i~0 67), 92681#(<= main_~i~0 70), 92680#(<= main_~i~0 69), 92683#(<= main_~i~0 72), 92682#(<= main_~i~0 71), 92685#(<= main_~i~0 74), 92684#(<= main_~i~0 73), 92687#(<= main_~i~0 76), 92686#(<= main_~i~0 75), 92689#(<= main_~i~0 78), 92688#(<= main_~i~0 77), 92691#(and (<= 1 main_~i~0) (<= main_~i~0 79)), 92690#(and (<= 0 main_~i~0) (<= main_~i~0 78)), 92609#true, 92611#(<= main_~i~0 0), 92610#false, 92613#(<= main_~i~0 2), 92612#(<= main_~i~0 1), 92615#(<= main_~i~0 4), 92614#(<= main_~i~0 3), 92617#(<= main_~i~0 6), 92616#(<= main_~i~0 5), 92619#(<= main_~i~0 8), 92618#(<= main_~i~0 7), 92621#(<= main_~i~0 10), 92620#(<= main_~i~0 9), 92623#(<= main_~i~0 12), 92622#(<= main_~i~0 11), 92625#(<= main_~i~0 14), 92624#(<= main_~i~0 13), 92627#(<= main_~i~0 16), 92626#(<= main_~i~0 15), 92629#(<= main_~i~0 18), 92628#(<= main_~i~0 17), 92631#(<= main_~i~0 20), 92630#(<= main_~i~0 19), 92633#(<= main_~i~0 22), 92632#(<= main_~i~0 21), 92635#(<= main_~i~0 24), 92634#(<= main_~i~0 23), 92637#(<= main_~i~0 26), 92636#(<= main_~i~0 25), 92639#(<= main_~i~0 28), 92638#(<= main_~i~0 27), 92641#(<= main_~i~0 30), 92640#(<= main_~i~0 29), 92643#(<= main_~i~0 32), 92642#(<= main_~i~0 31), 92645#(<= main_~i~0 34), 92644#(<= main_~i~0 33), 92647#(<= main_~i~0 36), 92646#(<= main_~i~0 35), 92649#(<= main_~i~0 38), 92648#(<= main_~i~0 37), 92651#(<= main_~i~0 40), 92650#(<= main_~i~0 39), 92653#(<= main_~i~0 42), 92652#(<= main_~i~0 41), 92655#(<= main_~i~0 44), 92654#(<= main_~i~0 43), 92657#(<= main_~i~0 46), 92656#(<= main_~i~0 45), 92659#(<= main_~i~0 48), 92658#(<= main_~i~0 47), 92661#(<= main_~i~0 50), 92660#(<= main_~i~0 49), 92663#(<= main_~i~0 52), 92662#(<= main_~i~0 51), 92665#(<= main_~i~0 54), 92664#(<= main_~i~0 53), 92667#(<= main_~i~0 56), 92666#(<= main_~i~0 55), 92669#(<= main_~i~0 58), 92668#(<= main_~i~0 57), 92671#(<= main_~i~0 60), 92670#(<= main_~i~0 59)] [2018-04-12 20:56:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-12 20:56:48,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-12 20:56:48,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-04-12 20:56:48,808 INFO L87 Difference]: Start difference. First operand 974 states and 1132 transitions. Second operand 83 states. [2018-04-12 20:56:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:52,332 INFO L93 Difference]: Finished difference Result 1068 states and 1229 transitions. [2018-04-12 20:56:52,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-12 20:56:52,332 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-04-12 20:56:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:52,334 INFO L225 Difference]: With dead ends: 1068 [2018-04-12 20:56:52,334 INFO L226 Difference]: Without dead ends: 1068 [2018-04-12 20:56:52,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9723, Invalid=16359, Unknown=0, NotChecked=0, Total=26082 [2018-04-12 20:56:52,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-04-12 20:56:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 986. [2018-04-12 20:56:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-04-12 20:56:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1146 transitions. [2018-04-12 20:56:52,340 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1146 transitions. Word has length 402 [2018-04-12 20:56:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:52,340 INFO L459 AbstractCegarLoop]: Abstraction has 986 states and 1146 transitions. [2018-04-12 20:56:52,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-12 20:56:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1146 transitions. [2018-04-12 20:56:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-12 20:56:52,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:52,342 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:52,342 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 564119144, now seen corresponding path program 80 times [2018-04-12 20:56:52,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:52,353 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:56:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:53,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:56:53,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-12 20:56:53,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:56:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:53,684 INFO L182 omatonBuilderFactory]: Interpolants [94977#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 94976#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 94979#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 94978#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 94981#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 94980#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 94983#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 94982#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 94985#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 94984#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 94987#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 94986#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 94905#false, 94904#true, 94907#(<= main_~i~0 1), 94906#(<= main_~i~0 0), 94909#(<= main_~i~0 3), 94908#(<= main_~i~0 2), 94911#(<= main_~i~0 5), 94910#(<= main_~i~0 4), 94913#(<= main_~i~0 7), 94912#(<= main_~i~0 6), 94915#(<= main_~i~0 9), 94914#(<= main_~i~0 8), 94917#(<= main_~i~0 11), 94916#(<= main_~i~0 10), 94919#(<= main_~i~0 13), 94918#(<= main_~i~0 12), 94921#(<= main_~i~0 15), 94920#(<= main_~i~0 14), 94923#(<= main_~i~0 17), 94922#(<= main_~i~0 16), 94925#(<= main_~i~0 19), 94924#(<= main_~i~0 18), 94927#(<= main_~i~0 21), 94926#(<= main_~i~0 20), 94929#(<= main_~i~0 23), 94928#(<= main_~i~0 22), 94931#(<= main_~i~0 25), 94930#(<= main_~i~0 24), 94933#(<= main_~i~0 27), 94932#(<= main_~i~0 26), 94935#(<= main_~i~0 29), 94934#(<= main_~i~0 28), 94937#(<= main_~i~0 31), 94936#(<= main_~i~0 30), 94939#(<= main_~i~0 33), 94938#(<= main_~i~0 32), 94941#(<= main_~i~0 35), 94940#(<= main_~i~0 34), 94943#(<= main_~i~0 37), 94942#(<= main_~i~0 36), 94945#(<= main_~i~0 39), 94944#(<= main_~i~0 38), 94947#(<= main_~i~0 41), 94946#(<= main_~i~0 40), 94949#(<= main_~i~0 43), 94948#(<= main_~i~0 42), 94951#(<= main_~i~0 45), 94950#(<= main_~i~0 44), 94953#(<= main_~i~0 47), 94952#(<= main_~i~0 46), 94955#(<= main_~i~0 49), 94954#(<= main_~i~0 48), 94957#(<= main_~i~0 51), 94956#(<= main_~i~0 50), 94959#(<= main_~i~0 53), 94958#(<= main_~i~0 52), 94961#(<= main_~i~0 55), 94960#(<= main_~i~0 54), 94963#(<= main_~i~0 57), 94962#(<= main_~i~0 56), 94965#(<= main_~i~0 59), 94964#(<= main_~i~0 58), 94967#(<= main_~i~0 61), 94966#(<= main_~i~0 60), 94969#(<= main_~i~0 63), 94968#(<= main_~i~0 62), 94971#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 94970#(<= main_~i~0 64), 94973#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 94972#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 94975#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 94974#(and (<= main_~i~0 67) (<= 3 main_~i~0))] [2018-04-12 20:56:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:56:53,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-12 20:56:53,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-12 20:56:53,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 20:56:53,685 INFO L87 Difference]: Start difference. First operand 986 states and 1146 transitions. Second operand 84 states. [2018-04-12 20:56:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:56:59,974 INFO L93 Difference]: Finished difference Result 1081 states and 1244 transitions. [2018-04-12 20:56:59,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-12 20:56:59,975 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 407 [2018-04-12 20:56:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:56:59,975 INFO L225 Difference]: With dead ends: 1081 [2018-04-12 20:56:59,976 INFO L226 Difference]: Without dead ends: 1081 [2018-04-12 20:56:59,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4279 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7671, Invalid=19061, Unknown=0, NotChecked=0, Total=26732 [2018-04-12 20:56:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-04-12 20:56:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 998. [2018-04-12 20:56:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-12 20:56:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1160 transitions. [2018-04-12 20:56:59,981 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1160 transitions. Word has length 407 [2018-04-12 20:56:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:56:59,981 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1160 transitions. [2018-04-12 20:56:59,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-12 20:56:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1160 transitions. [2018-04-12 20:56:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-12 20:56:59,983 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:56:59,983 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-12 20:56:59,983 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:56:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1644928107, now seen corresponding path program 81 times [2018-04-12 20:56:59,983 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:56:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:56:59,992 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:01,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:01,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-12 20:57:01,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:01,414 INFO L182 omatonBuilderFactory]: Interpolants [97281#(<= main_~i~0 52), 97280#(<= main_~i~0 51), 97283#(<= main_~i~0 54), 97282#(<= main_~i~0 53), 97285#(<= main_~i~0 56), 97284#(<= main_~i~0 55), 97287#(<= main_~i~0 58), 97286#(<= main_~i~0 57), 97289#(<= main_~i~0 60), 97288#(<= main_~i~0 59), 97291#(<= main_~i~0 62), 97290#(<= main_~i~0 61), 97293#(<= main_~i~0 64), 97292#(<= main_~i~0 63), 97295#(<= main_~i~0 66), 97294#(<= main_~i~0 65), 97297#(<= main_~i~0 68), 97296#(<= main_~i~0 67), 97299#(<= main_~i~0 70), 97298#(<= main_~i~0 69), 97301#(<= main_~i~0 72), 97300#(<= main_~i~0 71), 97303#(<= main_~i~0 74), 97302#(<= main_~i~0 73), 97305#(<= main_~i~0 76), 97304#(<= main_~i~0 75), 97307#(<= main_~i~0 78), 97306#(<= main_~i~0 77), 97309#(<= main_~i~0 80), 97308#(<= main_~i~0 79), 97311#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 97310#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 97227#true, 97229#(<= main_~i~0 0), 97228#false, 97231#(<= main_~i~0 2), 97230#(<= main_~i~0 1), 97233#(<= main_~i~0 4), 97232#(<= main_~i~0 3), 97235#(<= main_~i~0 6), 97234#(<= main_~i~0 5), 97237#(<= main_~i~0 8), 97236#(<= main_~i~0 7), 97239#(<= main_~i~0 10), 97238#(<= main_~i~0 9), 97241#(<= main_~i~0 12), 97240#(<= main_~i~0 11), 97243#(<= main_~i~0 14), 97242#(<= main_~i~0 13), 97245#(<= main_~i~0 16), 97244#(<= main_~i~0 15), 97247#(<= main_~i~0 18), 97246#(<= main_~i~0 17), 97249#(<= main_~i~0 20), 97248#(<= main_~i~0 19), 97251#(<= main_~i~0 22), 97250#(<= main_~i~0 21), 97253#(<= main_~i~0 24), 97252#(<= main_~i~0 23), 97255#(<= main_~i~0 26), 97254#(<= main_~i~0 25), 97257#(<= main_~i~0 28), 97256#(<= main_~i~0 27), 97259#(<= main_~i~0 30), 97258#(<= main_~i~0 29), 97261#(<= main_~i~0 32), 97260#(<= main_~i~0 31), 97263#(<= main_~i~0 34), 97262#(<= main_~i~0 33), 97265#(<= main_~i~0 36), 97264#(<= main_~i~0 35), 97267#(<= main_~i~0 38), 97266#(<= main_~i~0 37), 97269#(<= main_~i~0 40), 97268#(<= main_~i~0 39), 97271#(<= main_~i~0 42), 97270#(<= main_~i~0 41), 97273#(<= main_~i~0 44), 97272#(<= main_~i~0 43), 97275#(<= main_~i~0 46), 97274#(<= main_~i~0 45), 97277#(<= main_~i~0 48), 97276#(<= main_~i~0 47), 97279#(<= main_~i~0 50), 97278#(<= main_~i~0 49)] [2018-04-12 20:57:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:01,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-12 20:57:01,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-12 20:57:01,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-04-12 20:57:01,416 INFO L87 Difference]: Start difference. First operand 998 states and 1160 transitions. Second operand 85 states. [2018-04-12 20:57:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:05,290 INFO L93 Difference]: Finished difference Result 1094 states and 1259 transitions. [2018-04-12 20:57:05,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-12 20:57:05,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-04-12 20:57:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:05,292 INFO L225 Difference]: With dead ends: 1094 [2018-04-12 20:57:05,292 INFO L226 Difference]: Without dead ends: 1094 [2018-04-12 20:57:05,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10212, Invalid=17178, Unknown=0, NotChecked=0, Total=27390 [2018-04-12 20:57:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2018-04-12 20:57:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1010. [2018-04-12 20:57:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-04-12 20:57:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1174 transitions. [2018-04-12 20:57:05,297 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1174 transitions. Word has length 412 [2018-04-12 20:57:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:05,298 INFO L459 AbstractCegarLoop]: Abstraction has 1010 states and 1174 transitions. [2018-04-12 20:57:05,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-12 20:57:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1174 transitions. [2018-04-12 20:57:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-12 20:57:05,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:05,299 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:05,299 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -339477880, now seen corresponding path program 82 times [2018-04-12 20:57:05,300 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:05,310 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:06,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:06,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-12 20:57:06,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:06,742 INFO L182 omatonBuilderFactory]: Interpolants [99585#(<= main_~i~0 5), 99584#(<= main_~i~0 4), 99587#(<= main_~i~0 7), 99586#(<= main_~i~0 6), 99589#(<= main_~i~0 9), 99588#(<= main_~i~0 8), 99591#(<= main_~i~0 11), 99590#(<= main_~i~0 10), 99593#(<= main_~i~0 13), 99592#(<= main_~i~0 12), 99595#(<= main_~i~0 15), 99594#(<= main_~i~0 14), 99597#(<= main_~i~0 17), 99596#(<= main_~i~0 16), 99599#(<= main_~i~0 19), 99598#(<= main_~i~0 18), 99601#(<= main_~i~0 21), 99600#(<= main_~i~0 20), 99603#(<= main_~i~0 23), 99602#(<= main_~i~0 22), 99605#(<= main_~i~0 25), 99604#(<= main_~i~0 24), 99607#(<= main_~i~0 27), 99606#(<= main_~i~0 26), 99609#(<= main_~i~0 29), 99608#(<= main_~i~0 28), 99611#(<= main_~i~0 31), 99610#(<= main_~i~0 30), 99613#(<= main_~i~0 33), 99612#(<= main_~i~0 32), 99615#(<= main_~i~0 35), 99614#(<= main_~i~0 34), 99617#(<= main_~i~0 37), 99616#(<= main_~i~0 36), 99619#(<= main_~i~0 39), 99618#(<= main_~i~0 38), 99621#(<= main_~i~0 41), 99620#(<= main_~i~0 40), 99623#(<= main_~i~0 43), 99622#(<= main_~i~0 42), 99625#(<= main_~i~0 45), 99624#(<= main_~i~0 44), 99627#(<= main_~i~0 47), 99626#(<= main_~i~0 46), 99629#(<= main_~i~0 49), 99628#(<= main_~i~0 48), 99631#(<= main_~i~0 51), 99630#(<= main_~i~0 50), 99633#(<= main_~i~0 53), 99632#(<= main_~i~0 52), 99635#(<= main_~i~0 55), 99634#(<= main_~i~0 54), 99637#(<= main_~i~0 57), 99636#(<= main_~i~0 56), 99639#(<= main_~i~0 59), 99638#(<= main_~i~0 58), 99641#(<= main_~i~0 61), 99640#(<= main_~i~0 60), 99643#(<= main_~i~0 63), 99642#(<= main_~i~0 62), 99645#(<= main_~i~0 65), 99644#(<= main_~i~0 64), 99647#(<= main_~i~0 67), 99646#(<= main_~i~0 66), 99649#(<= main_~i~0 69), 99648#(<= main_~i~0 68), 99651#(<= main_~i~0 71), 99650#(<= main_~i~0 70), 99653#(<= main_~i~0 73), 99652#(<= main_~i~0 72), 99655#(<= main_~i~0 75), 99654#(<= main_~i~0 74), 99657#(<= main_~i~0 77), 99656#(<= main_~i~0 76), 99659#(<= main_~i~0 79), 99658#(<= main_~i~0 78), 99661#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 99660#(<= main_~i~0 80), 99663#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 99662#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 99579#false, 99578#true, 99581#(<= main_~i~0 1), 99580#(<= main_~i~0 0), 99583#(<= main_~i~0 3), 99582#(<= main_~i~0 2)] [2018-04-12 20:57:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:06,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-12 20:57:06,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-12 20:57:06,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 20:57:06,744 INFO L87 Difference]: Start difference. First operand 1010 states and 1174 transitions. Second operand 86 states. [2018-04-12 20:57:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:10,848 INFO L93 Difference]: Finished difference Result 1107 states and 1274 transitions. [2018-04-12 20:57:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-12 20:57:10,848 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 417 [2018-04-12 20:57:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:10,849 INFO L225 Difference]: With dead ends: 1107 [2018-04-12 20:57:10,849 INFO L226 Difference]: Without dead ends: 1107 [2018-04-12 20:57:10,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-04-12 20:57:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-04-12 20:57:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1022. [2018-04-12 20:57:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2018-04-12 20:57:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1188 transitions. [2018-04-12 20:57:10,854 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1188 transitions. Word has length 417 [2018-04-12 20:57:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:10,854 INFO L459 AbstractCegarLoop]: Abstraction has 1022 states and 1188 transitions. [2018-04-12 20:57:10,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-12 20:57:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1188 transitions. [2018-04-12 20:57:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-12 20:57:10,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:10,856 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:10,856 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2095825781, now seen corresponding path program 83 times [2018-04-12 20:57:10,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:10,866 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:12,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:12,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-12 20:57:12,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:12,314 INFO L182 omatonBuilderFactory]: Interpolants [102017#(<= main_~i~0 58), 102016#(<= main_~i~0 57), 102019#(<= main_~i~0 60), 102018#(<= main_~i~0 59), 102021#(<= main_~i~0 62), 102020#(<= main_~i~0 61), 102023#(<= main_~i~0 64), 102022#(<= main_~i~0 63), 102025#(<= main_~i~0 66), 102024#(<= main_~i~0 65), 102027#(<= main_~i~0 68), 102026#(<= main_~i~0 67), 102029#(<= main_~i~0 70), 102028#(<= main_~i~0 69), 102031#(<= main_~i~0 72), 102030#(<= main_~i~0 71), 102033#(<= main_~i~0 74), 102032#(<= main_~i~0 73), 102035#(<= main_~i~0 76), 102034#(<= main_~i~0 75), 102037#(<= main_~i~0 78), 102036#(<= main_~i~0 77), 102039#(<= main_~i~0 80), 102038#(<= main_~i~0 79), 102041#(<= main_~i~0 82), 102040#(<= main_~i~0 81), 102043#(and (<= 1 main_~i~0) (<= main_~i~0 83)), 102042#(and (<= 0 main_~i~0) (<= main_~i~0 82)), 101957#true, 101959#(<= main_~i~0 0), 101958#false, 101961#(<= main_~i~0 2), 101960#(<= main_~i~0 1), 101963#(<= main_~i~0 4), 101962#(<= main_~i~0 3), 101965#(<= main_~i~0 6), 101964#(<= main_~i~0 5), 101967#(<= main_~i~0 8), 101966#(<= main_~i~0 7), 101969#(<= main_~i~0 10), 101968#(<= main_~i~0 9), 101971#(<= main_~i~0 12), 101970#(<= main_~i~0 11), 101973#(<= main_~i~0 14), 101972#(<= main_~i~0 13), 101975#(<= main_~i~0 16), 101974#(<= main_~i~0 15), 101977#(<= main_~i~0 18), 101976#(<= main_~i~0 17), 101979#(<= main_~i~0 20), 101978#(<= main_~i~0 19), 101981#(<= main_~i~0 22), 101980#(<= main_~i~0 21), 101983#(<= main_~i~0 24), 101982#(<= main_~i~0 23), 101985#(<= main_~i~0 26), 101984#(<= main_~i~0 25), 101987#(<= main_~i~0 28), 101986#(<= main_~i~0 27), 101989#(<= main_~i~0 30), 101988#(<= main_~i~0 29), 101991#(<= main_~i~0 32), 101990#(<= main_~i~0 31), 101993#(<= main_~i~0 34), 101992#(<= main_~i~0 33), 101995#(<= main_~i~0 36), 101994#(<= main_~i~0 35), 101997#(<= main_~i~0 38), 101996#(<= main_~i~0 37), 101999#(<= main_~i~0 40), 101998#(<= main_~i~0 39), 102001#(<= main_~i~0 42), 102000#(<= main_~i~0 41), 102003#(<= main_~i~0 44), 102002#(<= main_~i~0 43), 102005#(<= main_~i~0 46), 102004#(<= main_~i~0 45), 102007#(<= main_~i~0 48), 102006#(<= main_~i~0 47), 102009#(<= main_~i~0 50), 102008#(<= main_~i~0 49), 102011#(<= main_~i~0 52), 102010#(<= main_~i~0 51), 102013#(<= main_~i~0 54), 102012#(<= main_~i~0 53), 102015#(<= main_~i~0 56), 102014#(<= main_~i~0 55)] [2018-04-12 20:57:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:12,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-12 20:57:12,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-12 20:57:12,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3575, Invalid=3907, Unknown=0, NotChecked=0, Total=7482 [2018-04-12 20:57:12,316 INFO L87 Difference]: Start difference. First operand 1022 states and 1188 transitions. Second operand 87 states. [2018-04-12 20:57:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:16,073 INFO L93 Difference]: Finished difference Result 1120 states and 1289 transitions. [2018-04-12 20:57:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-12 20:57:16,074 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-04-12 20:57:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:16,075 INFO L225 Difference]: With dead ends: 1120 [2018-04-12 20:57:16,075 INFO L226 Difference]: Without dead ends: 1120 [2018-04-12 20:57:16,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10713, Invalid=18017, Unknown=0, NotChecked=0, Total=28730 [2018-04-12 20:57:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-04-12 20:57:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1034. [2018-04-12 20:57:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-04-12 20:57:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1202 transitions. [2018-04-12 20:57:16,082 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1202 transitions. Word has length 422 [2018-04-12 20:57:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:16,082 INFO L459 AbstractCegarLoop]: Abstraction has 1034 states and 1202 transitions. [2018-04-12 20:57:16,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-12 20:57:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1202 transitions. [2018-04-12 20:57:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-12 20:57:16,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:16,084 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:16,085 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1775077032, now seen corresponding path program 84 times [2018-04-12 20:57:16,085 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:16,100 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:17,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:17,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-12 20:57:17,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:17,572 INFO L182 omatonBuilderFactory]: Interpolants [104449#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 104448#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 104451#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 104450#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 104365#false, 104364#true, 104367#(<= main_~i~0 1), 104366#(<= main_~i~0 0), 104369#(<= main_~i~0 3), 104368#(<= main_~i~0 2), 104371#(<= main_~i~0 5), 104370#(<= main_~i~0 4), 104373#(<= main_~i~0 7), 104372#(<= main_~i~0 6), 104375#(<= main_~i~0 9), 104374#(<= main_~i~0 8), 104377#(<= main_~i~0 11), 104376#(<= main_~i~0 10), 104379#(<= main_~i~0 13), 104378#(<= main_~i~0 12), 104381#(<= main_~i~0 15), 104380#(<= main_~i~0 14), 104383#(<= main_~i~0 17), 104382#(<= main_~i~0 16), 104385#(<= main_~i~0 19), 104384#(<= main_~i~0 18), 104387#(<= main_~i~0 21), 104386#(<= main_~i~0 20), 104389#(<= main_~i~0 23), 104388#(<= main_~i~0 22), 104391#(<= main_~i~0 25), 104390#(<= main_~i~0 24), 104393#(<= main_~i~0 27), 104392#(<= main_~i~0 26), 104395#(<= main_~i~0 29), 104394#(<= main_~i~0 28), 104397#(<= main_~i~0 31), 104396#(<= main_~i~0 30), 104399#(<= main_~i~0 33), 104398#(<= main_~i~0 32), 104401#(<= main_~i~0 35), 104400#(<= main_~i~0 34), 104403#(<= main_~i~0 37), 104402#(<= main_~i~0 36), 104405#(<= main_~i~0 39), 104404#(<= main_~i~0 38), 104407#(<= main_~i~0 41), 104406#(<= main_~i~0 40), 104409#(<= main_~i~0 43), 104408#(<= main_~i~0 42), 104411#(<= main_~i~0 45), 104410#(<= main_~i~0 44), 104413#(<= main_~i~0 47), 104412#(<= main_~i~0 46), 104415#(<= main_~i~0 49), 104414#(<= main_~i~0 48), 104417#(<= main_~i~0 51), 104416#(<= main_~i~0 50), 104419#(<= main_~i~0 53), 104418#(<= main_~i~0 52), 104421#(<= main_~i~0 55), 104420#(<= main_~i~0 54), 104423#(<= main_~i~0 57), 104422#(<= main_~i~0 56), 104425#(<= main_~i~0 59), 104424#(<= main_~i~0 58), 104427#(<= main_~i~0 61), 104426#(<= main_~i~0 60), 104429#(<= main_~i~0 63), 104428#(<= main_~i~0 62), 104431#(<= main_~i~0 65), 104430#(<= main_~i~0 64), 104433#(<= main_~i~0 67), 104432#(<= main_~i~0 66), 104435#(<= main_~i~0 69), 104434#(<= main_~i~0 68), 104437#(<= main_~i~0 71), 104436#(<= main_~i~0 70), 104439#(<= main_~i~0 73), 104438#(<= main_~i~0 72), 104441#(<= main_~i~0 75), 104440#(<= main_~i~0 74), 104443#(<= main_~i~0 77), 104442#(<= main_~i~0 76), 104445#(<= main_~i~0 79), 104444#(<= main_~i~0 78), 104447#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 104446#(<= main_~i~0 80)] [2018-04-12 20:57:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:17,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-12 20:57:17,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-12 20:57:17,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3414, Invalid=4242, Unknown=0, NotChecked=0, Total=7656 [2018-04-12 20:57:17,573 INFO L87 Difference]: Start difference. First operand 1034 states and 1202 transitions. Second operand 88 states. [2018-04-12 20:57:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:22,074 INFO L93 Difference]: Finished difference Result 1133 states and 1304 transitions. [2018-04-12 20:57:22,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-12 20:57:22,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 427 [2018-04-12 20:57:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:22,075 INFO L225 Difference]: With dead ends: 1133 [2018-04-12 20:57:22,075 INFO L226 Difference]: Without dead ends: 1133 [2018-04-12 20:57:22,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=10467, Invalid=18945, Unknown=0, NotChecked=0, Total=29412 [2018-04-12 20:57:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-12 20:57:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1046. [2018-04-12 20:57:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2018-04-12 20:57:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1216 transitions. [2018-04-12 20:57:22,080 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1216 transitions. Word has length 427 [2018-04-12 20:57:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:22,080 INFO L459 AbstractCegarLoop]: Abstraction has 1046 states and 1216 transitions. [2018-04-12 20:57:22,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-12 20:57:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1216 transitions. [2018-04-12 20:57:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-12 20:57:22,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:22,083 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:22,083 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2039794517, now seen corresponding path program 85 times [2018-04-12 20:57:22,084 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:22,101 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:23,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:23,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-12 20:57:23,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:23,631 INFO L182 omatonBuilderFactory]: Interpolants [106881#(<= main_~i~0 80), 106880#(<= main_~i~0 79), 106883#(<= main_~i~0 82), 106882#(<= main_~i~0 81), 106885#(<= main_~i~0 84), 106884#(<= main_~i~0 83), 106887#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 106886#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 106799#true, 106801#(<= main_~i~0 0), 106800#false, 106803#(<= main_~i~0 2), 106802#(<= main_~i~0 1), 106805#(<= main_~i~0 4), 106804#(<= main_~i~0 3), 106807#(<= main_~i~0 6), 106806#(<= main_~i~0 5), 106809#(<= main_~i~0 8), 106808#(<= main_~i~0 7), 106811#(<= main_~i~0 10), 106810#(<= main_~i~0 9), 106813#(<= main_~i~0 12), 106812#(<= main_~i~0 11), 106815#(<= main_~i~0 14), 106814#(<= main_~i~0 13), 106817#(<= main_~i~0 16), 106816#(<= main_~i~0 15), 106819#(<= main_~i~0 18), 106818#(<= main_~i~0 17), 106821#(<= main_~i~0 20), 106820#(<= main_~i~0 19), 106823#(<= main_~i~0 22), 106822#(<= main_~i~0 21), 106825#(<= main_~i~0 24), 106824#(<= main_~i~0 23), 106827#(<= main_~i~0 26), 106826#(<= main_~i~0 25), 106829#(<= main_~i~0 28), 106828#(<= main_~i~0 27), 106831#(<= main_~i~0 30), 106830#(<= main_~i~0 29), 106833#(<= main_~i~0 32), 106832#(<= main_~i~0 31), 106835#(<= main_~i~0 34), 106834#(<= main_~i~0 33), 106837#(<= main_~i~0 36), 106836#(<= main_~i~0 35), 106839#(<= main_~i~0 38), 106838#(<= main_~i~0 37), 106841#(<= main_~i~0 40), 106840#(<= main_~i~0 39), 106843#(<= main_~i~0 42), 106842#(<= main_~i~0 41), 106845#(<= main_~i~0 44), 106844#(<= main_~i~0 43), 106847#(<= main_~i~0 46), 106846#(<= main_~i~0 45), 106849#(<= main_~i~0 48), 106848#(<= main_~i~0 47), 106851#(<= main_~i~0 50), 106850#(<= main_~i~0 49), 106853#(<= main_~i~0 52), 106852#(<= main_~i~0 51), 106855#(<= main_~i~0 54), 106854#(<= main_~i~0 53), 106857#(<= main_~i~0 56), 106856#(<= main_~i~0 55), 106859#(<= main_~i~0 58), 106858#(<= main_~i~0 57), 106861#(<= main_~i~0 60), 106860#(<= main_~i~0 59), 106863#(<= main_~i~0 62), 106862#(<= main_~i~0 61), 106865#(<= main_~i~0 64), 106864#(<= main_~i~0 63), 106867#(<= main_~i~0 66), 106866#(<= main_~i~0 65), 106869#(<= main_~i~0 68), 106868#(<= main_~i~0 67), 106871#(<= main_~i~0 70), 106870#(<= main_~i~0 69), 106873#(<= main_~i~0 72), 106872#(<= main_~i~0 71), 106875#(<= main_~i~0 74), 106874#(<= main_~i~0 73), 106877#(<= main_~i~0 76), 106876#(<= main_~i~0 75), 106879#(<= main_~i~0 78), 106878#(<= main_~i~0 77)] [2018-04-12 20:57:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:23,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-12 20:57:23,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-12 20:57:23,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-04-12 20:57:23,632 INFO L87 Difference]: Start difference. First operand 1046 states and 1216 transitions. Second operand 89 states. [2018-04-12 20:57:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:27,779 INFO L93 Difference]: Finished difference Result 1146 states and 1319 transitions. [2018-04-12 20:57:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-12 20:57:27,779 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-04-12 20:57:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:27,780 INFO L225 Difference]: With dead ends: 1146 [2018-04-12 20:57:27,780 INFO L226 Difference]: Without dead ends: 1146 [2018-04-12 20:57:27,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=11226, Invalid=18876, Unknown=0, NotChecked=0, Total=30102 [2018-04-12 20:57:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-04-12 20:57:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1058. [2018-04-12 20:57:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-04-12 20:57:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1230 transitions. [2018-04-12 20:57:27,787 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1230 transitions. Word has length 432 [2018-04-12 20:57:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:27,788 INFO L459 AbstractCegarLoop]: Abstraction has 1058 states and 1230 transitions. [2018-04-12 20:57:27,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-12 20:57:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1230 transitions. [2018-04-12 20:57:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-12 20:57:27,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:27,789 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:27,789 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1592683208, now seen corresponding path program 86 times [2018-04-12 20:57:27,790 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:27,800 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:29,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:29,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-12 20:57:29,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:29,350 INFO L182 omatonBuilderFactory]: Interpolants [109313#(<= main_~i~0 49), 109312#(<= main_~i~0 48), 109315#(<= main_~i~0 51), 109314#(<= main_~i~0 50), 109317#(<= main_~i~0 53), 109316#(<= main_~i~0 52), 109319#(<= main_~i~0 55), 109318#(<= main_~i~0 54), 109321#(<= main_~i~0 57), 109320#(<= main_~i~0 56), 109323#(<= main_~i~0 59), 109322#(<= main_~i~0 58), 109325#(<= main_~i~0 61), 109324#(<= main_~i~0 60), 109327#(<= main_~i~0 63), 109326#(<= main_~i~0 62), 109329#(<= main_~i~0 65), 109328#(<= main_~i~0 64), 109331#(<= main_~i~0 67), 109330#(<= main_~i~0 66), 109333#(<= main_~i~0 69), 109332#(<= main_~i~0 68), 109335#(<= main_~i~0 71), 109334#(<= main_~i~0 70), 109337#(<= main_~i~0 73), 109336#(<= main_~i~0 72), 109339#(<= main_~i~0 75), 109338#(<= main_~i~0 74), 109341#(<= main_~i~0 77), 109340#(<= main_~i~0 76), 109343#(<= main_~i~0 79), 109342#(<= main_~i~0 78), 109345#(<= main_~i~0 81), 109344#(<= main_~i~0 80), 109347#(<= main_~i~0 83), 109346#(<= main_~i~0 82), 109349#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 109348#(<= main_~i~0 84), 109351#(and (<= main_~i~0 86) (<= 2 main_~i~0)), 109350#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 109263#false, 109262#true, 109265#(<= main_~i~0 1), 109264#(<= main_~i~0 0), 109267#(<= main_~i~0 3), 109266#(<= main_~i~0 2), 109269#(<= main_~i~0 5), 109268#(<= main_~i~0 4), 109271#(<= main_~i~0 7), 109270#(<= main_~i~0 6), 109273#(<= main_~i~0 9), 109272#(<= main_~i~0 8), 109275#(<= main_~i~0 11), 109274#(<= main_~i~0 10), 109277#(<= main_~i~0 13), 109276#(<= main_~i~0 12), 109279#(<= main_~i~0 15), 109278#(<= main_~i~0 14), 109281#(<= main_~i~0 17), 109280#(<= main_~i~0 16), 109283#(<= main_~i~0 19), 109282#(<= main_~i~0 18), 109285#(<= main_~i~0 21), 109284#(<= main_~i~0 20), 109287#(<= main_~i~0 23), 109286#(<= main_~i~0 22), 109289#(<= main_~i~0 25), 109288#(<= main_~i~0 24), 109291#(<= main_~i~0 27), 109290#(<= main_~i~0 26), 109293#(<= main_~i~0 29), 109292#(<= main_~i~0 28), 109295#(<= main_~i~0 31), 109294#(<= main_~i~0 30), 109297#(<= main_~i~0 33), 109296#(<= main_~i~0 32), 109299#(<= main_~i~0 35), 109298#(<= main_~i~0 34), 109301#(<= main_~i~0 37), 109300#(<= main_~i~0 36), 109303#(<= main_~i~0 39), 109302#(<= main_~i~0 38), 109305#(<= main_~i~0 41), 109304#(<= main_~i~0 40), 109307#(<= main_~i~0 43), 109306#(<= main_~i~0 42), 109309#(<= main_~i~0 45), 109308#(<= main_~i~0 44), 109311#(<= main_~i~0 47), 109310#(<= main_~i~0 46)] [2018-04-12 20:57:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:29,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-12 20:57:29,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-12 20:57:29,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 20:57:29,351 INFO L87 Difference]: Start difference. First operand 1058 states and 1230 transitions. Second operand 90 states. [2018-04-12 20:57:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:33,620 INFO L93 Difference]: Finished difference Result 1159 states and 1334 transitions. [2018-04-12 20:57:33,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-12 20:57:33,621 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 437 [2018-04-12 20:57:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:33,622 INFO L225 Difference]: With dead ends: 1159 [2018-04-12 20:57:33,622 INFO L226 Difference]: Without dead ends: 1159 [2018-04-12 20:57:33,622 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=11315, Invalid=19485, Unknown=0, NotChecked=0, Total=30800 [2018-04-12 20:57:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-04-12 20:57:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1070. [2018-04-12 20:57:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2018-04-12 20:57:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1244 transitions. [2018-04-12 20:57:33,628 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1244 transitions. Word has length 437 [2018-04-12 20:57:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:33,629 INFO L459 AbstractCegarLoop]: Abstraction has 1070 states and 1244 transitions. [2018-04-12 20:57:33,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-12 20:57:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1244 transitions. [2018-04-12 20:57:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-04-12 20:57:33,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:33,631 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:33,631 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -165067, now seen corresponding path program 87 times [2018-04-12 20:57:33,632 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:33,642 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:35,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:35,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-12 20:57:35,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:35,204 INFO L182 omatonBuilderFactory]: Interpolants [111753#true, 111755#(<= main_~i~0 0), 111754#false, 111757#(<= main_~i~0 2), 111756#(<= main_~i~0 1), 111759#(<= main_~i~0 4), 111758#(<= main_~i~0 3), 111761#(<= main_~i~0 6), 111760#(<= main_~i~0 5), 111763#(<= main_~i~0 8), 111762#(<= main_~i~0 7), 111765#(<= main_~i~0 10), 111764#(<= main_~i~0 9), 111767#(<= main_~i~0 12), 111766#(<= main_~i~0 11), 111769#(<= main_~i~0 14), 111768#(<= main_~i~0 13), 111771#(<= main_~i~0 16), 111770#(<= main_~i~0 15), 111773#(<= main_~i~0 18), 111772#(<= main_~i~0 17), 111775#(<= main_~i~0 20), 111774#(<= main_~i~0 19), 111777#(<= main_~i~0 22), 111776#(<= main_~i~0 21), 111779#(<= main_~i~0 24), 111778#(<= main_~i~0 23), 111781#(<= main_~i~0 26), 111780#(<= main_~i~0 25), 111783#(<= main_~i~0 28), 111782#(<= main_~i~0 27), 111785#(<= main_~i~0 30), 111784#(<= main_~i~0 29), 111787#(<= main_~i~0 32), 111786#(<= main_~i~0 31), 111789#(<= main_~i~0 34), 111788#(<= main_~i~0 33), 111791#(<= main_~i~0 36), 111790#(<= main_~i~0 35), 111793#(<= main_~i~0 38), 111792#(<= main_~i~0 37), 111795#(<= main_~i~0 40), 111794#(<= main_~i~0 39), 111797#(<= main_~i~0 42), 111796#(<= main_~i~0 41), 111799#(<= main_~i~0 44), 111798#(<= main_~i~0 43), 111801#(<= main_~i~0 46), 111800#(<= main_~i~0 45), 111803#(<= main_~i~0 48), 111802#(<= main_~i~0 47), 111805#(<= main_~i~0 50), 111804#(<= main_~i~0 49), 111807#(<= main_~i~0 52), 111806#(<= main_~i~0 51), 111809#(<= main_~i~0 54), 111808#(<= main_~i~0 53), 111811#(<= main_~i~0 56), 111810#(<= main_~i~0 55), 111813#(<= main_~i~0 58), 111812#(<= main_~i~0 57), 111815#(<= main_~i~0 60), 111814#(<= main_~i~0 59), 111817#(<= main_~i~0 62), 111816#(<= main_~i~0 61), 111819#(<= main_~i~0 64), 111818#(<= main_~i~0 63), 111821#(<= main_~i~0 66), 111820#(<= main_~i~0 65), 111823#(<= main_~i~0 68), 111822#(<= main_~i~0 67), 111825#(<= main_~i~0 70), 111824#(<= main_~i~0 69), 111827#(<= main_~i~0 72), 111826#(<= main_~i~0 71), 111829#(<= main_~i~0 74), 111828#(<= main_~i~0 73), 111831#(<= main_~i~0 76), 111830#(<= main_~i~0 75), 111833#(<= main_~i~0 78), 111832#(<= main_~i~0 77), 111835#(<= main_~i~0 80), 111834#(<= main_~i~0 79), 111837#(<= main_~i~0 82), 111836#(<= main_~i~0 81), 111839#(<= main_~i~0 84), 111838#(<= main_~i~0 83), 111841#(<= main_~i~0 86), 111840#(<= main_~i~0 85), 111843#(and (<= 1 main_~i~0) (<= main_~i~0 87)), 111842#(and (<= main_~i~0 86) (<= 0 main_~i~0))] [2018-04-12 20:57:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:35,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-12 20:57:35,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-12 20:57:35,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-04-12 20:57:35,205 INFO L87 Difference]: Start difference. First operand 1070 states and 1244 transitions. Second operand 91 states. [2018-04-12 20:57:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:39,587 INFO L93 Difference]: Finished difference Result 1172 states and 1349 transitions. [2018-04-12 20:57:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-12 20:57:39,587 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-04-12 20:57:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:39,588 INFO L225 Difference]: With dead ends: 1172 [2018-04-12 20:57:39,588 INFO L226 Difference]: Without dead ends: 1172 [2018-04-12 20:57:39,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11751, Invalid=19755, Unknown=0, NotChecked=0, Total=31506 [2018-04-12 20:57:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-04-12 20:57:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1082. [2018-04-12 20:57:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2018-04-12 20:57:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1258 transitions. [2018-04-12 20:57:39,593 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1258 transitions. Word has length 442 [2018-04-12 20:57:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:39,594 INFO L459 AbstractCegarLoop]: Abstraction has 1082 states and 1258 transitions. [2018-04-12 20:57:39,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-12 20:57:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1258 transitions. [2018-04-12 20:57:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-12 20:57:39,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:39,595 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:39,595 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1210538264, now seen corresponding path program 88 times [2018-04-12 20:57:39,596 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:39,606 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:41,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:41,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-12 20:57:41,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:41,256 INFO L182 omatonBuilderFactory]: Interpolants [114305#(<= main_~i~0 31), 114304#(<= main_~i~0 30), 114307#(<= main_~i~0 33), 114306#(<= main_~i~0 32), 114309#(<= main_~i~0 35), 114308#(<= main_~i~0 34), 114311#(<= main_~i~0 37), 114310#(<= main_~i~0 36), 114313#(<= main_~i~0 39), 114312#(<= main_~i~0 38), 114315#(<= main_~i~0 41), 114314#(<= main_~i~0 40), 114317#(<= main_~i~0 43), 114316#(<= main_~i~0 42), 114319#(<= main_~i~0 45), 114318#(<= main_~i~0 44), 114321#(<= main_~i~0 47), 114320#(<= main_~i~0 46), 114323#(<= main_~i~0 49), 114322#(<= main_~i~0 48), 114325#(<= main_~i~0 51), 114324#(<= main_~i~0 50), 114327#(<= main_~i~0 53), 114326#(<= main_~i~0 52), 114329#(<= main_~i~0 55), 114328#(<= main_~i~0 54), 114331#(<= main_~i~0 57), 114330#(<= main_~i~0 56), 114333#(<= main_~i~0 59), 114332#(<= main_~i~0 58), 114335#(<= main_~i~0 61), 114334#(<= main_~i~0 60), 114337#(<= main_~i~0 63), 114336#(<= main_~i~0 62), 114339#(<= main_~i~0 65), 114338#(<= main_~i~0 64), 114341#(<= main_~i~0 67), 114340#(<= main_~i~0 66), 114343#(<= main_~i~0 69), 114342#(<= main_~i~0 68), 114345#(<= main_~i~0 71), 114344#(<= main_~i~0 70), 114347#(<= main_~i~0 73), 114346#(<= main_~i~0 72), 114349#(<= main_~i~0 75), 114348#(<= main_~i~0 74), 114351#(<= main_~i~0 77), 114350#(<= main_~i~0 76), 114353#(<= main_~i~0 79), 114352#(<= main_~i~0 78), 114355#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 114354#(<= main_~i~0 80), 114357#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 114356#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 114359#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 114358#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 114361#(and (<= main_~i~0 86) (<= 6 main_~i~0)), 114360#(and (<= 5 main_~i~0) (<= main_~i~0 85)), 114363#(and (<= 8 main_~i~0) (<= main_~i~0 88)), 114362#(and (<= 7 main_~i~0) (<= main_~i~0 87)), 114273#false, 114272#true, 114275#(<= main_~i~0 1), 114274#(<= main_~i~0 0), 114277#(<= main_~i~0 3), 114276#(<= main_~i~0 2), 114279#(<= main_~i~0 5), 114278#(<= main_~i~0 4), 114281#(<= main_~i~0 7), 114280#(<= main_~i~0 6), 114283#(<= main_~i~0 9), 114282#(<= main_~i~0 8), 114285#(<= main_~i~0 11), 114284#(<= main_~i~0 10), 114287#(<= main_~i~0 13), 114286#(<= main_~i~0 12), 114289#(<= main_~i~0 15), 114288#(<= main_~i~0 14), 114291#(<= main_~i~0 17), 114290#(<= main_~i~0 16), 114293#(<= main_~i~0 19), 114292#(<= main_~i~0 18), 114295#(<= main_~i~0 21), 114294#(<= main_~i~0 20), 114297#(<= main_~i~0 23), 114296#(<= main_~i~0 22), 114299#(<= main_~i~0 25), 114298#(<= main_~i~0 24), 114301#(<= main_~i~0 27), 114300#(<= main_~i~0 26), 114303#(<= main_~i~0 29), 114302#(<= main_~i~0 28)] [2018-04-12 20:57:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:41,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-12 20:57:41,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-12 20:57:41,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 20:57:41,258 INFO L87 Difference]: Start difference. First operand 1082 states and 1258 transitions. Second operand 92 states. [2018-04-12 20:57:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:46,863 INFO L93 Difference]: Finished difference Result 1185 states and 1364 transitions. [2018-04-12 20:57:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-12 20:57:46,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 447 [2018-04-12 20:57:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:46,864 INFO L225 Difference]: With dead ends: 1185 [2018-04-12 20:57:46,864 INFO L226 Difference]: Without dead ends: 1185 [2018-04-12 20:57:46,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-04-12 20:57:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-04-12 20:57:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1094. [2018-04-12 20:57:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-04-12 20:57:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1272 transitions. [2018-04-12 20:57:46,871 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1272 transitions. Word has length 447 [2018-04-12 20:57:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:46,871 INFO L459 AbstractCegarLoop]: Abstraction has 1094 states and 1272 transitions. [2018-04-12 20:57:46,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-12 20:57:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1272 transitions. [2018-04-12 20:57:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-12 20:57:46,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:46,873 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:46,873 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1119081237, now seen corresponding path program 89 times [2018-04-12 20:57:46,873 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:46,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:48,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:48,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-12 20:57:48,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:48,556 INFO L182 omatonBuilderFactory]: Interpolants [116865#(<= main_~i~0 44), 116864#(<= main_~i~0 43), 116867#(<= main_~i~0 46), 116866#(<= main_~i~0 45), 116869#(<= main_~i~0 48), 116868#(<= main_~i~0 47), 116871#(<= main_~i~0 50), 116870#(<= main_~i~0 49), 116873#(<= main_~i~0 52), 116872#(<= main_~i~0 51), 116875#(<= main_~i~0 54), 116874#(<= main_~i~0 53), 116877#(<= main_~i~0 56), 116876#(<= main_~i~0 55), 116879#(<= main_~i~0 58), 116878#(<= main_~i~0 57), 116881#(<= main_~i~0 60), 116880#(<= main_~i~0 59), 116883#(<= main_~i~0 62), 116882#(<= main_~i~0 61), 116885#(<= main_~i~0 64), 116884#(<= main_~i~0 63), 116887#(<= main_~i~0 66), 116886#(<= main_~i~0 65), 116889#(<= main_~i~0 68), 116888#(<= main_~i~0 67), 116891#(<= main_~i~0 70), 116890#(<= main_~i~0 69), 116893#(<= main_~i~0 72), 116892#(<= main_~i~0 71), 116895#(<= main_~i~0 74), 116894#(<= main_~i~0 73), 116897#(<= main_~i~0 76), 116896#(<= main_~i~0 75), 116899#(<= main_~i~0 78), 116898#(<= main_~i~0 77), 116901#(<= main_~i~0 80), 116900#(<= main_~i~0 79), 116903#(<= main_~i~0 82), 116902#(<= main_~i~0 81), 116905#(<= main_~i~0 84), 116904#(<= main_~i~0 83), 116907#(<= main_~i~0 86), 116906#(<= main_~i~0 85), 116909#(<= main_~i~0 88), 116908#(<= main_~i~0 87), 116911#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 116910#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 116819#true, 116821#(<= main_~i~0 0), 116820#false, 116823#(<= main_~i~0 2), 116822#(<= main_~i~0 1), 116825#(<= main_~i~0 4), 116824#(<= main_~i~0 3), 116827#(<= main_~i~0 6), 116826#(<= main_~i~0 5), 116829#(<= main_~i~0 8), 116828#(<= main_~i~0 7), 116831#(<= main_~i~0 10), 116830#(<= main_~i~0 9), 116833#(<= main_~i~0 12), 116832#(<= main_~i~0 11), 116835#(<= main_~i~0 14), 116834#(<= main_~i~0 13), 116837#(<= main_~i~0 16), 116836#(<= main_~i~0 15), 116839#(<= main_~i~0 18), 116838#(<= main_~i~0 17), 116841#(<= main_~i~0 20), 116840#(<= main_~i~0 19), 116843#(<= main_~i~0 22), 116842#(<= main_~i~0 21), 116845#(<= main_~i~0 24), 116844#(<= main_~i~0 23), 116847#(<= main_~i~0 26), 116846#(<= main_~i~0 25), 116849#(<= main_~i~0 28), 116848#(<= main_~i~0 27), 116851#(<= main_~i~0 30), 116850#(<= main_~i~0 29), 116853#(<= main_~i~0 32), 116852#(<= main_~i~0 31), 116855#(<= main_~i~0 34), 116854#(<= main_~i~0 33), 116857#(<= main_~i~0 36), 116856#(<= main_~i~0 35), 116859#(<= main_~i~0 38), 116858#(<= main_~i~0 37), 116861#(<= main_~i~0 40), 116860#(<= main_~i~0 39), 116863#(<= main_~i~0 42), 116862#(<= main_~i~0 41)] [2018-04-12 20:57:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:48,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-12 20:57:48,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-12 20:57:48,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4100, Invalid=4456, Unknown=0, NotChecked=0, Total=8556 [2018-04-12 20:57:48,558 INFO L87 Difference]: Start difference. First operand 1094 states and 1272 transitions. Second operand 93 states. [2018-04-12 20:57:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:52,949 INFO L93 Difference]: Finished difference Result 1198 states and 1379 transitions. [2018-04-12 20:57:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-12 20:57:52,949 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-04-12 20:57:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:52,950 INFO L225 Difference]: With dead ends: 1198 [2018-04-12 20:57:52,950 INFO L226 Difference]: Without dead ends: 1198 [2018-04-12 20:57:52,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12288, Invalid=20654, Unknown=0, NotChecked=0, Total=32942 [2018-04-12 20:57:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-04-12 20:57:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1106. [2018-04-12 20:57:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-12 20:57:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1286 transitions. [2018-04-12 20:57:52,955 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1286 transitions. Word has length 452 [2018-04-12 20:57:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:52,955 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1286 transitions. [2018-04-12 20:57:52,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-12 20:57:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1286 transitions. [2018-04-12 20:57:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-12 20:57:52,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:52,957 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:52,957 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1430373624, now seen corresponding path program 90 times [2018-04-12 20:57:52,957 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:52,968 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:57:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:54,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:57:54,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-12 20:57:54,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:57:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:54,692 INFO L182 omatonBuilderFactory]: Interpolants [119425#(<= main_~i~0 29), 119424#(<= main_~i~0 28), 119427#(<= main_~i~0 31), 119426#(<= main_~i~0 30), 119429#(<= main_~i~0 33), 119428#(<= main_~i~0 32), 119431#(<= main_~i~0 35), 119430#(<= main_~i~0 34), 119433#(<= main_~i~0 37), 119432#(<= main_~i~0 36), 119435#(<= main_~i~0 39), 119434#(<= main_~i~0 38), 119437#(<= main_~i~0 41), 119436#(<= main_~i~0 40), 119439#(<= main_~i~0 43), 119438#(<= main_~i~0 42), 119441#(<= main_~i~0 45), 119440#(<= main_~i~0 44), 119443#(<= main_~i~0 47), 119442#(<= main_~i~0 46), 119445#(<= main_~i~0 49), 119444#(<= main_~i~0 48), 119447#(<= main_~i~0 51), 119446#(<= main_~i~0 50), 119449#(<= main_~i~0 53), 119448#(<= main_~i~0 52), 119451#(<= main_~i~0 55), 119450#(<= main_~i~0 54), 119453#(<= main_~i~0 57), 119452#(<= main_~i~0 56), 119455#(<= main_~i~0 59), 119454#(<= main_~i~0 58), 119457#(<= main_~i~0 61), 119456#(<= main_~i~0 60), 119459#(<= main_~i~0 63), 119458#(<= main_~i~0 62), 119461#(<= main_~i~0 65), 119460#(<= main_~i~0 64), 119463#(<= main_~i~0 67), 119462#(<= main_~i~0 66), 119465#(<= main_~i~0 69), 119464#(<= main_~i~0 68), 119467#(<= main_~i~0 71), 119466#(<= main_~i~0 70), 119469#(<= main_~i~0 73), 119468#(<= main_~i~0 72), 119471#(<= main_~i~0 75), 119470#(<= main_~i~0 74), 119473#(<= main_~i~0 77), 119472#(<= main_~i~0 76), 119475#(<= main_~i~0 79), 119474#(<= main_~i~0 78), 119477#(<= main_~i~0 81), 119476#(<= main_~i~0 80), 119479#(<= main_~i~0 83), 119478#(<= main_~i~0 82), 119481#(<= main_~i~0 85), 119480#(<= main_~i~0 84), 119483#(<= main_~i~0 87), 119482#(<= main_~i~0 86), 119485#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 119484#(<= main_~i~0 88), 119487#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 119486#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 119395#false, 119394#true, 119397#(<= main_~i~0 1), 119396#(<= main_~i~0 0), 119399#(<= main_~i~0 3), 119398#(<= main_~i~0 2), 119401#(<= main_~i~0 5), 119400#(<= main_~i~0 4), 119403#(<= main_~i~0 7), 119402#(<= main_~i~0 6), 119405#(<= main_~i~0 9), 119404#(<= main_~i~0 8), 119407#(<= main_~i~0 11), 119406#(<= main_~i~0 10), 119409#(<= main_~i~0 13), 119408#(<= main_~i~0 12), 119411#(<= main_~i~0 15), 119410#(<= main_~i~0 14), 119413#(<= main_~i~0 17), 119412#(<= main_~i~0 16), 119415#(<= main_~i~0 19), 119414#(<= main_~i~0 18), 119417#(<= main_~i~0 21), 119416#(<= main_~i~0 20), 119419#(<= main_~i~0 23), 119418#(<= main_~i~0 22), 119421#(<= main_~i~0 25), 119420#(<= main_~i~0 24), 119423#(<= main_~i~0 27), 119422#(<= main_~i~0 26)] [2018-04-12 20:57:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:57:54,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-12 20:57:54,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-12 20:57:54,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4102, Invalid=4640, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 20:57:54,693 INFO L87 Difference]: Start difference. First operand 1106 states and 1286 transitions. Second operand 94 states. [2018-04-12 20:57:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:57:59,412 INFO L93 Difference]: Finished difference Result 1211 states and 1394 transitions. [2018-04-12 20:57:59,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-12 20:57:59,412 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 457 [2018-04-12 20:57:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:57:59,413 INFO L225 Difference]: With dead ends: 1211 [2018-04-12 20:57:59,413 INFO L226 Difference]: Without dead ends: 1211 [2018-04-12 20:57:59,414 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=12381, Invalid=21291, Unknown=0, NotChecked=0, Total=33672 [2018-04-12 20:57:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-04-12 20:57:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1118. [2018-04-12 20:57:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-04-12 20:57:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1300 transitions. [2018-04-12 20:57:59,421 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1300 transitions. Word has length 457 [2018-04-12 20:57:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:57:59,422 INFO L459 AbstractCegarLoop]: Abstraction has 1118 states and 1300 transitions. [2018-04-12 20:57:59,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-12 20:57:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1300 transitions. [2018-04-12 20:57:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-12 20:57:59,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:57:59,423 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-12 20:57:59,423 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:57:59,424 INFO L82 PathProgramCache]: Analyzing trace with hash 449172213, now seen corresponding path program 91 times [2018-04-12 20:57:59,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:57:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:57:59,434 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:01,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:01,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-12 20:58:01,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:01,192 INFO L182 omatonBuilderFactory]: Interpolants [121997#true, 121999#(<= main_~i~0 0), 121998#false, 122001#(<= main_~i~0 2), 122000#(<= main_~i~0 1), 122003#(<= main_~i~0 4), 122002#(<= main_~i~0 3), 122005#(<= main_~i~0 6), 122004#(<= main_~i~0 5), 122007#(<= main_~i~0 8), 122006#(<= main_~i~0 7), 122009#(<= main_~i~0 10), 122008#(<= main_~i~0 9), 122011#(<= main_~i~0 12), 122010#(<= main_~i~0 11), 122013#(<= main_~i~0 14), 122012#(<= main_~i~0 13), 122015#(<= main_~i~0 16), 122014#(<= main_~i~0 15), 122017#(<= main_~i~0 18), 122016#(<= main_~i~0 17), 122019#(<= main_~i~0 20), 122018#(<= main_~i~0 19), 122021#(<= main_~i~0 22), 122020#(<= main_~i~0 21), 122023#(<= main_~i~0 24), 122022#(<= main_~i~0 23), 122025#(<= main_~i~0 26), 122024#(<= main_~i~0 25), 122027#(<= main_~i~0 28), 122026#(<= main_~i~0 27), 122029#(<= main_~i~0 30), 122028#(<= main_~i~0 29), 122031#(<= main_~i~0 32), 122030#(<= main_~i~0 31), 122033#(<= main_~i~0 34), 122032#(<= main_~i~0 33), 122035#(<= main_~i~0 36), 122034#(<= main_~i~0 35), 122037#(<= main_~i~0 38), 122036#(<= main_~i~0 37), 122039#(<= main_~i~0 40), 122038#(<= main_~i~0 39), 122041#(<= main_~i~0 42), 122040#(<= main_~i~0 41), 122043#(<= main_~i~0 44), 122042#(<= main_~i~0 43), 122045#(<= main_~i~0 46), 122044#(<= main_~i~0 45), 122047#(<= main_~i~0 48), 122046#(<= main_~i~0 47), 122049#(<= main_~i~0 50), 122048#(<= main_~i~0 49), 122051#(<= main_~i~0 52), 122050#(<= main_~i~0 51), 122053#(<= main_~i~0 54), 122052#(<= main_~i~0 53), 122055#(<= main_~i~0 56), 122054#(<= main_~i~0 55), 122057#(<= main_~i~0 58), 122056#(<= main_~i~0 57), 122059#(<= main_~i~0 60), 122058#(<= main_~i~0 59), 122061#(<= main_~i~0 62), 122060#(<= main_~i~0 61), 122063#(<= main_~i~0 64), 122062#(<= main_~i~0 63), 122065#(<= main_~i~0 66), 122064#(<= main_~i~0 65), 122067#(<= main_~i~0 68), 122066#(<= main_~i~0 67), 122069#(<= main_~i~0 70), 122068#(<= main_~i~0 69), 122071#(<= main_~i~0 72), 122070#(<= main_~i~0 71), 122073#(<= main_~i~0 74), 122072#(<= main_~i~0 73), 122075#(<= main_~i~0 76), 122074#(<= main_~i~0 75), 122077#(<= main_~i~0 78), 122076#(<= main_~i~0 77), 122079#(<= main_~i~0 80), 122078#(<= main_~i~0 79), 122081#(<= main_~i~0 82), 122080#(<= main_~i~0 81), 122083#(<= main_~i~0 84), 122082#(<= main_~i~0 83), 122085#(<= main_~i~0 86), 122084#(<= main_~i~0 85), 122087#(<= main_~i~0 88), 122086#(<= main_~i~0 87), 122089#(<= main_~i~0 90), 122088#(<= main_~i~0 89), 122091#(and (<= main_~i~0 91) (<= 1 main_~i~0)), 122090#(and (<= 0 main_~i~0) (<= main_~i~0 90))] [2018-04-12 20:58:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:01,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-12 20:58:01,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-12 20:58:01,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-04-12 20:58:01,193 INFO L87 Difference]: Start difference. First operand 1118 states and 1300 transitions. Second operand 95 states. [2018-04-12 20:58:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:06,357 INFO L93 Difference]: Finished difference Result 1224 states and 1409 transitions. [2018-04-12 20:58:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-12 20:58:06,357 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-04-12 20:58:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:06,358 INFO L225 Difference]: With dead ends: 1224 [2018-04-12 20:58:06,359 INFO L226 Difference]: Without dead ends: 1224 [2018-04-12 20:58:06,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=12837, Invalid=21573, Unknown=0, NotChecked=0, Total=34410 [2018-04-12 20:58:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-04-12 20:58:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1130. [2018-04-12 20:58:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-04-12 20:58:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1314 transitions. [2018-04-12 20:58:06,365 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1314 transitions. Word has length 462 [2018-04-12 20:58:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:06,365 INFO L459 AbstractCegarLoop]: Abstraction has 1130 states and 1314 transitions. [2018-04-12 20:58:06,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-12 20:58:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1314 transitions. [2018-04-12 20:58:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-12 20:58:06,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:06,367 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:06,367 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash -682547416, now seen corresponding path program 92 times [2018-04-12 20:58:06,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:06,379 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:08,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:08,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-12 20:58:08,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:08,095 INFO L182 omatonBuilderFactory]: Interpolants [124673#(<= main_~i~0 43), 124672#(<= main_~i~0 42), 124675#(<= main_~i~0 45), 124674#(<= main_~i~0 44), 124677#(<= main_~i~0 47), 124676#(<= main_~i~0 46), 124679#(<= main_~i~0 49), 124678#(<= main_~i~0 48), 124681#(<= main_~i~0 51), 124680#(<= main_~i~0 50), 124683#(<= main_~i~0 53), 124682#(<= main_~i~0 52), 124685#(<= main_~i~0 55), 124684#(<= main_~i~0 54), 124687#(<= main_~i~0 57), 124686#(<= main_~i~0 56), 124689#(<= main_~i~0 59), 124688#(<= main_~i~0 58), 124691#(<= main_~i~0 61), 124690#(<= main_~i~0 60), 124693#(<= main_~i~0 63), 124692#(<= main_~i~0 62), 124695#(<= main_~i~0 65), 124694#(<= main_~i~0 64), 124697#(<= main_~i~0 67), 124696#(<= main_~i~0 66), 124699#(<= main_~i~0 69), 124698#(<= main_~i~0 68), 124701#(<= main_~i~0 71), 124700#(<= main_~i~0 70), 124703#(<= main_~i~0 73), 124702#(<= main_~i~0 72), 124705#(<= main_~i~0 75), 124704#(<= main_~i~0 74), 124707#(<= main_~i~0 77), 124706#(<= main_~i~0 76), 124709#(<= main_~i~0 79), 124708#(<= main_~i~0 78), 124711#(<= main_~i~0 81), 124710#(<= main_~i~0 80), 124713#(<= main_~i~0 83), 124712#(<= main_~i~0 82), 124715#(<= main_~i~0 85), 124714#(<= main_~i~0 84), 124717#(<= main_~i~0 87), 124716#(<= main_~i~0 86), 124719#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 124718#(<= main_~i~0 88), 124721#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 124720#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 124723#(and (<= 4 main_~i~0) (<= main_~i~0 92)), 124722#(and (<= main_~i~0 91) (<= 3 main_~i~0)), 124629#false, 124628#true, 124631#(<= main_~i~0 1), 124630#(<= main_~i~0 0), 124633#(<= main_~i~0 3), 124632#(<= main_~i~0 2), 124635#(<= main_~i~0 5), 124634#(<= main_~i~0 4), 124637#(<= main_~i~0 7), 124636#(<= main_~i~0 6), 124639#(<= main_~i~0 9), 124638#(<= main_~i~0 8), 124641#(<= main_~i~0 11), 124640#(<= main_~i~0 10), 124643#(<= main_~i~0 13), 124642#(<= main_~i~0 12), 124645#(<= main_~i~0 15), 124644#(<= main_~i~0 14), 124647#(<= main_~i~0 17), 124646#(<= main_~i~0 16), 124649#(<= main_~i~0 19), 124648#(<= main_~i~0 18), 124651#(<= main_~i~0 21), 124650#(<= main_~i~0 20), 124653#(<= main_~i~0 23), 124652#(<= main_~i~0 22), 124655#(<= main_~i~0 25), 124654#(<= main_~i~0 24), 124657#(<= main_~i~0 27), 124656#(<= main_~i~0 26), 124659#(<= main_~i~0 29), 124658#(<= main_~i~0 28), 124661#(<= main_~i~0 31), 124660#(<= main_~i~0 30), 124663#(<= main_~i~0 33), 124662#(<= main_~i~0 32), 124665#(<= main_~i~0 35), 124664#(<= main_~i~0 34), 124667#(<= main_~i~0 37), 124666#(<= main_~i~0 36), 124669#(<= main_~i~0 39), 124668#(<= main_~i~0 38), 124671#(<= main_~i~0 41), 124670#(<= main_~i~0 40)] [2018-04-12 20:58:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21114 backedges. 0 proven. 21114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:08,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-12 20:58:08,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-12 20:58:08,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4106, Invalid=5014, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 20:58:08,096 INFO L87 Difference]: Start difference. First operand 1130 states and 1314 transitions. Second operand 96 states. [2018-04-12 20:58:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:13,364 INFO L93 Difference]: Finished difference Result 1237 states and 1424 transitions. [2018-04-12 20:58:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-12 20:58:13,364 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 467 [2018-04-12 20:58:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:13,365 INFO L225 Difference]: With dead ends: 1237 [2018-04-12 20:58:13,365 INFO L226 Difference]: Without dead ends: 1237 [2018-04-12 20:58:13,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4633 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=12567, Invalid=22589, Unknown=0, NotChecked=0, Total=35156 [2018-04-12 20:58:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2018-04-12 20:58:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1142. [2018-04-12 20:58:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-04-12 20:58:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1328 transitions. [2018-04-12 20:58:13,371 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1328 transitions. Word has length 467 [2018-04-12 20:58:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:13,371 INFO L459 AbstractCegarLoop]: Abstraction has 1142 states and 1328 transitions. [2018-04-12 20:58:13,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-12 20:58:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1328 transitions. [2018-04-12 20:58:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-04-12 20:58:13,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:13,373 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:13,373 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -406750507, now seen corresponding path program 93 times [2018-04-12 20:58:13,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:13,384 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:15,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:15,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-12 20:58:15,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:15,216 INFO L182 omatonBuilderFactory]: Interpolants [127287#true, 127289#(<= main_~i~0 0), 127288#false, 127291#(<= main_~i~0 2), 127290#(<= main_~i~0 1), 127293#(<= main_~i~0 4), 127292#(<= main_~i~0 3), 127295#(<= main_~i~0 6), 127294#(<= main_~i~0 5), 127297#(<= main_~i~0 8), 127296#(<= main_~i~0 7), 127299#(<= main_~i~0 10), 127298#(<= main_~i~0 9), 127301#(<= main_~i~0 12), 127300#(<= main_~i~0 11), 127303#(<= main_~i~0 14), 127302#(<= main_~i~0 13), 127305#(<= main_~i~0 16), 127304#(<= main_~i~0 15), 127307#(<= main_~i~0 18), 127306#(<= main_~i~0 17), 127309#(<= main_~i~0 20), 127308#(<= main_~i~0 19), 127311#(<= main_~i~0 22), 127310#(<= main_~i~0 21), 127313#(<= main_~i~0 24), 127312#(<= main_~i~0 23), 127315#(<= main_~i~0 26), 127314#(<= main_~i~0 25), 127317#(<= main_~i~0 28), 127316#(<= main_~i~0 27), 127319#(<= main_~i~0 30), 127318#(<= main_~i~0 29), 127321#(<= main_~i~0 32), 127320#(<= main_~i~0 31), 127323#(<= main_~i~0 34), 127322#(<= main_~i~0 33), 127325#(<= main_~i~0 36), 127324#(<= main_~i~0 35), 127327#(<= main_~i~0 38), 127326#(<= main_~i~0 37), 127329#(<= main_~i~0 40), 127328#(<= main_~i~0 39), 127331#(<= main_~i~0 42), 127330#(<= main_~i~0 41), 127333#(<= main_~i~0 44), 127332#(<= main_~i~0 43), 127335#(<= main_~i~0 46), 127334#(<= main_~i~0 45), 127337#(<= main_~i~0 48), 127336#(<= main_~i~0 47), 127339#(<= main_~i~0 50), 127338#(<= main_~i~0 49), 127341#(<= main_~i~0 52), 127340#(<= main_~i~0 51), 127343#(<= main_~i~0 54), 127342#(<= main_~i~0 53), 127345#(<= main_~i~0 56), 127344#(<= main_~i~0 55), 127347#(<= main_~i~0 58), 127346#(<= main_~i~0 57), 127349#(<= main_~i~0 60), 127348#(<= main_~i~0 59), 127351#(<= main_~i~0 62), 127350#(<= main_~i~0 61), 127353#(<= main_~i~0 64), 127352#(<= main_~i~0 63), 127355#(<= main_~i~0 66), 127354#(<= main_~i~0 65), 127357#(<= main_~i~0 68), 127356#(<= main_~i~0 67), 127359#(<= main_~i~0 70), 127358#(<= main_~i~0 69), 127361#(<= main_~i~0 72), 127360#(<= main_~i~0 71), 127363#(<= main_~i~0 74), 127362#(<= main_~i~0 73), 127365#(<= main_~i~0 76), 127364#(<= main_~i~0 75), 127367#(<= main_~i~0 78), 127366#(<= main_~i~0 77), 127369#(<= main_~i~0 80), 127368#(<= main_~i~0 79), 127371#(<= main_~i~0 82), 127370#(<= main_~i~0 81), 127373#(<= main_~i~0 84), 127372#(<= main_~i~0 83), 127375#(<= main_~i~0 86), 127374#(<= main_~i~0 85), 127377#(<= main_~i~0 88), 127376#(<= main_~i~0 87), 127379#(<= main_~i~0 90), 127378#(<= main_~i~0 89), 127381#(<= main_~i~0 92), 127380#(<= main_~i~0 91), 127383#(and (<= 1 main_~i~0) (<= main_~i~0 93)), 127382#(and (<= 0 main_~i~0) (<= main_~i~0 92))] [2018-04-12 20:58:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 21576 backedges. 0 proven. 21576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:15,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-12 20:58:15,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-12 20:58:15,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4470, Invalid=4842, Unknown=0, NotChecked=0, Total=9312 [2018-04-12 20:58:15,217 INFO L87 Difference]: Start difference. First operand 1142 states and 1328 transitions. Second operand 97 states. [2018-04-12 20:58:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:20,244 INFO L93 Difference]: Finished difference Result 1250 states and 1439 transitions. [2018-04-12 20:58:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-12 20:58:20,244 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 472 [2018-04-12 20:58:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:20,245 INFO L225 Difference]: With dead ends: 1250 [2018-04-12 20:58:20,245 INFO L226 Difference]: Without dead ends: 1250 [2018-04-12 20:58:20,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=13398, Invalid=22512, Unknown=0, NotChecked=0, Total=35910 [2018-04-12 20:58:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-12 20:58:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1154. [2018-04-12 20:58:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2018-04-12 20:58:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1342 transitions. [2018-04-12 20:58:20,251 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1342 transitions. Word has length 472 [2018-04-12 20:58:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:20,251 INFO L459 AbstractCegarLoop]: Abstraction has 1154 states and 1342 transitions. [2018-04-12 20:58:20,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-12 20:58:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1342 transitions. [2018-04-12 20:58:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-04-12 20:58:20,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:20,253 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:20,254 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1724083016, now seen corresponding path program 94 times [2018-04-12 20:58:20,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:20,266 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:22,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:22,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-12 20:58:22,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:22,206 INFO L182 omatonBuilderFactory]: Interpolants [130049#(<= main_~i~0 73), 130048#(<= main_~i~0 72), 130051#(<= main_~i~0 75), 130050#(<= main_~i~0 74), 130053#(<= main_~i~0 77), 130052#(<= main_~i~0 76), 130055#(<= main_~i~0 79), 130054#(<= main_~i~0 78), 130057#(<= main_~i~0 81), 130056#(<= main_~i~0 80), 130059#(<= main_~i~0 83), 130058#(<= main_~i~0 82), 130061#(<= main_~i~0 85), 130060#(<= main_~i~0 84), 130063#(<= main_~i~0 87), 130062#(<= main_~i~0 86), 130065#(<= main_~i~0 89), 130064#(<= main_~i~0 88), 130067#(<= main_~i~0 91), 130066#(<= main_~i~0 90), 130069#(and (<= 0 main_~i~0) (<= main_~i~0 92)), 130068#(<= main_~i~0 92), 130071#(and (<= 2 main_~i~0) (<= main_~i~0 94)), 130070#(and (<= 1 main_~i~0) (<= main_~i~0 93)), 129975#false, 129974#true, 129977#(<= main_~i~0 1), 129976#(<= main_~i~0 0), 129979#(<= main_~i~0 3), 129978#(<= main_~i~0 2), 129981#(<= main_~i~0 5), 129980#(<= main_~i~0 4), 129983#(<= main_~i~0 7), 129982#(<= main_~i~0 6), 129985#(<= main_~i~0 9), 129984#(<= main_~i~0 8), 129987#(<= main_~i~0 11), 129986#(<= main_~i~0 10), 129989#(<= main_~i~0 13), 129988#(<= main_~i~0 12), 129991#(<= main_~i~0 15), 129990#(<= main_~i~0 14), 129993#(<= main_~i~0 17), 129992#(<= main_~i~0 16), 129995#(<= main_~i~0 19), 129994#(<= main_~i~0 18), 129997#(<= main_~i~0 21), 129996#(<= main_~i~0 20), 129999#(<= main_~i~0 23), 129998#(<= main_~i~0 22), 130001#(<= main_~i~0 25), 130000#(<= main_~i~0 24), 130003#(<= main_~i~0 27), 130002#(<= main_~i~0 26), 130005#(<= main_~i~0 29), 130004#(<= main_~i~0 28), 130007#(<= main_~i~0 31), 130006#(<= main_~i~0 30), 130009#(<= main_~i~0 33), 130008#(<= main_~i~0 32), 130011#(<= main_~i~0 35), 130010#(<= main_~i~0 34), 130013#(<= main_~i~0 37), 130012#(<= main_~i~0 36), 130015#(<= main_~i~0 39), 130014#(<= main_~i~0 38), 130017#(<= main_~i~0 41), 130016#(<= main_~i~0 40), 130019#(<= main_~i~0 43), 130018#(<= main_~i~0 42), 130021#(<= main_~i~0 45), 130020#(<= main_~i~0 44), 130023#(<= main_~i~0 47), 130022#(<= main_~i~0 46), 130025#(<= main_~i~0 49), 130024#(<= main_~i~0 48), 130027#(<= main_~i~0 51), 130026#(<= main_~i~0 50), 130029#(<= main_~i~0 53), 130028#(<= main_~i~0 52), 130031#(<= main_~i~0 55), 130030#(<= main_~i~0 54), 130033#(<= main_~i~0 57), 130032#(<= main_~i~0 56), 130035#(<= main_~i~0 59), 130034#(<= main_~i~0 58), 130037#(<= main_~i~0 61), 130036#(<= main_~i~0 60), 130039#(<= main_~i~0 63), 130038#(<= main_~i~0 62), 130041#(<= main_~i~0 65), 130040#(<= main_~i~0 64), 130043#(<= main_~i~0 67), 130042#(<= main_~i~0 66), 130045#(<= main_~i~0 69), 130044#(<= main_~i~0 68), 130047#(<= main_~i~0 71), 130046#(<= main_~i~0 70)] [2018-04-12 20:58:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22043 backedges. 0 proven. 22043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:22,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-12 20:58:22,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-12 20:58:22,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4472, Invalid=5034, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 20:58:22,207 INFO L87 Difference]: Start difference. First operand 1154 states and 1342 transitions. Second operand 98 states. [2018-04-12 20:58:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:27,388 INFO L93 Difference]: Finished difference Result 1263 states and 1454 transitions. [2018-04-12 20:58:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-12 20:58:27,416 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 477 [2018-04-12 20:58:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:27,417 INFO L225 Difference]: With dead ends: 1263 [2018-04-12 20:58:27,417 INFO L226 Difference]: Without dead ends: 1263 [2018-04-12 20:58:27,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4650 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=13495, Invalid=23177, Unknown=0, NotChecked=0, Total=36672 [2018-04-12 20:58:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-04-12 20:58:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1166. [2018-04-12 20:58:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-04-12 20:58:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1356 transitions. [2018-04-12 20:58:27,423 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1356 transitions. Word has length 477 [2018-04-12 20:58:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:27,423 INFO L459 AbstractCegarLoop]: Abstraction has 1166 states and 1356 transitions. [2018-04-12 20:58:27,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-12 20:58:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1356 transitions. [2018-04-12 20:58:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-04-12 20:58:27,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:27,425 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:27,425 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:27,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1874119349, now seen corresponding path program 95 times [2018-04-12 20:58:27,425 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:27,436 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:29,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:29,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-12 20:58:29,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:29,318 INFO L182 omatonBuilderFactory]: Interpolants [132690#false, 132691#(<= main_~i~0 0), 132689#true, 132694#(<= main_~i~0 3), 132695#(<= main_~i~0 4), 132692#(<= main_~i~0 1), 132693#(<= main_~i~0 2), 132698#(<= main_~i~0 7), 132699#(<= main_~i~0 8), 132696#(<= main_~i~0 5), 132697#(<= main_~i~0 6), 132702#(<= main_~i~0 11), 132703#(<= main_~i~0 12), 132700#(<= main_~i~0 9), 132701#(<= main_~i~0 10), 132706#(<= main_~i~0 15), 132707#(<= main_~i~0 16), 132704#(<= main_~i~0 13), 132705#(<= main_~i~0 14), 132710#(<= main_~i~0 19), 132711#(<= main_~i~0 20), 132708#(<= main_~i~0 17), 132709#(<= main_~i~0 18), 132714#(<= main_~i~0 23), 132715#(<= main_~i~0 24), 132712#(<= main_~i~0 21), 132713#(<= main_~i~0 22), 132718#(<= main_~i~0 27), 132719#(<= main_~i~0 28), 132716#(<= main_~i~0 25), 132717#(<= main_~i~0 26), 132722#(<= main_~i~0 31), 132723#(<= main_~i~0 32), 132720#(<= main_~i~0 29), 132721#(<= main_~i~0 30), 132726#(<= main_~i~0 35), 132727#(<= main_~i~0 36), 132724#(<= main_~i~0 33), 132725#(<= main_~i~0 34), 132730#(<= main_~i~0 39), 132731#(<= main_~i~0 40), 132728#(<= main_~i~0 37), 132729#(<= main_~i~0 38), 132734#(<= main_~i~0 43), 132735#(<= main_~i~0 44), 132732#(<= main_~i~0 41), 132733#(<= main_~i~0 42), 132738#(<= main_~i~0 47), 132739#(<= main_~i~0 48), 132736#(<= main_~i~0 45), 132737#(<= main_~i~0 46), 132742#(<= main_~i~0 51), 132743#(<= main_~i~0 52), 132740#(<= main_~i~0 49), 132741#(<= main_~i~0 50), 132746#(<= main_~i~0 55), 132747#(<= main_~i~0 56), 132744#(<= main_~i~0 53), 132745#(<= main_~i~0 54), 132750#(<= main_~i~0 59), 132751#(<= main_~i~0 60), 132748#(<= main_~i~0 57), 132749#(<= main_~i~0 58), 132754#(<= main_~i~0 63), 132755#(<= main_~i~0 64), 132752#(<= main_~i~0 61), 132753#(<= main_~i~0 62), 132758#(<= main_~i~0 67), 132759#(<= main_~i~0 68), 132756#(<= main_~i~0 65), 132757#(<= main_~i~0 66), 132762#(<= main_~i~0 71), 132763#(<= main_~i~0 72), 132760#(<= main_~i~0 69), 132761#(<= main_~i~0 70), 132766#(<= main_~i~0 75), 132767#(<= main_~i~0 76), 132764#(<= main_~i~0 73), 132765#(<= main_~i~0 74), 132770#(<= main_~i~0 79), 132771#(<= main_~i~0 80), 132768#(<= main_~i~0 77), 132769#(<= main_~i~0 78), 132774#(<= main_~i~0 83), 132775#(<= main_~i~0 84), 132772#(<= main_~i~0 81), 132773#(<= main_~i~0 82), 132778#(<= main_~i~0 87), 132779#(<= main_~i~0 88), 132776#(<= main_~i~0 85), 132777#(<= main_~i~0 86), 132782#(<= main_~i~0 91), 132783#(<= main_~i~0 92), 132780#(<= main_~i~0 89), 132781#(<= main_~i~0 90), 132786#(and (<= 0 main_~i~0) (<= main_~i~0 94)), 132787#(and (<= 1 main_~i~0) (<= main_~i~0 95)), 132784#(<= main_~i~0 93), 132785#(<= main_~i~0 94)] [2018-04-12 20:58:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22515 backedges. 0 proven. 22515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:29,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-12 20:58:29,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-12 20:58:29,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4661, Invalid=5041, Unknown=0, NotChecked=0, Total=9702 [2018-04-12 20:58:29,319 INFO L87 Difference]: Start difference. First operand 1166 states and 1356 transitions. Second operand 99 states. [2018-04-12 20:58:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:34,582 INFO L93 Difference]: Finished difference Result 1276 states and 1469 transitions. [2018-04-12 20:58:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-12 20:58:34,583 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 482 [2018-04-12 20:58:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:34,583 INFO L225 Difference]: With dead ends: 1276 [2018-04-12 20:58:34,584 INFO L226 Difference]: Without dead ends: 1276 [2018-04-12 20:58:34,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=13971, Invalid=23471, Unknown=0, NotChecked=0, Total=37442 [2018-04-12 20:58:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-04-12 20:58:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1178. [2018-04-12 20:58:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-04-12 20:58:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1370 transitions. [2018-04-12 20:58:34,589 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1370 transitions. Word has length 482 [2018-04-12 20:58:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:34,590 INFO L459 AbstractCegarLoop]: Abstraction has 1178 states and 1370 transitions. [2018-04-12 20:58:34,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-12 20:58:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1370 transitions. [2018-04-12 20:58:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-04-12 20:58:34,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:34,592 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:34,592 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash 734463848, now seen corresponding path program 96 times [2018-04-12 20:58:34,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:34,603 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:36,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:36,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-12 20:58:36,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:36,413 INFO L182 omatonBuilderFactory]: Interpolants [135434#(<= main_~i~0 0), 135435#(<= main_~i~0 1), 135432#true, 135433#false, 135438#(<= main_~i~0 4), 135439#(<= main_~i~0 5), 135436#(<= main_~i~0 2), 135437#(<= main_~i~0 3), 135442#(<= main_~i~0 8), 135443#(<= main_~i~0 9), 135440#(<= main_~i~0 6), 135441#(<= main_~i~0 7), 135446#(<= main_~i~0 12), 135447#(<= main_~i~0 13), 135444#(<= main_~i~0 10), 135445#(<= main_~i~0 11), 135450#(<= main_~i~0 16), 135451#(<= main_~i~0 17), 135448#(<= main_~i~0 14), 135449#(<= main_~i~0 15), 135454#(<= main_~i~0 20), 135455#(<= main_~i~0 21), 135452#(<= main_~i~0 18), 135453#(<= main_~i~0 19), 135458#(<= main_~i~0 24), 135459#(<= main_~i~0 25), 135456#(<= main_~i~0 22), 135457#(<= main_~i~0 23), 135462#(<= main_~i~0 28), 135463#(<= main_~i~0 29), 135460#(<= main_~i~0 26), 135461#(<= main_~i~0 27), 135466#(<= main_~i~0 32), 135467#(<= main_~i~0 33), 135464#(<= main_~i~0 30), 135465#(<= main_~i~0 31), 135470#(<= main_~i~0 36), 135471#(<= main_~i~0 37), 135468#(<= main_~i~0 34), 135469#(<= main_~i~0 35), 135474#(<= main_~i~0 40), 135475#(<= main_~i~0 41), 135472#(<= main_~i~0 38), 135473#(<= main_~i~0 39), 135478#(<= main_~i~0 44), 135479#(<= main_~i~0 45), 135476#(<= main_~i~0 42), 135477#(<= main_~i~0 43), 135482#(<= main_~i~0 48), 135483#(<= main_~i~0 49), 135480#(<= main_~i~0 46), 135481#(<= main_~i~0 47), 135486#(<= main_~i~0 52), 135487#(<= main_~i~0 53), 135484#(<= main_~i~0 50), 135485#(<= main_~i~0 51), 135490#(<= main_~i~0 56), 135491#(<= main_~i~0 57), 135488#(<= main_~i~0 54), 135489#(<= main_~i~0 55), 135494#(<= main_~i~0 60), 135495#(<= main_~i~0 61), 135492#(<= main_~i~0 58), 135493#(<= main_~i~0 59), 135498#(<= main_~i~0 64), 135499#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 135496#(<= main_~i~0 62), 135497#(<= main_~i~0 63), 135502#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 135503#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 135500#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 135501#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 135506#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 135507#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 135504#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 135505#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 135510#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 135511#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 135508#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 135509#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 135514#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 135515#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 135512#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 135513#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 135518#(and (<= 19 main_~i~0) (<= main_~i~0 83)), 135519#(and (<= main_~i~0 84) (<= 20 main_~i~0)), 135516#(and (<= main_~i~0 81) (<= 17 main_~i~0)), 135517#(and (<= main_~i~0 82) (<= 18 main_~i~0)), 135522#(and (<= 23 main_~i~0) (<= main_~i~0 87)), 135523#(and (<= 24 main_~i~0) (<= main_~i~0 88)), 135520#(and (<= 21 main_~i~0) (<= main_~i~0 85)), 135521#(and (<= main_~i~0 86) (<= 22 main_~i~0)), 135526#(and (<= main_~i~0 91) (<= 27 main_~i~0)), 135527#(and (<= main_~i~0 92) (<= 28 main_~i~0)), 135524#(and (<= 25 main_~i~0) (<= main_~i~0 89)), 135525#(and (<= 26 main_~i~0) (<= main_~i~0 90)), 135530#(and (<= main_~i~0 95) (<= 31 main_~i~0)), 135531#(and (<= main_~i~0 96) (<= 32 main_~i~0)), 135528#(and (<= 29 main_~i~0) (<= main_~i~0 93)), 135529#(and (<= main_~i~0 94) (<= 30 main_~i~0))] [2018-04-12 20:58:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 22992 backedges. 0 proven. 22992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:36,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-12 20:58:36,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-12 20:58:36,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=7622, Unknown=0, NotChecked=0, Total=9900 [2018-04-12 20:58:36,414 INFO L87 Difference]: Start difference. First operand 1178 states and 1370 transitions. Second operand 100 states. [2018-04-12 20:58:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:48,969 INFO L93 Difference]: Finished difference Result 1289 states and 1484 transitions. [2018-04-12 20:58:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-12 20:58:48,969 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 487 [2018-04-12 20:58:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:48,970 INFO L225 Difference]: With dead ends: 1289 [2018-04-12 20:58:48,970 INFO L226 Difference]: Without dead ends: 1289 [2018-04-12 20:58:48,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6735 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=8775, Invalid=29445, Unknown=0, NotChecked=0, Total=38220 [2018-04-12 20:58:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-04-12 20:58:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1190. [2018-04-12 20:58:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2018-04-12 20:58:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1384 transitions. [2018-04-12 20:58:48,976 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1384 transitions. Word has length 487 [2018-04-12 20:58:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:48,976 INFO L459 AbstractCegarLoop]: Abstraction has 1190 states and 1384 transitions. [2018-04-12 20:58:48,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-12 20:58:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1384 transitions. [2018-04-12 20:58:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-12 20:58:48,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:48,978 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:48,978 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1087520107, now seen corresponding path program 97 times [2018-04-12 20:58:48,978 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:48,990 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:50,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:50,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-12 20:58:50,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:50,990 INFO L182 omatonBuilderFactory]: Interpolants [138242#(<= main_~i~0 37), 138243#(<= main_~i~0 38), 138240#(<= main_~i~0 35), 138241#(<= main_~i~0 36), 138246#(<= main_~i~0 41), 138247#(<= main_~i~0 42), 138244#(<= main_~i~0 39), 138245#(<= main_~i~0 40), 138250#(<= main_~i~0 45), 138251#(<= main_~i~0 46), 138248#(<= main_~i~0 43), 138249#(<= main_~i~0 44), 138254#(<= main_~i~0 49), 138255#(<= main_~i~0 50), 138252#(<= main_~i~0 47), 138253#(<= main_~i~0 48), 138258#(<= main_~i~0 53), 138259#(<= main_~i~0 54), 138256#(<= main_~i~0 51), 138257#(<= main_~i~0 52), 138262#(<= main_~i~0 57), 138263#(<= main_~i~0 58), 138260#(<= main_~i~0 55), 138261#(<= main_~i~0 56), 138266#(<= main_~i~0 61), 138267#(<= main_~i~0 62), 138264#(<= main_~i~0 59), 138265#(<= main_~i~0 60), 138270#(<= main_~i~0 65), 138271#(<= main_~i~0 66), 138268#(<= main_~i~0 63), 138269#(<= main_~i~0 64), 138274#(<= main_~i~0 69), 138275#(<= main_~i~0 70), 138272#(<= main_~i~0 67), 138273#(<= main_~i~0 68), 138278#(<= main_~i~0 73), 138279#(<= main_~i~0 74), 138276#(<= main_~i~0 71), 138277#(<= main_~i~0 72), 138282#(<= main_~i~0 77), 138283#(<= main_~i~0 78), 138280#(<= main_~i~0 75), 138281#(<= main_~i~0 76), 138286#(<= main_~i~0 81), 138287#(<= main_~i~0 82), 138284#(<= main_~i~0 79), 138285#(<= main_~i~0 80), 138290#(<= main_~i~0 85), 138291#(<= main_~i~0 86), 138288#(<= main_~i~0 83), 138289#(<= main_~i~0 84), 138294#(<= main_~i~0 89), 138295#(<= main_~i~0 90), 138292#(<= main_~i~0 87), 138293#(<= main_~i~0 88), 138298#(<= main_~i~0 93), 138299#(<= main_~i~0 94), 138296#(<= main_~i~0 91), 138297#(<= main_~i~0 92), 138302#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 138303#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 138300#(<= main_~i~0 95), 138301#(<= main_~i~0 96), 138203#true, 138206#(<= main_~i~0 1), 138207#(<= main_~i~0 2), 138204#false, 138205#(<= main_~i~0 0), 138210#(<= main_~i~0 5), 138211#(<= main_~i~0 6), 138208#(<= main_~i~0 3), 138209#(<= main_~i~0 4), 138214#(<= main_~i~0 9), 138215#(<= main_~i~0 10), 138212#(<= main_~i~0 7), 138213#(<= main_~i~0 8), 138218#(<= main_~i~0 13), 138219#(<= main_~i~0 14), 138216#(<= main_~i~0 11), 138217#(<= main_~i~0 12), 138222#(<= main_~i~0 17), 138223#(<= main_~i~0 18), 138220#(<= main_~i~0 15), 138221#(<= main_~i~0 16), 138226#(<= main_~i~0 21), 138227#(<= main_~i~0 22), 138224#(<= main_~i~0 19), 138225#(<= main_~i~0 20), 138230#(<= main_~i~0 25), 138231#(<= main_~i~0 26), 138228#(<= main_~i~0 23), 138229#(<= main_~i~0 24), 138234#(<= main_~i~0 29), 138235#(<= main_~i~0 30), 138232#(<= main_~i~0 27), 138233#(<= main_~i~0 28), 138238#(<= main_~i~0 33), 138239#(<= main_~i~0 34), 138236#(<= main_~i~0 31), 138237#(<= main_~i~0 32)] [2018-04-12 20:58:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 23474 backedges. 0 proven. 23474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:50,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-12 20:58:50,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-12 20:58:50,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4856, Invalid=5244, Unknown=0, NotChecked=0, Total=10100 [2018-04-12 20:58:50,992 INFO L87 Difference]: Start difference. First operand 1190 states and 1384 transitions. Second operand 101 states. [2018-04-12 20:58:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:58:56,484 INFO L93 Difference]: Finished difference Result 1302 states and 1499 transitions. [2018-04-12 20:58:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-12 20:58:56,484 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 492 [2018-04-12 20:58:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:58:56,485 INFO L225 Difference]: With dead ends: 1302 [2018-04-12 20:58:56,485 INFO L226 Difference]: Without dead ends: 1302 [2018-04-12 20:58:56,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=14556, Invalid=24450, Unknown=0, NotChecked=0, Total=39006 [2018-04-12 20:58:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-04-12 20:58:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1202. [2018-04-12 20:58:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2018-04-12 20:58:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1398 transitions. [2018-04-12 20:58:56,492 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1398 transitions. Word has length 492 [2018-04-12 20:58:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:58:56,492 INFO L459 AbstractCegarLoop]: Abstraction has 1202 states and 1398 transitions. [2018-04-12 20:58:56,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-12 20:58:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1398 transitions. [2018-04-12 20:58:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-04-12 20:58:56,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:58:56,494 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-04-12 20:58:56,494 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:58:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1030882424, now seen corresponding path program 98 times [2018-04-12 20:58:56,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:58:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:58:56,506 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:58:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:58,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:58:58,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-12 20:58:58,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:58:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:58,642 INFO L182 omatonBuilderFactory]: Interpolants [141058#(<= main_~i~0 54), 141059#(<= main_~i~0 55), 141056#(<= main_~i~0 52), 141057#(<= main_~i~0 53), 141062#(<= main_~i~0 58), 141063#(<= main_~i~0 59), 141060#(<= main_~i~0 56), 141061#(<= main_~i~0 57), 141066#(<= main_~i~0 62), 141067#(<= main_~i~0 63), 141064#(<= main_~i~0 60), 141065#(<= main_~i~0 61), 141070#(<= main_~i~0 66), 141071#(<= main_~i~0 67), 141068#(<= main_~i~0 64), 141069#(<= main_~i~0 65), 141074#(<= main_~i~0 70), 141075#(<= main_~i~0 71), 141072#(<= main_~i~0 68), 141073#(<= main_~i~0 69), 141078#(<= main_~i~0 74), 141079#(<= main_~i~0 75), 141076#(<= main_~i~0 72), 141077#(<= main_~i~0 73), 141082#(<= main_~i~0 78), 141083#(<= main_~i~0 79), 141080#(<= main_~i~0 76), 141081#(<= main_~i~0 77), 141086#(<= main_~i~0 82), 141087#(<= main_~i~0 83), 141084#(<= main_~i~0 80), 141085#(<= main_~i~0 81), 141090#(<= main_~i~0 86), 141091#(<= main_~i~0 87), 141088#(<= main_~i~0 84), 141089#(<= main_~i~0 85), 141094#(<= main_~i~0 90), 141095#(<= main_~i~0 91), 141092#(<= main_~i~0 88), 141093#(<= main_~i~0 89), 141098#(<= main_~i~0 94), 141099#(<= main_~i~0 95), 141096#(<= main_~i~0 92), 141097#(<= main_~i~0 93), 141102#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 141103#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 141100#(<= main_~i~0 96), 141101#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 141002#true, 141003#false, 141006#(<= main_~i~0 2), 141007#(<= main_~i~0 3), 141004#(<= main_~i~0 0), 141005#(<= main_~i~0 1), 141010#(<= main_~i~0 6), 141011#(<= main_~i~0 7), 141008#(<= main_~i~0 4), 141009#(<= main_~i~0 5), 141014#(<= main_~i~0 10), 141015#(<= main_~i~0 11), 141012#(<= main_~i~0 8), 141013#(<= main_~i~0 9), 141018#(<= main_~i~0 14), 141019#(<= main_~i~0 15), 141016#(<= main_~i~0 12), 141017#(<= main_~i~0 13), 141022#(<= main_~i~0 18), 141023#(<= main_~i~0 19), 141020#(<= main_~i~0 16), 141021#(<= main_~i~0 17), 141026#(<= main_~i~0 22), 141027#(<= main_~i~0 23), 141024#(<= main_~i~0 20), 141025#(<= main_~i~0 21), 141030#(<= main_~i~0 26), 141031#(<= main_~i~0 27), 141028#(<= main_~i~0 24), 141029#(<= main_~i~0 25), 141034#(<= main_~i~0 30), 141035#(<= main_~i~0 31), 141032#(<= main_~i~0 28), 141033#(<= main_~i~0 29), 141038#(<= main_~i~0 34), 141039#(<= main_~i~0 35), 141036#(<= main_~i~0 32), 141037#(<= main_~i~0 33), 141042#(<= main_~i~0 38), 141043#(<= main_~i~0 39), 141040#(<= main_~i~0 36), 141041#(<= main_~i~0 37), 141046#(<= main_~i~0 42), 141047#(<= main_~i~0 43), 141044#(<= main_~i~0 40), 141045#(<= main_~i~0 41), 141050#(<= main_~i~0 46), 141051#(<= main_~i~0 47), 141048#(<= main_~i~0 44), 141049#(<= main_~i~0 45), 141054#(<= main_~i~0 50), 141055#(<= main_~i~0 51), 141052#(<= main_~i~0 48), 141053#(<= main_~i~0 49)] [2018-04-12 20:58:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 23961 backedges. 0 proven. 23961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:58:58,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-12 20:58:58,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-12 20:58:58,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4858, Invalid=5444, Unknown=0, NotChecked=0, Total=10302 [2018-04-12 20:58:58,644 INFO L87 Difference]: Start difference. First operand 1202 states and 1398 transitions. Second operand 102 states. [2018-04-12 20:59:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:04,757 INFO L93 Difference]: Finished difference Result 1315 states and 1514 transitions. [2018-04-12 20:59:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-12 20:59:04,757 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 497 [2018-04-12 20:59:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:04,758 INFO L225 Difference]: With dead ends: 1315 [2018-04-12 20:59:04,758 INFO L226 Difference]: Without dead ends: 1315 [2018-04-12 20:59:04,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5044 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=14657, Invalid=25143, Unknown=0, NotChecked=0, Total=39800 [2018-04-12 20:59:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-04-12 20:59:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1214. [2018-04-12 20:59:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-04-12 20:59:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1412 transitions. [2018-04-12 20:59:04,765 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1412 transitions. Word has length 497 [2018-04-12 20:59:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:04,765 INFO L459 AbstractCegarLoop]: Abstraction has 1214 states and 1412 transitions. [2018-04-12 20:59:04,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-12 20:59:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1412 transitions. [2018-04-12 20:59:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-12 20:59:04,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:04,767 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:04,767 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash 154821237, now seen corresponding path program 99 times [2018-04-12 20:59:04,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:04,779 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:07,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:07,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-12 20:59:07,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:07,011 INFO L182 omatonBuilderFactory]: Interpolants [143874#(<= main_~i~0 43), 143875#(<= main_~i~0 44), 143872#(<= main_~i~0 41), 143873#(<= main_~i~0 42), 143878#(<= main_~i~0 47), 143879#(<= main_~i~0 48), 143876#(<= main_~i~0 45), 143877#(<= main_~i~0 46), 143882#(<= main_~i~0 51), 143883#(<= main_~i~0 52), 143880#(<= main_~i~0 49), 143881#(<= main_~i~0 50), 143886#(<= main_~i~0 55), 143887#(<= main_~i~0 56), 143884#(<= main_~i~0 53), 143885#(<= main_~i~0 54), 143890#(<= main_~i~0 59), 143891#(<= main_~i~0 60), 143888#(<= main_~i~0 57), 143889#(<= main_~i~0 58), 143894#(<= main_~i~0 63), 143895#(<= main_~i~0 64), 143892#(<= main_~i~0 61), 143893#(<= main_~i~0 62), 143898#(<= main_~i~0 67), 143899#(<= main_~i~0 68), 143896#(<= main_~i~0 65), 143897#(<= main_~i~0 66), 143902#(<= main_~i~0 71), 143903#(<= main_~i~0 72), 143900#(<= main_~i~0 69), 143901#(<= main_~i~0 70), 143906#(<= main_~i~0 75), 143907#(<= main_~i~0 76), 143904#(<= main_~i~0 73), 143905#(<= main_~i~0 74), 143910#(<= main_~i~0 79), 143911#(<= main_~i~0 80), 143908#(<= main_~i~0 77), 143909#(<= main_~i~0 78), 143914#(<= main_~i~0 83), 143915#(<= main_~i~0 84), 143912#(<= main_~i~0 81), 143913#(<= main_~i~0 82), 143918#(<= main_~i~0 87), 143919#(<= main_~i~0 88), 143916#(<= main_~i~0 85), 143917#(<= main_~i~0 86), 143922#(<= main_~i~0 91), 143923#(<= main_~i~0 92), 143920#(<= main_~i~0 89), 143921#(<= main_~i~0 90), 143926#(<= main_~i~0 95), 143927#(<= main_~i~0 96), 143924#(<= main_~i~0 93), 143925#(<= main_~i~0 94), 143930#(and (<= main_~i~0 98) (<= 0 main_~i~0)), 143931#(and (<= 1 main_~i~0) (<= main_~i~0 99)), 143928#(<= main_~i~0 97), 143929#(<= main_~i~0 98), 143830#false, 143831#(<= main_~i~0 0), 143829#true, 143834#(<= main_~i~0 3), 143835#(<= main_~i~0 4), 143832#(<= main_~i~0 1), 143833#(<= main_~i~0 2), 143838#(<= main_~i~0 7), 143839#(<= main_~i~0 8), 143836#(<= main_~i~0 5), 143837#(<= main_~i~0 6), 143842#(<= main_~i~0 11), 143843#(<= main_~i~0 12), 143840#(<= main_~i~0 9), 143841#(<= main_~i~0 10), 143846#(<= main_~i~0 15), 143847#(<= main_~i~0 16), 143844#(<= main_~i~0 13), 143845#(<= main_~i~0 14), 143850#(<= main_~i~0 19), 143851#(<= main_~i~0 20), 143848#(<= main_~i~0 17), 143849#(<= main_~i~0 18), 143854#(<= main_~i~0 23), 143855#(<= main_~i~0 24), 143852#(<= main_~i~0 21), 143853#(<= main_~i~0 22), 143858#(<= main_~i~0 27), 143859#(<= main_~i~0 28), 143856#(<= main_~i~0 25), 143857#(<= main_~i~0 26), 143862#(<= main_~i~0 31), 143863#(<= main_~i~0 32), 143860#(<= main_~i~0 29), 143861#(<= main_~i~0 30), 143866#(<= main_~i~0 35), 143867#(<= main_~i~0 36), 143864#(<= main_~i~0 33), 143865#(<= main_~i~0 34), 143870#(<= main_~i~0 39), 143871#(<= main_~i~0 40), 143868#(<= main_~i~0 37), 143869#(<= main_~i~0 38)] [2018-04-12 20:59:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24453 backedges. 0 proven. 24453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:07,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-12 20:59:07,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-12 20:59:07,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5055, Invalid=5451, Unknown=0, NotChecked=0, Total=10506 [2018-04-12 20:59:07,013 INFO L87 Difference]: Start difference. First operand 1214 states and 1412 transitions. Second operand 103 states. [2018-04-12 20:59:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:12,784 INFO L93 Difference]: Finished difference Result 1328 states and 1529 transitions. [2018-04-12 20:59:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-12 20:59:12,784 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 502 [2018-04-12 20:59:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:12,785 INFO L225 Difference]: With dead ends: 1328 [2018-04-12 20:59:12,785 INFO L226 Difference]: Without dead ends: 1328 [2018-04-12 20:59:12,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=15153, Invalid=25449, Unknown=0, NotChecked=0, Total=40602 [2018-04-12 20:59:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-04-12 20:59:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1226. [2018-04-12 20:59:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-12 20:59:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1426 transitions. [2018-04-12 20:59:12,792 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1426 transitions. Word has length 502 [2018-04-12 20:59:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:12,792 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1426 transitions. [2018-04-12 20:59:12,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-12 20:59:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1426 transitions. [2018-04-12 20:59:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-04-12 20:59:12,794 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:12,794 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:12,795 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1328920664, now seen corresponding path program 100 times [2018-04-12 20:59:12,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:12,812 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:14,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:14,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-12 20:59:14,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:14,933 INFO L182 omatonBuilderFactory]: Interpolants [146690#(<= main_~i~0 4), 146691#(<= main_~i~0 5), 146688#(<= main_~i~0 2), 146689#(<= main_~i~0 3), 146694#(<= main_~i~0 8), 146695#(<= main_~i~0 9), 146692#(<= main_~i~0 6), 146693#(<= main_~i~0 7), 146698#(<= main_~i~0 12), 146699#(<= main_~i~0 13), 146696#(<= main_~i~0 10), 146697#(<= main_~i~0 11), 146702#(<= main_~i~0 16), 146703#(<= main_~i~0 17), 146700#(<= main_~i~0 14), 146701#(<= main_~i~0 15), 146706#(<= main_~i~0 20), 146707#(<= main_~i~0 21), 146704#(<= main_~i~0 18), 146705#(<= main_~i~0 19), 146710#(<= main_~i~0 24), 146711#(<= main_~i~0 25), 146708#(<= main_~i~0 22), 146709#(<= main_~i~0 23), 146714#(<= main_~i~0 28), 146715#(<= main_~i~0 29), 146712#(<= main_~i~0 26), 146713#(<= main_~i~0 27), 146718#(<= main_~i~0 32), 146719#(<= main_~i~0 33), 146716#(<= main_~i~0 30), 146717#(<= main_~i~0 31), 146722#(<= main_~i~0 36), 146723#(<= main_~i~0 37), 146720#(<= main_~i~0 34), 146721#(<= main_~i~0 35), 146726#(<= main_~i~0 40), 146727#(<= main_~i~0 41), 146724#(<= main_~i~0 38), 146725#(<= main_~i~0 39), 146730#(<= main_~i~0 44), 146731#(<= main_~i~0 45), 146728#(<= main_~i~0 42), 146729#(<= main_~i~0 43), 146734#(<= main_~i~0 48), 146735#(<= main_~i~0 49), 146732#(<= main_~i~0 46), 146733#(<= main_~i~0 47), 146738#(<= main_~i~0 52), 146739#(<= main_~i~0 53), 146736#(<= main_~i~0 50), 146737#(<= main_~i~0 51), 146742#(<= main_~i~0 56), 146743#(<= main_~i~0 57), 146740#(<= main_~i~0 54), 146741#(<= main_~i~0 55), 146746#(<= main_~i~0 60), 146747#(<= main_~i~0 61), 146744#(<= main_~i~0 58), 146745#(<= main_~i~0 59), 146750#(<= main_~i~0 64), 146751#(<= main_~i~0 65), 146748#(<= main_~i~0 62), 146749#(<= main_~i~0 63), 146754#(<= main_~i~0 68), 146755#(<= main_~i~0 69), 146752#(<= main_~i~0 66), 146753#(<= main_~i~0 67), 146758#(<= main_~i~0 72), 146759#(<= main_~i~0 73), 146756#(<= main_~i~0 70), 146757#(<= main_~i~0 71), 146762#(<= main_~i~0 76), 146763#(<= main_~i~0 77), 146760#(<= main_~i~0 74), 146761#(<= main_~i~0 75), 146766#(<= main_~i~0 80), 146767#(<= main_~i~0 81), 146764#(<= main_~i~0 78), 146765#(<= main_~i~0 79), 146770#(<= main_~i~0 84), 146771#(<= main_~i~0 85), 146768#(<= main_~i~0 82), 146769#(<= main_~i~0 83), 146774#(<= main_~i~0 88), 146775#(<= main_~i~0 89), 146772#(<= main_~i~0 86), 146773#(<= main_~i~0 87), 146778#(<= main_~i~0 92), 146779#(<= main_~i~0 93), 146776#(<= main_~i~0 90), 146777#(<= main_~i~0 91), 146782#(<= main_~i~0 96), 146783#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 146780#(<= main_~i~0 94), 146781#(<= main_~i~0 95), 146786#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 146787#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 146784#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 146785#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 146686#(<= main_~i~0 0), 146687#(<= main_~i~0 1), 146684#true, 146685#false] [2018-04-12 20:59:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24950 backedges. 0 proven. 24950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:14,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-12 20:59:14,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-12 20:59:14,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4862, Invalid=5850, Unknown=0, NotChecked=0, Total=10712 [2018-04-12 20:59:14,935 INFO L87 Difference]: Start difference. First operand 1226 states and 1426 transitions. Second operand 104 states. [2018-04-12 20:59:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:21,698 INFO L93 Difference]: Finished difference Result 1341 states and 1544 transitions. [2018-04-12 20:59:21,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-12 20:59:21,698 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 507 [2018-04-12 20:59:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:21,699 INFO L225 Difference]: With dead ends: 1341 [2018-04-12 20:59:21,699 INFO L226 Difference]: Without dead ends: 1341 [2018-04-12 20:59:21,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5437 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=14859, Invalid=26553, Unknown=0, NotChecked=0, Total=41412 [2018-04-12 20:59:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2018-04-12 20:59:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1238. [2018-04-12 20:59:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2018-04-12 20:59:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1440 transitions. [2018-04-12 20:59:21,707 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1440 transitions. Word has length 507 [2018-04-12 20:59:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:21,707 INFO L459 AbstractCegarLoop]: Abstraction has 1238 states and 1440 transitions. [2018-04-12 20:59:21,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-12 20:59:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1440 transitions. [2018-04-12 20:59:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-04-12 20:59:21,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:21,709 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:21,709 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2023183787, now seen corresponding path program 101 times [2018-04-12 20:59:21,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:21,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:23,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:23,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-12 20:59:23,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:23,964 INFO L182 omatonBuilderFactory]: Interpolants [149567#true, 149570#(<= main_~i~0 1), 149571#(<= main_~i~0 2), 149568#false, 149569#(<= main_~i~0 0), 149574#(<= main_~i~0 5), 149575#(<= main_~i~0 6), 149572#(<= main_~i~0 3), 149573#(<= main_~i~0 4), 149578#(<= main_~i~0 9), 149579#(<= main_~i~0 10), 149576#(<= main_~i~0 7), 149577#(<= main_~i~0 8), 149582#(<= main_~i~0 13), 149583#(<= main_~i~0 14), 149580#(<= main_~i~0 11), 149581#(<= main_~i~0 12), 149586#(<= main_~i~0 17), 149587#(<= main_~i~0 18), 149584#(<= main_~i~0 15), 149585#(<= main_~i~0 16), 149590#(<= main_~i~0 21), 149591#(<= main_~i~0 22), 149588#(<= main_~i~0 19), 149589#(<= main_~i~0 20), 149594#(<= main_~i~0 25), 149595#(<= main_~i~0 26), 149592#(<= main_~i~0 23), 149593#(<= main_~i~0 24), 149598#(<= main_~i~0 29), 149599#(<= main_~i~0 30), 149596#(<= main_~i~0 27), 149597#(<= main_~i~0 28), 149602#(<= main_~i~0 33), 149603#(<= main_~i~0 34), 149600#(<= main_~i~0 31), 149601#(<= main_~i~0 32), 149606#(<= main_~i~0 37), 149607#(<= main_~i~0 38), 149604#(<= main_~i~0 35), 149605#(<= main_~i~0 36), 149610#(<= main_~i~0 41), 149611#(<= main_~i~0 42), 149608#(<= main_~i~0 39), 149609#(<= main_~i~0 40), 149614#(<= main_~i~0 45), 149615#(<= main_~i~0 46), 149612#(<= main_~i~0 43), 149613#(<= main_~i~0 44), 149618#(<= main_~i~0 49), 149619#(<= main_~i~0 50), 149616#(<= main_~i~0 47), 149617#(<= main_~i~0 48), 149622#(<= main_~i~0 53), 149623#(<= main_~i~0 54), 149620#(<= main_~i~0 51), 149621#(<= main_~i~0 52), 149626#(<= main_~i~0 57), 149627#(<= main_~i~0 58), 149624#(<= main_~i~0 55), 149625#(<= main_~i~0 56), 149630#(<= main_~i~0 61), 149631#(<= main_~i~0 62), 149628#(<= main_~i~0 59), 149629#(<= main_~i~0 60), 149634#(<= main_~i~0 65), 149635#(<= main_~i~0 66), 149632#(<= main_~i~0 63), 149633#(<= main_~i~0 64), 149638#(<= main_~i~0 69), 149639#(<= main_~i~0 70), 149636#(<= main_~i~0 67), 149637#(<= main_~i~0 68), 149642#(<= main_~i~0 73), 149643#(<= main_~i~0 74), 149640#(<= main_~i~0 71), 149641#(<= main_~i~0 72), 149646#(<= main_~i~0 77), 149647#(<= main_~i~0 78), 149644#(<= main_~i~0 75), 149645#(<= main_~i~0 76), 149650#(<= main_~i~0 81), 149651#(<= main_~i~0 82), 149648#(<= main_~i~0 79), 149649#(<= main_~i~0 80), 149654#(<= main_~i~0 85), 149655#(<= main_~i~0 86), 149652#(<= main_~i~0 83), 149653#(<= main_~i~0 84), 149658#(<= main_~i~0 89), 149659#(<= main_~i~0 90), 149656#(<= main_~i~0 87), 149657#(<= main_~i~0 88), 149662#(<= main_~i~0 93), 149663#(<= main_~i~0 94), 149660#(<= main_~i~0 91), 149661#(<= main_~i~0 92), 149666#(<= main_~i~0 97), 149667#(<= main_~i~0 98), 149664#(<= main_~i~0 95), 149665#(<= main_~i~0 96), 149670#(and (<= 0 main_~i~0) (<= main_~i~0 100)), 149671#(and (<= 1 main_~i~0) (<= main_~i~0 101)), 149668#(<= main_~i~0 99), 149669#(<= main_~i~0 100)] [2018-04-12 20:59:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25452 backedges. 0 proven. 25452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:23,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-12 20:59:23,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-12 20:59:23,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-04-12 20:59:23,966 INFO L87 Difference]: Start difference. First operand 1238 states and 1440 transitions. Second operand 105 states. [2018-04-12 20:59:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:30,215 INFO L93 Difference]: Finished difference Result 1354 states and 1559 transitions. [2018-04-12 20:59:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-12 20:59:30,215 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 512 [2018-04-12 20:59:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:30,216 INFO L225 Difference]: With dead ends: 1354 [2018-04-12 20:59:30,216 INFO L226 Difference]: Without dead ends: 1354 [2018-04-12 20:59:30,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=15762, Invalid=26468, Unknown=0, NotChecked=0, Total=42230 [2018-04-12 20:59:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-04-12 20:59:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1250. [2018-04-12 20:59:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-04-12 20:59:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1454 transitions. [2018-04-12 20:59:30,225 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1454 transitions. Word has length 512 [2018-04-12 20:59:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:30,226 INFO L459 AbstractCegarLoop]: Abstraction has 1250 states and 1454 transitions. [2018-04-12 20:59:30,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-12 20:59:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1454 transitions. [2018-04-12 20:59:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-04-12 20:59:30,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:30,229 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:30,229 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2052199480, now seen corresponding path program 102 times [2018-04-12 20:59:30,230 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:30,242 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:32,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:32,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-12 20:59:32,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:32,513 INFO L182 omatonBuilderFactory]: Interpolants [152578#(<= main_~i~0 98), 152579#(<= main_~i~0 99), 152576#(<= main_~i~0 96), 152577#(<= main_~i~0 97), 152582#(and (<= 1 main_~i~0) (<= main_~i~0 101)), 152583#(and (<= 2 main_~i~0) (<= main_~i~0 102)), 152580#(<= main_~i~0 100), 152581#(and (<= 0 main_~i~0) (<= main_~i~0 100)), 152478#true, 152479#false, 152482#(<= main_~i~0 2), 152483#(<= main_~i~0 3), 152480#(<= main_~i~0 0), 152481#(<= main_~i~0 1), 152486#(<= main_~i~0 6), 152487#(<= main_~i~0 7), 152484#(<= main_~i~0 4), 152485#(<= main_~i~0 5), 152490#(<= main_~i~0 10), 152491#(<= main_~i~0 11), 152488#(<= main_~i~0 8), 152489#(<= main_~i~0 9), 152494#(<= main_~i~0 14), 152495#(<= main_~i~0 15), 152492#(<= main_~i~0 12), 152493#(<= main_~i~0 13), 152498#(<= main_~i~0 18), 152499#(<= main_~i~0 19), 152496#(<= main_~i~0 16), 152497#(<= main_~i~0 17), 152502#(<= main_~i~0 22), 152503#(<= main_~i~0 23), 152500#(<= main_~i~0 20), 152501#(<= main_~i~0 21), 152506#(<= main_~i~0 26), 152507#(<= main_~i~0 27), 152504#(<= main_~i~0 24), 152505#(<= main_~i~0 25), 152510#(<= main_~i~0 30), 152511#(<= main_~i~0 31), 152508#(<= main_~i~0 28), 152509#(<= main_~i~0 29), 152514#(<= main_~i~0 34), 152515#(<= main_~i~0 35), 152512#(<= main_~i~0 32), 152513#(<= main_~i~0 33), 152518#(<= main_~i~0 38), 152519#(<= main_~i~0 39), 152516#(<= main_~i~0 36), 152517#(<= main_~i~0 37), 152522#(<= main_~i~0 42), 152523#(<= main_~i~0 43), 152520#(<= main_~i~0 40), 152521#(<= main_~i~0 41), 152526#(<= main_~i~0 46), 152527#(<= main_~i~0 47), 152524#(<= main_~i~0 44), 152525#(<= main_~i~0 45), 152530#(<= main_~i~0 50), 152531#(<= main_~i~0 51), 152528#(<= main_~i~0 48), 152529#(<= main_~i~0 49), 152534#(<= main_~i~0 54), 152535#(<= main_~i~0 55), 152532#(<= main_~i~0 52), 152533#(<= main_~i~0 53), 152538#(<= main_~i~0 58), 152539#(<= main_~i~0 59), 152536#(<= main_~i~0 56), 152537#(<= main_~i~0 57), 152542#(<= main_~i~0 62), 152543#(<= main_~i~0 63), 152540#(<= main_~i~0 60), 152541#(<= main_~i~0 61), 152546#(<= main_~i~0 66), 152547#(<= main_~i~0 67), 152544#(<= main_~i~0 64), 152545#(<= main_~i~0 65), 152550#(<= main_~i~0 70), 152551#(<= main_~i~0 71), 152548#(<= main_~i~0 68), 152549#(<= main_~i~0 69), 152554#(<= main_~i~0 74), 152555#(<= main_~i~0 75), 152552#(<= main_~i~0 72), 152553#(<= main_~i~0 73), 152558#(<= main_~i~0 78), 152559#(<= main_~i~0 79), 152556#(<= main_~i~0 76), 152557#(<= main_~i~0 77), 152562#(<= main_~i~0 82), 152563#(<= main_~i~0 83), 152560#(<= main_~i~0 80), 152561#(<= main_~i~0 81), 152566#(<= main_~i~0 86), 152567#(<= main_~i~0 87), 152564#(<= main_~i~0 84), 152565#(<= main_~i~0 85), 152570#(<= main_~i~0 90), 152571#(<= main_~i~0 91), 152568#(<= main_~i~0 88), 152569#(<= main_~i~0 89), 152574#(<= main_~i~0 94), 152575#(<= main_~i~0 95), 152572#(<= main_~i~0 92), 152573#(<= main_~i~0 93)] [2018-04-12 20:59:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25959 backedges. 0 proven. 25959 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:32,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-12 20:59:32,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-12 20:59:32,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5260, Invalid=5870, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 20:59:32,515 INFO L87 Difference]: Start difference. First operand 1250 states and 1454 transitions. Second operand 106 states. [2018-04-12 20:59:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:39,102 INFO L93 Difference]: Finished difference Result 1367 states and 1574 transitions. [2018-04-12 20:59:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-12 20:59:39,102 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 517 [2018-04-12 20:59:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:39,103 INFO L225 Difference]: With dead ends: 1367 [2018-04-12 20:59:39,103 INFO L226 Difference]: Without dead ends: 1367 [2018-04-12 20:59:39,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5454 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=15867, Invalid=27189, Unknown=0, NotChecked=0, Total=43056 [2018-04-12 20:59:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-04-12 20:59:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1262. [2018-04-12 20:59:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2018-04-12 20:59:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1468 transitions. [2018-04-12 20:59:39,113 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1468 transitions. Word has length 517 [2018-04-12 20:59:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:39,114 INFO L459 AbstractCegarLoop]: Abstraction has 1262 states and 1468 transitions. [2018-04-12 20:59:39,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-12 20:59:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1468 transitions. [2018-04-12 20:59:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-04-12 20:59:39,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:39,115 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:39,115 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1506187829, now seen corresponding path program 103 times [2018-04-12 20:59:39,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:39,128 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:41,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:41,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-12 20:59:41,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:41,414 INFO L182 omatonBuilderFactory]: Interpolants [155418#false, 155419#(<= main_~i~0 0), 155417#true, 155422#(<= main_~i~0 3), 155423#(<= main_~i~0 4), 155420#(<= main_~i~0 1), 155421#(<= main_~i~0 2), 155426#(<= main_~i~0 7), 155427#(<= main_~i~0 8), 155424#(<= main_~i~0 5), 155425#(<= main_~i~0 6), 155430#(<= main_~i~0 11), 155431#(<= main_~i~0 12), 155428#(<= main_~i~0 9), 155429#(<= main_~i~0 10), 155434#(<= main_~i~0 15), 155435#(<= main_~i~0 16), 155432#(<= main_~i~0 13), 155433#(<= main_~i~0 14), 155438#(<= main_~i~0 19), 155439#(<= main_~i~0 20), 155436#(<= main_~i~0 17), 155437#(<= main_~i~0 18), 155442#(<= main_~i~0 23), 155443#(<= main_~i~0 24), 155440#(<= main_~i~0 21), 155441#(<= main_~i~0 22), 155446#(<= main_~i~0 27), 155447#(<= main_~i~0 28), 155444#(<= main_~i~0 25), 155445#(<= main_~i~0 26), 155450#(<= main_~i~0 31), 155451#(<= main_~i~0 32), 155448#(<= main_~i~0 29), 155449#(<= main_~i~0 30), 155454#(<= main_~i~0 35), 155455#(<= main_~i~0 36), 155452#(<= main_~i~0 33), 155453#(<= main_~i~0 34), 155458#(<= main_~i~0 39), 155459#(<= main_~i~0 40), 155456#(<= main_~i~0 37), 155457#(<= main_~i~0 38), 155462#(<= main_~i~0 43), 155463#(<= main_~i~0 44), 155460#(<= main_~i~0 41), 155461#(<= main_~i~0 42), 155466#(<= main_~i~0 47), 155467#(<= main_~i~0 48), 155464#(<= main_~i~0 45), 155465#(<= main_~i~0 46), 155470#(<= main_~i~0 51), 155471#(<= main_~i~0 52), 155468#(<= main_~i~0 49), 155469#(<= main_~i~0 50), 155474#(<= main_~i~0 55), 155475#(<= main_~i~0 56), 155472#(<= main_~i~0 53), 155473#(<= main_~i~0 54), 155478#(<= main_~i~0 59), 155479#(<= main_~i~0 60), 155476#(<= main_~i~0 57), 155477#(<= main_~i~0 58), 155482#(<= main_~i~0 63), 155483#(<= main_~i~0 64), 155480#(<= main_~i~0 61), 155481#(<= main_~i~0 62), 155486#(<= main_~i~0 67), 155487#(<= main_~i~0 68), 155484#(<= main_~i~0 65), 155485#(<= main_~i~0 66), 155490#(<= main_~i~0 71), 155491#(<= main_~i~0 72), 155488#(<= main_~i~0 69), 155489#(<= main_~i~0 70), 155494#(<= main_~i~0 75), 155495#(<= main_~i~0 76), 155492#(<= main_~i~0 73), 155493#(<= main_~i~0 74), 155498#(<= main_~i~0 79), 155499#(<= main_~i~0 80), 155496#(<= main_~i~0 77), 155497#(<= main_~i~0 78), 155502#(<= main_~i~0 83), 155503#(<= main_~i~0 84), 155500#(<= main_~i~0 81), 155501#(<= main_~i~0 82), 155506#(<= main_~i~0 87), 155507#(<= main_~i~0 88), 155504#(<= main_~i~0 85), 155505#(<= main_~i~0 86), 155510#(<= main_~i~0 91), 155511#(<= main_~i~0 92), 155508#(<= main_~i~0 89), 155509#(<= main_~i~0 90), 155514#(<= main_~i~0 95), 155515#(<= main_~i~0 96), 155512#(<= main_~i~0 93), 155513#(<= main_~i~0 94), 155518#(<= main_~i~0 99), 155519#(<= main_~i~0 100), 155516#(<= main_~i~0 97), 155517#(<= main_~i~0 98), 155522#(and (<= 0 main_~i~0) (<= main_~i~0 102)), 155523#(and (<= 1 main_~i~0) (<= main_~i~0 103)), 155520#(<= main_~i~0 101), 155521#(<= main_~i~0 102)] [2018-04-12 20:59:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26471 backedges. 0 proven. 26471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:41,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-12 20:59:41,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-12 20:59:41,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5465, Invalid=5877, Unknown=0, NotChecked=0, Total=11342 [2018-04-12 20:59:41,416 INFO L87 Difference]: Start difference. First operand 1262 states and 1468 transitions. Second operand 107 states. [2018-04-12 20:59:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:47,775 INFO L93 Difference]: Finished difference Result 1380 states and 1589 transitions. [2018-04-12 20:59:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-12 20:59:47,776 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 522 [2018-04-12 20:59:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:47,777 INFO L225 Difference]: With dead ends: 1380 [2018-04-12 20:59:47,777 INFO L226 Difference]: Without dead ends: 1380 [2018-04-12 20:59:47,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=16383, Invalid=27507, Unknown=0, NotChecked=0, Total=43890 [2018-04-12 20:59:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-04-12 20:59:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1274. [2018-04-12 20:59:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2018-04-12 20:59:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1482 transitions. [2018-04-12 20:59:47,788 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1482 transitions. Word has length 522 [2018-04-12 20:59:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:47,788 INFO L459 AbstractCegarLoop]: Abstraction has 1274 states and 1482 transitions. [2018-04-12 20:59:47,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-12 20:59:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1482 transitions. [2018-04-12 20:59:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-04-12 20:59:47,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:47,791 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:47,791 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash -102045720, now seen corresponding path program 104 times [2018-04-12 20:59:47,792 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:47,805 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 20:59:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:50,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 20:59:50,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-04-12 20:59:50,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 20:59:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:50,010 INFO L182 omatonBuilderFactory]: Interpolants [158466#(<= main_~i~0 80), 158467#(<= main_~i~0 81), 158464#(<= main_~i~0 78), 158465#(<= main_~i~0 79), 158470#(<= main_~i~0 84), 158471#(<= main_~i~0 85), 158468#(<= main_~i~0 82), 158469#(<= main_~i~0 83), 158474#(<= main_~i~0 88), 158475#(<= main_~i~0 89), 158472#(<= main_~i~0 86), 158473#(<= main_~i~0 87), 158478#(<= main_~i~0 92), 158479#(<= main_~i~0 93), 158476#(<= main_~i~0 90), 158477#(<= main_~i~0 91), 158482#(<= main_~i~0 96), 158483#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 158480#(<= main_~i~0 94), 158481#(<= main_~i~0 95), 158486#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 158487#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 158484#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 158485#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 158490#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 158491#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 158488#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 158489#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 158386#(<= main_~i~0 0), 158387#(<= main_~i~0 1), 158384#true, 158385#false, 158390#(<= main_~i~0 4), 158391#(<= main_~i~0 5), 158388#(<= main_~i~0 2), 158389#(<= main_~i~0 3), 158394#(<= main_~i~0 8), 158395#(<= main_~i~0 9), 158392#(<= main_~i~0 6), 158393#(<= main_~i~0 7), 158398#(<= main_~i~0 12), 158399#(<= main_~i~0 13), 158396#(<= main_~i~0 10), 158397#(<= main_~i~0 11), 158402#(<= main_~i~0 16), 158403#(<= main_~i~0 17), 158400#(<= main_~i~0 14), 158401#(<= main_~i~0 15), 158406#(<= main_~i~0 20), 158407#(<= main_~i~0 21), 158404#(<= main_~i~0 18), 158405#(<= main_~i~0 19), 158410#(<= main_~i~0 24), 158411#(<= main_~i~0 25), 158408#(<= main_~i~0 22), 158409#(<= main_~i~0 23), 158414#(<= main_~i~0 28), 158415#(<= main_~i~0 29), 158412#(<= main_~i~0 26), 158413#(<= main_~i~0 27), 158418#(<= main_~i~0 32), 158419#(<= main_~i~0 33), 158416#(<= main_~i~0 30), 158417#(<= main_~i~0 31), 158422#(<= main_~i~0 36), 158423#(<= main_~i~0 37), 158420#(<= main_~i~0 34), 158421#(<= main_~i~0 35), 158426#(<= main_~i~0 40), 158427#(<= main_~i~0 41), 158424#(<= main_~i~0 38), 158425#(<= main_~i~0 39), 158430#(<= main_~i~0 44), 158431#(<= main_~i~0 45), 158428#(<= main_~i~0 42), 158429#(<= main_~i~0 43), 158434#(<= main_~i~0 48), 158435#(<= main_~i~0 49), 158432#(<= main_~i~0 46), 158433#(<= main_~i~0 47), 158438#(<= main_~i~0 52), 158439#(<= main_~i~0 53), 158436#(<= main_~i~0 50), 158437#(<= main_~i~0 51), 158442#(<= main_~i~0 56), 158443#(<= main_~i~0 57), 158440#(<= main_~i~0 54), 158441#(<= main_~i~0 55), 158446#(<= main_~i~0 60), 158447#(<= main_~i~0 61), 158444#(<= main_~i~0 58), 158445#(<= main_~i~0 59), 158450#(<= main_~i~0 64), 158451#(<= main_~i~0 65), 158448#(<= main_~i~0 62), 158449#(<= main_~i~0 63), 158454#(<= main_~i~0 68), 158455#(<= main_~i~0 69), 158452#(<= main_~i~0 66), 158453#(<= main_~i~0 67), 158458#(<= main_~i~0 72), 158459#(<= main_~i~0 73), 158456#(<= main_~i~0 70), 158457#(<= main_~i~0 71), 158462#(<= main_~i~0 76), 158463#(<= main_~i~0 77), 158460#(<= main_~i~0 74), 158461#(<= main_~i~0 75)] [2018-04-12 20:59:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 26988 backedges. 0 proven. 26988 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 20:59:50,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-12 20:59:50,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-12 20:59:50,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4870, Invalid=6686, Unknown=0, NotChecked=0, Total=11556 [2018-04-12 20:59:50,012 INFO L87 Difference]: Start difference. First operand 1274 states and 1482 transitions. Second operand 108 states. [2018-04-12 20:59:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 20:59:57,790 INFO L93 Difference]: Finished difference Result 1393 states and 1604 transitions. [2018-04-12 20:59:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-12 20:59:57,790 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 527 [2018-04-12 20:59:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 20:59:57,792 INFO L225 Difference]: With dead ends: 1393 [2018-04-12 20:59:57,792 INFO L226 Difference]: Without dead ends: 1393 [2018-04-12 20:59:57,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6235 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=15263, Invalid=29469, Unknown=0, NotChecked=0, Total=44732 [2018-04-12 20:59:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-04-12 20:59:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1286. [2018-04-12 20:59:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2018-04-12 20:59:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1496 transitions. [2018-04-12 20:59:57,798 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1496 transitions. Word has length 527 [2018-04-12 20:59:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 20:59:57,799 INFO L459 AbstractCegarLoop]: Abstraction has 1286 states and 1496 transitions. [2018-04-12 20:59:57,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-12 20:59:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1496 transitions. [2018-04-12 20:59:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-12 20:59:57,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 20:59:57,801 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-04-12 20:59:57,801 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 20:59:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1726099989, now seen corresponding path program 105 times [2018-04-12 20:59:57,801 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 20:59:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 20:59:57,813 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:00,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:00,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-04-12 21:00:00,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:00,180 INFO L182 omatonBuilderFactory]: Interpolants [161379#true, 161382#(<= main_~i~0 1), 161383#(<= main_~i~0 2), 161380#false, 161381#(<= main_~i~0 0), 161386#(<= main_~i~0 5), 161387#(<= main_~i~0 6), 161384#(<= main_~i~0 3), 161385#(<= main_~i~0 4), 161390#(<= main_~i~0 9), 161391#(<= main_~i~0 10), 161388#(<= main_~i~0 7), 161389#(<= main_~i~0 8), 161394#(<= main_~i~0 13), 161395#(<= main_~i~0 14), 161392#(<= main_~i~0 11), 161393#(<= main_~i~0 12), 161398#(<= main_~i~0 17), 161399#(<= main_~i~0 18), 161396#(<= main_~i~0 15), 161397#(<= main_~i~0 16), 161402#(<= main_~i~0 21), 161403#(<= main_~i~0 22), 161400#(<= main_~i~0 19), 161401#(<= main_~i~0 20), 161406#(<= main_~i~0 25), 161407#(<= main_~i~0 26), 161404#(<= main_~i~0 23), 161405#(<= main_~i~0 24), 161410#(<= main_~i~0 29), 161411#(<= main_~i~0 30), 161408#(<= main_~i~0 27), 161409#(<= main_~i~0 28), 161414#(<= main_~i~0 33), 161415#(<= main_~i~0 34), 161412#(<= main_~i~0 31), 161413#(<= main_~i~0 32), 161418#(<= main_~i~0 37), 161419#(<= main_~i~0 38), 161416#(<= main_~i~0 35), 161417#(<= main_~i~0 36), 161422#(<= main_~i~0 41), 161423#(<= main_~i~0 42), 161420#(<= main_~i~0 39), 161421#(<= main_~i~0 40), 161426#(<= main_~i~0 45), 161427#(<= main_~i~0 46), 161424#(<= main_~i~0 43), 161425#(<= main_~i~0 44), 161430#(<= main_~i~0 49), 161431#(<= main_~i~0 50), 161428#(<= main_~i~0 47), 161429#(<= main_~i~0 48), 161434#(<= main_~i~0 53), 161435#(<= main_~i~0 54), 161432#(<= main_~i~0 51), 161433#(<= main_~i~0 52), 161438#(<= main_~i~0 57), 161439#(<= main_~i~0 58), 161436#(<= main_~i~0 55), 161437#(<= main_~i~0 56), 161442#(<= main_~i~0 61), 161443#(<= main_~i~0 62), 161440#(<= main_~i~0 59), 161441#(<= main_~i~0 60), 161446#(<= main_~i~0 65), 161447#(<= main_~i~0 66), 161444#(<= main_~i~0 63), 161445#(<= main_~i~0 64), 161450#(<= main_~i~0 69), 161451#(<= main_~i~0 70), 161448#(<= main_~i~0 67), 161449#(<= main_~i~0 68), 161454#(<= main_~i~0 73), 161455#(<= main_~i~0 74), 161452#(<= main_~i~0 71), 161453#(<= main_~i~0 72), 161458#(<= main_~i~0 77), 161459#(<= main_~i~0 78), 161456#(<= main_~i~0 75), 161457#(<= main_~i~0 76), 161462#(<= main_~i~0 81), 161463#(<= main_~i~0 82), 161460#(<= main_~i~0 79), 161461#(<= main_~i~0 80), 161466#(<= main_~i~0 85), 161467#(<= main_~i~0 86), 161464#(<= main_~i~0 83), 161465#(<= main_~i~0 84), 161470#(<= main_~i~0 89), 161471#(<= main_~i~0 90), 161468#(<= main_~i~0 87), 161469#(<= main_~i~0 88), 161474#(<= main_~i~0 93), 161475#(<= main_~i~0 94), 161472#(<= main_~i~0 91), 161473#(<= main_~i~0 92), 161478#(<= main_~i~0 97), 161479#(<= main_~i~0 98), 161476#(<= main_~i~0 95), 161477#(<= main_~i~0 96), 161482#(<= main_~i~0 101), 161483#(<= main_~i~0 102), 161480#(<= main_~i~0 99), 161481#(<= main_~i~0 100), 161486#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 161487#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 161484#(<= main_~i~0 103), 161485#(<= main_~i~0 104)] [2018-04-12 21:00:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 27510 backedges. 0 proven. 27510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:00,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-12 21:00:00,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-12 21:00:00,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5676, Invalid=6096, Unknown=0, NotChecked=0, Total=11772 [2018-04-12 21:00:00,181 INFO L87 Difference]: Start difference. First operand 1286 states and 1496 transitions. Second operand 109 states. [2018-04-12 21:00:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:07,200 INFO L93 Difference]: Finished difference Result 1406 states and 1619 transitions. [2018-04-12 21:00:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-12 21:00:07,200 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 532 [2018-04-12 21:00:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:07,201 INFO L225 Difference]: With dead ends: 1406 [2018-04-12 21:00:07,201 INFO L226 Difference]: Without dead ends: 1406 [2018-04-12 21:00:07,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=17016, Invalid=28566, Unknown=0, NotChecked=0, Total=45582 [2018-04-12 21:00:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2018-04-12 21:00:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1298. [2018-04-12 21:00:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2018-04-12 21:00:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1510 transitions. [2018-04-12 21:00:07,209 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1510 transitions. Word has length 532 [2018-04-12 21:00:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:07,209 INFO L459 AbstractCegarLoop]: Abstraction has 1298 states and 1510 transitions. [2018-04-12 21:00:07,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-12 21:00:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1510 transitions. [2018-04-12 21:00:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-04-12 21:00:07,211 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:07,211 INFO L355 BasicCegarLoop]: trace histogram [107, 106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:07,211 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash 263404552, now seen corresponding path program 106 times [2018-04-12 21:00:07,212 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:07,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:09,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:09,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-04-12 21:00:09,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:09,577 INFO L182 omatonBuilderFactory]: Interpolants [164402#true, 164403#false, 164406#(<= main_~i~0 2), 164407#(<= main_~i~0 3), 164404#(<= main_~i~0 0), 164405#(<= main_~i~0 1), 164410#(<= main_~i~0 6), 164411#(<= main_~i~0 7), 164408#(<= main_~i~0 4), 164409#(<= main_~i~0 5), 164414#(<= main_~i~0 10), 164415#(<= main_~i~0 11), 164412#(<= main_~i~0 8), 164413#(<= main_~i~0 9), 164418#(<= main_~i~0 14), 164419#(<= main_~i~0 15), 164416#(<= main_~i~0 12), 164417#(<= main_~i~0 13), 164422#(<= main_~i~0 18), 164423#(<= main_~i~0 19), 164420#(<= main_~i~0 16), 164421#(<= main_~i~0 17), 164426#(<= main_~i~0 22), 164427#(<= main_~i~0 23), 164424#(<= main_~i~0 20), 164425#(<= main_~i~0 21), 164430#(<= main_~i~0 26), 164431#(<= main_~i~0 27), 164428#(<= main_~i~0 24), 164429#(<= main_~i~0 25), 164434#(<= main_~i~0 30), 164435#(<= main_~i~0 31), 164432#(<= main_~i~0 28), 164433#(<= main_~i~0 29), 164438#(<= main_~i~0 34), 164439#(<= main_~i~0 35), 164436#(<= main_~i~0 32), 164437#(<= main_~i~0 33), 164442#(<= main_~i~0 38), 164443#(<= main_~i~0 39), 164440#(<= main_~i~0 36), 164441#(<= main_~i~0 37), 164446#(<= main_~i~0 42), 164447#(<= main_~i~0 43), 164444#(<= main_~i~0 40), 164445#(<= main_~i~0 41), 164450#(<= main_~i~0 46), 164451#(<= main_~i~0 47), 164448#(<= main_~i~0 44), 164449#(<= main_~i~0 45), 164454#(<= main_~i~0 50), 164455#(<= main_~i~0 51), 164452#(<= main_~i~0 48), 164453#(<= main_~i~0 49), 164458#(<= main_~i~0 54), 164459#(<= main_~i~0 55), 164456#(<= main_~i~0 52), 164457#(<= main_~i~0 53), 164462#(<= main_~i~0 58), 164463#(<= main_~i~0 59), 164460#(<= main_~i~0 56), 164461#(<= main_~i~0 57), 164466#(<= main_~i~0 62), 164467#(<= main_~i~0 63), 164464#(<= main_~i~0 60), 164465#(<= main_~i~0 61), 164470#(<= main_~i~0 66), 164471#(<= main_~i~0 67), 164468#(<= main_~i~0 64), 164469#(<= main_~i~0 65), 164474#(<= main_~i~0 70), 164475#(<= main_~i~0 71), 164472#(<= main_~i~0 68), 164473#(<= main_~i~0 69), 164478#(<= main_~i~0 74), 164479#(<= main_~i~0 75), 164476#(<= main_~i~0 72), 164477#(<= main_~i~0 73), 164482#(<= main_~i~0 78), 164483#(<= main_~i~0 79), 164480#(<= main_~i~0 76), 164481#(<= main_~i~0 77), 164486#(<= main_~i~0 82), 164487#(<= main_~i~0 83), 164484#(<= main_~i~0 80), 164485#(<= main_~i~0 81), 164490#(<= main_~i~0 86), 164491#(<= main_~i~0 87), 164488#(<= main_~i~0 84), 164489#(<= main_~i~0 85), 164494#(<= main_~i~0 90), 164495#(<= main_~i~0 91), 164492#(<= main_~i~0 88), 164493#(<= main_~i~0 89), 164498#(<= main_~i~0 94), 164499#(<= main_~i~0 95), 164496#(<= main_~i~0 92), 164497#(<= main_~i~0 93), 164502#(<= main_~i~0 98), 164503#(<= main_~i~0 99), 164500#(<= main_~i~0 96), 164501#(<= main_~i~0 97), 164506#(<= main_~i~0 102), 164507#(<= main_~i~0 103), 164504#(<= main_~i~0 100), 164505#(<= main_~i~0 101), 164510#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 164511#(and (<= 2 main_~i~0) (<= main_~i~0 106)), 164508#(<= main_~i~0 104), 164509#(and (<= 0 main_~i~0) (<= main_~i~0 104))] [2018-04-12 21:00:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28037 backedges. 0 proven. 28037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:09,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-12 21:00:09,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-12 21:00:09,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5678, Invalid=6312, Unknown=0, NotChecked=0, Total=11990 [2018-04-12 21:00:09,578 INFO L87 Difference]: Start difference. First operand 1298 states and 1510 transitions. Second operand 110 states. [2018-04-12 21:00:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:16,629 INFO L93 Difference]: Finished difference Result 1419 states and 1634 transitions. [2018-04-12 21:00:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-12 21:00:16,629 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 537 [2018-04-12 21:00:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:16,630 INFO L225 Difference]: With dead ends: 1419 [2018-04-12 21:00:16,630 INFO L226 Difference]: Without dead ends: 1419 [2018-04-12 21:00:16,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=17125, Invalid=29315, Unknown=0, NotChecked=0, Total=46440 [2018-04-12 21:00:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-04-12 21:00:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1310. [2018-04-12 21:00:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2018-04-12 21:00:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1524 transitions. [2018-04-12 21:00:16,637 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1524 transitions. Word has length 537 [2018-04-12 21:00:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:16,637 INFO L459 AbstractCegarLoop]: Abstraction has 1310 states and 1524 transitions. [2018-04-12 21:00:16,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-12 21:00:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1524 transitions. [2018-04-12 21:00:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-04-12 21:00:16,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:16,639 INFO L355 BasicCegarLoop]: trace histogram [108, 107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:16,639 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1003057653, now seen corresponding path program 107 times [2018-04-12 21:00:16,640 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:16,652 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:19,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:19,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-04-12 21:00:19,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:19,048 INFO L182 omatonBuilderFactory]: Interpolants [167454#false, 167455#(<= main_~i~0 0), 167453#true, 167458#(<= main_~i~0 3), 167459#(<= main_~i~0 4), 167456#(<= main_~i~0 1), 167457#(<= main_~i~0 2), 167462#(<= main_~i~0 7), 167463#(<= main_~i~0 8), 167460#(<= main_~i~0 5), 167461#(<= main_~i~0 6), 167466#(<= main_~i~0 11), 167467#(<= main_~i~0 12), 167464#(<= main_~i~0 9), 167465#(<= main_~i~0 10), 167470#(<= main_~i~0 15), 167471#(<= main_~i~0 16), 167468#(<= main_~i~0 13), 167469#(<= main_~i~0 14), 167474#(<= main_~i~0 19), 167475#(<= main_~i~0 20), 167472#(<= main_~i~0 17), 167473#(<= main_~i~0 18), 167478#(<= main_~i~0 23), 167479#(<= main_~i~0 24), 167476#(<= main_~i~0 21), 167477#(<= main_~i~0 22), 167482#(<= main_~i~0 27), 167483#(<= main_~i~0 28), 167480#(<= main_~i~0 25), 167481#(<= main_~i~0 26), 167486#(<= main_~i~0 31), 167487#(<= main_~i~0 32), 167484#(<= main_~i~0 29), 167485#(<= main_~i~0 30), 167490#(<= main_~i~0 35), 167491#(<= main_~i~0 36), 167488#(<= main_~i~0 33), 167489#(<= main_~i~0 34), 167494#(<= main_~i~0 39), 167495#(<= main_~i~0 40), 167492#(<= main_~i~0 37), 167493#(<= main_~i~0 38), 167498#(<= main_~i~0 43), 167499#(<= main_~i~0 44), 167496#(<= main_~i~0 41), 167497#(<= main_~i~0 42), 167502#(<= main_~i~0 47), 167503#(<= main_~i~0 48), 167500#(<= main_~i~0 45), 167501#(<= main_~i~0 46), 167506#(<= main_~i~0 51), 167507#(<= main_~i~0 52), 167504#(<= main_~i~0 49), 167505#(<= main_~i~0 50), 167510#(<= main_~i~0 55), 167511#(<= main_~i~0 56), 167508#(<= main_~i~0 53), 167509#(<= main_~i~0 54), 167514#(<= main_~i~0 59), 167515#(<= main_~i~0 60), 167512#(<= main_~i~0 57), 167513#(<= main_~i~0 58), 167518#(<= main_~i~0 63), 167519#(<= main_~i~0 64), 167516#(<= main_~i~0 61), 167517#(<= main_~i~0 62), 167522#(<= main_~i~0 67), 167523#(<= main_~i~0 68), 167520#(<= main_~i~0 65), 167521#(<= main_~i~0 66), 167526#(<= main_~i~0 71), 167527#(<= main_~i~0 72), 167524#(<= main_~i~0 69), 167525#(<= main_~i~0 70), 167530#(<= main_~i~0 75), 167531#(<= main_~i~0 76), 167528#(<= main_~i~0 73), 167529#(<= main_~i~0 74), 167534#(<= main_~i~0 79), 167535#(<= main_~i~0 80), 167532#(<= main_~i~0 77), 167533#(<= main_~i~0 78), 167538#(<= main_~i~0 83), 167539#(<= main_~i~0 84), 167536#(<= main_~i~0 81), 167537#(<= main_~i~0 82), 167542#(<= main_~i~0 87), 167543#(<= main_~i~0 88), 167540#(<= main_~i~0 85), 167541#(<= main_~i~0 86), 167546#(<= main_~i~0 91), 167547#(<= main_~i~0 92), 167544#(<= main_~i~0 89), 167545#(<= main_~i~0 90), 167550#(<= main_~i~0 95), 167551#(<= main_~i~0 96), 167548#(<= main_~i~0 93), 167549#(<= main_~i~0 94), 167554#(<= main_~i~0 99), 167555#(<= main_~i~0 100), 167552#(<= main_~i~0 97), 167553#(<= main_~i~0 98), 167558#(<= main_~i~0 103), 167559#(<= main_~i~0 104), 167556#(<= main_~i~0 101), 167557#(<= main_~i~0 102), 167562#(and (<= 0 main_~i~0) (<= main_~i~0 106)), 167563#(and (<= 1 main_~i~0) (<= main_~i~0 107)), 167560#(<= main_~i~0 105), 167561#(<= main_~i~0 106)] [2018-04-12 21:00:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28569 backedges. 0 proven. 28569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:19,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-12 21:00:19,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-12 21:00:19,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5891, Invalid=6319, Unknown=0, NotChecked=0, Total=12210 [2018-04-12 21:00:19,050 INFO L87 Difference]: Start difference. First operand 1310 states and 1524 transitions. Second operand 111 states. [2018-04-12 21:00:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:26,120 INFO L93 Difference]: Finished difference Result 1432 states and 1649 transitions. [2018-04-12 21:00:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-12 21:00:26,120 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 542 [2018-04-12 21:00:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:26,121 INFO L225 Difference]: With dead ends: 1432 [2018-04-12 21:00:26,121 INFO L226 Difference]: Without dead ends: 1432 [2018-04-12 21:00:26,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=17661, Invalid=29645, Unknown=0, NotChecked=0, Total=47306 [2018-04-12 21:00:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2018-04-12 21:00:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1322. [2018-04-12 21:00:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-04-12 21:00:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1538 transitions. [2018-04-12 21:00:26,128 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1538 transitions. Word has length 542 [2018-04-12 21:00:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:26,128 INFO L459 AbstractCegarLoop]: Abstraction has 1322 states and 1538 transitions. [2018-04-12 21:00:26,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-12 21:00:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1538 transitions. [2018-04-12 21:00:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-04-12 21:00:26,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:26,130 INFO L355 BasicCegarLoop]: trace histogram [109, 108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:26,130 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash 850978856, now seen corresponding path program 108 times [2018-04-12 21:00:26,130 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:26,143 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:28,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:28,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-04-12 21:00:28,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:28,541 INFO L182 omatonBuilderFactory]: Interpolants [170534#(<= main_~i~0 0), 170535#(<= main_~i~0 1), 170532#true, 170533#false, 170538#(<= main_~i~0 4), 170539#(<= main_~i~0 5), 170536#(<= main_~i~0 2), 170537#(<= main_~i~0 3), 170542#(<= main_~i~0 8), 170543#(<= main_~i~0 9), 170540#(<= main_~i~0 6), 170541#(<= main_~i~0 7), 170546#(<= main_~i~0 12), 170547#(<= main_~i~0 13), 170544#(<= main_~i~0 10), 170545#(<= main_~i~0 11), 170550#(<= main_~i~0 16), 170551#(<= main_~i~0 17), 170548#(<= main_~i~0 14), 170549#(<= main_~i~0 15), 170554#(<= main_~i~0 20), 170555#(<= main_~i~0 21), 170552#(<= main_~i~0 18), 170553#(<= main_~i~0 19), 170558#(<= main_~i~0 24), 170559#(<= main_~i~0 25), 170556#(<= main_~i~0 22), 170557#(<= main_~i~0 23), 170562#(<= main_~i~0 28), 170563#(<= main_~i~0 29), 170560#(<= main_~i~0 26), 170561#(<= main_~i~0 27), 170566#(<= main_~i~0 32), 170567#(<= main_~i~0 33), 170564#(<= main_~i~0 30), 170565#(<= main_~i~0 31), 170570#(<= main_~i~0 36), 170571#(<= main_~i~0 37), 170568#(<= main_~i~0 34), 170569#(<= main_~i~0 35), 170574#(<= main_~i~0 40), 170575#(<= main_~i~0 41), 170572#(<= main_~i~0 38), 170573#(<= main_~i~0 39), 170578#(<= main_~i~0 44), 170579#(<= main_~i~0 45), 170576#(<= main_~i~0 42), 170577#(<= main_~i~0 43), 170582#(<= main_~i~0 48), 170583#(<= main_~i~0 49), 170580#(<= main_~i~0 46), 170581#(<= main_~i~0 47), 170586#(<= main_~i~0 52), 170587#(<= main_~i~0 53), 170584#(<= main_~i~0 50), 170585#(<= main_~i~0 51), 170590#(<= main_~i~0 56), 170591#(<= main_~i~0 57), 170588#(<= main_~i~0 54), 170589#(<= main_~i~0 55), 170594#(<= main_~i~0 60), 170595#(<= main_~i~0 61), 170592#(<= main_~i~0 58), 170593#(<= main_~i~0 59), 170598#(<= main_~i~0 64), 170599#(<= main_~i~0 65), 170596#(<= main_~i~0 62), 170597#(<= main_~i~0 63), 170602#(<= main_~i~0 68), 170603#(<= main_~i~0 69), 170600#(<= main_~i~0 66), 170601#(<= main_~i~0 67), 170606#(<= main_~i~0 72), 170607#(<= main_~i~0 73), 170604#(<= main_~i~0 70), 170605#(<= main_~i~0 71), 170610#(<= main_~i~0 76), 170611#(<= main_~i~0 77), 170608#(<= main_~i~0 74), 170609#(<= main_~i~0 75), 170614#(<= main_~i~0 80), 170615#(<= main_~i~0 81), 170612#(<= main_~i~0 78), 170613#(<= main_~i~0 79), 170618#(<= main_~i~0 84), 170619#(<= main_~i~0 85), 170616#(<= main_~i~0 82), 170617#(<= main_~i~0 83), 170622#(<= main_~i~0 88), 170623#(<= main_~i~0 89), 170620#(<= main_~i~0 86), 170621#(<= main_~i~0 87), 170626#(<= main_~i~0 92), 170627#(<= main_~i~0 93), 170624#(<= main_~i~0 90), 170625#(<= main_~i~0 91), 170630#(<= main_~i~0 96), 170631#(<= main_~i~0 97), 170628#(<= main_~i~0 94), 170629#(<= main_~i~0 95), 170634#(<= main_~i~0 100), 170635#(<= main_~i~0 101), 170632#(<= main_~i~0 98), 170633#(<= main_~i~0 99), 170638#(<= main_~i~0 104), 170639#(and (<= 0 main_~i~0) (<= main_~i~0 104)), 170636#(<= main_~i~0 102), 170637#(<= main_~i~0 103), 170642#(and (<= 3 main_~i~0) (<= main_~i~0 107)), 170643#(and (<= 4 main_~i~0) (<= main_~i~0 108)), 170640#(and (<= 1 main_~i~0) (<= main_~i~0 105)), 170641#(and (<= 2 main_~i~0) (<= main_~i~0 106))] [2018-04-12 21:00:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 29106 backedges. 0 proven. 29106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:28,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-12 21:00:28,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-12 21:00:28,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5682, Invalid=6750, Unknown=0, NotChecked=0, Total=12432 [2018-04-12 21:00:28,543 INFO L87 Difference]: Start difference. First operand 1322 states and 1538 transitions. Second operand 112 states. [2018-04-12 21:00:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:36,305 INFO L93 Difference]: Finished difference Result 1445 states and 1664 transitions. [2018-04-12 21:00:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-12 21:00:36,306 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 547 [2018-04-12 21:00:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:36,307 INFO L225 Difference]: With dead ends: 1445 [2018-04-12 21:00:36,307 INFO L226 Difference]: Without dead ends: 1445 [2018-04-12 21:00:36,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6305 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=17343, Invalid=30837, Unknown=0, NotChecked=0, Total=48180 [2018-04-12 21:00:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-04-12 21:00:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1334. [2018-04-12 21:00:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2018-04-12 21:00:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1552 transitions. [2018-04-12 21:00:36,313 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1552 transitions. Word has length 547 [2018-04-12 21:00:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:36,314 INFO L459 AbstractCegarLoop]: Abstraction has 1334 states and 1552 transitions. [2018-04-12 21:00:36,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-12 21:00:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1552 transitions. [2018-04-12 21:00:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-04-12 21:00:36,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:36,315 INFO L355 BasicCegarLoop]: trace histogram [110, 109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:36,315 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash -334865963, now seen corresponding path program 109 times [2018-04-12 21:00:36,316 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:36,328 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:38,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:38,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-04-12 21:00:38,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:38,828 INFO L182 omatonBuilderFactory]: Interpolants [173639#true, 173642#(<= main_~i~0 1), 173643#(<= main_~i~0 2), 173640#false, 173641#(<= main_~i~0 0), 173646#(<= main_~i~0 5), 173647#(<= main_~i~0 6), 173644#(<= main_~i~0 3), 173645#(<= main_~i~0 4), 173650#(<= main_~i~0 9), 173651#(<= main_~i~0 10), 173648#(<= main_~i~0 7), 173649#(<= main_~i~0 8), 173654#(<= main_~i~0 13), 173655#(<= main_~i~0 14), 173652#(<= main_~i~0 11), 173653#(<= main_~i~0 12), 173658#(<= main_~i~0 17), 173659#(<= main_~i~0 18), 173656#(<= main_~i~0 15), 173657#(<= main_~i~0 16), 173662#(<= main_~i~0 21), 173663#(<= main_~i~0 22), 173660#(<= main_~i~0 19), 173661#(<= main_~i~0 20), 173666#(<= main_~i~0 25), 173667#(<= main_~i~0 26), 173664#(<= main_~i~0 23), 173665#(<= main_~i~0 24), 173670#(<= main_~i~0 29), 173671#(<= main_~i~0 30), 173668#(<= main_~i~0 27), 173669#(<= main_~i~0 28), 173674#(<= main_~i~0 33), 173675#(<= main_~i~0 34), 173672#(<= main_~i~0 31), 173673#(<= main_~i~0 32), 173678#(<= main_~i~0 37), 173679#(<= main_~i~0 38), 173676#(<= main_~i~0 35), 173677#(<= main_~i~0 36), 173682#(<= main_~i~0 41), 173683#(<= main_~i~0 42), 173680#(<= main_~i~0 39), 173681#(<= main_~i~0 40), 173686#(<= main_~i~0 45), 173687#(<= main_~i~0 46), 173684#(<= main_~i~0 43), 173685#(<= main_~i~0 44), 173690#(<= main_~i~0 49), 173691#(<= main_~i~0 50), 173688#(<= main_~i~0 47), 173689#(<= main_~i~0 48), 173694#(<= main_~i~0 53), 173695#(<= main_~i~0 54), 173692#(<= main_~i~0 51), 173693#(<= main_~i~0 52), 173698#(<= main_~i~0 57), 173699#(<= main_~i~0 58), 173696#(<= main_~i~0 55), 173697#(<= main_~i~0 56), 173702#(<= main_~i~0 61), 173703#(<= main_~i~0 62), 173700#(<= main_~i~0 59), 173701#(<= main_~i~0 60), 173706#(<= main_~i~0 65), 173707#(<= main_~i~0 66), 173704#(<= main_~i~0 63), 173705#(<= main_~i~0 64), 173710#(<= main_~i~0 69), 173711#(<= main_~i~0 70), 173708#(<= main_~i~0 67), 173709#(<= main_~i~0 68), 173714#(<= main_~i~0 73), 173715#(<= main_~i~0 74), 173712#(<= main_~i~0 71), 173713#(<= main_~i~0 72), 173718#(<= main_~i~0 77), 173719#(<= main_~i~0 78), 173716#(<= main_~i~0 75), 173717#(<= main_~i~0 76), 173722#(<= main_~i~0 81), 173723#(<= main_~i~0 82), 173720#(<= main_~i~0 79), 173721#(<= main_~i~0 80), 173726#(<= main_~i~0 85), 173727#(<= main_~i~0 86), 173724#(<= main_~i~0 83), 173725#(<= main_~i~0 84), 173730#(<= main_~i~0 89), 173731#(<= main_~i~0 90), 173728#(<= main_~i~0 87), 173729#(<= main_~i~0 88), 173734#(<= main_~i~0 93), 173735#(<= main_~i~0 94), 173732#(<= main_~i~0 91), 173733#(<= main_~i~0 92), 173738#(<= main_~i~0 97), 173739#(<= main_~i~0 98), 173736#(<= main_~i~0 95), 173737#(<= main_~i~0 96), 173742#(<= main_~i~0 101), 173743#(<= main_~i~0 102), 173740#(<= main_~i~0 99), 173741#(<= main_~i~0 100), 173746#(<= main_~i~0 105), 173747#(<= main_~i~0 106), 173744#(<= main_~i~0 103), 173745#(<= main_~i~0 104), 173750#(and (<= 0 main_~i~0) (<= main_~i~0 108)), 173751#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 173748#(<= main_~i~0 107), 173749#(<= main_~i~0 108)] [2018-04-12 21:00:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 29648 backedges. 0 proven. 29648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:38,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-12 21:00:38,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-12 21:00:38,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6110, Invalid=6546, Unknown=0, NotChecked=0, Total=12656 [2018-04-12 21:00:38,830 INFO L87 Difference]: Start difference. First operand 1334 states and 1552 transitions. Second operand 113 states. [2018-04-12 21:00:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:46,336 INFO L93 Difference]: Finished difference Result 1458 states and 1679 transitions. [2018-04-12 21:00:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-12 21:00:46,336 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 552 [2018-04-12 21:00:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:46,337 INFO L225 Difference]: With dead ends: 1458 [2018-04-12 21:00:46,337 INFO L226 Difference]: Without dead ends: 1458 [2018-04-12 21:00:46,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=18318, Invalid=30744, Unknown=0, NotChecked=0, Total=49062 [2018-04-12 21:00:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-04-12 21:00:46,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1346. [2018-04-12 21:00:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-04-12 21:00:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1566 transitions. [2018-04-12 21:00:46,344 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1566 transitions. Word has length 552 [2018-04-12 21:00:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:46,345 INFO L459 AbstractCegarLoop]: Abstraction has 1346 states and 1566 transitions. [2018-04-12 21:00:46,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-12 21:00:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1566 transitions. [2018-04-12 21:00:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-04-12 21:00:46,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:46,347 INFO L355 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:46,347 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1479404616, now seen corresponding path program 110 times [2018-04-12 21:00:46,347 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:46,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:48,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:48,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-04-12 21:00:48,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:48,864 INFO L182 omatonBuilderFactory]: Interpolants [176774#true, 176775#false, 176778#(<= main_~i~0 2), 176779#(<= main_~i~0 3), 176776#(<= main_~i~0 0), 176777#(<= main_~i~0 1), 176782#(<= main_~i~0 6), 176783#(<= main_~i~0 7), 176780#(<= main_~i~0 4), 176781#(<= main_~i~0 5), 176786#(<= main_~i~0 10), 176787#(<= main_~i~0 11), 176784#(<= main_~i~0 8), 176785#(<= main_~i~0 9), 176790#(<= main_~i~0 14), 176791#(<= main_~i~0 15), 176788#(<= main_~i~0 12), 176789#(<= main_~i~0 13), 176794#(<= main_~i~0 18), 176795#(<= main_~i~0 19), 176792#(<= main_~i~0 16), 176793#(<= main_~i~0 17), 176798#(<= main_~i~0 22), 176799#(<= main_~i~0 23), 176796#(<= main_~i~0 20), 176797#(<= main_~i~0 21), 176802#(<= main_~i~0 26), 176803#(<= main_~i~0 27), 176800#(<= main_~i~0 24), 176801#(<= main_~i~0 25), 176806#(<= main_~i~0 30), 176807#(<= main_~i~0 31), 176804#(<= main_~i~0 28), 176805#(<= main_~i~0 29), 176810#(<= main_~i~0 34), 176811#(<= main_~i~0 35), 176808#(<= main_~i~0 32), 176809#(<= main_~i~0 33), 176814#(<= main_~i~0 38), 176815#(<= main_~i~0 39), 176812#(<= main_~i~0 36), 176813#(<= main_~i~0 37), 176818#(<= main_~i~0 42), 176819#(<= main_~i~0 43), 176816#(<= main_~i~0 40), 176817#(<= main_~i~0 41), 176822#(<= main_~i~0 46), 176823#(<= main_~i~0 47), 176820#(<= main_~i~0 44), 176821#(<= main_~i~0 45), 176826#(<= main_~i~0 50), 176827#(<= main_~i~0 51), 176824#(<= main_~i~0 48), 176825#(<= main_~i~0 49), 176830#(<= main_~i~0 54), 176831#(<= main_~i~0 55), 176828#(<= main_~i~0 52), 176829#(<= main_~i~0 53), 176834#(<= main_~i~0 58), 176835#(<= main_~i~0 59), 176832#(<= main_~i~0 56), 176833#(<= main_~i~0 57), 176838#(<= main_~i~0 62), 176839#(<= main_~i~0 63), 176836#(<= main_~i~0 60), 176837#(<= main_~i~0 61), 176842#(<= main_~i~0 66), 176843#(<= main_~i~0 67), 176840#(<= main_~i~0 64), 176841#(<= main_~i~0 65), 176846#(<= main_~i~0 70), 176847#(<= main_~i~0 71), 176844#(<= main_~i~0 68), 176845#(<= main_~i~0 69), 176850#(<= main_~i~0 74), 176851#(<= main_~i~0 75), 176848#(<= main_~i~0 72), 176849#(<= main_~i~0 73), 176854#(<= main_~i~0 78), 176855#(<= main_~i~0 79), 176852#(<= main_~i~0 76), 176853#(<= main_~i~0 77), 176858#(<= main_~i~0 82), 176859#(<= main_~i~0 83), 176856#(<= main_~i~0 80), 176857#(<= main_~i~0 81), 176862#(<= main_~i~0 86), 176863#(<= main_~i~0 87), 176860#(<= main_~i~0 84), 176861#(<= main_~i~0 85), 176866#(<= main_~i~0 90), 176867#(<= main_~i~0 91), 176864#(<= main_~i~0 88), 176865#(<= main_~i~0 89), 176870#(<= main_~i~0 94), 176871#(<= main_~i~0 95), 176868#(<= main_~i~0 92), 176869#(<= main_~i~0 93), 176874#(<= main_~i~0 98), 176875#(<= main_~i~0 99), 176872#(<= main_~i~0 96), 176873#(<= main_~i~0 97), 176878#(<= main_~i~0 102), 176879#(<= main_~i~0 103), 176876#(<= main_~i~0 100), 176877#(<= main_~i~0 101), 176882#(<= main_~i~0 106), 176883#(<= main_~i~0 107), 176880#(<= main_~i~0 104), 176881#(<= main_~i~0 105), 176886#(and (<= 1 main_~i~0) (<= main_~i~0 109)), 176887#(and (<= 2 main_~i~0) (<= main_~i~0 110)), 176884#(<= main_~i~0 108), 176885#(and (<= 0 main_~i~0) (<= main_~i~0 108))] [2018-04-12 21:00:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30195 backedges. 0 proven. 30195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:48,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-12 21:00:48,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-12 21:00:48,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6112, Invalid=6770, Unknown=0, NotChecked=0, Total=12882 [2018-04-12 21:00:48,866 INFO L87 Difference]: Start difference. First operand 1346 states and 1566 transitions. Second operand 114 states. [2018-04-12 21:00:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:00:56,612 INFO L93 Difference]: Finished difference Result 1471 states and 1694 transitions. [2018-04-12 21:00:56,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-12 21:00:56,612 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 557 [2018-04-12 21:00:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:00:56,613 INFO L225 Difference]: With dead ends: 1471 [2018-04-12 21:00:56,613 INFO L226 Difference]: Without dead ends: 1471 [2018-04-12 21:00:56,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6322 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=18431, Invalid=31521, Unknown=0, NotChecked=0, Total=49952 [2018-04-12 21:00:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-04-12 21:00:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1358. [2018-04-12 21:00:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-12 21:00:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1580 transitions. [2018-04-12 21:00:56,621 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1580 transitions. Word has length 557 [2018-04-12 21:00:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:00:56,621 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1580 transitions. [2018-04-12 21:00:56,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-12 21:00:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1580 transitions. [2018-04-12 21:00:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-04-12 21:00:56,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:00:56,623 INFO L355 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 111, 1, 1, 1, 1, 1, 1] [2018-04-12 21:00:56,623 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:00:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -239933003, now seen corresponding path program 111 times [2018-04-12 21:00:56,624 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:00:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:00:56,636 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:00:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:59,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:00:59,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-04-12 21:00:59,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:00:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:59,298 INFO L182 omatonBuilderFactory]: Interpolants [179970#(<= main_~i~0 31), 179971#(<= main_~i~0 32), 179968#(<= main_~i~0 29), 179969#(<= main_~i~0 30), 179974#(<= main_~i~0 35), 179975#(<= main_~i~0 36), 179972#(<= main_~i~0 33), 179973#(<= main_~i~0 34), 179978#(<= main_~i~0 39), 179979#(<= main_~i~0 40), 179976#(<= main_~i~0 37), 179977#(<= main_~i~0 38), 179982#(<= main_~i~0 43), 179983#(<= main_~i~0 44), 179980#(<= main_~i~0 41), 179981#(<= main_~i~0 42), 179986#(<= main_~i~0 47), 179987#(<= main_~i~0 48), 179984#(<= main_~i~0 45), 179985#(<= main_~i~0 46), 179990#(<= main_~i~0 51), 179991#(<= main_~i~0 52), 179988#(<= main_~i~0 49), 179989#(<= main_~i~0 50), 179994#(<= main_~i~0 55), 179995#(<= main_~i~0 56), 179992#(<= main_~i~0 53), 179993#(<= main_~i~0 54), 179998#(<= main_~i~0 59), 179999#(<= main_~i~0 60), 179996#(<= main_~i~0 57), 179997#(<= main_~i~0 58), 180002#(<= main_~i~0 63), 180003#(<= main_~i~0 64), 180000#(<= main_~i~0 61), 180001#(<= main_~i~0 62), 180006#(<= main_~i~0 67), 180007#(<= main_~i~0 68), 180004#(<= main_~i~0 65), 180005#(<= main_~i~0 66), 180010#(<= main_~i~0 71), 180011#(<= main_~i~0 72), 180008#(<= main_~i~0 69), 180009#(<= main_~i~0 70), 180014#(<= main_~i~0 75), 180015#(<= main_~i~0 76), 180012#(<= main_~i~0 73), 180013#(<= main_~i~0 74), 180018#(<= main_~i~0 79), 180019#(<= main_~i~0 80), 180016#(<= main_~i~0 77), 180017#(<= main_~i~0 78), 180022#(<= main_~i~0 83), 180023#(<= main_~i~0 84), 180020#(<= main_~i~0 81), 180021#(<= main_~i~0 82), 180026#(<= main_~i~0 87), 180027#(<= main_~i~0 88), 180024#(<= main_~i~0 85), 180025#(<= main_~i~0 86), 180030#(<= main_~i~0 91), 180031#(<= main_~i~0 92), 180028#(<= main_~i~0 89), 180029#(<= main_~i~0 90), 180034#(<= main_~i~0 95), 180035#(<= main_~i~0 96), 180032#(<= main_~i~0 93), 180033#(<= main_~i~0 94), 180038#(<= main_~i~0 99), 180039#(<= main_~i~0 100), 180036#(<= main_~i~0 97), 180037#(<= main_~i~0 98), 180042#(<= main_~i~0 103), 180043#(<= main_~i~0 104), 180040#(<= main_~i~0 101), 180041#(<= main_~i~0 102), 180046#(<= main_~i~0 107), 180047#(<= main_~i~0 108), 180044#(<= main_~i~0 105), 180045#(<= main_~i~0 106), 180050#(and (<= 0 main_~i~0) (<= main_~i~0 110)), 180051#(and (<= 1 main_~i~0) (<= main_~i~0 111)), 180048#(<= main_~i~0 109), 180049#(<= main_~i~0 110), 179938#false, 179939#(<= main_~i~0 0), 179937#true, 179942#(<= main_~i~0 3), 179943#(<= main_~i~0 4), 179940#(<= main_~i~0 1), 179941#(<= main_~i~0 2), 179946#(<= main_~i~0 7), 179947#(<= main_~i~0 8), 179944#(<= main_~i~0 5), 179945#(<= main_~i~0 6), 179950#(<= main_~i~0 11), 179951#(<= main_~i~0 12), 179948#(<= main_~i~0 9), 179949#(<= main_~i~0 10), 179954#(<= main_~i~0 15), 179955#(<= main_~i~0 16), 179952#(<= main_~i~0 13), 179953#(<= main_~i~0 14), 179958#(<= main_~i~0 19), 179959#(<= main_~i~0 20), 179956#(<= main_~i~0 17), 179957#(<= main_~i~0 18), 179962#(<= main_~i~0 23), 179963#(<= main_~i~0 24), 179960#(<= main_~i~0 21), 179961#(<= main_~i~0 22), 179966#(<= main_~i~0 27), 179967#(<= main_~i~0 28), 179964#(<= main_~i~0 25), 179965#(<= main_~i~0 26)] [2018-04-12 21:00:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30747 backedges. 0 proven. 30747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:00:59,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-04-12 21:00:59,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-04-12 21:00:59,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6333, Invalid=6777, Unknown=0, NotChecked=0, Total=13110 [2018-04-12 21:00:59,300 INFO L87 Difference]: Start difference. First operand 1358 states and 1580 transitions. Second operand 115 states. [2018-04-12 21:01:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:01:07,108 INFO L93 Difference]: Finished difference Result 1484 states and 1709 transitions. [2018-04-12 21:01:07,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-12 21:01:07,108 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 562 [2018-04-12 21:01:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:01:07,109 INFO L225 Difference]: With dead ends: 1484 [2018-04-12 21:01:07,109 INFO L226 Difference]: Without dead ends: 1484 [2018-04-12 21:01:07,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6326 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=18987, Invalid=31863, Unknown=0, NotChecked=0, Total=50850 [2018-04-12 21:01:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-04-12 21:01:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1370. [2018-04-12 21:01:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-04-12 21:01:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1594 transitions. [2018-04-12 21:01:07,116 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1594 transitions. Word has length 562 [2018-04-12 21:01:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:01:07,116 INFO L459 AbstractCegarLoop]: Abstraction has 1370 states and 1594 transitions. [2018-04-12 21:01:07,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-04-12 21:01:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1594 transitions. [2018-04-12 21:01:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-04-12 21:01:07,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:01:07,118 INFO L355 BasicCegarLoop]: trace histogram [113, 112, 112, 112, 112, 1, 1, 1, 1, 1, 1] [2018-04-12 21:01:07,118 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:01:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash 516180072, now seen corresponding path program 112 times [2018-04-12 21:01:07,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:01:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:01:07,131 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:01:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:09,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:01:09,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-04-12 21:01:09,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:01:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:09,627 INFO L182 omatonBuilderFactory]: Interpolants [183130#(<= main_~i~0 0), 183131#(<= main_~i~0 1), 183128#true, 183129#false, 183134#(<= main_~i~0 4), 183135#(<= main_~i~0 5), 183132#(<= main_~i~0 2), 183133#(<= main_~i~0 3), 183138#(<= main_~i~0 8), 183139#(<= main_~i~0 9), 183136#(<= main_~i~0 6), 183137#(<= main_~i~0 7), 183142#(<= main_~i~0 12), 183143#(<= main_~i~0 13), 183140#(<= main_~i~0 10), 183141#(<= main_~i~0 11), 183146#(<= main_~i~0 16), 183147#(<= main_~i~0 17), 183144#(<= main_~i~0 14), 183145#(<= main_~i~0 15), 183150#(<= main_~i~0 20), 183151#(<= main_~i~0 21), 183148#(<= main_~i~0 18), 183149#(<= main_~i~0 19), 183154#(<= main_~i~0 24), 183155#(<= main_~i~0 25), 183152#(<= main_~i~0 22), 183153#(<= main_~i~0 23), 183158#(<= main_~i~0 28), 183159#(<= main_~i~0 29), 183156#(<= main_~i~0 26), 183157#(<= main_~i~0 27), 183162#(<= main_~i~0 32), 183163#(<= main_~i~0 33), 183160#(<= main_~i~0 30), 183161#(<= main_~i~0 31), 183166#(<= main_~i~0 36), 183167#(<= main_~i~0 37), 183164#(<= main_~i~0 34), 183165#(<= main_~i~0 35), 183170#(<= main_~i~0 40), 183171#(<= main_~i~0 41), 183168#(<= main_~i~0 38), 183169#(<= main_~i~0 39), 183174#(<= main_~i~0 44), 183175#(<= main_~i~0 45), 183172#(<= main_~i~0 42), 183173#(<= main_~i~0 43), 183178#(<= main_~i~0 48), 183179#(<= main_~i~0 49), 183176#(<= main_~i~0 46), 183177#(<= main_~i~0 47), 183182#(<= main_~i~0 52), 183183#(<= main_~i~0 53), 183180#(<= main_~i~0 50), 183181#(<= main_~i~0 51), 183186#(<= main_~i~0 56), 183187#(<= main_~i~0 57), 183184#(<= main_~i~0 54), 183185#(<= main_~i~0 55), 183190#(<= main_~i~0 60), 183191#(<= main_~i~0 61), 183188#(<= main_~i~0 58), 183189#(<= main_~i~0 59), 183194#(<= main_~i~0 64), 183195#(<= main_~i~0 65), 183192#(<= main_~i~0 62), 183193#(<= main_~i~0 63), 183198#(<= main_~i~0 68), 183199#(<= main_~i~0 69), 183196#(<= main_~i~0 66), 183197#(<= main_~i~0 67), 183202#(<= main_~i~0 72), 183203#(<= main_~i~0 73), 183200#(<= main_~i~0 70), 183201#(<= main_~i~0 71), 183206#(<= main_~i~0 76), 183207#(<= main_~i~0 77), 183204#(<= main_~i~0 74), 183205#(<= main_~i~0 75), 183210#(<= main_~i~0 80), 183211#(<= main_~i~0 81), 183208#(<= main_~i~0 78), 183209#(<= main_~i~0 79), 183214#(<= main_~i~0 84), 183215#(<= main_~i~0 85), 183212#(<= main_~i~0 82), 183213#(<= main_~i~0 83), 183218#(<= main_~i~0 88), 183219#(<= main_~i~0 89), 183216#(<= main_~i~0 86), 183217#(<= main_~i~0 87), 183222#(<= main_~i~0 92), 183223#(<= main_~i~0 93), 183220#(<= main_~i~0 90), 183221#(<= main_~i~0 91), 183226#(<= main_~i~0 96), 183227#(and (<= main_~i~0 96) (<= 0 main_~i~0)), 183224#(<= main_~i~0 94), 183225#(<= main_~i~0 95), 183230#(and (<= main_~i~0 99) (<= 3 main_~i~0)), 183231#(and (<= 4 main_~i~0) (<= main_~i~0 100)), 183228#(and (<= 1 main_~i~0) (<= main_~i~0 97)), 183229#(and (<= 2 main_~i~0) (<= main_~i~0 98)), 183234#(and (<= 7 main_~i~0) (<= main_~i~0 103)), 183235#(and (<= main_~i~0 104) (<= 8 main_~i~0)), 183232#(and (<= 5 main_~i~0) (<= main_~i~0 101)), 183233#(and (<= 6 main_~i~0) (<= main_~i~0 102)), 183238#(and (<= 11 main_~i~0) (<= main_~i~0 107)), 183239#(and (<= 12 main_~i~0) (<= main_~i~0 108)), 183236#(and (<= 9 main_~i~0) (<= main_~i~0 105)), 183237#(and (<= main_~i~0 106) (<= 10 main_~i~0)), 183242#(and (<= main_~i~0 111) (<= 15 main_~i~0)), 183243#(and (<= main_~i~0 112) (<= 16 main_~i~0)), 183240#(and (<= main_~i~0 109) (<= 13 main_~i~0)), 183241#(and (<= main_~i~0 110) (<= 14 main_~i~0))] [2018-04-12 21:01:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31304 backedges. 0 proven. 31304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:09,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-12 21:01:09,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-12 21:01:09,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4886, Invalid=8454, Unknown=0, NotChecked=0, Total=13340 [2018-04-12 21:01:09,629 INFO L87 Difference]: Start difference. First operand 1370 states and 1594 transitions. Second operand 116 states. [2018-04-12 21:01:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:01:21,479 INFO L93 Difference]: Finished difference Result 1497 states and 1724 transitions. [2018-04-12 21:01:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-12 21:01:21,479 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 567 [2018-04-12 21:01:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:01:21,480 INFO L225 Difference]: With dead ends: 1497 [2018-04-12 21:01:21,480 INFO L226 Difference]: Without dead ends: 1497 [2018-04-12 21:01:21,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7879 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16071, Invalid=35685, Unknown=0, NotChecked=0, Total=51756 [2018-04-12 21:01:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-04-12 21:01:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1382. [2018-04-12 21:01:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-04-12 21:01:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1608 transitions. [2018-04-12 21:01:21,488 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1608 transitions. Word has length 567 [2018-04-12 21:01:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:01:21,488 INFO L459 AbstractCegarLoop]: Abstraction has 1382 states and 1608 transitions. [2018-04-12 21:01:21,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-12 21:01:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1608 transitions. [2018-04-12 21:01:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-04-12 21:01:21,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:01:21,490 INFO L355 BasicCegarLoop]: trace histogram [114, 113, 113, 113, 113, 1, 1, 1, 1, 1, 1] [2018-04-12 21:01:21,490 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:01:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash 223420821, now seen corresponding path program 113 times [2018-04-12 21:01:21,491 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:01:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:01:21,505 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:01:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:24,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:01:24,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-04-12 21:01:24,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:01:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:24,211 INFO L182 omatonBuilderFactory]: Interpolants [186370#(<= main_~i~0 21), 186371#(<= main_~i~0 22), 186368#(<= main_~i~0 19), 186369#(<= main_~i~0 20), 186374#(<= main_~i~0 25), 186375#(<= main_~i~0 26), 186372#(<= main_~i~0 23), 186373#(<= main_~i~0 24), 186378#(<= main_~i~0 29), 186379#(<= main_~i~0 30), 186376#(<= main_~i~0 27), 186377#(<= main_~i~0 28), 186382#(<= main_~i~0 33), 186383#(<= main_~i~0 34), 186380#(<= main_~i~0 31), 186381#(<= main_~i~0 32), 186386#(<= main_~i~0 37), 186387#(<= main_~i~0 38), 186384#(<= main_~i~0 35), 186385#(<= main_~i~0 36), 186390#(<= main_~i~0 41), 186391#(<= main_~i~0 42), 186388#(<= main_~i~0 39), 186389#(<= main_~i~0 40), 186394#(<= main_~i~0 45), 186395#(<= main_~i~0 46), 186392#(<= main_~i~0 43), 186393#(<= main_~i~0 44), 186398#(<= main_~i~0 49), 186399#(<= main_~i~0 50), 186396#(<= main_~i~0 47), 186397#(<= main_~i~0 48), 186402#(<= main_~i~0 53), 186403#(<= main_~i~0 54), 186400#(<= main_~i~0 51), 186401#(<= main_~i~0 52), 186406#(<= main_~i~0 57), 186407#(<= main_~i~0 58), 186404#(<= main_~i~0 55), 186405#(<= main_~i~0 56), 186410#(<= main_~i~0 61), 186411#(<= main_~i~0 62), 186408#(<= main_~i~0 59), 186409#(<= main_~i~0 60), 186414#(<= main_~i~0 65), 186415#(<= main_~i~0 66), 186412#(<= main_~i~0 63), 186413#(<= main_~i~0 64), 186418#(<= main_~i~0 69), 186419#(<= main_~i~0 70), 186416#(<= main_~i~0 67), 186417#(<= main_~i~0 68), 186422#(<= main_~i~0 73), 186423#(<= main_~i~0 74), 186420#(<= main_~i~0 71), 186421#(<= main_~i~0 72), 186426#(<= main_~i~0 77), 186427#(<= main_~i~0 78), 186424#(<= main_~i~0 75), 186425#(<= main_~i~0 76), 186430#(<= main_~i~0 81), 186431#(<= main_~i~0 82), 186428#(<= main_~i~0 79), 186429#(<= main_~i~0 80), 186434#(<= main_~i~0 85), 186435#(<= main_~i~0 86), 186432#(<= main_~i~0 83), 186433#(<= main_~i~0 84), 186438#(<= main_~i~0 89), 186439#(<= main_~i~0 90), 186436#(<= main_~i~0 87), 186437#(<= main_~i~0 88), 186442#(<= main_~i~0 93), 186443#(<= main_~i~0 94), 186440#(<= main_~i~0 91), 186441#(<= main_~i~0 92), 186446#(<= main_~i~0 97), 186447#(<= main_~i~0 98), 186444#(<= main_~i~0 95), 186445#(<= main_~i~0 96), 186450#(<= main_~i~0 101), 186451#(<= main_~i~0 102), 186448#(<= main_~i~0 99), 186449#(<= main_~i~0 100), 186454#(<= main_~i~0 105), 186455#(<= main_~i~0 106), 186452#(<= main_~i~0 103), 186453#(<= main_~i~0 104), 186458#(<= main_~i~0 109), 186459#(<= main_~i~0 110), 186456#(<= main_~i~0 107), 186457#(<= main_~i~0 108), 186462#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 186463#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 186460#(<= main_~i~0 111), 186461#(<= main_~i~0 112), 186347#true, 186350#(<= main_~i~0 1), 186351#(<= main_~i~0 2), 186348#false, 186349#(<= main_~i~0 0), 186354#(<= main_~i~0 5), 186355#(<= main_~i~0 6), 186352#(<= main_~i~0 3), 186353#(<= main_~i~0 4), 186358#(<= main_~i~0 9), 186359#(<= main_~i~0 10), 186356#(<= main_~i~0 7), 186357#(<= main_~i~0 8), 186362#(<= main_~i~0 13), 186363#(<= main_~i~0 14), 186360#(<= main_~i~0 11), 186361#(<= main_~i~0 12), 186366#(<= main_~i~0 17), 186367#(<= main_~i~0 18), 186364#(<= main_~i~0 15), 186365#(<= main_~i~0 16)] [2018-04-12 21:01:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31866 backedges. 0 proven. 31866 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:24,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-12 21:01:24,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-12 21:01:24,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6560, Invalid=7012, Unknown=0, NotChecked=0, Total=13572 [2018-04-12 21:01:24,214 INFO L87 Difference]: Start difference. First operand 1382 states and 1608 transitions. Second operand 117 states. [2018-04-12 21:01:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:01:32,276 INFO L93 Difference]: Finished difference Result 1510 states and 1739 transitions. [2018-04-12 21:01:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-12 21:01:32,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 572 [2018-04-12 21:01:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:01:32,278 INFO L225 Difference]: With dead ends: 1510 [2018-04-12 21:01:32,278 INFO L226 Difference]: Without dead ends: 1510 [2018-04-12 21:01:32,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6553 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=19668, Invalid=33002, Unknown=0, NotChecked=0, Total=52670 [2018-04-12 21:01:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-04-12 21:01:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1394. [2018-04-12 21:01:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2018-04-12 21:01:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1622 transitions. [2018-04-12 21:01:32,286 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1622 transitions. Word has length 572 [2018-04-12 21:01:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:01:32,286 INFO L459 AbstractCegarLoop]: Abstraction has 1394 states and 1622 transitions. [2018-04-12 21:01:32,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-12 21:01:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1622 transitions. [2018-04-12 21:01:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-04-12 21:01:32,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:01:32,289 INFO L355 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 114, 1, 1, 1, 1, 1, 1] [2018-04-12 21:01:32,289 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:01:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -290587512, now seen corresponding path program 114 times [2018-04-12 21:01:32,289 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:01:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:01:32,303 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:01:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32433 backedges. 0 proven. 32433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:35,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:01:35,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-04-12 21:01:35,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:01:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:35,042 INFO L182 omatonBuilderFactory]: Interpolants [189698#(<= main_~i~0 102), 189699#(<= main_~i~0 103), 189696#(<= main_~i~0 100), 189697#(<= main_~i~0 101), 189702#(<= main_~i~0 106), 189703#(<= main_~i~0 107), 189700#(<= main_~i~0 104), 189701#(<= main_~i~0 105), 189706#(<= main_~i~0 110), 189707#(<= main_~i~0 111), 189704#(<= main_~i~0 108), 189705#(<= main_~i~0 109), 189710#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 189711#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 189708#(<= main_~i~0 112), 189709#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 189594#true, 189595#false, 189598#(<= main_~i~0 2), 189599#(<= main_~i~0 3), 189596#(<= main_~i~0 0), 189597#(<= main_~i~0 1), 189602#(<= main_~i~0 6), 189603#(<= main_~i~0 7), 189600#(<= main_~i~0 4), 189601#(<= main_~i~0 5), 189606#(<= main_~i~0 10), 189607#(<= main_~i~0 11), 189604#(<= main_~i~0 8), 189605#(<= main_~i~0 9), 189610#(<= main_~i~0 14), 189611#(<= main_~i~0 15), 189608#(<= main_~i~0 12), 189609#(<= main_~i~0 13), 189614#(<= main_~i~0 18), 189615#(<= main_~i~0 19), 189612#(<= main_~i~0 16), 189613#(<= main_~i~0 17), 189618#(<= main_~i~0 22), 189619#(<= main_~i~0 23), 189616#(<= main_~i~0 20), 189617#(<= main_~i~0 21), 189622#(<= main_~i~0 26), 189623#(<= main_~i~0 27), 189620#(<= main_~i~0 24), 189621#(<= main_~i~0 25), 189626#(<= main_~i~0 30), 189627#(<= main_~i~0 31), 189624#(<= main_~i~0 28), 189625#(<= main_~i~0 29), 189630#(<= main_~i~0 34), 189631#(<= main_~i~0 35), 189628#(<= main_~i~0 32), 189629#(<= main_~i~0 33), 189634#(<= main_~i~0 38), 189635#(<= main_~i~0 39), 189632#(<= main_~i~0 36), 189633#(<= main_~i~0 37), 189638#(<= main_~i~0 42), 189639#(<= main_~i~0 43), 189636#(<= main_~i~0 40), 189637#(<= main_~i~0 41), 189642#(<= main_~i~0 46), 189643#(<= main_~i~0 47), 189640#(<= main_~i~0 44), 189641#(<= main_~i~0 45), 189646#(<= main_~i~0 50), 189647#(<= main_~i~0 51), 189644#(<= main_~i~0 48), 189645#(<= main_~i~0 49), 189650#(<= main_~i~0 54), 189651#(<= main_~i~0 55), 189648#(<= main_~i~0 52), 189649#(<= main_~i~0 53), 189654#(<= main_~i~0 58), 189655#(<= main_~i~0 59), 189652#(<= main_~i~0 56), 189653#(<= main_~i~0 57), 189658#(<= main_~i~0 62), 189659#(<= main_~i~0 63), 189656#(<= main_~i~0 60), 189657#(<= main_~i~0 61), 189662#(<= main_~i~0 66), 189663#(<= main_~i~0 67), 189660#(<= main_~i~0 64), 189661#(<= main_~i~0 65), 189666#(<= main_~i~0 70), 189667#(<= main_~i~0 71), 189664#(<= main_~i~0 68), 189665#(<= main_~i~0 69), 189670#(<= main_~i~0 74), 189671#(<= main_~i~0 75), 189668#(<= main_~i~0 72), 189669#(<= main_~i~0 73), 189674#(<= main_~i~0 78), 189675#(<= main_~i~0 79), 189672#(<= main_~i~0 76), 189673#(<= main_~i~0 77), 189678#(<= main_~i~0 82), 189679#(<= main_~i~0 83), 189676#(<= main_~i~0 80), 189677#(<= main_~i~0 81), 189682#(<= main_~i~0 86), 189683#(<= main_~i~0 87), 189680#(<= main_~i~0 84), 189681#(<= main_~i~0 85), 189686#(<= main_~i~0 90), 189687#(<= main_~i~0 91), 189684#(<= main_~i~0 88), 189685#(<= main_~i~0 89), 189690#(<= main_~i~0 94), 189691#(<= main_~i~0 95), 189688#(<= main_~i~0 92), 189689#(<= main_~i~0 93), 189694#(<= main_~i~0 98), 189695#(<= main_~i~0 99), 189692#(<= main_~i~0 96), 189693#(<= main_~i~0 97)] [2018-04-12 21:01:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32433 backedges. 0 proven. 32433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:35,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-12 21:01:35,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-12 21:01:35,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6562, Invalid=7244, Unknown=0, NotChecked=0, Total=13806 [2018-04-12 21:01:35,044 INFO L87 Difference]: Start difference. First operand 1394 states and 1622 transitions. Second operand 118 states. [2018-04-12 21:01:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:01:43,604 INFO L93 Difference]: Finished difference Result 1523 states and 1754 transitions. [2018-04-12 21:01:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-12 21:01:43,604 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 577 [2018-04-12 21:01:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:01:43,606 INFO L225 Difference]: With dead ends: 1523 [2018-04-12 21:01:43,606 INFO L226 Difference]: Without dead ends: 1523 [2018-04-12 21:01:43,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6780 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=19785, Invalid=33807, Unknown=0, NotChecked=0, Total=53592 [2018-04-12 21:01:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-04-12 21:01:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1406. [2018-04-12 21:01:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2018-04-12 21:01:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1636 transitions. [2018-04-12 21:01:43,614 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1636 transitions. Word has length 577 [2018-04-12 21:01:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:01:43,614 INFO L459 AbstractCegarLoop]: Abstraction has 1406 states and 1636 transitions. [2018-04-12 21:01:43,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-12 21:01:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1636 transitions. [2018-04-12 21:01:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-04-12 21:01:43,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:01:43,616 INFO L355 BasicCegarLoop]: trace histogram [116, 115, 115, 115, 115, 1, 1, 1, 1, 1, 1] [2018-04-12 21:01:43,616 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:01:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash 636682613, now seen corresponding path program 115 times [2018-04-12 21:01:43,617 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:01:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:01:43,630 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:01:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 33005 backedges. 0 proven. 33005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:46,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:01:46,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-04-12 21:01:46,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:01:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:46,386 INFO L182 omatonBuilderFactory]: Interpolants [192870#false, 192871#(<= main_~i~0 0), 192869#true, 192874#(<= main_~i~0 3), 192875#(<= main_~i~0 4), 192872#(<= main_~i~0 1), 192873#(<= main_~i~0 2), 192878#(<= main_~i~0 7), 192879#(<= main_~i~0 8), 192876#(<= main_~i~0 5), 192877#(<= main_~i~0 6), 192882#(<= main_~i~0 11), 192883#(<= main_~i~0 12), 192880#(<= main_~i~0 9), 192881#(<= main_~i~0 10), 192886#(<= main_~i~0 15), 192887#(<= main_~i~0 16), 192884#(<= main_~i~0 13), 192885#(<= main_~i~0 14), 192890#(<= main_~i~0 19), 192891#(<= main_~i~0 20), 192888#(<= main_~i~0 17), 192889#(<= main_~i~0 18), 192894#(<= main_~i~0 23), 192895#(<= main_~i~0 24), 192892#(<= main_~i~0 21), 192893#(<= main_~i~0 22), 192898#(<= main_~i~0 27), 192899#(<= main_~i~0 28), 192896#(<= main_~i~0 25), 192897#(<= main_~i~0 26), 192902#(<= main_~i~0 31), 192903#(<= main_~i~0 32), 192900#(<= main_~i~0 29), 192901#(<= main_~i~0 30), 192906#(<= main_~i~0 35), 192907#(<= main_~i~0 36), 192904#(<= main_~i~0 33), 192905#(<= main_~i~0 34), 192910#(<= main_~i~0 39), 192911#(<= main_~i~0 40), 192908#(<= main_~i~0 37), 192909#(<= main_~i~0 38), 192914#(<= main_~i~0 43), 192915#(<= main_~i~0 44), 192912#(<= main_~i~0 41), 192913#(<= main_~i~0 42), 192918#(<= main_~i~0 47), 192919#(<= main_~i~0 48), 192916#(<= main_~i~0 45), 192917#(<= main_~i~0 46), 192922#(<= main_~i~0 51), 192923#(<= main_~i~0 52), 192920#(<= main_~i~0 49), 192921#(<= main_~i~0 50), 192926#(<= main_~i~0 55), 192927#(<= main_~i~0 56), 192924#(<= main_~i~0 53), 192925#(<= main_~i~0 54), 192930#(<= main_~i~0 59), 192931#(<= main_~i~0 60), 192928#(<= main_~i~0 57), 192929#(<= main_~i~0 58), 192934#(<= main_~i~0 63), 192935#(<= main_~i~0 64), 192932#(<= main_~i~0 61), 192933#(<= main_~i~0 62), 192938#(<= main_~i~0 67), 192939#(<= main_~i~0 68), 192936#(<= main_~i~0 65), 192937#(<= main_~i~0 66), 192942#(<= main_~i~0 71), 192943#(<= main_~i~0 72), 192940#(<= main_~i~0 69), 192941#(<= main_~i~0 70), 192946#(<= main_~i~0 75), 192947#(<= main_~i~0 76), 192944#(<= main_~i~0 73), 192945#(<= main_~i~0 74), 192950#(<= main_~i~0 79), 192951#(<= main_~i~0 80), 192948#(<= main_~i~0 77), 192949#(<= main_~i~0 78), 192954#(<= main_~i~0 83), 192955#(<= main_~i~0 84), 192952#(<= main_~i~0 81), 192953#(<= main_~i~0 82), 192958#(<= main_~i~0 87), 192959#(<= main_~i~0 88), 192956#(<= main_~i~0 85), 192957#(<= main_~i~0 86), 192962#(<= main_~i~0 91), 192963#(<= main_~i~0 92), 192960#(<= main_~i~0 89), 192961#(<= main_~i~0 90), 192966#(<= main_~i~0 95), 192967#(<= main_~i~0 96), 192964#(<= main_~i~0 93), 192965#(<= main_~i~0 94), 192970#(<= main_~i~0 99), 192971#(<= main_~i~0 100), 192968#(<= main_~i~0 97), 192969#(<= main_~i~0 98), 192974#(<= main_~i~0 103), 192975#(<= main_~i~0 104), 192972#(<= main_~i~0 101), 192973#(<= main_~i~0 102), 192978#(<= main_~i~0 107), 192979#(<= main_~i~0 108), 192976#(<= main_~i~0 105), 192977#(<= main_~i~0 106), 192982#(<= main_~i~0 111), 192983#(<= main_~i~0 112), 192980#(<= main_~i~0 109), 192981#(<= main_~i~0 110), 192986#(and (<= 0 main_~i~0) (<= main_~i~0 114)), 192987#(and (<= 1 main_~i~0) (<= main_~i~0 115)), 192984#(<= main_~i~0 113), 192985#(<= main_~i~0 114)] [2018-04-12 21:01:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33005 backedges. 0 proven. 33005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:46,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-12 21:01:46,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-12 21:01:46,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6791, Invalid=7251, Unknown=0, NotChecked=0, Total=14042 [2018-04-12 21:01:46,388 INFO L87 Difference]: Start difference. First operand 1406 states and 1636 transitions. Second operand 119 states. [2018-04-12 21:01:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:01:55,069 INFO L93 Difference]: Finished difference Result 1536 states and 1769 transitions. [2018-04-12 21:01:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-12 21:01:55,069 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 582 [2018-04-12 21:01:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:01:55,070 INFO L225 Difference]: With dead ends: 1536 [2018-04-12 21:01:55,070 INFO L226 Difference]: Without dead ends: 1536 [2018-04-12 21:01:55,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6784 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=20361, Invalid=34161, Unknown=0, NotChecked=0, Total=54522 [2018-04-12 21:01:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2018-04-12 21:01:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1418. [2018-04-12 21:01:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2018-04-12 21:01:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1650 transitions. [2018-04-12 21:01:55,077 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1650 transitions. Word has length 582 [2018-04-12 21:01:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:01:55,078 INFO L459 AbstractCegarLoop]: Abstraction has 1418 states and 1650 transitions. [2018-04-12 21:01:55,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-12 21:01:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1650 transitions. [2018-04-12 21:01:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-04-12 21:01:55,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:01:55,080 INFO L355 BasicCegarLoop]: trace histogram [117, 116, 116, 116, 116, 1, 1, 1, 1, 1, 1] [2018-04-12 21:01:55,080 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:01:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 429721768, now seen corresponding path program 116 times [2018-04-12 21:01:55,080 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:01:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:01:55,094 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:01:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 33582 backedges. 0 proven. 33582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:57,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:01:57,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-04-12 21:01:57,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:01:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:57,892 INFO L182 omatonBuilderFactory]: Interpolants [196174#(<= main_~i~0 0), 196175#(<= main_~i~0 1), 196172#true, 196173#false, 196178#(<= main_~i~0 4), 196179#(<= main_~i~0 5), 196176#(<= main_~i~0 2), 196177#(<= main_~i~0 3), 196182#(<= main_~i~0 8), 196183#(<= main_~i~0 9), 196180#(<= main_~i~0 6), 196181#(<= main_~i~0 7), 196186#(<= main_~i~0 12), 196187#(<= main_~i~0 13), 196184#(<= main_~i~0 10), 196185#(<= main_~i~0 11), 196190#(<= main_~i~0 16), 196191#(<= main_~i~0 17), 196188#(<= main_~i~0 14), 196189#(<= main_~i~0 15), 196194#(<= main_~i~0 20), 196195#(<= main_~i~0 21), 196192#(<= main_~i~0 18), 196193#(<= main_~i~0 19), 196198#(<= main_~i~0 24), 196199#(<= main_~i~0 25), 196196#(<= main_~i~0 22), 196197#(<= main_~i~0 23), 196202#(<= main_~i~0 28), 196203#(<= main_~i~0 29), 196200#(<= main_~i~0 26), 196201#(<= main_~i~0 27), 196206#(<= main_~i~0 32), 196207#(<= main_~i~0 33), 196204#(<= main_~i~0 30), 196205#(<= main_~i~0 31), 196210#(<= main_~i~0 36), 196211#(<= main_~i~0 37), 196208#(<= main_~i~0 34), 196209#(<= main_~i~0 35), 196214#(<= main_~i~0 40), 196215#(<= main_~i~0 41), 196212#(<= main_~i~0 38), 196213#(<= main_~i~0 39), 196218#(<= main_~i~0 44), 196219#(<= main_~i~0 45), 196216#(<= main_~i~0 42), 196217#(<= main_~i~0 43), 196222#(<= main_~i~0 48), 196223#(<= main_~i~0 49), 196220#(<= main_~i~0 46), 196221#(<= main_~i~0 47), 196226#(<= main_~i~0 52), 196227#(<= main_~i~0 53), 196224#(<= main_~i~0 50), 196225#(<= main_~i~0 51), 196230#(<= main_~i~0 56), 196231#(<= main_~i~0 57), 196228#(<= main_~i~0 54), 196229#(<= main_~i~0 55), 196234#(<= main_~i~0 60), 196235#(<= main_~i~0 61), 196232#(<= main_~i~0 58), 196233#(<= main_~i~0 59), 196238#(<= main_~i~0 64), 196239#(<= main_~i~0 65), 196236#(<= main_~i~0 62), 196237#(<= main_~i~0 63), 196242#(<= main_~i~0 68), 196243#(<= main_~i~0 69), 196240#(<= main_~i~0 66), 196241#(<= main_~i~0 67), 196246#(<= main_~i~0 72), 196247#(<= main_~i~0 73), 196244#(<= main_~i~0 70), 196245#(<= main_~i~0 71), 196250#(<= main_~i~0 76), 196251#(<= main_~i~0 77), 196248#(<= main_~i~0 74), 196249#(<= main_~i~0 75), 196254#(<= main_~i~0 80), 196255#(<= main_~i~0 81), 196252#(<= main_~i~0 78), 196253#(<= main_~i~0 79), 196258#(<= main_~i~0 84), 196259#(<= main_~i~0 85), 196256#(<= main_~i~0 82), 196257#(<= main_~i~0 83), 196262#(<= main_~i~0 88), 196263#(<= main_~i~0 89), 196260#(<= main_~i~0 86), 196261#(<= main_~i~0 87), 196266#(<= main_~i~0 92), 196267#(<= main_~i~0 93), 196264#(<= main_~i~0 90), 196265#(<= main_~i~0 91), 196270#(<= main_~i~0 96), 196271#(<= main_~i~0 97), 196268#(<= main_~i~0 94), 196269#(<= main_~i~0 95), 196274#(<= main_~i~0 100), 196275#(<= main_~i~0 101), 196272#(<= main_~i~0 98), 196273#(<= main_~i~0 99), 196278#(<= main_~i~0 104), 196279#(<= main_~i~0 105), 196276#(<= main_~i~0 102), 196277#(<= main_~i~0 103), 196282#(<= main_~i~0 108), 196283#(<= main_~i~0 109), 196280#(<= main_~i~0 106), 196281#(<= main_~i~0 107), 196286#(<= main_~i~0 112), 196287#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 196284#(<= main_~i~0 110), 196285#(<= main_~i~0 111), 196290#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 196291#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 196288#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 196289#(and (<= 2 main_~i~0) (<= main_~i~0 114))] [2018-04-12 21:01:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33582 backedges. 0 proven. 33582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:01:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-12 21:01:57,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-12 21:01:57,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=7714, Unknown=0, NotChecked=0, Total=14280 [2018-04-12 21:01:57,894 INFO L87 Difference]: Start difference. First operand 1418 states and 1650 transitions. Second operand 120 states. [2018-04-12 21:02:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:02:07,494 INFO L93 Difference]: Finished difference Result 1549 states and 1784 transitions. [2018-04-12 21:02:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-12 21:02:07,495 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 587 [2018-04-12 21:02:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:02:07,496 INFO L225 Difference]: With dead ends: 1549 [2018-04-12 21:02:07,496 INFO L226 Difference]: Without dead ends: 1549 [2018-04-12 21:02:07,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7237 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=20019, Invalid=35441, Unknown=0, NotChecked=0, Total=55460 [2018-04-12 21:02:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2018-04-12 21:02:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1430. [2018-04-12 21:02:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2018-04-12 21:02:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1664 transitions. [2018-04-12 21:02:07,503 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1664 transitions. Word has length 587 [2018-04-12 21:02:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:02:07,504 INFO L459 AbstractCegarLoop]: Abstraction has 1430 states and 1664 transitions. [2018-04-12 21:02:07,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-12 21:02:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1664 transitions. [2018-04-12 21:02:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-12 21:02:07,506 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:02:07,506 INFO L355 BasicCegarLoop]: trace histogram [118, 117, 117, 117, 117, 1, 1, 1, 1, 1, 1] [2018-04-12 21:02:07,506 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:02:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash 690391381, now seen corresponding path program 117 times [2018-04-12 21:02:07,506 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:02:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:02:07,520 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:02:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34164 backedges. 0 proven. 34164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:10,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:02:10,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-04-12 21:02:10,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:02:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:10,454 INFO L182 omatonBuilderFactory]: Interpolants [199503#true, 199507#(<= main_~i~0 2), 199506#(<= main_~i~0 1), 199505#(<= main_~i~0 0), 199504#false, 199511#(<= main_~i~0 6), 199510#(<= main_~i~0 5), 199509#(<= main_~i~0 4), 199508#(<= main_~i~0 3), 199515#(<= main_~i~0 10), 199514#(<= main_~i~0 9), 199513#(<= main_~i~0 8), 199512#(<= main_~i~0 7), 199519#(<= main_~i~0 14), 199518#(<= main_~i~0 13), 199517#(<= main_~i~0 12), 199516#(<= main_~i~0 11), 199523#(<= main_~i~0 18), 199522#(<= main_~i~0 17), 199521#(<= main_~i~0 16), 199520#(<= main_~i~0 15), 199527#(<= main_~i~0 22), 199526#(<= main_~i~0 21), 199525#(<= main_~i~0 20), 199524#(<= main_~i~0 19), 199531#(<= main_~i~0 26), 199530#(<= main_~i~0 25), 199529#(<= main_~i~0 24), 199528#(<= main_~i~0 23), 199535#(<= main_~i~0 30), 199534#(<= main_~i~0 29), 199533#(<= main_~i~0 28), 199532#(<= main_~i~0 27), 199539#(<= main_~i~0 34), 199538#(<= main_~i~0 33), 199537#(<= main_~i~0 32), 199536#(<= main_~i~0 31), 199543#(<= main_~i~0 38), 199542#(<= main_~i~0 37), 199541#(<= main_~i~0 36), 199540#(<= main_~i~0 35), 199547#(<= main_~i~0 42), 199546#(<= main_~i~0 41), 199545#(<= main_~i~0 40), 199544#(<= main_~i~0 39), 199551#(<= main_~i~0 46), 199550#(<= main_~i~0 45), 199549#(<= main_~i~0 44), 199548#(<= main_~i~0 43), 199555#(<= main_~i~0 50), 199554#(<= main_~i~0 49), 199553#(<= main_~i~0 48), 199552#(<= main_~i~0 47), 199559#(<= main_~i~0 54), 199558#(<= main_~i~0 53), 199557#(<= main_~i~0 52), 199556#(<= main_~i~0 51), 199563#(<= main_~i~0 58), 199562#(<= main_~i~0 57), 199561#(<= main_~i~0 56), 199560#(<= main_~i~0 55), 199567#(<= main_~i~0 62), 199566#(<= main_~i~0 61), 199565#(<= main_~i~0 60), 199564#(<= main_~i~0 59), 199571#(<= main_~i~0 66), 199570#(<= main_~i~0 65), 199569#(<= main_~i~0 64), 199568#(<= main_~i~0 63), 199575#(<= main_~i~0 70), 199574#(<= main_~i~0 69), 199573#(<= main_~i~0 68), 199572#(<= main_~i~0 67), 199579#(<= main_~i~0 74), 199578#(<= main_~i~0 73), 199577#(<= main_~i~0 72), 199576#(<= main_~i~0 71), 199583#(<= main_~i~0 78), 199582#(<= main_~i~0 77), 199581#(<= main_~i~0 76), 199580#(<= main_~i~0 75), 199587#(<= main_~i~0 82), 199586#(<= main_~i~0 81), 199585#(<= main_~i~0 80), 199584#(<= main_~i~0 79), 199591#(<= main_~i~0 86), 199590#(<= main_~i~0 85), 199589#(<= main_~i~0 84), 199588#(<= main_~i~0 83), 199595#(<= main_~i~0 90), 199594#(<= main_~i~0 89), 199593#(<= main_~i~0 88), 199592#(<= main_~i~0 87), 199599#(<= main_~i~0 94), 199598#(<= main_~i~0 93), 199597#(<= main_~i~0 92), 199596#(<= main_~i~0 91), 199603#(<= main_~i~0 98), 199602#(<= main_~i~0 97), 199601#(<= main_~i~0 96), 199600#(<= main_~i~0 95), 199607#(<= main_~i~0 102), 199606#(<= main_~i~0 101), 199605#(<= main_~i~0 100), 199604#(<= main_~i~0 99), 199611#(<= main_~i~0 106), 199610#(<= main_~i~0 105), 199609#(<= main_~i~0 104), 199608#(<= main_~i~0 103), 199615#(<= main_~i~0 110), 199614#(<= main_~i~0 109), 199613#(<= main_~i~0 108), 199612#(<= main_~i~0 107), 199619#(<= main_~i~0 114), 199618#(<= main_~i~0 113), 199617#(<= main_~i~0 112), 199616#(<= main_~i~0 111), 199623#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 199622#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 199621#(<= main_~i~0 116), 199620#(<= main_~i~0 115)] [2018-04-12 21:02:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34164 backedges. 0 proven. 34164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:10,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-12 21:02:10,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-12 21:02:10,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7026, Invalid=7494, Unknown=0, NotChecked=0, Total=14520 [2018-04-12 21:02:10,456 INFO L87 Difference]: Start difference. First operand 1430 states and 1664 transitions. Second operand 121 states. [2018-04-12 21:02:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:02:19,146 INFO L93 Difference]: Finished difference Result 1562 states and 1799 transitions. [2018-04-12 21:02:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-12 21:02:19,146 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 592 [2018-04-12 21:02:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:02:19,148 INFO L225 Difference]: With dead ends: 1562 [2018-04-12 21:02:19,148 INFO L226 Difference]: Without dead ends: 1562 [2018-04-12 21:02:19,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7019 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=21066, Invalid=35340, Unknown=0, NotChecked=0, Total=56406 [2018-04-12 21:02:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-04-12 21:02:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1442. [2018-04-12 21:02:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-04-12 21:02:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1678 transitions. [2018-04-12 21:02:19,156 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1678 transitions. Word has length 592 [2018-04-12 21:02:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:02:19,156 INFO L459 AbstractCegarLoop]: Abstraction has 1442 states and 1678 transitions. [2018-04-12 21:02:19,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-12 21:02:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1678 transitions. [2018-04-12 21:02:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-12 21:02:19,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:02:19,159 INFO L355 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 118, 1, 1, 1, 1, 1, 1] [2018-04-12 21:02:19,159 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:02:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -87855928, now seen corresponding path program 118 times [2018-04-12 21:02:19,159 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:02:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:02:19,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:02:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 34751 backedges. 0 proven. 34751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:22,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:02:22,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-04-12 21:02:22,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:02:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:22,163 INFO L182 omatonBuilderFactory]: Interpolants [202863#false, 202862#true, 202867#(<= main_~i~0 3), 202866#(<= main_~i~0 2), 202865#(<= main_~i~0 1), 202864#(<= main_~i~0 0), 202871#(<= main_~i~0 7), 202870#(<= main_~i~0 6), 202869#(<= main_~i~0 5), 202868#(<= main_~i~0 4), 202875#(<= main_~i~0 11), 202874#(<= main_~i~0 10), 202873#(<= main_~i~0 9), 202872#(<= main_~i~0 8), 202879#(<= main_~i~0 15), 202878#(<= main_~i~0 14), 202877#(<= main_~i~0 13), 202876#(<= main_~i~0 12), 202883#(<= main_~i~0 19), 202882#(<= main_~i~0 18), 202881#(<= main_~i~0 17), 202880#(<= main_~i~0 16), 202887#(<= main_~i~0 23), 202886#(<= main_~i~0 22), 202885#(<= main_~i~0 21), 202884#(<= main_~i~0 20), 202891#(<= main_~i~0 27), 202890#(<= main_~i~0 26), 202889#(<= main_~i~0 25), 202888#(<= main_~i~0 24), 202895#(<= main_~i~0 31), 202894#(<= main_~i~0 30), 202893#(<= main_~i~0 29), 202892#(<= main_~i~0 28), 202899#(<= main_~i~0 35), 202898#(<= main_~i~0 34), 202897#(<= main_~i~0 33), 202896#(<= main_~i~0 32), 202903#(<= main_~i~0 39), 202902#(<= main_~i~0 38), 202901#(<= main_~i~0 37), 202900#(<= main_~i~0 36), 202907#(<= main_~i~0 43), 202906#(<= main_~i~0 42), 202905#(<= main_~i~0 41), 202904#(<= main_~i~0 40), 202911#(<= main_~i~0 47), 202910#(<= main_~i~0 46), 202909#(<= main_~i~0 45), 202908#(<= main_~i~0 44), 202915#(<= main_~i~0 51), 202914#(<= main_~i~0 50), 202913#(<= main_~i~0 49), 202912#(<= main_~i~0 48), 202919#(<= main_~i~0 55), 202918#(<= main_~i~0 54), 202917#(<= main_~i~0 53), 202916#(<= main_~i~0 52), 202923#(<= main_~i~0 59), 202922#(<= main_~i~0 58), 202921#(<= main_~i~0 57), 202920#(<= main_~i~0 56), 202927#(<= main_~i~0 63), 202926#(<= main_~i~0 62), 202925#(<= main_~i~0 61), 202924#(<= main_~i~0 60), 202931#(<= main_~i~0 67), 202930#(<= main_~i~0 66), 202929#(<= main_~i~0 65), 202928#(<= main_~i~0 64), 202935#(<= main_~i~0 71), 202934#(<= main_~i~0 70), 202933#(<= main_~i~0 69), 202932#(<= main_~i~0 68), 202939#(<= main_~i~0 75), 202938#(<= main_~i~0 74), 202937#(<= main_~i~0 73), 202936#(<= main_~i~0 72), 202943#(<= main_~i~0 79), 202942#(<= main_~i~0 78), 202941#(<= main_~i~0 77), 202940#(<= main_~i~0 76), 202947#(<= main_~i~0 83), 202946#(<= main_~i~0 82), 202945#(<= main_~i~0 81), 202944#(<= main_~i~0 80), 202951#(<= main_~i~0 87), 202950#(<= main_~i~0 86), 202949#(<= main_~i~0 85), 202948#(<= main_~i~0 84), 202955#(<= main_~i~0 91), 202954#(<= main_~i~0 90), 202953#(<= main_~i~0 89), 202952#(<= main_~i~0 88), 202959#(<= main_~i~0 95), 202958#(<= main_~i~0 94), 202957#(<= main_~i~0 93), 202956#(<= main_~i~0 92), 202963#(<= main_~i~0 99), 202962#(<= main_~i~0 98), 202961#(<= main_~i~0 97), 202960#(<= main_~i~0 96), 202967#(<= main_~i~0 103), 202966#(<= main_~i~0 102), 202965#(<= main_~i~0 101), 202964#(<= main_~i~0 100), 202971#(<= main_~i~0 107), 202970#(<= main_~i~0 106), 202969#(<= main_~i~0 105), 202968#(<= main_~i~0 104), 202975#(<= main_~i~0 111), 202974#(<= main_~i~0 110), 202973#(<= main_~i~0 109), 202972#(<= main_~i~0 108), 202979#(<= main_~i~0 115), 202978#(<= main_~i~0 114), 202977#(<= main_~i~0 113), 202976#(<= main_~i~0 112), 202983#(and (<= 2 main_~i~0) (<= main_~i~0 118)), 202982#(and (<= 1 main_~i~0) (<= main_~i~0 117)), 202981#(and (<= 0 main_~i~0) (<= main_~i~0 116)), 202980#(<= main_~i~0 116)] [2018-04-12 21:02:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34751 backedges. 0 proven. 34751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:22,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-12 21:02:22,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-12 21:02:22,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7028, Invalid=7734, Unknown=0, NotChecked=0, Total=14762 [2018-04-12 21:02:22,165 INFO L87 Difference]: Start difference. First operand 1442 states and 1678 transitions. Second operand 122 states. [2018-04-12 21:02:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:02:31,213 INFO L93 Difference]: Finished difference Result 1575 states and 1814 transitions. [2018-04-12 21:02:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-12 21:02:31,213 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 597 [2018-04-12 21:02:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:02:31,215 INFO L225 Difference]: With dead ends: 1575 [2018-04-12 21:02:31,215 INFO L226 Difference]: Without dead ends: 1575 [2018-04-12 21:02:31,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7254 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=21187, Invalid=36173, Unknown=0, NotChecked=0, Total=57360 [2018-04-12 21:02:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2018-04-12 21:02:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1454. [2018-04-12 21:02:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-04-12 21:02:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1692 transitions. [2018-04-12 21:02:31,224 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1692 transitions. Word has length 597 [2018-04-12 21:02:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:02:31,224 INFO L459 AbstractCegarLoop]: Abstraction has 1454 states and 1692 transitions. [2018-04-12 21:02:31,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-12 21:02:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1692 transitions. [2018-04-12 21:02:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-04-12 21:02:31,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:02:31,226 INFO L355 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 119, 1, 1, 1, 1, 1, 1] [2018-04-12 21:02:31,226 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:02:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -352732875, now seen corresponding path program 119 times [2018-04-12 21:02:31,227 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:02:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:02:31,242 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:02:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 35343 backedges. 0 proven. 35343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:34,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:02:34,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-04-12 21:02:34,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:02:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:34,241 INFO L182 omatonBuilderFactory]: Interpolants [206339#(<= main_~i~0 88), 206338#(<= main_~i~0 87), 206337#(<= main_~i~0 86), 206336#(<= main_~i~0 85), 206343#(<= main_~i~0 92), 206342#(<= main_~i~0 91), 206341#(<= main_~i~0 90), 206340#(<= main_~i~0 89), 206347#(<= main_~i~0 96), 206346#(<= main_~i~0 95), 206345#(<= main_~i~0 94), 206344#(<= main_~i~0 93), 206351#(<= main_~i~0 100), 206350#(<= main_~i~0 99), 206349#(<= main_~i~0 98), 206348#(<= main_~i~0 97), 206355#(<= main_~i~0 104), 206354#(<= main_~i~0 103), 206353#(<= main_~i~0 102), 206352#(<= main_~i~0 101), 206359#(<= main_~i~0 108), 206358#(<= main_~i~0 107), 206357#(<= main_~i~0 106), 206356#(<= main_~i~0 105), 206363#(<= main_~i~0 112), 206362#(<= main_~i~0 111), 206361#(<= main_~i~0 110), 206360#(<= main_~i~0 109), 206367#(<= main_~i~0 116), 206366#(<= main_~i~0 115), 206365#(<= main_~i~0 114), 206364#(<= main_~i~0 113), 206371#(and (<= main_~i~0 119) (<= 1 main_~i~0)), 206370#(and (<= 0 main_~i~0) (<= main_~i~0 118)), 206369#(<= main_~i~0 118), 206368#(<= main_~i~0 117), 206251#(<= main_~i~0 0), 206250#false, 206249#true, 206255#(<= main_~i~0 4), 206254#(<= main_~i~0 3), 206253#(<= main_~i~0 2), 206252#(<= main_~i~0 1), 206259#(<= main_~i~0 8), 206258#(<= main_~i~0 7), 206257#(<= main_~i~0 6), 206256#(<= main_~i~0 5), 206263#(<= main_~i~0 12), 206262#(<= main_~i~0 11), 206261#(<= main_~i~0 10), 206260#(<= main_~i~0 9), 206267#(<= main_~i~0 16), 206266#(<= main_~i~0 15), 206265#(<= main_~i~0 14), 206264#(<= main_~i~0 13), 206271#(<= main_~i~0 20), 206270#(<= main_~i~0 19), 206269#(<= main_~i~0 18), 206268#(<= main_~i~0 17), 206275#(<= main_~i~0 24), 206274#(<= main_~i~0 23), 206273#(<= main_~i~0 22), 206272#(<= main_~i~0 21), 206279#(<= main_~i~0 28), 206278#(<= main_~i~0 27), 206277#(<= main_~i~0 26), 206276#(<= main_~i~0 25), 206283#(<= main_~i~0 32), 206282#(<= main_~i~0 31), 206281#(<= main_~i~0 30), 206280#(<= main_~i~0 29), 206287#(<= main_~i~0 36), 206286#(<= main_~i~0 35), 206285#(<= main_~i~0 34), 206284#(<= main_~i~0 33), 206291#(<= main_~i~0 40), 206290#(<= main_~i~0 39), 206289#(<= main_~i~0 38), 206288#(<= main_~i~0 37), 206295#(<= main_~i~0 44), 206294#(<= main_~i~0 43), 206293#(<= main_~i~0 42), 206292#(<= main_~i~0 41), 206299#(<= main_~i~0 48), 206298#(<= main_~i~0 47), 206297#(<= main_~i~0 46), 206296#(<= main_~i~0 45), 206303#(<= main_~i~0 52), 206302#(<= main_~i~0 51), 206301#(<= main_~i~0 50), 206300#(<= main_~i~0 49), 206307#(<= main_~i~0 56), 206306#(<= main_~i~0 55), 206305#(<= main_~i~0 54), 206304#(<= main_~i~0 53), 206311#(<= main_~i~0 60), 206310#(<= main_~i~0 59), 206309#(<= main_~i~0 58), 206308#(<= main_~i~0 57), 206315#(<= main_~i~0 64), 206314#(<= main_~i~0 63), 206313#(<= main_~i~0 62), 206312#(<= main_~i~0 61), 206319#(<= main_~i~0 68), 206318#(<= main_~i~0 67), 206317#(<= main_~i~0 66), 206316#(<= main_~i~0 65), 206323#(<= main_~i~0 72), 206322#(<= main_~i~0 71), 206321#(<= main_~i~0 70), 206320#(<= main_~i~0 69), 206327#(<= main_~i~0 76), 206326#(<= main_~i~0 75), 206325#(<= main_~i~0 74), 206324#(<= main_~i~0 73), 206331#(<= main_~i~0 80), 206330#(<= main_~i~0 79), 206329#(<= main_~i~0 78), 206328#(<= main_~i~0 77), 206335#(<= main_~i~0 84), 206334#(<= main_~i~0 83), 206333#(<= main_~i~0 82), 206332#(<= main_~i~0 81)] [2018-04-12 21:02:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 35343 backedges. 0 proven. 35343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:34,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-12 21:02:34,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-12 21:02:34,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7265, Invalid=7741, Unknown=0, NotChecked=0, Total=15006 [2018-04-12 21:02:34,243 INFO L87 Difference]: Start difference. First operand 1454 states and 1692 transitions. Second operand 123 states. [2018-04-12 21:02:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:02:43,227 INFO L93 Difference]: Finished difference Result 1588 states and 1829 transitions. [2018-04-12 21:02:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-12 21:02:43,228 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 602 [2018-04-12 21:02:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:02:43,229 INFO L225 Difference]: With dead ends: 1588 [2018-04-12 21:02:43,229 INFO L226 Difference]: Without dead ends: 1588 [2018-04-12 21:02:43,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7258 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=21783, Invalid=36539, Unknown=0, NotChecked=0, Total=58322 [2018-04-12 21:02:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2018-04-12 21:02:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1466. [2018-04-12 21:02:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-04-12 21:02:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1706 transitions. [2018-04-12 21:02:43,237 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1706 transitions. Word has length 602 [2018-04-12 21:02:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:02:43,237 INFO L459 AbstractCegarLoop]: Abstraction has 1466 states and 1706 transitions. [2018-04-12 21:02:43,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-12 21:02:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1706 transitions. [2018-04-12 21:02:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-04-12 21:02:43,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:02:43,239 INFO L355 BasicCegarLoop]: trace histogram [121, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1] [2018-04-12 21:02:43,239 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:02:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 382937320, now seen corresponding path program 120 times [2018-04-12 21:02:43,239 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:02:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:02:43,254 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:02:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 35940 backedges. 0 proven. 35940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:46,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:02:46,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-04-12 21:02:46,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:02:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:46,160 INFO L182 omatonBuilderFactory]: Interpolants [209667#(<= main_~i~0 1), 209666#(<= main_~i~0 0), 209665#false, 209664#true, 209671#(<= main_~i~0 5), 209670#(<= main_~i~0 4), 209669#(<= main_~i~0 3), 209668#(<= main_~i~0 2), 209675#(<= main_~i~0 9), 209674#(<= main_~i~0 8), 209673#(<= main_~i~0 7), 209672#(<= main_~i~0 6), 209679#(<= main_~i~0 13), 209678#(<= main_~i~0 12), 209677#(<= main_~i~0 11), 209676#(<= main_~i~0 10), 209683#(<= main_~i~0 17), 209682#(<= main_~i~0 16), 209681#(<= main_~i~0 15), 209680#(<= main_~i~0 14), 209687#(<= main_~i~0 21), 209686#(<= main_~i~0 20), 209685#(<= main_~i~0 19), 209684#(<= main_~i~0 18), 209691#(<= main_~i~0 25), 209690#(<= main_~i~0 24), 209689#(<= main_~i~0 23), 209688#(<= main_~i~0 22), 209695#(<= main_~i~0 29), 209694#(<= main_~i~0 28), 209693#(<= main_~i~0 27), 209692#(<= main_~i~0 26), 209699#(<= main_~i~0 33), 209698#(<= main_~i~0 32), 209697#(<= main_~i~0 31), 209696#(<= main_~i~0 30), 209703#(<= main_~i~0 37), 209702#(<= main_~i~0 36), 209701#(<= main_~i~0 35), 209700#(<= main_~i~0 34), 209707#(<= main_~i~0 41), 209706#(<= main_~i~0 40), 209705#(<= main_~i~0 39), 209704#(<= main_~i~0 38), 209711#(<= main_~i~0 45), 209710#(<= main_~i~0 44), 209709#(<= main_~i~0 43), 209708#(<= main_~i~0 42), 209715#(<= main_~i~0 49), 209714#(<= main_~i~0 48), 209713#(<= main_~i~0 47), 209712#(<= main_~i~0 46), 209719#(<= main_~i~0 53), 209718#(<= main_~i~0 52), 209717#(<= main_~i~0 51), 209716#(<= main_~i~0 50), 209723#(<= main_~i~0 57), 209722#(<= main_~i~0 56), 209721#(<= main_~i~0 55), 209720#(<= main_~i~0 54), 209727#(<= main_~i~0 61), 209726#(<= main_~i~0 60), 209725#(<= main_~i~0 59), 209724#(<= main_~i~0 58), 209731#(<= main_~i~0 65), 209730#(<= main_~i~0 64), 209729#(<= main_~i~0 63), 209728#(<= main_~i~0 62), 209735#(<= main_~i~0 69), 209734#(<= main_~i~0 68), 209733#(<= main_~i~0 67), 209732#(<= main_~i~0 66), 209739#(<= main_~i~0 73), 209738#(<= main_~i~0 72), 209737#(<= main_~i~0 71), 209736#(<= main_~i~0 70), 209743#(<= main_~i~0 77), 209742#(<= main_~i~0 76), 209741#(<= main_~i~0 75), 209740#(<= main_~i~0 74), 209747#(<= main_~i~0 81), 209746#(<= main_~i~0 80), 209745#(<= main_~i~0 79), 209744#(<= main_~i~0 78), 209751#(<= main_~i~0 85), 209750#(<= main_~i~0 84), 209749#(<= main_~i~0 83), 209748#(<= main_~i~0 82), 209755#(<= main_~i~0 89), 209754#(<= main_~i~0 88), 209753#(<= main_~i~0 87), 209752#(<= main_~i~0 86), 209759#(<= main_~i~0 93), 209758#(<= main_~i~0 92), 209757#(<= main_~i~0 91), 209756#(<= main_~i~0 90), 209763#(<= main_~i~0 97), 209762#(<= main_~i~0 96), 209761#(<= main_~i~0 95), 209760#(<= main_~i~0 94), 209767#(<= main_~i~0 101), 209766#(<= main_~i~0 100), 209765#(<= main_~i~0 99), 209764#(<= main_~i~0 98), 209771#(<= main_~i~0 105), 209770#(<= main_~i~0 104), 209769#(<= main_~i~0 103), 209768#(<= main_~i~0 102), 209775#(<= main_~i~0 109), 209774#(<= main_~i~0 108), 209773#(<= main_~i~0 107), 209772#(<= main_~i~0 106), 209779#(and (<= 0 main_~i~0) (<= main_~i~0 112)), 209778#(<= main_~i~0 112), 209777#(<= main_~i~0 111), 209776#(<= main_~i~0 110), 209783#(and (<= 4 main_~i~0) (<= main_~i~0 116)), 209782#(and (<= main_~i~0 115) (<= 3 main_~i~0)), 209781#(and (<= 2 main_~i~0) (<= main_~i~0 114)), 209780#(and (<= 1 main_~i~0) (<= main_~i~0 113)), 209787#(and (<= 8 main_~i~0) (<= main_~i~0 120)), 209786#(and (<= main_~i~0 119) (<= 7 main_~i~0)), 209785#(and (<= 6 main_~i~0) (<= main_~i~0 118)), 209784#(and (<= 5 main_~i~0) (<= main_~i~0 117))] [2018-04-12 21:02:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 35940 backedges. 0 proven. 35940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:02:46,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-04-12 21:02:46,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-04-12 21:02:46,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6574, Invalid=8678, Unknown=0, NotChecked=0, Total=15252 [2018-04-12 21:02:46,163 INFO L87 Difference]: Start difference. First operand 1466 states and 1706 transitions. Second operand 124 states. [2018-04-12 21:02:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:02:56,981 INFO L93 Difference]: Finished difference Result 1601 states and 1844 transitions. [2018-04-12 21:02:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-12 21:02:56,981 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 607 [2018-04-12 21:02:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:02:56,982 INFO L225 Difference]: With dead ends: 1601 [2018-04-12 21:02:56,982 INFO L226 Difference]: Without dead ends: 1601 [2018-04-12 21:02:56,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8163 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=20487, Invalid=38805, Unknown=0, NotChecked=0, Total=59292 [2018-04-12 21:02:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-04-12 21:02:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1478. [2018-04-12 21:02:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2018-04-12 21:02:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1720 transitions. [2018-04-12 21:02:56,991 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1720 transitions. Word has length 607 [2018-04-12 21:02:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:02:56,991 INFO L459 AbstractCegarLoop]: Abstraction has 1478 states and 1720 transitions. [2018-04-12 21:02:56,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-04-12 21:02:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1720 transitions. [2018-04-12 21:02:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-04-12 21:02:56,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:02:56,993 INFO L355 BasicCegarLoop]: trace histogram [122, 121, 121, 121, 121, 1, 1, 1, 1, 1, 1] [2018-04-12 21:02:56,993 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:02:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 100307221, now seen corresponding path program 121 times [2018-04-12 21:02:56,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:02:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:02:57,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:03:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36542 backedges. 0 proven. 36542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:00,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:03:00,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-04-12 21:03:00,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:03:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:00,054 INFO L182 omatonBuilderFactory]: Interpolants [213107#true, 213111#(<= main_~i~0 2), 213110#(<= main_~i~0 1), 213109#(<= main_~i~0 0), 213108#false, 213115#(<= main_~i~0 6), 213114#(<= main_~i~0 5), 213113#(<= main_~i~0 4), 213112#(<= main_~i~0 3), 213119#(<= main_~i~0 10), 213118#(<= main_~i~0 9), 213117#(<= main_~i~0 8), 213116#(<= main_~i~0 7), 213123#(<= main_~i~0 14), 213122#(<= main_~i~0 13), 213121#(<= main_~i~0 12), 213120#(<= main_~i~0 11), 213127#(<= main_~i~0 18), 213126#(<= main_~i~0 17), 213125#(<= main_~i~0 16), 213124#(<= main_~i~0 15), 213131#(<= main_~i~0 22), 213130#(<= main_~i~0 21), 213129#(<= main_~i~0 20), 213128#(<= main_~i~0 19), 213135#(<= main_~i~0 26), 213134#(<= main_~i~0 25), 213133#(<= main_~i~0 24), 213132#(<= main_~i~0 23), 213139#(<= main_~i~0 30), 213138#(<= main_~i~0 29), 213137#(<= main_~i~0 28), 213136#(<= main_~i~0 27), 213143#(<= main_~i~0 34), 213142#(<= main_~i~0 33), 213141#(<= main_~i~0 32), 213140#(<= main_~i~0 31), 213147#(<= main_~i~0 38), 213146#(<= main_~i~0 37), 213145#(<= main_~i~0 36), 213144#(<= main_~i~0 35), 213151#(<= main_~i~0 42), 213150#(<= main_~i~0 41), 213149#(<= main_~i~0 40), 213148#(<= main_~i~0 39), 213155#(<= main_~i~0 46), 213154#(<= main_~i~0 45), 213153#(<= main_~i~0 44), 213152#(<= main_~i~0 43), 213159#(<= main_~i~0 50), 213158#(<= main_~i~0 49), 213157#(<= main_~i~0 48), 213156#(<= main_~i~0 47), 213163#(<= main_~i~0 54), 213162#(<= main_~i~0 53), 213161#(<= main_~i~0 52), 213160#(<= main_~i~0 51), 213167#(<= main_~i~0 58), 213166#(<= main_~i~0 57), 213165#(<= main_~i~0 56), 213164#(<= main_~i~0 55), 213171#(<= main_~i~0 62), 213170#(<= main_~i~0 61), 213169#(<= main_~i~0 60), 213168#(<= main_~i~0 59), 213175#(<= main_~i~0 66), 213174#(<= main_~i~0 65), 213173#(<= main_~i~0 64), 213172#(<= main_~i~0 63), 213179#(<= main_~i~0 70), 213178#(<= main_~i~0 69), 213177#(<= main_~i~0 68), 213176#(<= main_~i~0 67), 213183#(<= main_~i~0 74), 213182#(<= main_~i~0 73), 213181#(<= main_~i~0 72), 213180#(<= main_~i~0 71), 213187#(<= main_~i~0 78), 213186#(<= main_~i~0 77), 213185#(<= main_~i~0 76), 213184#(<= main_~i~0 75), 213191#(<= main_~i~0 82), 213190#(<= main_~i~0 81), 213189#(<= main_~i~0 80), 213188#(<= main_~i~0 79), 213195#(<= main_~i~0 86), 213194#(<= main_~i~0 85), 213193#(<= main_~i~0 84), 213192#(<= main_~i~0 83), 213199#(<= main_~i~0 90), 213198#(<= main_~i~0 89), 213197#(<= main_~i~0 88), 213196#(<= main_~i~0 87), 213203#(<= main_~i~0 94), 213202#(<= main_~i~0 93), 213201#(<= main_~i~0 92), 213200#(<= main_~i~0 91), 213207#(<= main_~i~0 98), 213206#(<= main_~i~0 97), 213205#(<= main_~i~0 96), 213204#(<= main_~i~0 95), 213211#(<= main_~i~0 102), 213210#(<= main_~i~0 101), 213209#(<= main_~i~0 100), 213208#(<= main_~i~0 99), 213215#(<= main_~i~0 106), 213214#(<= main_~i~0 105), 213213#(<= main_~i~0 104), 213212#(<= main_~i~0 103), 213219#(<= main_~i~0 110), 213218#(<= main_~i~0 109), 213217#(<= main_~i~0 108), 213216#(<= main_~i~0 107), 213223#(<= main_~i~0 114), 213222#(<= main_~i~0 113), 213221#(<= main_~i~0 112), 213220#(<= main_~i~0 111), 213227#(<= main_~i~0 118), 213226#(<= main_~i~0 117), 213225#(<= main_~i~0 116), 213224#(<= main_~i~0 115), 213231#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 213230#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 213229#(<= main_~i~0 120), 213228#(<= main_~i~0 119)] [2018-04-12 21:03:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36542 backedges. 0 proven. 36542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:00,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-12 21:03:00,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-12 21:03:00,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7508, Invalid=7992, Unknown=0, NotChecked=0, Total=15500 [2018-04-12 21:03:00,056 INFO L87 Difference]: Start difference. First operand 1478 states and 1720 transitions. Second operand 125 states. [2018-04-12 21:03:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:03:09,607 INFO L93 Difference]: Finished difference Result 1614 states and 1859 transitions. [2018-04-12 21:03:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-12 21:03:09,607 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 612 [2018-04-12 21:03:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:03:09,608 INFO L225 Difference]: With dead ends: 1614 [2018-04-12 21:03:09,608 INFO L226 Difference]: Without dead ends: 1614 [2018-04-12 21:03:09,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=22512, Invalid=37758, Unknown=0, NotChecked=0, Total=60270 [2018-04-12 21:03:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2018-04-12 21:03:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1490. [2018-04-12 21:03:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-04-12 21:03:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1734 transitions. [2018-04-12 21:03:09,617 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1734 transitions. Word has length 612 [2018-04-12 21:03:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:03:09,617 INFO L459 AbstractCegarLoop]: Abstraction has 1490 states and 1734 transitions. [2018-04-12 21:03:09,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-12 21:03:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1734 transitions. [2018-04-12 21:03:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-04-12 21:03:09,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:03:09,619 INFO L355 BasicCegarLoop]: trace histogram [123, 122, 122, 122, 122, 1, 1, 1, 1, 1, 1] [2018-04-12 21:03:09,619 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:03:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1006517512, now seen corresponding path program 122 times [2018-04-12 21:03:09,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:03:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:03:09,634 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:03:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 37149 backedges. 0 proven. 37149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:12,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:03:12,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-04-12 21:03:12,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:03:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:12,790 INFO L182 omatonBuilderFactory]: Interpolants [216579#false, 216578#true, 216583#(<= main_~i~0 3), 216582#(<= main_~i~0 2), 216581#(<= main_~i~0 1), 216580#(<= main_~i~0 0), 216587#(<= main_~i~0 7), 216586#(<= main_~i~0 6), 216585#(<= main_~i~0 5), 216584#(<= main_~i~0 4), 216591#(<= main_~i~0 11), 216590#(<= main_~i~0 10), 216589#(<= main_~i~0 9), 216588#(<= main_~i~0 8), 216595#(<= main_~i~0 15), 216594#(<= main_~i~0 14), 216593#(<= main_~i~0 13), 216592#(<= main_~i~0 12), 216599#(<= main_~i~0 19), 216598#(<= main_~i~0 18), 216597#(<= main_~i~0 17), 216596#(<= main_~i~0 16), 216603#(<= main_~i~0 23), 216602#(<= main_~i~0 22), 216601#(<= main_~i~0 21), 216600#(<= main_~i~0 20), 216607#(<= main_~i~0 27), 216606#(<= main_~i~0 26), 216605#(<= main_~i~0 25), 216604#(<= main_~i~0 24), 216611#(<= main_~i~0 31), 216610#(<= main_~i~0 30), 216609#(<= main_~i~0 29), 216608#(<= main_~i~0 28), 216615#(<= main_~i~0 35), 216614#(<= main_~i~0 34), 216613#(<= main_~i~0 33), 216612#(<= main_~i~0 32), 216619#(<= main_~i~0 39), 216618#(<= main_~i~0 38), 216617#(<= main_~i~0 37), 216616#(<= main_~i~0 36), 216623#(<= main_~i~0 43), 216622#(<= main_~i~0 42), 216621#(<= main_~i~0 41), 216620#(<= main_~i~0 40), 216627#(<= main_~i~0 47), 216626#(<= main_~i~0 46), 216625#(<= main_~i~0 45), 216624#(<= main_~i~0 44), 216631#(<= main_~i~0 51), 216630#(<= main_~i~0 50), 216629#(<= main_~i~0 49), 216628#(<= main_~i~0 48), 216635#(<= main_~i~0 55), 216634#(<= main_~i~0 54), 216633#(<= main_~i~0 53), 216632#(<= main_~i~0 52), 216639#(<= main_~i~0 59), 216638#(<= main_~i~0 58), 216637#(<= main_~i~0 57), 216636#(<= main_~i~0 56), 216643#(<= main_~i~0 63), 216642#(<= main_~i~0 62), 216641#(<= main_~i~0 61), 216640#(<= main_~i~0 60), 216647#(<= main_~i~0 67), 216646#(<= main_~i~0 66), 216645#(<= main_~i~0 65), 216644#(<= main_~i~0 64), 216651#(<= main_~i~0 71), 216650#(<= main_~i~0 70), 216649#(<= main_~i~0 69), 216648#(<= main_~i~0 68), 216655#(<= main_~i~0 75), 216654#(<= main_~i~0 74), 216653#(<= main_~i~0 73), 216652#(<= main_~i~0 72), 216659#(<= main_~i~0 79), 216658#(<= main_~i~0 78), 216657#(<= main_~i~0 77), 216656#(<= main_~i~0 76), 216663#(<= main_~i~0 83), 216662#(<= main_~i~0 82), 216661#(<= main_~i~0 81), 216660#(<= main_~i~0 80), 216667#(<= main_~i~0 87), 216666#(<= main_~i~0 86), 216665#(<= main_~i~0 85), 216664#(<= main_~i~0 84), 216671#(<= main_~i~0 91), 216670#(<= main_~i~0 90), 216669#(<= main_~i~0 89), 216668#(<= main_~i~0 88), 216675#(<= main_~i~0 95), 216674#(<= main_~i~0 94), 216673#(<= main_~i~0 93), 216672#(<= main_~i~0 92), 216679#(<= main_~i~0 99), 216678#(<= main_~i~0 98), 216677#(<= main_~i~0 97), 216676#(<= main_~i~0 96), 216683#(<= main_~i~0 103), 216682#(<= main_~i~0 102), 216681#(<= main_~i~0 101), 216680#(<= main_~i~0 100), 216687#(<= main_~i~0 107), 216686#(<= main_~i~0 106), 216685#(<= main_~i~0 105), 216684#(<= main_~i~0 104), 216691#(<= main_~i~0 111), 216690#(<= main_~i~0 110), 216689#(<= main_~i~0 109), 216688#(<= main_~i~0 108), 216695#(<= main_~i~0 115), 216694#(<= main_~i~0 114), 216693#(<= main_~i~0 113), 216692#(<= main_~i~0 112), 216699#(<= main_~i~0 119), 216698#(<= main_~i~0 118), 216697#(<= main_~i~0 117), 216696#(<= main_~i~0 116), 216703#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 216702#(and (<= 1 main_~i~0) (<= main_~i~0 121)), 216701#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 216700#(<= main_~i~0 120)] [2018-04-12 21:03:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 37149 backedges. 0 proven. 37149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:12,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-12 21:03:12,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-12 21:03:12,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7510, Invalid=8240, Unknown=0, NotChecked=0, Total=15750 [2018-04-12 21:03:12,792 INFO L87 Difference]: Start difference. First operand 1490 states and 1734 transitions. Second operand 126 states. [2018-04-12 21:03:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:03:22,434 INFO L93 Difference]: Finished difference Result 1627 states and 1874 transitions. [2018-04-12 21:03:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-12 21:03:22,435 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 617 [2018-04-12 21:03:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:03:22,436 INFO L225 Difference]: With dead ends: 1627 [2018-04-12 21:03:22,436 INFO L226 Difference]: Without dead ends: 1627 [2018-04-12 21:03:22,438 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=22637, Invalid=38619, Unknown=0, NotChecked=0, Total=61256 [2018-04-12 21:03:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-04-12 21:03:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1502. [2018-04-12 21:03:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-04-12 21:03:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1748 transitions. [2018-04-12 21:03:22,444 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1748 transitions. Word has length 617 [2018-04-12 21:03:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:03:22,444 INFO L459 AbstractCegarLoop]: Abstraction has 1502 states and 1748 transitions. [2018-04-12 21:03:22,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-12 21:03:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1748 transitions. [2018-04-12 21:03:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-04-12 21:03:22,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:03:22,447 INFO L355 BasicCegarLoop]: trace histogram [124, 123, 123, 123, 123, 1, 1, 1, 1, 1, 1] [2018-04-12 21:03:22,447 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:03:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1154019083, now seen corresponding path program 123 times [2018-04-12 21:03:22,447 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:03:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:03:22,462 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:03:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 0 proven. 37761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:25,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:03:25,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-04-12 21:03:25,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:03:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:25,634 INFO L182 omatonBuilderFactory]: Interpolants [220163#(<= main_~i~0 84), 220162#(<= main_~i~0 83), 220161#(<= main_~i~0 82), 220160#(<= main_~i~0 81), 220167#(<= main_~i~0 88), 220166#(<= main_~i~0 87), 220165#(<= main_~i~0 86), 220164#(<= main_~i~0 85), 220171#(<= main_~i~0 92), 220170#(<= main_~i~0 91), 220169#(<= main_~i~0 90), 220168#(<= main_~i~0 89), 220175#(<= main_~i~0 96), 220174#(<= main_~i~0 95), 220173#(<= main_~i~0 94), 220172#(<= main_~i~0 93), 220179#(<= main_~i~0 100), 220178#(<= main_~i~0 99), 220177#(<= main_~i~0 98), 220176#(<= main_~i~0 97), 220183#(<= main_~i~0 104), 220182#(<= main_~i~0 103), 220181#(<= main_~i~0 102), 220180#(<= main_~i~0 101), 220187#(<= main_~i~0 108), 220186#(<= main_~i~0 107), 220185#(<= main_~i~0 106), 220184#(<= main_~i~0 105), 220191#(<= main_~i~0 112), 220190#(<= main_~i~0 111), 220189#(<= main_~i~0 110), 220188#(<= main_~i~0 109), 220195#(<= main_~i~0 116), 220194#(<= main_~i~0 115), 220193#(<= main_~i~0 114), 220192#(<= main_~i~0 113), 220199#(<= main_~i~0 120), 220198#(<= main_~i~0 119), 220197#(<= main_~i~0 118), 220196#(<= main_~i~0 117), 220203#(and (<= 1 main_~i~0) (<= main_~i~0 123)), 220202#(and (<= main_~i~0 122) (<= 0 main_~i~0)), 220201#(<= main_~i~0 122), 220200#(<= main_~i~0 121), 220079#(<= main_~i~0 0), 220078#false, 220077#true, 220083#(<= main_~i~0 4), 220082#(<= main_~i~0 3), 220081#(<= main_~i~0 2), 220080#(<= main_~i~0 1), 220087#(<= main_~i~0 8), 220086#(<= main_~i~0 7), 220085#(<= main_~i~0 6), 220084#(<= main_~i~0 5), 220091#(<= main_~i~0 12), 220090#(<= main_~i~0 11), 220089#(<= main_~i~0 10), 220088#(<= main_~i~0 9), 220095#(<= main_~i~0 16), 220094#(<= main_~i~0 15), 220093#(<= main_~i~0 14), 220092#(<= main_~i~0 13), 220099#(<= main_~i~0 20), 220098#(<= main_~i~0 19), 220097#(<= main_~i~0 18), 220096#(<= main_~i~0 17), 220103#(<= main_~i~0 24), 220102#(<= main_~i~0 23), 220101#(<= main_~i~0 22), 220100#(<= main_~i~0 21), 220107#(<= main_~i~0 28), 220106#(<= main_~i~0 27), 220105#(<= main_~i~0 26), 220104#(<= main_~i~0 25), 220111#(<= main_~i~0 32), 220110#(<= main_~i~0 31), 220109#(<= main_~i~0 30), 220108#(<= main_~i~0 29), 220115#(<= main_~i~0 36), 220114#(<= main_~i~0 35), 220113#(<= main_~i~0 34), 220112#(<= main_~i~0 33), 220119#(<= main_~i~0 40), 220118#(<= main_~i~0 39), 220117#(<= main_~i~0 38), 220116#(<= main_~i~0 37), 220123#(<= main_~i~0 44), 220122#(<= main_~i~0 43), 220121#(<= main_~i~0 42), 220120#(<= main_~i~0 41), 220127#(<= main_~i~0 48), 220126#(<= main_~i~0 47), 220125#(<= main_~i~0 46), 220124#(<= main_~i~0 45), 220131#(<= main_~i~0 52), 220130#(<= main_~i~0 51), 220129#(<= main_~i~0 50), 220128#(<= main_~i~0 49), 220135#(<= main_~i~0 56), 220134#(<= main_~i~0 55), 220133#(<= main_~i~0 54), 220132#(<= main_~i~0 53), 220139#(<= main_~i~0 60), 220138#(<= main_~i~0 59), 220137#(<= main_~i~0 58), 220136#(<= main_~i~0 57), 220143#(<= main_~i~0 64), 220142#(<= main_~i~0 63), 220141#(<= main_~i~0 62), 220140#(<= main_~i~0 61), 220147#(<= main_~i~0 68), 220146#(<= main_~i~0 67), 220145#(<= main_~i~0 66), 220144#(<= main_~i~0 65), 220151#(<= main_~i~0 72), 220150#(<= main_~i~0 71), 220149#(<= main_~i~0 70), 220148#(<= main_~i~0 69), 220155#(<= main_~i~0 76), 220154#(<= main_~i~0 75), 220153#(<= main_~i~0 74), 220152#(<= main_~i~0 73), 220159#(<= main_~i~0 80), 220158#(<= main_~i~0 79), 220157#(<= main_~i~0 78), 220156#(<= main_~i~0 77)] [2018-04-12 21:03:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 37761 backedges. 0 proven. 37761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:25,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-12 21:03:25,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-12 21:03:25,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7755, Invalid=8247, Unknown=0, NotChecked=0, Total=16002 [2018-04-12 21:03:25,636 INFO L87 Difference]: Start difference. First operand 1502 states and 1748 transitions. Second operand 127 states. [2018-04-12 21:03:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:03:35,142 INFO L93 Difference]: Finished difference Result 1640 states and 1889 transitions. [2018-04-12 21:03:35,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-12 21:03:35,142 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 622 [2018-04-12 21:03:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:03:35,144 INFO L225 Difference]: With dead ends: 1640 [2018-04-12 21:03:35,144 INFO L226 Difference]: Without dead ends: 1640 [2018-04-12 21:03:35,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7748 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=23253, Invalid=38997, Unknown=0, NotChecked=0, Total=62250 [2018-04-12 21:03:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2018-04-12 21:03:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1514. [2018-04-12 21:03:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2018-04-12 21:03:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1762 transitions. [2018-04-12 21:03:35,155 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1762 transitions. Word has length 622 [2018-04-12 21:03:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:03:35,155 INFO L459 AbstractCegarLoop]: Abstraction has 1514 states and 1762 transitions. [2018-04-12 21:03:35,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-12 21:03:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1762 transitions. [2018-04-12 21:03:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-04-12 21:03:35,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:03:35,158 INFO L355 BasicCegarLoop]: trace histogram [125, 124, 124, 124, 124, 1, 1, 1, 1, 1, 1] [2018-04-12 21:03:35,158 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:03:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1577670360, now seen corresponding path program 124 times [2018-04-12 21:03:35,159 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:03:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:03:35,175 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:03:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 38378 backedges. 0 proven. 38378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:38,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:03:38,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-04-12 21:03:38,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:03:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:38,318 INFO L182 omatonBuilderFactory]: Interpolants [223607#(<= main_~i~0 1), 223606#(<= main_~i~0 0), 223605#false, 223604#true, 223611#(<= main_~i~0 5), 223610#(<= main_~i~0 4), 223609#(<= main_~i~0 3), 223608#(<= main_~i~0 2), 223615#(<= main_~i~0 9), 223614#(<= main_~i~0 8), 223613#(<= main_~i~0 7), 223612#(<= main_~i~0 6), 223619#(<= main_~i~0 13), 223618#(<= main_~i~0 12), 223617#(<= main_~i~0 11), 223616#(<= main_~i~0 10), 223623#(<= main_~i~0 17), 223622#(<= main_~i~0 16), 223621#(<= main_~i~0 15), 223620#(<= main_~i~0 14), 223627#(<= main_~i~0 21), 223626#(<= main_~i~0 20), 223625#(<= main_~i~0 19), 223624#(<= main_~i~0 18), 223631#(<= main_~i~0 25), 223630#(<= main_~i~0 24), 223629#(<= main_~i~0 23), 223628#(<= main_~i~0 22), 223635#(<= main_~i~0 29), 223634#(<= main_~i~0 28), 223633#(<= main_~i~0 27), 223632#(<= main_~i~0 26), 223639#(<= main_~i~0 33), 223638#(<= main_~i~0 32), 223637#(<= main_~i~0 31), 223636#(<= main_~i~0 30), 223643#(<= main_~i~0 37), 223642#(<= main_~i~0 36), 223641#(<= main_~i~0 35), 223640#(<= main_~i~0 34), 223647#(<= main_~i~0 41), 223646#(<= main_~i~0 40), 223645#(<= main_~i~0 39), 223644#(<= main_~i~0 38), 223651#(<= main_~i~0 45), 223650#(<= main_~i~0 44), 223649#(<= main_~i~0 43), 223648#(<= main_~i~0 42), 223655#(<= main_~i~0 49), 223654#(<= main_~i~0 48), 223653#(<= main_~i~0 47), 223652#(<= main_~i~0 46), 223659#(<= main_~i~0 53), 223658#(<= main_~i~0 52), 223657#(<= main_~i~0 51), 223656#(<= main_~i~0 50), 223663#(<= main_~i~0 57), 223662#(<= main_~i~0 56), 223661#(<= main_~i~0 55), 223660#(<= main_~i~0 54), 223667#(<= main_~i~0 61), 223666#(<= main_~i~0 60), 223665#(<= main_~i~0 59), 223664#(<= main_~i~0 58), 223671#(<= main_~i~0 65), 223670#(<= main_~i~0 64), 223669#(<= main_~i~0 63), 223668#(<= main_~i~0 62), 223675#(<= main_~i~0 69), 223674#(<= main_~i~0 68), 223673#(<= main_~i~0 67), 223672#(<= main_~i~0 66), 223679#(<= main_~i~0 73), 223678#(<= main_~i~0 72), 223677#(<= main_~i~0 71), 223676#(<= main_~i~0 70), 223683#(<= main_~i~0 77), 223682#(<= main_~i~0 76), 223681#(<= main_~i~0 75), 223680#(<= main_~i~0 74), 223687#(<= main_~i~0 81), 223686#(<= main_~i~0 80), 223685#(<= main_~i~0 79), 223684#(<= main_~i~0 78), 223691#(<= main_~i~0 85), 223690#(<= main_~i~0 84), 223689#(<= main_~i~0 83), 223688#(<= main_~i~0 82), 223695#(<= main_~i~0 89), 223694#(<= main_~i~0 88), 223693#(<= main_~i~0 87), 223692#(<= main_~i~0 86), 223699#(<= main_~i~0 93), 223698#(<= main_~i~0 92), 223697#(<= main_~i~0 91), 223696#(<= main_~i~0 90), 223703#(<= main_~i~0 97), 223702#(<= main_~i~0 96), 223701#(<= main_~i~0 95), 223700#(<= main_~i~0 94), 223707#(<= main_~i~0 101), 223706#(<= main_~i~0 100), 223705#(<= main_~i~0 99), 223704#(<= main_~i~0 98), 223711#(<= main_~i~0 105), 223710#(<= main_~i~0 104), 223709#(<= main_~i~0 103), 223708#(<= main_~i~0 102), 223715#(<= main_~i~0 109), 223714#(<= main_~i~0 108), 223713#(<= main_~i~0 107), 223712#(<= main_~i~0 106), 223719#(<= main_~i~0 113), 223718#(<= main_~i~0 112), 223717#(<= main_~i~0 111), 223716#(<= main_~i~0 110), 223723#(<= main_~i~0 117), 223722#(<= main_~i~0 116), 223721#(<= main_~i~0 115), 223720#(<= main_~i~0 114), 223727#(and (<= 0 main_~i~0) (<= main_~i~0 120)), 223726#(<= main_~i~0 120), 223725#(<= main_~i~0 119), 223724#(<= main_~i~0 118), 223731#(and (<= 4 main_~i~0) (<= main_~i~0 124)), 223730#(and (<= main_~i~0 123) (<= 3 main_~i~0)), 223729#(and (<= 2 main_~i~0) (<= main_~i~0 122)), 223728#(and (<= 1 main_~i~0) (<= main_~i~0 121))] [2018-04-12 21:03:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 38378 backedges. 0 proven. 38378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:38,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-12 21:03:38,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-12 21:03:38,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7514, Invalid=8742, Unknown=0, NotChecked=0, Total=16256 [2018-04-12 21:03:38,320 INFO L87 Difference]: Start difference. First operand 1514 states and 1762 transitions. Second operand 128 states. [2018-04-12 21:03:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:03:49,025 INFO L93 Difference]: Finished difference Result 1653 states and 1904 transitions. [2018-04-12 21:03:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-12 21:03:49,025 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 627 [2018-04-12 21:03:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:03:49,026 INFO L225 Difference]: With dead ends: 1653 [2018-04-12 21:03:49,026 INFO L226 Difference]: Without dead ends: 1653 [2018-04-12 21:03:49,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8233 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=22887, Invalid=40365, Unknown=0, NotChecked=0, Total=63252 [2018-04-12 21:03:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-04-12 21:03:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1526. [2018-04-12 21:03:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2018-04-12 21:03:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1776 transitions. [2018-04-12 21:03:49,034 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1776 transitions. Word has length 627 [2018-04-12 21:03:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:03:49,034 INFO L459 AbstractCegarLoop]: Abstraction has 1526 states and 1776 transitions. [2018-04-12 21:03:49,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-12 21:03:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1776 transitions. [2018-04-12 21:03:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-04-12 21:03:49,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:03:49,036 INFO L355 BasicCegarLoop]: trace histogram [126, 125, 125, 125, 125, 1, 1, 1, 1, 1, 1] [2018-04-12 21:03:49,036 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:03:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -767739691, now seen corresponding path program 125 times [2018-04-12 21:03:49,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:03:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:03:49,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:03:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 39000 backedges. 0 proven. 39000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:52,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:03:52,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-04-12 21:03:52,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:03:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:52,326 INFO L182 omatonBuilderFactory]: Interpolants [227159#true, 227163#(<= main_~i~0 2), 227162#(<= main_~i~0 1), 227161#(<= main_~i~0 0), 227160#false, 227167#(<= main_~i~0 6), 227166#(<= main_~i~0 5), 227165#(<= main_~i~0 4), 227164#(<= main_~i~0 3), 227171#(<= main_~i~0 10), 227170#(<= main_~i~0 9), 227169#(<= main_~i~0 8), 227168#(<= main_~i~0 7), 227175#(<= main_~i~0 14), 227174#(<= main_~i~0 13), 227173#(<= main_~i~0 12), 227172#(<= main_~i~0 11), 227179#(<= main_~i~0 18), 227178#(<= main_~i~0 17), 227177#(<= main_~i~0 16), 227176#(<= main_~i~0 15), 227183#(<= main_~i~0 22), 227182#(<= main_~i~0 21), 227181#(<= main_~i~0 20), 227180#(<= main_~i~0 19), 227187#(<= main_~i~0 26), 227186#(<= main_~i~0 25), 227185#(<= main_~i~0 24), 227184#(<= main_~i~0 23), 227191#(<= main_~i~0 30), 227190#(<= main_~i~0 29), 227189#(<= main_~i~0 28), 227188#(<= main_~i~0 27), 227195#(<= main_~i~0 34), 227194#(<= main_~i~0 33), 227193#(<= main_~i~0 32), 227192#(<= main_~i~0 31), 227199#(<= main_~i~0 38), 227198#(<= main_~i~0 37), 227197#(<= main_~i~0 36), 227196#(<= main_~i~0 35), 227203#(<= main_~i~0 42), 227202#(<= main_~i~0 41), 227201#(<= main_~i~0 40), 227200#(<= main_~i~0 39), 227207#(<= main_~i~0 46), 227206#(<= main_~i~0 45), 227205#(<= main_~i~0 44), 227204#(<= main_~i~0 43), 227211#(<= main_~i~0 50), 227210#(<= main_~i~0 49), 227209#(<= main_~i~0 48), 227208#(<= main_~i~0 47), 227215#(<= main_~i~0 54), 227214#(<= main_~i~0 53), 227213#(<= main_~i~0 52), 227212#(<= main_~i~0 51), 227219#(<= main_~i~0 58), 227218#(<= main_~i~0 57), 227217#(<= main_~i~0 56), 227216#(<= main_~i~0 55), 227223#(<= main_~i~0 62), 227222#(<= main_~i~0 61), 227221#(<= main_~i~0 60), 227220#(<= main_~i~0 59), 227227#(<= main_~i~0 66), 227226#(<= main_~i~0 65), 227225#(<= main_~i~0 64), 227224#(<= main_~i~0 63), 227231#(<= main_~i~0 70), 227230#(<= main_~i~0 69), 227229#(<= main_~i~0 68), 227228#(<= main_~i~0 67), 227235#(<= main_~i~0 74), 227234#(<= main_~i~0 73), 227233#(<= main_~i~0 72), 227232#(<= main_~i~0 71), 227239#(<= main_~i~0 78), 227238#(<= main_~i~0 77), 227237#(<= main_~i~0 76), 227236#(<= main_~i~0 75), 227243#(<= main_~i~0 82), 227242#(<= main_~i~0 81), 227241#(<= main_~i~0 80), 227240#(<= main_~i~0 79), 227247#(<= main_~i~0 86), 227246#(<= main_~i~0 85), 227245#(<= main_~i~0 84), 227244#(<= main_~i~0 83), 227251#(<= main_~i~0 90), 227250#(<= main_~i~0 89), 227249#(<= main_~i~0 88), 227248#(<= main_~i~0 87), 227255#(<= main_~i~0 94), 227254#(<= main_~i~0 93), 227253#(<= main_~i~0 92), 227252#(<= main_~i~0 91), 227259#(<= main_~i~0 98), 227258#(<= main_~i~0 97), 227257#(<= main_~i~0 96), 227256#(<= main_~i~0 95), 227263#(<= main_~i~0 102), 227262#(<= main_~i~0 101), 227261#(<= main_~i~0 100), 227260#(<= main_~i~0 99), 227267#(<= main_~i~0 106), 227266#(<= main_~i~0 105), 227265#(<= main_~i~0 104), 227264#(<= main_~i~0 103), 227271#(<= main_~i~0 110), 227270#(<= main_~i~0 109), 227269#(<= main_~i~0 108), 227268#(<= main_~i~0 107), 227275#(<= main_~i~0 114), 227274#(<= main_~i~0 113), 227273#(<= main_~i~0 112), 227272#(<= main_~i~0 111), 227279#(<= main_~i~0 118), 227278#(<= main_~i~0 117), 227277#(<= main_~i~0 116), 227276#(<= main_~i~0 115), 227283#(<= main_~i~0 122), 227282#(<= main_~i~0 121), 227281#(<= main_~i~0 120), 227280#(<= main_~i~0 119), 227287#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 227286#(and (<= 0 main_~i~0) (<= main_~i~0 124)), 227285#(<= main_~i~0 124), 227284#(<= main_~i~0 123)] [2018-04-12 21:03:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 39000 backedges. 0 proven. 39000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:03:52,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-12 21:03:52,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-12 21:03:52,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8006, Invalid=8506, Unknown=0, NotChecked=0, Total=16512 [2018-04-12 21:03:52,329 INFO L87 Difference]: Start difference. First operand 1526 states and 1776 transitions. Second operand 129 states. [2018-04-12 21:04:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:04:02,461 INFO L93 Difference]: Finished difference Result 1666 states and 1919 transitions. [2018-04-12 21:04:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-12 21:04:02,461 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 632 [2018-04-12 21:04:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:04:02,463 INFO L225 Difference]: With dead ends: 1666 [2018-04-12 21:04:02,463 INFO L226 Difference]: Without dead ends: 1666 [2018-04-12 21:04:02,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7999 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=24006, Invalid=40256, Unknown=0, NotChecked=0, Total=64262 [2018-04-12 21:04:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-04-12 21:04:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1538. [2018-04-12 21:04:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-04-12 21:04:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1790 transitions. [2018-04-12 21:04:02,471 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1790 transitions. Word has length 632 [2018-04-12 21:04:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:04:02,472 INFO L459 AbstractCegarLoop]: Abstraction has 1538 states and 1790 transitions. [2018-04-12 21:04:02,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-12 21:04:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1790 transitions. [2018-04-12 21:04:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-04-12 21:04:02,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:04:02,474 INFO L355 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 126, 1, 1, 1, 1, 1, 1] [2018-04-12 21:04:02,474 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:04:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash 166620488, now seen corresponding path program 126 times [2018-04-12 21:04:02,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:04:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:04:02,490 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:04:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 39627 backedges. 0 proven. 39627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:05,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:04:05,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-04-12 21:04:05,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:04:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:05,905 INFO L182 omatonBuilderFactory]: Interpolants [230743#false, 230742#true, 230747#(<= main_~i~0 3), 230746#(<= main_~i~0 2), 230745#(<= main_~i~0 1), 230744#(<= main_~i~0 0), 230751#(<= main_~i~0 7), 230750#(<= main_~i~0 6), 230749#(<= main_~i~0 5), 230748#(<= main_~i~0 4), 230755#(<= main_~i~0 11), 230754#(<= main_~i~0 10), 230753#(<= main_~i~0 9), 230752#(<= main_~i~0 8), 230759#(<= main_~i~0 15), 230758#(<= main_~i~0 14), 230757#(<= main_~i~0 13), 230756#(<= main_~i~0 12), 230763#(<= main_~i~0 19), 230762#(<= main_~i~0 18), 230761#(<= main_~i~0 17), 230760#(<= main_~i~0 16), 230767#(<= main_~i~0 23), 230766#(<= main_~i~0 22), 230765#(<= main_~i~0 21), 230764#(<= main_~i~0 20), 230771#(<= main_~i~0 27), 230770#(<= main_~i~0 26), 230769#(<= main_~i~0 25), 230768#(<= main_~i~0 24), 230775#(<= main_~i~0 31), 230774#(<= main_~i~0 30), 230773#(<= main_~i~0 29), 230772#(<= main_~i~0 28), 230779#(<= main_~i~0 35), 230778#(<= main_~i~0 34), 230777#(<= main_~i~0 33), 230776#(<= main_~i~0 32), 230783#(<= main_~i~0 39), 230782#(<= main_~i~0 38), 230781#(<= main_~i~0 37), 230780#(<= main_~i~0 36), 230787#(<= main_~i~0 43), 230786#(<= main_~i~0 42), 230785#(<= main_~i~0 41), 230784#(<= main_~i~0 40), 230791#(<= main_~i~0 47), 230790#(<= main_~i~0 46), 230789#(<= main_~i~0 45), 230788#(<= main_~i~0 44), 230795#(<= main_~i~0 51), 230794#(<= main_~i~0 50), 230793#(<= main_~i~0 49), 230792#(<= main_~i~0 48), 230799#(<= main_~i~0 55), 230798#(<= main_~i~0 54), 230797#(<= main_~i~0 53), 230796#(<= main_~i~0 52), 230803#(<= main_~i~0 59), 230802#(<= main_~i~0 58), 230801#(<= main_~i~0 57), 230800#(<= main_~i~0 56), 230807#(<= main_~i~0 63), 230806#(<= main_~i~0 62), 230805#(<= main_~i~0 61), 230804#(<= main_~i~0 60), 230811#(<= main_~i~0 67), 230810#(<= main_~i~0 66), 230809#(<= main_~i~0 65), 230808#(<= main_~i~0 64), 230815#(<= main_~i~0 71), 230814#(<= main_~i~0 70), 230813#(<= main_~i~0 69), 230812#(<= main_~i~0 68), 230819#(<= main_~i~0 75), 230818#(<= main_~i~0 74), 230817#(<= main_~i~0 73), 230816#(<= main_~i~0 72), 230823#(<= main_~i~0 79), 230822#(<= main_~i~0 78), 230821#(<= main_~i~0 77), 230820#(<= main_~i~0 76), 230827#(<= main_~i~0 83), 230826#(<= main_~i~0 82), 230825#(<= main_~i~0 81), 230824#(<= main_~i~0 80), 230831#(<= main_~i~0 87), 230830#(<= main_~i~0 86), 230829#(<= main_~i~0 85), 230828#(<= main_~i~0 84), 230835#(<= main_~i~0 91), 230834#(<= main_~i~0 90), 230833#(<= main_~i~0 89), 230832#(<= main_~i~0 88), 230839#(<= main_~i~0 95), 230838#(<= main_~i~0 94), 230837#(<= main_~i~0 93), 230836#(<= main_~i~0 92), 230843#(<= main_~i~0 99), 230842#(<= main_~i~0 98), 230841#(<= main_~i~0 97), 230840#(<= main_~i~0 96), 230847#(<= main_~i~0 103), 230846#(<= main_~i~0 102), 230845#(<= main_~i~0 101), 230844#(<= main_~i~0 100), 230851#(<= main_~i~0 107), 230850#(<= main_~i~0 106), 230849#(<= main_~i~0 105), 230848#(<= main_~i~0 104), 230855#(<= main_~i~0 111), 230854#(<= main_~i~0 110), 230853#(<= main_~i~0 109), 230852#(<= main_~i~0 108), 230859#(<= main_~i~0 115), 230858#(<= main_~i~0 114), 230857#(<= main_~i~0 113), 230856#(<= main_~i~0 112), 230863#(<= main_~i~0 119), 230862#(<= main_~i~0 118), 230861#(<= main_~i~0 117), 230860#(<= main_~i~0 116), 230867#(<= main_~i~0 123), 230866#(<= main_~i~0 122), 230865#(<= main_~i~0 121), 230864#(<= main_~i~0 120), 230871#(and (<= 2 main_~i~0) (<= main_~i~0 126)), 230870#(and (<= main_~i~0 125) (<= 1 main_~i~0)), 230869#(and (<= 0 main_~i~0) (<= main_~i~0 124)), 230868#(<= main_~i~0 124)] [2018-04-12 21:04:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 39627 backedges. 0 proven. 39627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:05,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-12 21:04:05,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-12 21:04:05,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8008, Invalid=8762, Unknown=0, NotChecked=0, Total=16770 [2018-04-12 21:04:05,908 INFO L87 Difference]: Start difference. First operand 1538 states and 1790 transitions. Second operand 130 states. [2018-04-12 21:04:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:04:16,580 INFO L93 Difference]: Finished difference Result 1679 states and 1934 transitions. [2018-04-12 21:04:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-04-12 21:04:16,580 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 637 [2018-04-12 21:04:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:04:16,581 INFO L225 Difference]: With dead ends: 1679 [2018-04-12 21:04:16,582 INFO L226 Difference]: Without dead ends: 1679 [2018-04-12 21:04:16,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8250 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=24135, Invalid=41145, Unknown=0, NotChecked=0, Total=65280 [2018-04-12 21:04:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2018-04-12 21:04:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1550. [2018-04-12 21:04:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2018-04-12 21:04:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1804 transitions. [2018-04-12 21:04:16,590 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1804 transitions. Word has length 637 [2018-04-12 21:04:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:04:16,590 INFO L459 AbstractCegarLoop]: Abstraction has 1550 states and 1804 transitions. [2018-04-12 21:04:16,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-12 21:04:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1804 transitions. [2018-04-12 21:04:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-04-12 21:04:16,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:04:16,593 INFO L355 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 127, 1, 1, 1, 1, 1, 1] [2018-04-12 21:04:16,593 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:04:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2031814837, now seen corresponding path program 127 times [2018-04-12 21:04:16,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:04:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:04:16,611 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:04:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 40259 backedges. 0 proven. 40259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:20,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:04:20,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-12 21:04:20,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:04:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:20,027 INFO L182 omatonBuilderFactory]: Interpolants [234355#(<= main_~i~0 0), 234354#false, 234353#true, 234359#(<= main_~i~0 4), 234358#(<= main_~i~0 3), 234357#(<= main_~i~0 2), 234356#(<= main_~i~0 1), 234363#(<= main_~i~0 8), 234362#(<= main_~i~0 7), 234361#(<= main_~i~0 6), 234360#(<= main_~i~0 5), 234367#(<= main_~i~0 12), 234366#(<= main_~i~0 11), 234365#(<= main_~i~0 10), 234364#(<= main_~i~0 9), 234371#(<= main_~i~0 16), 234370#(<= main_~i~0 15), 234369#(<= main_~i~0 14), 234368#(<= main_~i~0 13), 234375#(<= main_~i~0 20), 234374#(<= main_~i~0 19), 234373#(<= main_~i~0 18), 234372#(<= main_~i~0 17), 234379#(<= main_~i~0 24), 234378#(<= main_~i~0 23), 234377#(<= main_~i~0 22), 234376#(<= main_~i~0 21), 234383#(<= main_~i~0 28), 234382#(<= main_~i~0 27), 234381#(<= main_~i~0 26), 234380#(<= main_~i~0 25), 234387#(<= main_~i~0 32), 234386#(<= main_~i~0 31), 234385#(<= main_~i~0 30), 234384#(<= main_~i~0 29), 234391#(<= main_~i~0 36), 234390#(<= main_~i~0 35), 234389#(<= main_~i~0 34), 234388#(<= main_~i~0 33), 234395#(<= main_~i~0 40), 234394#(<= main_~i~0 39), 234393#(<= main_~i~0 38), 234392#(<= main_~i~0 37), 234399#(<= main_~i~0 44), 234398#(<= main_~i~0 43), 234397#(<= main_~i~0 42), 234396#(<= main_~i~0 41), 234403#(<= main_~i~0 48), 234402#(<= main_~i~0 47), 234401#(<= main_~i~0 46), 234400#(<= main_~i~0 45), 234407#(<= main_~i~0 52), 234406#(<= main_~i~0 51), 234405#(<= main_~i~0 50), 234404#(<= main_~i~0 49), 234411#(<= main_~i~0 56), 234410#(<= main_~i~0 55), 234409#(<= main_~i~0 54), 234408#(<= main_~i~0 53), 234415#(<= main_~i~0 60), 234414#(<= main_~i~0 59), 234413#(<= main_~i~0 58), 234412#(<= main_~i~0 57), 234419#(<= main_~i~0 64), 234418#(<= main_~i~0 63), 234417#(<= main_~i~0 62), 234416#(<= main_~i~0 61), 234423#(<= main_~i~0 68), 234422#(<= main_~i~0 67), 234421#(<= main_~i~0 66), 234420#(<= main_~i~0 65), 234427#(<= main_~i~0 72), 234426#(<= main_~i~0 71), 234425#(<= main_~i~0 70), 234424#(<= main_~i~0 69), 234431#(<= main_~i~0 76), 234430#(<= main_~i~0 75), 234429#(<= main_~i~0 74), 234428#(<= main_~i~0 73), 234435#(<= main_~i~0 80), 234434#(<= main_~i~0 79), 234433#(<= main_~i~0 78), 234432#(<= main_~i~0 77), 234439#(<= main_~i~0 84), 234438#(<= main_~i~0 83), 234437#(<= main_~i~0 82), 234436#(<= main_~i~0 81), 234443#(<= main_~i~0 88), 234442#(<= main_~i~0 87), 234441#(<= main_~i~0 86), 234440#(<= main_~i~0 85), 234447#(<= main_~i~0 92), 234446#(<= main_~i~0 91), 234445#(<= main_~i~0 90), 234444#(<= main_~i~0 89), 234451#(<= main_~i~0 96), 234450#(<= main_~i~0 95), 234449#(<= main_~i~0 94), 234448#(<= main_~i~0 93), 234455#(<= main_~i~0 100), 234454#(<= main_~i~0 99), 234453#(<= main_~i~0 98), 234452#(<= main_~i~0 97), 234459#(<= main_~i~0 104), 234458#(<= main_~i~0 103), 234457#(<= main_~i~0 102), 234456#(<= main_~i~0 101), 234463#(<= main_~i~0 108), 234462#(<= main_~i~0 107), 234461#(<= main_~i~0 106), 234460#(<= main_~i~0 105), 234467#(<= main_~i~0 112), 234466#(<= main_~i~0 111), 234465#(<= main_~i~0 110), 234464#(<= main_~i~0 109), 234471#(<= main_~i~0 116), 234470#(<= main_~i~0 115), 234469#(<= main_~i~0 114), 234468#(<= main_~i~0 113), 234475#(<= main_~i~0 120), 234474#(<= main_~i~0 119), 234473#(<= main_~i~0 118), 234472#(<= main_~i~0 117), 234479#(<= main_~i~0 124), 234478#(<= main_~i~0 123), 234477#(<= main_~i~0 122), 234476#(<= main_~i~0 121), 234483#(and (<= 1 main_~i~0) (<= main_~i~0 127)), 234482#(and (<= 0 main_~i~0) (<= main_~i~0 126)), 234481#(<= main_~i~0 126), 234480#(<= main_~i~0 125)] [2018-04-12 21:04:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 40259 backedges. 0 proven. 40259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:20,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-12 21:04:20,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-12 21:04:20,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8261, Invalid=8769, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 21:04:20,030 INFO L87 Difference]: Start difference. First operand 1550 states and 1804 transitions. Second operand 131 states. [2018-04-12 21:04:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:04:30,522 INFO L93 Difference]: Finished difference Result 1692 states and 1949 transitions. [2018-04-12 21:04:30,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-04-12 21:04:30,522 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 642 [2018-04-12 21:04:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:04:30,524 INFO L225 Difference]: With dead ends: 1692 [2018-04-12 21:04:30,524 INFO L226 Difference]: Without dead ends: 1692 [2018-04-12 21:04:30,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8254 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=24771, Invalid=41535, Unknown=0, NotChecked=0, Total=66306 [2018-04-12 21:04:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2018-04-12 21:04:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1562. [2018-04-12 21:04:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2018-04-12 21:04:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1818 transitions. [2018-04-12 21:04:30,532 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1818 transitions. Word has length 642 [2018-04-12 21:04:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:04:30,533 INFO L459 AbstractCegarLoop]: Abstraction has 1562 states and 1818 transitions. [2018-04-12 21:04:30,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-12 21:04:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1818 transitions. [2018-04-12 21:04:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-04-12 21:04:30,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:04:30,535 INFO L355 BasicCegarLoop]: trace histogram [129, 128, 128, 128, 128, 1, 1, 1, 1, 1, 1] [2018-04-12 21:04:30,535 INFO L408 AbstractCegarLoop]: === Iteration 129 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:04:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -560494232, now seen corresponding path program 128 times [2018-04-12 21:04:30,536 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:04:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:04:30,551 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:04:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 40896 backedges. 0 proven. 40896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:35,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:04:35,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-12 21:04:35,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:04:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:35,148 INFO L182 omatonBuilderFactory]: Interpolants [238083#(and (<= 89 main_~i~0) (<= main_~i~0 89)), 238082#(and (<= main_~i~0 88) (<= 88 main_~i~0)), 238081#(and (<= 87 main_~i~0) (<= main_~i~0 87)), 238080#(and (<= main_~i~0 86) (<= 86 main_~i~0)), 238087#(and (<= 93 main_~i~0) (<= main_~i~0 93)), 238086#(and (<= 92 main_~i~0) (<= main_~i~0 92)), 238085#(and (<= main_~i~0 91) (<= 91 main_~i~0)), 238084#(and (<= main_~i~0 90) (<= 90 main_~i~0)), 238091#(and (<= 97 main_~i~0) (<= main_~i~0 97)), 238090#(and (<= main_~i~0 96) (<= 96 main_~i~0)), 238089#(and (<= main_~i~0 95) (<= 95 main_~i~0)), 238088#(and (<= main_~i~0 94) (<= 94 main_~i~0)), 238095#(and (<= 101 main_~i~0) (<= main_~i~0 101)), 238094#(and (<= main_~i~0 100) (<= 100 main_~i~0)), 238093#(and (<= 99 main_~i~0) (<= main_~i~0 99)), 238092#(and (<= main_~i~0 98) (<= 98 main_~i~0)), 238099#(and (<= 105 main_~i~0) (<= main_~i~0 105)), 238098#(and (<= main_~i~0 104) (<= 104 main_~i~0)), 238097#(and (<= main_~i~0 103) (<= 103 main_~i~0)), 238096#(and (<= 102 main_~i~0) (<= main_~i~0 102)), 238103#(and (<= 109 main_~i~0) (<= main_~i~0 109)), 238102#(and (<= 108 main_~i~0) (<= main_~i~0 108)), 238101#(and (<= 107 main_~i~0) (<= main_~i~0 107)), 238100#(and (<= main_~i~0 106) (<= 106 main_~i~0)), 238107#(and (<= 113 main_~i~0) (<= main_~i~0 113)), 238106#(and (<= main_~i~0 112) (<= 112 main_~i~0)), 238105#(and (<= main_~i~0 111) (<= 111 main_~i~0)), 238104#(and (<= main_~i~0 110) (<= 110 main_~i~0)), 238111#(and (<= main_~i~0 117) (<= 117 main_~i~0)), 238110#(and (<= 116 main_~i~0) (<= main_~i~0 116)), 238109#(and (<= 115 main_~i~0) (<= main_~i~0 115)), 238108#(and (<= 114 main_~i~0) (<= main_~i~0 114)), 238115#(and (<= main_~i~0 121) (<= 121 main_~i~0)), 238114#(and (<= 120 main_~i~0) (<= main_~i~0 120)), 238113#(and (<= main_~i~0 119) (<= 119 main_~i~0)), 238112#(and (<= 118 main_~i~0) (<= main_~i~0 118)), 238119#(and (<= main_~i~0 125) (<= 125 main_~i~0)), 238118#(and (<= 124 main_~i~0) (<= main_~i~0 124)), 238117#(and (<= 123 main_~i~0) (<= main_~i~0 123)), 238116#(and (<= main_~i~0 122) (<= 122 main_~i~0)), 238122#(and (<= main_~i~0 128) (<= 128 main_~i~0)), 238121#(and (<= main_~i~0 127) (<= 127 main_~i~0)), 238120#(and (<= main_~i~0 126) (<= 126 main_~i~0)), 237995#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 237994#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 237993#false, 237992#true, 237999#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 237998#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 237997#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 237996#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 238003#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 238002#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 238001#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 238000#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 238007#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 238006#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 238005#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 238004#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 238011#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 238010#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 238009#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 238008#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 238015#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 238014#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 238013#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 238012#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 238019#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 238018#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 238017#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 238016#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 238023#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 238022#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 238021#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 238020#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 238027#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 238026#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 238025#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 238024#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 238031#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 238030#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 238029#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 238028#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 238035#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 238034#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 238033#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 238032#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 238039#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 238038#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 238037#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 238036#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 238043#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 238042#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 238041#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 238040#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 238047#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 238046#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 238045#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 238044#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 238051#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 238050#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 238049#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 238048#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 238055#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 238054#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 238053#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 238052#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 238059#(and (<= 65 main_~i~0) (<= main_~i~0 65)), 238058#(and (<= main_~i~0 64) (<= 64 main_~i~0)), 238057#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 238056#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 238063#(and (<= main_~i~0 69) (<= 69 main_~i~0)), 238062#(and (<= main_~i~0 68) (<= 68 main_~i~0)), 238061#(and (<= main_~i~0 67) (<= 67 main_~i~0)), 238060#(and (<= main_~i~0 66) (<= 66 main_~i~0)), 238067#(and (<= main_~i~0 73) (<= 73 main_~i~0)), 238066#(and (<= main_~i~0 72) (<= 72 main_~i~0)), 238065#(and (<= 71 main_~i~0) (<= main_~i~0 71)), 238064#(and (<= main_~i~0 70) (<= 70 main_~i~0)), 238071#(and (<= main_~i~0 77) (<= 77 main_~i~0)), 238070#(and (<= 76 main_~i~0) (<= main_~i~0 76)), 238069#(and (<= main_~i~0 75) (<= 75 main_~i~0)), 238068#(and (<= 74 main_~i~0) (<= main_~i~0 74)), 238075#(and (<= main_~i~0 81) (<= 81 main_~i~0)), 238074#(and (<= main_~i~0 80) (<= 80 main_~i~0)), 238073#(and (<= main_~i~0 79) (<= 79 main_~i~0)), 238072#(and (<= main_~i~0 78) (<= 78 main_~i~0)), 238079#(and (<= 85 main_~i~0) (<= main_~i~0 85)), 238078#(and (<= main_~i~0 84) (<= 84 main_~i~0)), 238077#(and (<= main_~i~0 83) (<= 83 main_~i~0)), 238076#(and (<= main_~i~0 82) (<= 82 main_~i~0))] [2018-04-12 21:04:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40896 backedges. 0 proven. 40896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:04:35,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-12 21:04:35,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-12 21:04:35,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 21:04:35,150 INFO L87 Difference]: Start difference. First operand 1562 states and 1818 transitions. Second operand 131 states. [2018-04-12 21:05:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:05:22,357 INFO L93 Difference]: Finished difference Result 1705 states and 1964 transitions. [2018-04-12 21:05:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-12 21:05:22,358 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 647 [2018-04-12 21:05:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:05:22,359 INFO L225 Difference]: With dead ends: 1705 [2018-04-12 21:05:22,359 INFO L226 Difference]: Without dead ends: 1705 [2018-04-12 21:05:22,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-04-12 21:05:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-04-12 21:05:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1574. [2018-04-12 21:05:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2018-04-12 21:05:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1832 transitions. [2018-04-12 21:05:22,366 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1832 transitions. Word has length 647 [2018-04-12 21:05:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:05:22,367 INFO L459 AbstractCegarLoop]: Abstraction has 1574 states and 1832 transitions. [2018-04-12 21:05:22,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-12 21:05:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1832 transitions. [2018-04-12 21:05:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-04-12 21:05:22,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:05:22,370 INFO L355 BasicCegarLoop]: trace histogram [130, 129, 129, 129, 129, 1, 1, 1, 1, 1, 1] [2018-04-12 21:05:22,370 INFO L408 AbstractCegarLoop]: === Iteration 130 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:05:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash 610173077, now seen corresponding path program 129 times [2018-04-12 21:05:22,370 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:05:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:05:22,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:05:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 41538 backedges. 0 proven. 41538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:25,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:05:25,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-04-12 21:05:25,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:05:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:25,870 INFO L182 omatonBuilderFactory]: Interpolants [241411#(<= main_~i~0 7), 241410#(<= main_~i~0 6), 241409#(<= main_~i~0 5), 241408#(<= main_~i~0 4), 241415#(<= main_~i~0 11), 241414#(<= main_~i~0 10), 241413#(<= main_~i~0 9), 241412#(<= main_~i~0 8), 241419#(<= main_~i~0 15), 241418#(<= main_~i~0 14), 241417#(<= main_~i~0 13), 241416#(<= main_~i~0 12), 241423#(<= main_~i~0 19), 241422#(<= main_~i~0 18), 241421#(<= main_~i~0 17), 241420#(<= main_~i~0 16), 241427#(<= main_~i~0 23), 241426#(<= main_~i~0 22), 241425#(<= main_~i~0 21), 241424#(<= main_~i~0 20), 241431#(<= main_~i~0 27), 241430#(<= main_~i~0 26), 241429#(<= main_~i~0 25), 241428#(<= main_~i~0 24), 241435#(<= main_~i~0 31), 241434#(<= main_~i~0 30), 241433#(<= main_~i~0 29), 241432#(<= main_~i~0 28), 241439#(<= main_~i~0 35), 241438#(<= main_~i~0 34), 241437#(<= main_~i~0 33), 241436#(<= main_~i~0 32), 241443#(<= main_~i~0 39), 241442#(<= main_~i~0 38), 241441#(<= main_~i~0 37), 241440#(<= main_~i~0 36), 241447#(<= main_~i~0 43), 241446#(<= main_~i~0 42), 241445#(<= main_~i~0 41), 241444#(<= main_~i~0 40), 241451#(<= main_~i~0 47), 241450#(<= main_~i~0 46), 241449#(<= main_~i~0 45), 241448#(<= main_~i~0 44), 241455#(<= main_~i~0 51), 241454#(<= main_~i~0 50), 241453#(<= main_~i~0 49), 241452#(<= main_~i~0 48), 241459#(<= main_~i~0 55), 241458#(<= main_~i~0 54), 241457#(<= main_~i~0 53), 241456#(<= main_~i~0 52), 241463#(<= main_~i~0 59), 241462#(<= main_~i~0 58), 241461#(<= main_~i~0 57), 241460#(<= main_~i~0 56), 241467#(<= main_~i~0 63), 241466#(<= main_~i~0 62), 241465#(<= main_~i~0 61), 241464#(<= main_~i~0 60), 241471#(<= main_~i~0 67), 241470#(<= main_~i~0 66), 241469#(<= main_~i~0 65), 241468#(<= main_~i~0 64), 241475#(<= main_~i~0 71), 241474#(<= main_~i~0 70), 241473#(<= main_~i~0 69), 241472#(<= main_~i~0 68), 241479#(<= main_~i~0 75), 241478#(<= main_~i~0 74), 241477#(<= main_~i~0 73), 241476#(<= main_~i~0 72), 241483#(<= main_~i~0 79), 241482#(<= main_~i~0 78), 241481#(<= main_~i~0 77), 241480#(<= main_~i~0 76), 241487#(<= main_~i~0 83), 241486#(<= main_~i~0 82), 241485#(<= main_~i~0 81), 241484#(<= main_~i~0 80), 241491#(<= main_~i~0 87), 241490#(<= main_~i~0 86), 241489#(<= main_~i~0 85), 241488#(<= main_~i~0 84), 241495#(<= main_~i~0 91), 241494#(<= main_~i~0 90), 241493#(<= main_~i~0 89), 241492#(<= main_~i~0 88), 241499#(<= main_~i~0 95), 241498#(<= main_~i~0 94), 241497#(<= main_~i~0 93), 241496#(<= main_~i~0 92), 241503#(<= main_~i~0 99), 241502#(<= main_~i~0 98), 241501#(<= main_~i~0 97), 241500#(<= main_~i~0 96), 241507#(<= main_~i~0 103), 241506#(<= main_~i~0 102), 241505#(<= main_~i~0 101), 241504#(<= main_~i~0 100), 241511#(<= main_~i~0 107), 241510#(<= main_~i~0 106), 241509#(<= main_~i~0 105), 241508#(<= main_~i~0 104), 241515#(<= main_~i~0 111), 241514#(<= main_~i~0 110), 241513#(<= main_~i~0 109), 241512#(<= main_~i~0 108), 241519#(<= main_~i~0 115), 241518#(<= main_~i~0 114), 241517#(<= main_~i~0 113), 241516#(<= main_~i~0 112), 241523#(<= main_~i~0 119), 241522#(<= main_~i~0 118), 241521#(<= main_~i~0 117), 241520#(<= main_~i~0 116), 241527#(<= main_~i~0 123), 241526#(<= main_~i~0 122), 241525#(<= main_~i~0 121), 241524#(<= main_~i~0 120), 241531#(<= main_~i~0 127), 241530#(<= main_~i~0 126), 241529#(<= main_~i~0 125), 241528#(<= main_~i~0 124), 241534#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 241533#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 241532#(<= main_~i~0 128), 241403#false, 241402#true, 241407#(<= main_~i~0 3), 241406#(<= main_~i~0 2), 241405#(<= main_~i~0 1), 241404#(<= main_~i~0 0)] [2018-04-12 21:05:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 41538 backedges. 0 proven. 41538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:25,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-12 21:05:25,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-12 21:05:25,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8520, Invalid=9036, Unknown=0, NotChecked=0, Total=17556 [2018-04-12 21:05:25,872 INFO L87 Difference]: Start difference. First operand 1574 states and 1832 transitions. Second operand 133 states. [2018-04-12 21:05:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:05:36,632 INFO L93 Difference]: Finished difference Result 1718 states and 1979 transitions. [2018-04-12 21:05:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-12 21:05:36,632 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 652 [2018-04-12 21:05:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:05:36,633 INFO L225 Difference]: With dead ends: 1718 [2018-04-12 21:05:36,633 INFO L226 Difference]: Without dead ends: 1718 [2018-04-12 21:05:36,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8513 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=25548, Invalid=42834, Unknown=0, NotChecked=0, Total=68382 [2018-04-12 21:05:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-04-12 21:05:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1586. [2018-04-12 21:05:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2018-04-12 21:05:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1846 transitions. [2018-04-12 21:05:36,642 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1846 transitions. Word has length 652 [2018-04-12 21:05:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:05:36,642 INFO L459 AbstractCegarLoop]: Abstraction has 1586 states and 1846 transitions. [2018-04-12 21:05:36,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-12 21:05:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1846 transitions. [2018-04-12 21:05:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2018-04-12 21:05:36,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:05:36,645 INFO L355 BasicCegarLoop]: trace histogram [131, 130, 130, 130, 130, 1, 1, 1, 1, 1, 1] [2018-04-12 21:05:36,645 INFO L408 AbstractCegarLoop]: === Iteration 131 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:05:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1411644808, now seen corresponding path program 130 times [2018-04-12 21:05:36,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:05:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:05:36,661 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:05:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 42185 backedges. 0 proven. 42185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:40,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:05:40,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-04-12 21:05:40,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:05:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:40,127 INFO L182 omatonBuilderFactory]: Interpolants [245099#(<= main_~i~0 0), 245098#false, 245097#true, 245103#(<= main_~i~0 4), 245102#(<= main_~i~0 3), 245101#(<= main_~i~0 2), 245100#(<= main_~i~0 1), 245107#(<= main_~i~0 8), 245106#(<= main_~i~0 7), 245105#(<= main_~i~0 6), 245104#(<= main_~i~0 5), 245111#(<= main_~i~0 12), 245110#(<= main_~i~0 11), 245109#(<= main_~i~0 10), 245108#(<= main_~i~0 9), 245115#(<= main_~i~0 16), 245114#(<= main_~i~0 15), 245113#(<= main_~i~0 14), 245112#(<= main_~i~0 13), 245119#(<= main_~i~0 20), 245118#(<= main_~i~0 19), 245117#(<= main_~i~0 18), 245116#(<= main_~i~0 17), 245123#(<= main_~i~0 24), 245122#(<= main_~i~0 23), 245121#(<= main_~i~0 22), 245120#(<= main_~i~0 21), 245127#(<= main_~i~0 28), 245126#(<= main_~i~0 27), 245125#(<= main_~i~0 26), 245124#(<= main_~i~0 25), 245131#(<= main_~i~0 32), 245130#(<= main_~i~0 31), 245129#(<= main_~i~0 30), 245128#(<= main_~i~0 29), 245135#(<= main_~i~0 36), 245134#(<= main_~i~0 35), 245133#(<= main_~i~0 34), 245132#(<= main_~i~0 33), 245139#(<= main_~i~0 40), 245138#(<= main_~i~0 39), 245137#(<= main_~i~0 38), 245136#(<= main_~i~0 37), 245143#(<= main_~i~0 44), 245142#(<= main_~i~0 43), 245141#(<= main_~i~0 42), 245140#(<= main_~i~0 41), 245147#(<= main_~i~0 48), 245146#(<= main_~i~0 47), 245145#(<= main_~i~0 46), 245144#(<= main_~i~0 45), 245151#(<= main_~i~0 52), 245150#(<= main_~i~0 51), 245149#(<= main_~i~0 50), 245148#(<= main_~i~0 49), 245155#(<= main_~i~0 56), 245154#(<= main_~i~0 55), 245153#(<= main_~i~0 54), 245152#(<= main_~i~0 53), 245159#(<= main_~i~0 60), 245158#(<= main_~i~0 59), 245157#(<= main_~i~0 58), 245156#(<= main_~i~0 57), 245163#(<= main_~i~0 64), 245162#(<= main_~i~0 63), 245161#(<= main_~i~0 62), 245160#(<= main_~i~0 61), 245167#(<= main_~i~0 68), 245166#(<= main_~i~0 67), 245165#(<= main_~i~0 66), 245164#(<= main_~i~0 65), 245171#(<= main_~i~0 72), 245170#(<= main_~i~0 71), 245169#(<= main_~i~0 70), 245168#(<= main_~i~0 69), 245175#(<= main_~i~0 76), 245174#(<= main_~i~0 75), 245173#(<= main_~i~0 74), 245172#(<= main_~i~0 73), 245179#(<= main_~i~0 80), 245178#(<= main_~i~0 79), 245177#(<= main_~i~0 78), 245176#(<= main_~i~0 77), 245183#(<= main_~i~0 84), 245182#(<= main_~i~0 83), 245181#(<= main_~i~0 82), 245180#(<= main_~i~0 81), 245187#(<= main_~i~0 88), 245186#(<= main_~i~0 87), 245185#(<= main_~i~0 86), 245184#(<= main_~i~0 85), 245191#(<= main_~i~0 92), 245190#(<= main_~i~0 91), 245189#(<= main_~i~0 90), 245188#(<= main_~i~0 89), 245195#(<= main_~i~0 96), 245194#(<= main_~i~0 95), 245193#(<= main_~i~0 94), 245192#(<= main_~i~0 93), 245199#(<= main_~i~0 100), 245198#(<= main_~i~0 99), 245197#(<= main_~i~0 98), 245196#(<= main_~i~0 97), 245203#(<= main_~i~0 104), 245202#(<= main_~i~0 103), 245201#(<= main_~i~0 102), 245200#(<= main_~i~0 101), 245207#(<= main_~i~0 108), 245206#(<= main_~i~0 107), 245205#(<= main_~i~0 106), 245204#(<= main_~i~0 105), 245211#(<= main_~i~0 112), 245210#(<= main_~i~0 111), 245209#(<= main_~i~0 110), 245208#(<= main_~i~0 109), 245215#(<= main_~i~0 116), 245214#(<= main_~i~0 115), 245213#(<= main_~i~0 114), 245212#(<= main_~i~0 113), 245219#(<= main_~i~0 120), 245218#(<= main_~i~0 119), 245217#(<= main_~i~0 118), 245216#(<= main_~i~0 117), 245223#(<= main_~i~0 124), 245222#(<= main_~i~0 123), 245221#(<= main_~i~0 122), 245220#(<= main_~i~0 121), 245227#(<= main_~i~0 128), 245226#(<= main_~i~0 127), 245225#(<= main_~i~0 126), 245224#(<= main_~i~0 125), 245230#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 245229#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 245228#(and (<= 0 main_~i~0) (<= main_~i~0 128))] [2018-04-12 21:05:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 42185 backedges. 0 proven. 42185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:40,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-12 21:05:40,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-12 21:05:40,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8522, Invalid=9300, Unknown=0, NotChecked=0, Total=17822 [2018-04-12 21:05:40,130 INFO L87 Difference]: Start difference. First operand 1586 states and 1846 transitions. Second operand 134 states. [2018-04-12 21:05:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:05:51,424 INFO L93 Difference]: Finished difference Result 1731 states and 1994 transitions. [2018-04-12 21:05:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-04-12 21:05:51,424 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 657 [2018-04-12 21:05:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:05:51,425 INFO L225 Difference]: With dead ends: 1731 [2018-04-12 21:05:51,425 INFO L226 Difference]: Without dead ends: 1731 [2018-04-12 21:05:51,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8772 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=25681, Invalid=43751, Unknown=0, NotChecked=0, Total=69432 [2018-04-12 21:05:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-04-12 21:05:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1598. [2018-04-12 21:05:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-04-12 21:05:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1860 transitions. [2018-04-12 21:05:51,432 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1860 transitions. Word has length 657 [2018-04-12 21:05:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:05:51,433 INFO L459 AbstractCegarLoop]: Abstraction has 1598 states and 1860 transitions. [2018-04-12 21:05:51,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-12 21:05:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1860 transitions. [2018-04-12 21:05:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-04-12 21:05:51,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:05:51,435 INFO L355 BasicCegarLoop]: trace histogram [132, 131, 131, 131, 131, 1, 1, 1, 1, 1, 1] [2018-04-12 21:05:51,435 INFO L408 AbstractCegarLoop]: === Iteration 132 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:05:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1863688309, now seen corresponding path program 131 times [2018-04-12 21:05:51,435 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:05:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:05:51,450 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:05:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42837 backedges. 0 proven. 42837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:54,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:05:54,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-04-12 21:05:54,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:05:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:54,999 INFO L182 omatonBuilderFactory]: Interpolants [248835#(<= main_~i~0 13), 248834#(<= main_~i~0 12), 248833#(<= main_~i~0 11), 248832#(<= main_~i~0 10), 248839#(<= main_~i~0 17), 248838#(<= main_~i~0 16), 248837#(<= main_~i~0 15), 248836#(<= main_~i~0 14), 248843#(<= main_~i~0 21), 248842#(<= main_~i~0 20), 248841#(<= main_~i~0 19), 248840#(<= main_~i~0 18), 248847#(<= main_~i~0 25), 248846#(<= main_~i~0 24), 248845#(<= main_~i~0 23), 248844#(<= main_~i~0 22), 248851#(<= main_~i~0 29), 248850#(<= main_~i~0 28), 248849#(<= main_~i~0 27), 248848#(<= main_~i~0 26), 248855#(<= main_~i~0 33), 248854#(<= main_~i~0 32), 248853#(<= main_~i~0 31), 248852#(<= main_~i~0 30), 248859#(<= main_~i~0 37), 248858#(<= main_~i~0 36), 248857#(<= main_~i~0 35), 248856#(<= main_~i~0 34), 248863#(<= main_~i~0 41), 248862#(<= main_~i~0 40), 248861#(<= main_~i~0 39), 248860#(<= main_~i~0 38), 248867#(<= main_~i~0 45), 248866#(<= main_~i~0 44), 248865#(<= main_~i~0 43), 248864#(<= main_~i~0 42), 248871#(<= main_~i~0 49), 248870#(<= main_~i~0 48), 248869#(<= main_~i~0 47), 248868#(<= main_~i~0 46), 248875#(<= main_~i~0 53), 248874#(<= main_~i~0 52), 248873#(<= main_~i~0 51), 248872#(<= main_~i~0 50), 248879#(<= main_~i~0 57), 248878#(<= main_~i~0 56), 248877#(<= main_~i~0 55), 248876#(<= main_~i~0 54), 248883#(<= main_~i~0 61), 248882#(<= main_~i~0 60), 248881#(<= main_~i~0 59), 248880#(<= main_~i~0 58), 248887#(<= main_~i~0 65), 248886#(<= main_~i~0 64), 248885#(<= main_~i~0 63), 248884#(<= main_~i~0 62), 248891#(<= main_~i~0 69), 248890#(<= main_~i~0 68), 248889#(<= main_~i~0 67), 248888#(<= main_~i~0 66), 248895#(<= main_~i~0 73), 248894#(<= main_~i~0 72), 248893#(<= main_~i~0 71), 248892#(<= main_~i~0 70), 248899#(<= main_~i~0 77), 248898#(<= main_~i~0 76), 248897#(<= main_~i~0 75), 248896#(<= main_~i~0 74), 248903#(<= main_~i~0 81), 248902#(<= main_~i~0 80), 248901#(<= main_~i~0 79), 248900#(<= main_~i~0 78), 248907#(<= main_~i~0 85), 248906#(<= main_~i~0 84), 248905#(<= main_~i~0 83), 248904#(<= main_~i~0 82), 248911#(<= main_~i~0 89), 248910#(<= main_~i~0 88), 248909#(<= main_~i~0 87), 248908#(<= main_~i~0 86), 248915#(<= main_~i~0 93), 248914#(<= main_~i~0 92), 248913#(<= main_~i~0 91), 248912#(<= main_~i~0 90), 248919#(<= main_~i~0 97), 248918#(<= main_~i~0 96), 248917#(<= main_~i~0 95), 248916#(<= main_~i~0 94), 248923#(<= main_~i~0 101), 248922#(<= main_~i~0 100), 248921#(<= main_~i~0 99), 248920#(<= main_~i~0 98), 248927#(<= main_~i~0 105), 248926#(<= main_~i~0 104), 248925#(<= main_~i~0 103), 248924#(<= main_~i~0 102), 248931#(<= main_~i~0 109), 248930#(<= main_~i~0 108), 248929#(<= main_~i~0 107), 248928#(<= main_~i~0 106), 248935#(<= main_~i~0 113), 248934#(<= main_~i~0 112), 248933#(<= main_~i~0 111), 248932#(<= main_~i~0 110), 248939#(<= main_~i~0 117), 248938#(<= main_~i~0 116), 248937#(<= main_~i~0 115), 248936#(<= main_~i~0 114), 248943#(<= main_~i~0 121), 248942#(<= main_~i~0 120), 248941#(<= main_~i~0 119), 248940#(<= main_~i~0 118), 248947#(<= main_~i~0 125), 248946#(<= main_~i~0 124), 248945#(<= main_~i~0 123), 248944#(<= main_~i~0 122), 248951#(<= main_~i~0 129), 248950#(<= main_~i~0 128), 248949#(<= main_~i~0 127), 248948#(<= main_~i~0 126), 248954#(and (<= 1 main_~i~0) (<= main_~i~0 131)), 248953#(and (<= 0 main_~i~0) (<= main_~i~0 130)), 248952#(<= main_~i~0 130), 248823#(<= main_~i~0 1), 248822#(<= main_~i~0 0), 248821#false, 248820#true, 248827#(<= main_~i~0 5), 248826#(<= main_~i~0 4), 248825#(<= main_~i~0 3), 248824#(<= main_~i~0 2), 248831#(<= main_~i~0 9), 248830#(<= main_~i~0 8), 248829#(<= main_~i~0 7), 248828#(<= main_~i~0 6)] [2018-04-12 21:05:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 42837 backedges. 0 proven. 42837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:05:55,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-04-12 21:05:55,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-04-12 21:05:55,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8783, Invalid=9307, Unknown=0, NotChecked=0, Total=18090 [2018-04-12 21:05:55,001 INFO L87 Difference]: Start difference. First operand 1598 states and 1860 transitions. Second operand 135 states. [2018-04-12 21:06:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:06:06,669 INFO L93 Difference]: Finished difference Result 1744 states and 2009 transitions. [2018-04-12 21:06:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-04-12 21:06:06,670 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 662 [2018-04-12 21:06:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:06:06,671 INFO L225 Difference]: With dead ends: 1744 [2018-04-12 21:06:06,671 INFO L226 Difference]: Without dead ends: 1744 [2018-04-12 21:06:06,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8776 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=26337, Invalid=44153, Unknown=0, NotChecked=0, Total=70490 [2018-04-12 21:06:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-04-12 21:06:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1610. [2018-04-12 21:06:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-04-12 21:06:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1874 transitions. [2018-04-12 21:06:06,745 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1874 transitions. Word has length 662 [2018-04-12 21:06:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:06:06,745 INFO L459 AbstractCegarLoop]: Abstraction has 1610 states and 1874 transitions. [2018-04-12 21:06:06,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-04-12 21:06:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1874 transitions. [2018-04-12 21:06:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-04-12 21:06:06,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:06:06,748 INFO L355 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 132, 1, 1, 1, 1, 1, 1] [2018-04-12 21:06:06,748 INFO L408 AbstractCegarLoop]: === Iteration 133 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:06:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2008692312, now seen corresponding path program 132 times [2018-04-12 21:06:06,748 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:06:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:06:06,764 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:06:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 43494 backedges. 0 proven. 43494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:10,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:06:10,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-04-12 21:06:10,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:06:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:10,346 INFO L182 omatonBuilderFactory]: Interpolants [252675#(<= main_~i~0 102), 252674#(<= main_~i~0 101), 252673#(<= main_~i~0 100), 252672#(<= main_~i~0 99), 252679#(<= main_~i~0 106), 252678#(<= main_~i~0 105), 252677#(<= main_~i~0 104), 252676#(<= main_~i~0 103), 252683#(<= main_~i~0 110), 252682#(<= main_~i~0 109), 252681#(<= main_~i~0 108), 252680#(<= main_~i~0 107), 252687#(<= main_~i~0 114), 252686#(<= main_~i~0 113), 252685#(<= main_~i~0 112), 252684#(<= main_~i~0 111), 252691#(<= main_~i~0 118), 252690#(<= main_~i~0 117), 252689#(<= main_~i~0 116), 252688#(<= main_~i~0 115), 252695#(<= main_~i~0 122), 252694#(<= main_~i~0 121), 252693#(<= main_~i~0 120), 252692#(<= main_~i~0 119), 252699#(<= main_~i~0 126), 252698#(<= main_~i~0 125), 252697#(<= main_~i~0 124), 252696#(<= main_~i~0 123), 252703#(and (<= main_~i~0 129) (<= 1 main_~i~0)), 252702#(and (<= 0 main_~i~0) (<= main_~i~0 128)), 252701#(<= main_~i~0 128), 252700#(<= main_~i~0 127), 252706#(and (<= main_~i~0 132) (<= 4 main_~i~0)), 252705#(and (<= main_~i~0 131) (<= 3 main_~i~0)), 252704#(and (<= 2 main_~i~0) (<= main_~i~0 130)), 252571#true, 252575#(<= main_~i~0 2), 252574#(<= main_~i~0 1), 252573#(<= main_~i~0 0), 252572#false, 252579#(<= main_~i~0 6), 252578#(<= main_~i~0 5), 252577#(<= main_~i~0 4), 252576#(<= main_~i~0 3), 252583#(<= main_~i~0 10), 252582#(<= main_~i~0 9), 252581#(<= main_~i~0 8), 252580#(<= main_~i~0 7), 252587#(<= main_~i~0 14), 252586#(<= main_~i~0 13), 252585#(<= main_~i~0 12), 252584#(<= main_~i~0 11), 252591#(<= main_~i~0 18), 252590#(<= main_~i~0 17), 252589#(<= main_~i~0 16), 252588#(<= main_~i~0 15), 252595#(<= main_~i~0 22), 252594#(<= main_~i~0 21), 252593#(<= main_~i~0 20), 252592#(<= main_~i~0 19), 252599#(<= main_~i~0 26), 252598#(<= main_~i~0 25), 252597#(<= main_~i~0 24), 252596#(<= main_~i~0 23), 252603#(<= main_~i~0 30), 252602#(<= main_~i~0 29), 252601#(<= main_~i~0 28), 252600#(<= main_~i~0 27), 252607#(<= main_~i~0 34), 252606#(<= main_~i~0 33), 252605#(<= main_~i~0 32), 252604#(<= main_~i~0 31), 252611#(<= main_~i~0 38), 252610#(<= main_~i~0 37), 252609#(<= main_~i~0 36), 252608#(<= main_~i~0 35), 252615#(<= main_~i~0 42), 252614#(<= main_~i~0 41), 252613#(<= main_~i~0 40), 252612#(<= main_~i~0 39), 252619#(<= main_~i~0 46), 252618#(<= main_~i~0 45), 252617#(<= main_~i~0 44), 252616#(<= main_~i~0 43), 252623#(<= main_~i~0 50), 252622#(<= main_~i~0 49), 252621#(<= main_~i~0 48), 252620#(<= main_~i~0 47), 252627#(<= main_~i~0 54), 252626#(<= main_~i~0 53), 252625#(<= main_~i~0 52), 252624#(<= main_~i~0 51), 252631#(<= main_~i~0 58), 252630#(<= main_~i~0 57), 252629#(<= main_~i~0 56), 252628#(<= main_~i~0 55), 252635#(<= main_~i~0 62), 252634#(<= main_~i~0 61), 252633#(<= main_~i~0 60), 252632#(<= main_~i~0 59), 252639#(<= main_~i~0 66), 252638#(<= main_~i~0 65), 252637#(<= main_~i~0 64), 252636#(<= main_~i~0 63), 252643#(<= main_~i~0 70), 252642#(<= main_~i~0 69), 252641#(<= main_~i~0 68), 252640#(<= main_~i~0 67), 252647#(<= main_~i~0 74), 252646#(<= main_~i~0 73), 252645#(<= main_~i~0 72), 252644#(<= main_~i~0 71), 252651#(<= main_~i~0 78), 252650#(<= main_~i~0 77), 252649#(<= main_~i~0 76), 252648#(<= main_~i~0 75), 252655#(<= main_~i~0 82), 252654#(<= main_~i~0 81), 252653#(<= main_~i~0 80), 252652#(<= main_~i~0 79), 252659#(<= main_~i~0 86), 252658#(<= main_~i~0 85), 252657#(<= main_~i~0 84), 252656#(<= main_~i~0 83), 252663#(<= main_~i~0 90), 252662#(<= main_~i~0 89), 252661#(<= main_~i~0 88), 252660#(<= main_~i~0 87), 252667#(<= main_~i~0 94), 252666#(<= main_~i~0 93), 252665#(<= main_~i~0 92), 252664#(<= main_~i~0 91), 252671#(<= main_~i~0 98), 252670#(<= main_~i~0 97), 252669#(<= main_~i~0 96), 252668#(<= main_~i~0 95)] [2018-04-12 21:06:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 43494 backedges. 0 proven. 43494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:10,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-12 21:06:10,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-12 21:06:10,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8526, Invalid=9834, Unknown=0, NotChecked=0, Total=18360 [2018-04-12 21:06:10,348 INFO L87 Difference]: Start difference. First operand 1610 states and 1874 transitions. Second operand 136 states. [2018-04-12 21:06:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 21:06:22,836 INFO L93 Difference]: Finished difference Result 1757 states and 2024 transitions. [2018-04-12 21:06:22,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-12 21:06:22,836 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 667 [2018-04-12 21:06:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 21:06:22,837 INFO L225 Difference]: With dead ends: 1757 [2018-04-12 21:06:22,837 INFO L226 Difference]: Without dead ends: 1757 [2018-04-12 21:06:22,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9293 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=25947, Invalid=45609, Unknown=0, NotChecked=0, Total=71556 [2018-04-12 21:06:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2018-04-12 21:06:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1622. [2018-04-12 21:06:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-04-12 21:06:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1888 transitions. [2018-04-12 21:06:22,849 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1888 transitions. Word has length 667 [2018-04-12 21:06:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 21:06:22,849 INFO L459 AbstractCegarLoop]: Abstraction has 1622 states and 1888 transitions. [2018-04-12 21:06:22,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-12 21:06:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1888 transitions. [2018-04-12 21:06:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-04-12 21:06:22,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 21:06:22,852 INFO L355 BasicCegarLoop]: trace histogram [134, 133, 133, 133, 133, 1, 1, 1, 1, 1, 1] [2018-04-12 21:06:22,852 INFO L408 AbstractCegarLoop]: === Iteration 134 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-12 21:06:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash -87136171, now seen corresponding path program 133 times [2018-04-12 21:06:22,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 21:06:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 21:06:22,869 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 21:06:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 44156 backedges. 0 proven. 44156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:26,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 21:06:26,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-04-12 21:06:26,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 21:06:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:26,497 INFO L182 omatonBuilderFactory]: Interpolants [256351#false, 256350#true, 256355#(<= main_~i~0 3), 256354#(<= main_~i~0 2), 256353#(<= main_~i~0 1), 256352#(<= main_~i~0 0), 256359#(<= main_~i~0 7), 256358#(<= main_~i~0 6), 256357#(<= main_~i~0 5), 256356#(<= main_~i~0 4), 256363#(<= main_~i~0 11), 256362#(<= main_~i~0 10), 256361#(<= main_~i~0 9), 256360#(<= main_~i~0 8), 256367#(<= main_~i~0 15), 256366#(<= main_~i~0 14), 256365#(<= main_~i~0 13), 256364#(<= main_~i~0 12), 256371#(<= main_~i~0 19), 256370#(<= main_~i~0 18), 256369#(<= main_~i~0 17), 256368#(<= main_~i~0 16), 256375#(<= main_~i~0 23), 256374#(<= main_~i~0 22), 256373#(<= main_~i~0 21), 256372#(<= main_~i~0 20), 256379#(<= main_~i~0 27), 256378#(<= main_~i~0 26), 256377#(<= main_~i~0 25), 256376#(<= main_~i~0 24), 256383#(<= main_~i~0 31), 256382#(<= main_~i~0 30), 256381#(<= main_~i~0 29), 256380#(<= main_~i~0 28), 256387#(<= main_~i~0 35), 256386#(<= main_~i~0 34), 256385#(<= main_~i~0 33), 256384#(<= main_~i~0 32), 256391#(<= main_~i~0 39), 256390#(<= main_~i~0 38), 256389#(<= main_~i~0 37), 256388#(<= main_~i~0 36), 256395#(<= main_~i~0 43), 256394#(<= main_~i~0 42), 256393#(<= main_~i~0 41), 256392#(<= main_~i~0 40), 256399#(<= main_~i~0 47), 256398#(<= main_~i~0 46), 256397#(<= main_~i~0 45), 256396#(<= main_~i~0 44), 256403#(<= main_~i~0 51), 256402#(<= main_~i~0 50), 256401#(<= main_~i~0 49), 256400#(<= main_~i~0 48), 256407#(<= main_~i~0 55), 256406#(<= main_~i~0 54), 256405#(<= main_~i~0 53), 256404#(<= main_~i~0 52), 256411#(<= main_~i~0 59), 256410#(<= main_~i~0 58), 256409#(<= main_~i~0 57), 256408#(<= main_~i~0 56), 256415#(<= main_~i~0 63), 256414#(<= main_~i~0 62), 256413#(<= main_~i~0 61), 256412#(<= main_~i~0 60), 256419#(<= main_~i~0 67), 256418#(<= main_~i~0 66), 256417#(<= main_~i~0 65), 256416#(<= main_~i~0 64), 256423#(<= main_~i~0 71), 256422#(<= main_~i~0 70), 256421#(<= main_~i~0 69), 256420#(<= main_~i~0 68), 256427#(<= main_~i~0 75), 256426#(<= main_~i~0 74), 256425#(<= main_~i~0 73), 256424#(<= main_~i~0 72), 256431#(<= main_~i~0 79), 256430#(<= main_~i~0 78), 256429#(<= main_~i~0 77), 256428#(<= main_~i~0 76), 256435#(<= main_~i~0 83), 256434#(<= main_~i~0 82), 256433#(<= main_~i~0 81), 256432#(<= main_~i~0 80), 256439#(<= main_~i~0 87), 256438#(<= main_~i~0 86), 256437#(<= main_~i~0 85), 256436#(<= main_~i~0 84), 256443#(<= main_~i~0 91), 256442#(<= main_~i~0 90), 256441#(<= main_~i~0 89), 256440#(<= main_~i~0 88), 256447#(<= main_~i~0 95), 256446#(<= main_~i~0 94), 256445#(<= main_~i~0 93), 256444#(<= main_~i~0 92), 256451#(<= main_~i~0 99), 256450#(<= main_~i~0 98), 256449#(<= main_~i~0 97), 256448#(<= main_~i~0 96), 256455#(<= main_~i~0 103), 256454#(<= main_~i~0 102), 256453#(<= main_~i~0 101), 256452#(<= main_~i~0 100), 256459#(<= main_~i~0 107), 256458#(<= main_~i~0 106), 256457#(<= main_~i~0 105), 256456#(<= main_~i~0 104), 256463#(<= main_~i~0 111), 256462#(<= main_~i~0 110), 256461#(<= main_~i~0 109), 256460#(<= main_~i~0 108), 256467#(<= main_~i~0 115), 256466#(<= main_~i~0 114), 256465#(<= main_~i~0 113), 256464#(<= main_~i~0 112), 256471#(<= main_~i~0 119), 256470#(<= main_~i~0 118), 256469#(<= main_~i~0 117), 256468#(<= main_~i~0 116), 256475#(<= main_~i~0 123), 256474#(<= main_~i~0 122), 256473#(<= main_~i~0 121), 256472#(<= main_~i~0 120), 256479#(<= main_~i~0 127), 256478#(<= main_~i~0 126), 256477#(<= main_~i~0 125), 256476#(<= main_~i~0 124), 256483#(<= main_~i~0 131), 256482#(<= main_~i~0 130), 256481#(<= main_~i~0 129), 256480#(<= main_~i~0 128), 256486#(and (<= 1 main_~i~0) (<= main_~i~0 133)), 256485#(and (<= 0 main_~i~0) (<= main_~i~0 132)), 256484#(<= main_~i~0 132)] [2018-04-12 21:06:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 44156 backedges. 0 proven. 44156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 21:06:26,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-12 21:06:26,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-12 21:06:26,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9050, Invalid=9582, Unknown=0, NotChecked=0, Total=18632 [2018-04-12 21:06:26,500 INFO L87 Difference]: Start difference. First operand 1622 states and 1888 transitions. Second operand 137 states. Received shutdown request... [2018-04-12 21:06:36,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-04-12 21:06:36,388 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 21:06:36,391 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 21:06:36,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 09:06:36 BoogieIcfgContainer [2018-04-12 21:06:36,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 21:06:36,392 INFO L168 Benchmark]: Toolchain (without parser) took 760871.98 ms. Allocated memory was 404.8 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 344.6 MB in the beginning and 1.1 GB in the end (delta: -750.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-12 21:06:36,393 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 404.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 21:06:36,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.64 ms. Allocated memory is still 404.8 MB. Free memory was 344.6 MB in the beginning and 335.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-12 21:06:36,393 INFO L168 Benchmark]: Boogie Preprocessor took 20.78 ms. Allocated memory is still 404.8 MB. Free memory was 335.3 MB in the beginning and 334.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-12 21:06:36,393 INFO L168 Benchmark]: RCFGBuilder took 173.01 ms. Allocated memory was 404.8 MB in the beginning and 617.1 MB in the end (delta: 212.3 MB). Free memory was 334.0 MB in the beginning and 584.7 MB in the end (delta: -250.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-12 21:06:36,393 INFO L168 Benchmark]: TraceAbstraction took 760524.69 ms. Allocated memory was 617.1 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 583.0 MB in the beginning and 1.1 GB in the end (delta: -512.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-12 21:06:36,395 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 404.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.64 ms. Allocated memory is still 404.8 MB. Free memory was 344.6 MB in the beginning and 335.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.78 ms. Allocated memory is still 404.8 MB. Free memory was 335.3 MB in the beginning and 334.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 173.01 ms. Allocated memory was 404.8 MB in the beginning and 617.1 MB in the end (delta: 212.3 MB). Free memory was 334.0 MB in the beginning and 584.7 MB in the end (delta: -250.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 760524.69 ms. Allocated memory was 617.1 MB in the beginning and 2.2 GB in the end (delta: 1.5 GB). Free memory was 583.0 MB in the beginning and 1.1 GB in the end (delta: -512.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (1622states) and interpolant automaton (currently 136 states, 137 states before enhancement), while ReachableStatesComputation was computing reachable states (1286 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 760.4s OverallTime, 134 OverallIterations, 134 TraceHistogramMax, 583.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13864 SDtfs, 345789 SDslu, 141229 SDs, 0 SdLazy, 577323 SolverSat, 135703 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 158.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17960 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 17826 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411852 ImplicationChecksByTransitivity, 410.4s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1622occurred in iteration=133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/1978242 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 133 MinimizatonAttempts, 9177 StatesRemovedByMinimization, 133 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 165.1s InterpolantComputationTime, 45493 NumberOfCodeBlocks, 45493 NumberOfCodeBlocksAsserted, 134 NumberOfCheckSat, 45359 ConstructedInterpolants, 0 QuantifiedInterpolants, 65441037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 134 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1978242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_21-06-36-399.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_21-06-36-399.csv Completed graceful shutdown