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/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:26:32,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:26:32,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:26:32,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:26:32,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:26:32,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:26:32,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:26:32,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:26:32,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:26:32,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:26:32,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:26:32,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:26:32,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:26:32,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:26:32,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:26:32,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:26:32,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:26:32,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:26:32,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:26:32,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:26:32,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:26:32,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:26:32,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:26:32,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:26:32,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:26:32,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:26:32,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:26:32,334 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:26:32,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:26:32,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:26:32,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:26:32,336 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-13 03:26:32,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:26:32,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:26:32,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:26:32,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:26:32,347 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:26:32,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:26:32,348 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:26:32,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:26:32,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:26:32,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:26:32,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:26:32,350 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-13 03:26:32,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:26:32,390 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:26:32,393 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:26:32,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:26:32,395 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:26:32,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-04-13 03:26:32,736 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc166e3730 [2018-04-13 03:26:32,824 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:26:32,824 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:26:32,824 INFO L168 CDTParser]: Scanning array3_false-valid-deref.i [2018-04-13 03:26:32,825 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:26:32,825 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:26:32,825 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:26:32,825 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in array3_false-valid-deref.i [2018-04-13 03:26:32,825 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in array3_false-valid-deref.i [2018-04-13 03:26:32,825 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:26:32,825 INFO L233 ultiparseSymbolTable]: [2018-04-13 03:26:32,837 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc166e3730 [2018-04-13 03:26:32,839 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:26:32,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:26:32,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:26:32,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:26:32,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:26:32,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27303ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32, skipping insertion in model container [2018-04-13 03:26:32,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,857 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:26:32,866 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:26:32,960 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:26:32,972 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:26:32,975 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 6 non ball SCCs. Number of states in SCCs 6. [2018-04-13 03:26:32,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32 WrapperNode [2018-04-13 03:26:32,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:26:32,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:26:32,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:26:32,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:26:32,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (1/1) ... [2018-04-13 03:26:32,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:26:32,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:26:32,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:26:32,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:26:32,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (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-13 03:26:33,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:26:33,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:26:33,034 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-13 03:26:33,034 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:26:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 03:26:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:26:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-13 03:26:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:26:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:26:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:26:33,187 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:26:33,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:26:33 BoogieIcfgContainer [2018-04-13 03:26:33,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:26:33,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:26:33,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:26:33,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:26:33,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:26:32" (1/3) ... [2018-04-13 03:26:33,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b16b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:26:33, skipping insertion in model container [2018-04-13 03:26:33,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:26:32" (2/3) ... [2018-04-13 03:26:33,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b16b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:26:33, skipping insertion in model container [2018-04-13 03:26:33,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:26:33" (3/3) ... [2018-04-13 03:26:33,194 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-04-13 03:26:33,201 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:26:33,205 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-04-13 03:26:33,229 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:26:33,230 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:26:33,230 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:26:33,230 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-13 03:26:33,230 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-13 03:26:33,230 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:26:33,230 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:26:33,230 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:26:33,230 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:26:33,231 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:26:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-04-13 03:26:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 03:26:33,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,244 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,244 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1214141712, now seen corresponding path program 1 times [2018-04-13 03:26:33,277 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,299 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,355 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-13 03:26:33,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:26:33,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 03:26:33,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,363 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-13 03:26:33,363 INFO L182 omatonBuilderFactory]: Interpolants [32#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 33#(and (<= main_~i~0 1023) (<= 0 main_~i~0)), 30#true, 31#false] [2018-04-13 03:26:33,364 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-13 03:26:33,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:26:33,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:26:33,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:26:33,374 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-04-13 03:26:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:33,453 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 03:26:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 03:26:33,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 03:26:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:33,464 INFO L225 Difference]: With dead ends: 44 [2018-04-13 03:26:33,464 INFO L226 Difference]: Without dead ends: 31 [2018-04-13 03:26:33,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:26:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-13 03:26:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-13 03:26:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-13 03:26:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-13 03:26:33,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-04-13 03:26:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:33,487 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-13 03:26:33,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:26:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-13 03:26:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 03:26:33,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,488 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,488 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1902176386, now seen corresponding path program 1 times [2018-04-13 03:26:33,489 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,504 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 03:26:33,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:26:33,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:26:33,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,537 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-13 03:26:33,538 INFO L182 omatonBuilderFactory]: Interpolants [112#(<= 1 main_~i~0), 113#(and (<= main_~i~0 1023) (<= 1 main_~i~0)), 109#true, 110#false, 111#(<= 0 main_~i~0)] [2018-04-13 03:26:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 03:26:33,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:26:33,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:26:33,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:26:33,539 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-04-13 03:26:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:33,591 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-04-13 03:26:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:26:33,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 03:26:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:33,592 INFO L225 Difference]: With dead ends: 30 [2018-04-13 03:26:33,592 INFO L226 Difference]: Without dead ends: 30 [2018-04-13 03:26:33,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:26:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-13 03:26:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-04-13 03:26:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-04-13 03:26:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-04-13 03:26:33,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-04-13 03:26:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:33,597 INFO L459 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-04-13 03:26:33,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:26:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-04-13 03:26:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:26:33,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,598 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,598 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1035544172, now seen corresponding path program 1 times [2018-04-13 03:26:33,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,608 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:33,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 03:26:33,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,652 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-13 03:26:33,652 INFO L182 omatonBuilderFactory]: Interpolants [176#(<= main_~i~0 1), 177#(<= main_~i~0 2), 173#true, 174#false, 175#(<= main_~i~0 0)] [2018-04-13 03:26:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:26:33,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:26:33,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:26:33,653 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-04-13 03:26:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:33,704 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-13 03:26:33,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:26:33,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-13 03:26:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:33,704 INFO L225 Difference]: With dead ends: 44 [2018-04-13 03:26:33,704 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 03:26:33,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:26:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 03:26:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-13 03:26:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-13 03:26:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-04-13 03:26:33,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-04-13 03:26:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:33,708 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-04-13 03:26:33,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:26:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-04-13 03:26:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 03:26:33,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,708 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,708 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1402074139, now seen corresponding path program 2 times [2018-04-13 03:26:33,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:33,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 03:26:33,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,759 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-13 03:26:33,759 INFO L182 omatonBuilderFactory]: Interpolants [256#false, 257#(<= main_~i~0 0), 258#(<= main_~i~0 1), 259#(<= main_~i~0 2), 260#(<= main_~i~0 3), 255#true] [2018-04-13 03:26:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:26:33,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:26:33,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:26:33,760 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-04-13 03:26:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:33,801 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-13 03:26:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:26:33,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-13 03:26:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:33,802 INFO L225 Difference]: With dead ends: 53 [2018-04-13 03:26:33,803 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 03:26:33,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:26:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 03:26:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-04-13 03:26:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 03:26:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-04-13 03:26:33,807 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-04-13 03:26:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:33,807 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-04-13 03:26:33,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:26:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-04-13 03:26:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 03:26:33,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,808 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,808 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1121029342, now seen corresponding path program 3 times [2018-04-13 03:26:33,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,818 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:33,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 03:26:33,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,858 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-13 03:26:33,858 INFO L182 omatonBuilderFactory]: Interpolants [352#false, 353#(<= main_~i~0 0), 354#(<= main_~i~0 1), 355#(<= main_~i~0 2), 356#(<= main_~i~0 3), 357#(<= main_~i~0 4), 351#true] [2018-04-13 03:26:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 03:26:33,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 03:26:33,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:26:33,859 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 7 states. [2018-04-13 03:26:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:33,908 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-04-13 03:26:33,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 03:26:33,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-04-13 03:26:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:33,909 INFO L225 Difference]: With dead ends: 62 [2018-04-13 03:26:33,910 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 03:26:33,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:26:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 03:26:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2018-04-13 03:26:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 03:26:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-04-13 03:26:33,913 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-04-13 03:26:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:33,914 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-04-13 03:26:33,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 03:26:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-04-13 03:26:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 03:26:33,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:33,915 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:33,915 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash 153741655, now seen corresponding path program 4 times [2018-04-13 03:26:33,916 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:33,927 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:33,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 03:26:33,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:33,970 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-13 03:26:33,970 INFO L182 omatonBuilderFactory]: Interpolants [464#(<= main_~i~0 1), 465#(<= main_~i~0 2), 466#(<= main_~i~0 3), 467#(<= main_~i~0 4), 468#(<= main_~i~0 5), 461#true, 462#false, 463#(<= main_~i~0 0)] [2018-04-13 03:26:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:33,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:26:33,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:26:33,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:26:33,971 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 8 states. [2018-04-13 03:26:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,031 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-04-13 03:26:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:26:34,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-04-13 03:26:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,033 INFO L225 Difference]: With dead ends: 71 [2018-04-13 03:26:34,033 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 03:26:34,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:26:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 03:26:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-13 03:26:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 03:26:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-13 03:26:34,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-04-13 03:26:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,039 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-13 03:26:34,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:26:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-13 03:26:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:26:34,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,040 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,040 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash -90349232, now seen corresponding path program 5 times [2018-04-13 03:26:34,041 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 03:26:34,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,100 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-13 03:26:34,100 INFO L182 omatonBuilderFactory]: Interpolants [592#(<= main_~i~0 5), 593#(<= main_~i~0 6), 585#true, 586#false, 587#(<= main_~i~0 0), 588#(<= main_~i~0 1), 589#(<= main_~i~0 2), 590#(<= main_~i~0 3), 591#(<= main_~i~0 4)] [2018-04-13 03:26:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 03:26:34,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 03:26:34,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:26:34,102 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2018-04-13 03:26:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,173 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-04-13 03:26:34,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:26:34,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-13 03:26:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,179 INFO L225 Difference]: With dead ends: 80 [2018-04-13 03:26:34,179 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 03:26:34,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-13 03:26:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 03:26:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2018-04-13 03:26:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 03:26:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-04-13 03:26:34,184 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-04-13 03:26:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,185 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-04-13 03:26:34,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 03:26:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-04-13 03:26:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 03:26:34,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,186 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,186 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1791871799, now seen corresponding path program 6 times [2018-04-13 03:26:34,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,208 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 03:26:34,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,278 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-13 03:26:34,278 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#(<= main_~i~0 5), 731#(<= main_~i~0 6), 732#(<= main_~i~0 7)] [2018-04-13 03:26:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 03:26:34,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 03:26:34,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:26:34,279 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2018-04-13 03:26:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,364 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-04-13 03:26:34,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 03:26:34,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-13 03:26:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,365 INFO L225 Difference]: With dead ends: 89 [2018-04-13 03:26:34,365 INFO L226 Difference]: Without dead ends: 89 [2018-04-13 03:26:34,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-13 03:26:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-13 03:26:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2018-04-13 03:26:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 03:26:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-04-13 03:26:34,369 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2018-04-13 03:26:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,370 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-04-13 03:26:34,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 03:26:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-04-13 03:26:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 03:26:34,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,371 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,371 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1775150018, now seen corresponding path program 7 times [2018-04-13 03:26:34,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,382 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 03:26:34,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,449 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-13 03:26:34,449 INFO L182 omatonBuilderFactory]: Interpolants [880#(<= main_~i~0 3), 881#(<= main_~i~0 4), 882#(<= main_~i~0 5), 883#(<= main_~i~0 6), 884#(<= main_~i~0 7), 885#(<= main_~i~0 8), 875#true, 876#false, 877#(<= main_~i~0 0), 878#(<= main_~i~0 1), 879#(<= main_~i~0 2)] [2018-04-13 03:26:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 03:26:34,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 03:26:34,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:26:34,450 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 11 states. [2018-04-13 03:26:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,543 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-04-13 03:26:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 03:26:34,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-04-13 03:26:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,544 INFO L225 Difference]: With dead ends: 98 [2018-04-13 03:26:34,544 INFO L226 Difference]: Without dead ends: 98 [2018-04-13 03:26:34,545 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:26:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-13 03:26:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 57. [2018-04-13 03:26:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 03:26:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-13 03:26:34,547 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-04-13 03:26:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,547 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-13 03:26:34,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 03:26:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-13 03:26:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 03:26:34,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,548 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,548 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1405555141, now seen corresponding path program 8 times [2018-04-13 03:26:34,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,559 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 03:26:34,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,611 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-13 03:26:34,611 INFO L182 omatonBuilderFactory]: Interpolants [1041#true, 1042#false, 1043#(<= main_~i~0 0), 1044#(<= main_~i~0 1), 1045#(<= main_~i~0 2), 1046#(<= main_~i~0 3), 1047#(<= main_~i~0 4), 1048#(<= main_~i~0 5), 1049#(<= main_~i~0 6), 1050#(<= main_~i~0 7), 1051#(<= main_~i~0 8), 1052#(<= main_~i~0 9)] [2018-04-13 03:26:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 03:26:34,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 03:26:34,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:26:34,611 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2018-04-13 03:26:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,668 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-04-13 03:26:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 03:26:34,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-13 03:26:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,669 INFO L225 Difference]: With dead ends: 107 [2018-04-13 03:26:34,669 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 03:26:34,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:26:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 03:26:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 61. [2018-04-13 03:26:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-13 03:26:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-04-13 03:26:34,672 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2018-04-13 03:26:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,672 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-04-13 03:26:34,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 03:26:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-04-13 03:26:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-13 03:26:34,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,672 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,672 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1021881292, now seen corresponding path program 9 times [2018-04-13 03:26:34,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,679 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 03:26:34,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,756 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-13 03:26:34,756 INFO L182 omatonBuilderFactory]: Interpolants [1221#true, 1222#false, 1223#(<= main_~i~0 0), 1224#(<= main_~i~0 1), 1225#(<= main_~i~0 2), 1226#(<= main_~i~0 3), 1227#(<= main_~i~0 4), 1228#(<= main_~i~0 5), 1229#(<= main_~i~0 6), 1230#(<= main_~i~0 7), 1231#(<= main_~i~0 8), 1232#(<= main_~i~0 9), 1233#(<= main_~i~0 10)] [2018-04-13 03:26:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 03:26:34,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 03:26:34,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:26:34,757 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 13 states. [2018-04-13 03:26:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,821 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-04-13 03:26:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 03:26:34,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-04-13 03:26:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,822 INFO L225 Difference]: With dead ends: 116 [2018-04-13 03:26:34,823 INFO L226 Difference]: Without dead ends: 116 [2018-04-13 03:26:34,823 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-13 03:26:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-13 03:26:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 65. [2018-04-13 03:26:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 03:26:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-04-13 03:26:34,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-04-13 03:26:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,827 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-04-13 03:26:34,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 03:26:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-04-13 03:26:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 03:26:34,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,828 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,828 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash -672131667, now seen corresponding path program 10 times [2018-04-13 03:26:34,829 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,839 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:34,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 03:26:34,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:34,917 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-13 03:26:34,917 INFO L182 omatonBuilderFactory]: Interpolants [1415#true, 1416#false, 1417#(<= main_~i~0 0), 1418#(<= main_~i~0 1), 1419#(<= main_~i~0 2), 1420#(<= main_~i~0 3), 1421#(<= main_~i~0 4), 1422#(<= main_~i~0 5), 1423#(<= main_~i~0 6), 1424#(<= main_~i~0 7), 1425#(<= main_~i~0 8), 1426#(<= main_~i~0 9), 1427#(<= main_~i~0 10), 1428#(<= main_~i~0 11)] [2018-04-13 03:26:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:34,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 03:26:34,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 03:26:34,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:26:34,918 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2018-04-13 03:26:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:34,979 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-04-13 03:26:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:26:34,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-04-13 03:26:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:34,980 INFO L225 Difference]: With dead ends: 125 [2018-04-13 03:26:34,980 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 03:26:34,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-13 03:26:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 03:26:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2018-04-13 03:26:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 03:26:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-04-13 03:26:34,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-04-13 03:26:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:34,983 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-04-13 03:26:34,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 03:26:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-04-13 03:26:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 03:26:34,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:34,988 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:34,989 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1730769574, now seen corresponding path program 11 times [2018-04-13 03:26:34,989 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:34,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:35,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 03:26:35,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:35,089 INFO L182 omatonBuilderFactory]: Interpolants [1632#(<= main_~i~0 7), 1633#(<= main_~i~0 8), 1634#(<= main_~i~0 9), 1635#(<= main_~i~0 10), 1636#(<= main_~i~0 11), 1637#(<= main_~i~0 12), 1623#true, 1624#false, 1625#(<= main_~i~0 0), 1626#(<= main_~i~0 1), 1627#(<= main_~i~0 2), 1628#(<= main_~i~0 3), 1629#(<= main_~i~0 4), 1630#(<= main_~i~0 5), 1631#(<= main_~i~0 6)] [2018-04-13 03:26:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 03:26:35,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 03:26:35,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:26:35,090 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 15 states. [2018-04-13 03:26:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:35,167 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-04-13 03:26:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 03:26:35,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-04-13 03:26:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:35,168 INFO L225 Difference]: With dead ends: 134 [2018-04-13 03:26:35,168 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 03:26:35,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-13 03:26:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 03:26:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 73. [2018-04-13 03:26:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-13 03:26:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-04-13 03:26:35,171 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-04-13 03:26:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:35,172 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-04-13 03:26:35,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 03:26:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-04-13 03:26:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 03:26:35,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:35,173 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:35,173 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -804672737, now seen corresponding path program 12 times [2018-04-13 03:26:35,174 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:35,184 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:35,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 03:26:35,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:35,291 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-13 03:26:35,291 INFO L182 omatonBuilderFactory]: Interpolants [1856#(<= main_~i~0 9), 1857#(<= main_~i~0 10), 1858#(<= main_~i~0 11), 1859#(<= main_~i~0 12), 1860#(<= main_~i~0 13), 1845#true, 1846#false, 1847#(<= main_~i~0 0), 1848#(<= main_~i~0 1), 1849#(<= main_~i~0 2), 1850#(<= main_~i~0 3), 1851#(<= main_~i~0 4), 1852#(<= main_~i~0 5), 1853#(<= main_~i~0 6), 1854#(<= main_~i~0 7), 1855#(<= main_~i~0 8)] [2018-04-13 03:26:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 03:26:35,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 03:26:35,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:26:35,292 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 16 states. [2018-04-13 03:26:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:35,397 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-04-13 03:26:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:26:35,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-04-13 03:26:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:35,399 INFO L225 Difference]: With dead ends: 143 [2018-04-13 03:26:35,399 INFO L226 Difference]: Without dead ends: 143 [2018-04-13 03:26:35,400 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-13 03:26:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-13 03:26:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 77. [2018-04-13 03:26:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-13 03:26:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-04-13 03:26:35,402 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 72 [2018-04-13 03:26:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:35,402 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-04-13 03:26:35,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 03:26:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-04-13 03:26:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-13 03:26:35,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:35,403 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:35,403 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash -457769192, now seen corresponding path program 13 times [2018-04-13 03:26:35,404 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:35,414 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:35,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 03:26:35,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:35,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-13 03:26:35,510 INFO L182 omatonBuilderFactory]: Interpolants [2081#true, 2082#false, 2083#(<= main_~i~0 0), 2084#(<= main_~i~0 1), 2085#(<= main_~i~0 2), 2086#(<= main_~i~0 3), 2087#(<= main_~i~0 4), 2088#(<= main_~i~0 5), 2089#(<= main_~i~0 6), 2090#(<= main_~i~0 7), 2091#(<= main_~i~0 8), 2092#(<= main_~i~0 9), 2093#(<= main_~i~0 10), 2094#(<= main_~i~0 11), 2095#(<= main_~i~0 12), 2096#(<= main_~i~0 13), 2097#(<= main_~i~0 14)] [2018-04-13 03:26:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:26:35,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:26:35,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:26:35,511 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 17 states. [2018-04-13 03:26:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:35,599 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2018-04-13 03:26:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:26:35,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-04-13 03:26:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:35,600 INFO L225 Difference]: With dead ends: 152 [2018-04-13 03:26:35,600 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 03:26:35,600 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:26:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 03:26:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 81. [2018-04-13 03:26:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-13 03:26:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-04-13 03:26:35,603 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-04-13 03:26:35,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:35,603 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-04-13 03:26:35,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:26:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-04-13 03:26:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-13 03:26:35,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:35,604 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:35,604 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2050469521, now seen corresponding path program 14 times [2018-04-13 03:26:35,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:35,613 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:35,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 03:26:35,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:35,733 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-13 03:26:35,734 INFO L182 omatonBuilderFactory]: Interpolants [2336#(<= main_~i~0 3), 2337#(<= main_~i~0 4), 2338#(<= main_~i~0 5), 2339#(<= main_~i~0 6), 2340#(<= main_~i~0 7), 2341#(<= main_~i~0 8), 2342#(<= main_~i~0 9), 2343#(<= main_~i~0 10), 2344#(<= main_~i~0 11), 2345#(<= main_~i~0 12), 2346#(<= main_~i~0 13), 2347#(<= main_~i~0 14), 2348#(<= main_~i~0 15), 2331#true, 2332#false, 2333#(<= main_~i~0 0), 2334#(<= main_~i~0 1), 2335#(<= main_~i~0 2)] [2018-04-13 03:26:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:35,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 03:26:35,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 03:26:35,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:26:35,735 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 18 states. [2018-04-13 03:26:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:35,866 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-04-13 03:26:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 03:26:35,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2018-04-13 03:26:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:35,867 INFO L225 Difference]: With dead ends: 161 [2018-04-13 03:26:35,867 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 03:26:35,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-13 03:26:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 03:26:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 85. [2018-04-13 03:26:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 03:26:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-13 03:26:35,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2018-04-13 03:26:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:35,870 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-13 03:26:35,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 03:26:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-13 03:26:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:26:35,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:35,871 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:35,871 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash -126748278, now seen corresponding path program 15 times [2018-04-13 03:26:35,872 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:35,881 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:36,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 03:26:36,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:36,003 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-13 03:26:36,003 INFO L182 omatonBuilderFactory]: Interpolants [2595#true, 2596#false, 2597#(<= main_~i~0 0), 2598#(<= main_~i~0 1), 2599#(<= main_~i~0 2), 2600#(<= main_~i~0 3), 2601#(<= main_~i~0 4), 2602#(<= main_~i~0 5), 2603#(<= main_~i~0 6), 2604#(<= main_~i~0 7), 2605#(<= main_~i~0 8), 2606#(<= main_~i~0 9), 2607#(<= main_~i~0 10), 2608#(<= main_~i~0 11), 2609#(<= main_~i~0 12), 2610#(<= main_~i~0 13), 2611#(<= main_~i~0 14), 2612#(<= main_~i~0 15), 2613#(<= main_~i~0 16)] [2018-04-13 03:26:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:26:36,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:26:36,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:26:36,004 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 19 states. [2018-04-13 03:26:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:36,099 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-04-13 03:26:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 03:26:36,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-04-13 03:26:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:36,100 INFO L225 Difference]: With dead ends: 170 [2018-04-13 03:26:36,100 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 03:26:36,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:26:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 03:26:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 89. [2018-04-13 03:26:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-13 03:26:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-04-13 03:26:36,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-04-13 03:26:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:36,102 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-04-13 03:26:36,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:26:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-04-13 03:26:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-13 03:26:36,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:36,103 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:36,103 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -366206973, now seen corresponding path program 16 times [2018-04-13 03:26:36,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:36,109 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:36,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 03:26:36,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:36,263 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-13 03:26:36,263 INFO L182 omatonBuilderFactory]: Interpolants [2880#(<= main_~i~0 5), 2881#(<= main_~i~0 6), 2882#(<= main_~i~0 7), 2883#(<= main_~i~0 8), 2884#(<= main_~i~0 9), 2885#(<= main_~i~0 10), 2886#(<= main_~i~0 11), 2887#(<= main_~i~0 12), 2888#(<= main_~i~0 13), 2889#(<= main_~i~0 14), 2890#(<= main_~i~0 15), 2891#(<= main_~i~0 16), 2892#(<= main_~i~0 17), 2873#true, 2874#false, 2875#(<= main_~i~0 0), 2876#(<= main_~i~0 1), 2877#(<= main_~i~0 2), 2878#(<= main_~i~0 3), 2879#(<= main_~i~0 4)] [2018-04-13 03:26:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:26:36,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:26:36,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:26:36,265 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 20 states. [2018-04-13 03:26:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:36,366 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2018-04-13 03:26:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 03:26:36,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-04-13 03:26:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:36,367 INFO L225 Difference]: With dead ends: 179 [2018-04-13 03:26:36,367 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 03:26:36,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:26:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 03:26:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 93. [2018-04-13 03:26:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-13 03:26:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-04-13 03:26:36,369 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 88 [2018-04-13 03:26:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:36,369 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-04-13 03:26:36,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:26:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-04-13 03:26:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-13 03:26:36,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:36,370 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:36,370 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1928568324, now seen corresponding path program 17 times [2018-04-13 03:26:36,370 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:36,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:36,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 03:26:36,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:36,536 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-13 03:26:36,536 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= main_~i~0 1), 3169#(<= main_~i~0 2), 3170#(<= main_~i~0 3), 3171#(<= main_~i~0 4), 3172#(<= main_~i~0 5), 3173#(<= main_~i~0 6), 3174#(<= main_~i~0 7), 3175#(<= main_~i~0 8), 3176#(<= main_~i~0 9), 3177#(<= main_~i~0 10), 3178#(<= main_~i~0 11), 3179#(<= main_~i~0 12), 3180#(<= main_~i~0 13), 3181#(<= main_~i~0 14), 3182#(<= main_~i~0 15), 3183#(<= main_~i~0 16), 3184#(<= main_~i~0 17), 3185#(<= main_~i~0 18), 3165#true, 3166#false, 3167#(<= main_~i~0 0)] [2018-04-13 03:26:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 03:26:36,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 03:26:36,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:26:36,537 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-04-13 03:26:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:36,663 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-04-13 03:26:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 03:26:36,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-13 03:26:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:36,664 INFO L225 Difference]: With dead ends: 188 [2018-04-13 03:26:36,665 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 03:26:36,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-13 03:26:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 03:26:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 97. [2018-04-13 03:26:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-13 03:26:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-04-13 03:26:36,667 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-04-13 03:26:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:36,667 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-04-13 03:26:36,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 03:26:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-04-13 03:26:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-13 03:26:36,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:36,668 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:36,668 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1637416821, now seen corresponding path program 18 times [2018-04-13 03:26:36,669 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:36,675 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:36,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 03:26:36,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:36,824 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-13 03:26:36,824 INFO L182 omatonBuilderFactory]: Interpolants [3488#(<= main_~i~0 15), 3489#(<= main_~i~0 16), 3490#(<= main_~i~0 17), 3491#(<= main_~i~0 18), 3492#(<= main_~i~0 19), 3471#true, 3472#false, 3473#(<= main_~i~0 0), 3474#(<= main_~i~0 1), 3475#(<= main_~i~0 2), 3476#(<= main_~i~0 3), 3477#(<= main_~i~0 4), 3478#(<= main_~i~0 5), 3479#(<= main_~i~0 6), 3480#(<= main_~i~0 7), 3481#(<= main_~i~0 8), 3482#(<= main_~i~0 9), 3483#(<= main_~i~0 10), 3484#(<= main_~i~0 11), 3485#(<= main_~i~0 12), 3486#(<= main_~i~0 13), 3487#(<= main_~i~0 14)] [2018-04-13 03:26:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:36,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 03:26:36,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 03:26:36,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:26:36,826 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 22 states. [2018-04-13 03:26:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:36,951 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions. [2018-04-13 03:26:36,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:26:36,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2018-04-13 03:26:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:36,952 INFO L225 Difference]: With dead ends: 197 [2018-04-13 03:26:36,952 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 03:26:36,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-13 03:26:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 03:26:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 101. [2018-04-13 03:26:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 03:26:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-04-13 03:26:36,955 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 96 [2018-04-13 03:26:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:36,956 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-04-13 03:26:36,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 03:26:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-04-13 03:26:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-13 03:26:36,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:36,957 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:36,957 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1153943442, now seen corresponding path program 19 times [2018-04-13 03:26:36,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:36,967 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:37,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 03:26:37,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:37,112 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-13 03:26:37,112 INFO L182 omatonBuilderFactory]: Interpolants [3808#(<= main_~i~0 15), 3809#(<= main_~i~0 16), 3810#(<= main_~i~0 17), 3811#(<= main_~i~0 18), 3812#(<= main_~i~0 19), 3813#(<= main_~i~0 20), 3791#true, 3792#false, 3793#(<= main_~i~0 0), 3794#(<= main_~i~0 1), 3795#(<= main_~i~0 2), 3796#(<= main_~i~0 3), 3797#(<= main_~i~0 4), 3798#(<= main_~i~0 5), 3799#(<= main_~i~0 6), 3800#(<= main_~i~0 7), 3801#(<= main_~i~0 8), 3802#(<= main_~i~0 9), 3803#(<= main_~i~0 10), 3804#(<= main_~i~0 11), 3805#(<= main_~i~0 12), 3806#(<= main_~i~0 13), 3807#(<= main_~i~0 14)] [2018-04-13 03:26:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:26:37,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:26:37,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:26:37,113 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 23 states. [2018-04-13 03:26:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:37,239 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2018-04-13 03:26:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 03:26:37,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-04-13 03:26:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:37,240 INFO L225 Difference]: With dead ends: 206 [2018-04-13 03:26:37,240 INFO L226 Difference]: Without dead ends: 206 [2018-04-13 03:26:37,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:26:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-13 03:26:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 105. [2018-04-13 03:26:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 03:26:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-13 03:26:37,243 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-04-13 03:26:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:37,243 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-13 03:26:37,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:26:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-13 03:26:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 03:26:37,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:37,244 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:37,244 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1345342695, now seen corresponding path program 20 times [2018-04-13 03:26:37,245 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:37,255 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:37,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 03:26:37,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:37,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-13 03:26:37,414 INFO L182 omatonBuilderFactory]: Interpolants [4128#(<= main_~i~0 1), 4129#(<= main_~i~0 2), 4130#(<= main_~i~0 3), 4131#(<= main_~i~0 4), 4132#(<= main_~i~0 5), 4133#(<= main_~i~0 6), 4134#(<= main_~i~0 7), 4135#(<= main_~i~0 8), 4136#(<= main_~i~0 9), 4137#(<= main_~i~0 10), 4138#(<= main_~i~0 11), 4139#(<= main_~i~0 12), 4140#(<= main_~i~0 13), 4141#(<= main_~i~0 14), 4142#(<= main_~i~0 15), 4143#(<= main_~i~0 16), 4144#(<= main_~i~0 17), 4145#(<= main_~i~0 18), 4146#(<= main_~i~0 19), 4147#(<= main_~i~0 20), 4148#(<= main_~i~0 21), 4125#true, 4126#false, 4127#(<= main_~i~0 0)] [2018-04-13 03:26:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 03:26:37,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 03:26:37,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:26:37,415 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 24 states. [2018-04-13 03:26:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:37,524 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-04-13 03:26:37,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:26:37,525 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 104 [2018-04-13 03:26:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:37,525 INFO L225 Difference]: With dead ends: 215 [2018-04-13 03:26:37,526 INFO L226 Difference]: Without dead ends: 215 [2018-04-13 03:26:37,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-13 03:26:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-13 03:26:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 109. [2018-04-13 03:26:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-13 03:26:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-04-13 03:26:37,529 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-04-13 03:26:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:37,529 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-04-13 03:26:37,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 03:26:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-04-13 03:26:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-13 03:26:37,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:37,530 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:37,530 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash -911770400, now seen corresponding path program 21 times [2018-04-13 03:26:37,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:37,540 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:37,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 03:26:37,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:37,701 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-13 03:26:37,701 INFO L182 omatonBuilderFactory]: Interpolants [4480#(<= main_~i~0 5), 4481#(<= main_~i~0 6), 4482#(<= main_~i~0 7), 4483#(<= main_~i~0 8), 4484#(<= main_~i~0 9), 4485#(<= main_~i~0 10), 4486#(<= main_~i~0 11), 4487#(<= main_~i~0 12), 4488#(<= main_~i~0 13), 4489#(<= main_~i~0 14), 4490#(<= main_~i~0 15), 4491#(<= main_~i~0 16), 4492#(<= main_~i~0 17), 4493#(<= main_~i~0 18), 4494#(<= main_~i~0 19), 4495#(<= main_~i~0 20), 4496#(<= main_~i~0 21), 4497#(<= main_~i~0 22), 4473#true, 4474#false, 4475#(<= main_~i~0 0), 4476#(<= main_~i~0 1), 4477#(<= main_~i~0 2), 4478#(<= main_~i~0 3), 4479#(<= main_~i~0 4)] [2018-04-13 03:26:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:37,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:26:37,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:26:37,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:26:37,703 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 25 states. [2018-04-13 03:26:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:37,818 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2018-04-13 03:26:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:26:37,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 108 [2018-04-13 03:26:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:37,819 INFO L225 Difference]: With dead ends: 224 [2018-04-13 03:26:37,819 INFO L226 Difference]: Without dead ends: 224 [2018-04-13 03:26:37,820 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:26:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-13 03:26:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 113. [2018-04-13 03:26:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 03:26:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-04-13 03:26:37,822 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-04-13 03:26:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:37,823 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-04-13 03:26:37,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:26:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-04-13 03:26:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-13 03:26:37,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:37,823 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:37,823 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1403258969, now seen corresponding path program 22 times [2018-04-13 03:26:37,824 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:37,833 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:38,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 03:26:38,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:38,047 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-13 03:26:38,047 INFO L182 omatonBuilderFactory]: Interpolants [4835#true, 4836#false, 4837#(<= main_~i~0 0), 4838#(<= main_~i~0 1), 4839#(<= main_~i~0 2), 4840#(<= main_~i~0 3), 4841#(<= main_~i~0 4), 4842#(<= main_~i~0 5), 4843#(<= main_~i~0 6), 4844#(<= main_~i~0 7), 4845#(<= main_~i~0 8), 4846#(<= main_~i~0 9), 4847#(<= main_~i~0 10), 4848#(<= main_~i~0 11), 4849#(<= main_~i~0 12), 4850#(<= main_~i~0 13), 4851#(<= main_~i~0 14), 4852#(<= main_~i~0 15), 4853#(<= main_~i~0 16), 4854#(<= main_~i~0 17), 4855#(<= main_~i~0 18), 4856#(<= main_~i~0 19), 4857#(<= main_~i~0 20), 4858#(<= main_~i~0 21), 4859#(<= main_~i~0 22), 4860#(<= main_~i~0 23)] [2018-04-13 03:26:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 03:26:38,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 03:26:38,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:26:38,049 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 26 states. [2018-04-13 03:26:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:38,170 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-04-13 03:26:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 03:26:38,170 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2018-04-13 03:26:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:38,171 INFO L225 Difference]: With dead ends: 233 [2018-04-13 03:26:38,171 INFO L226 Difference]: Without dead ends: 233 [2018-04-13 03:26:38,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-13 03:26:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-13 03:26:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 117. [2018-04-13 03:26:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-13 03:26:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-04-13 03:26:38,173 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 112 [2018-04-13 03:26:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:38,174 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-04-13 03:26:38,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 03:26:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-04-13 03:26:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-04-13 03:26:38,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:38,175 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:38,175 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash 755773266, now seen corresponding path program 23 times [2018-04-13 03:26:38,176 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:38,185 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:38,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 03:26:38,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:38,395 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-13 03:26:38,395 INFO L182 omatonBuilderFactory]: Interpolants [5211#true, 5212#false, 5213#(<= main_~i~0 0), 5214#(<= main_~i~0 1), 5215#(<= main_~i~0 2), 5216#(<= main_~i~0 3), 5217#(<= main_~i~0 4), 5218#(<= main_~i~0 5), 5219#(<= main_~i~0 6), 5220#(<= main_~i~0 7), 5221#(<= main_~i~0 8), 5222#(<= main_~i~0 9), 5223#(<= main_~i~0 10), 5224#(<= main_~i~0 11), 5225#(<= main_~i~0 12), 5226#(<= main_~i~0 13), 5227#(<= main_~i~0 14), 5228#(<= main_~i~0 15), 5229#(<= main_~i~0 16), 5230#(<= main_~i~0 17), 5231#(<= main_~i~0 18), 5232#(<= main_~i~0 19), 5233#(<= main_~i~0 20), 5234#(<= main_~i~0 21), 5235#(<= main_~i~0 22), 5236#(<= main_~i~0 23), 5237#(<= main_~i~0 24)] [2018-04-13 03:26:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 03:26:38,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 03:26:38,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:26:38,397 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 27 states. [2018-04-13 03:26:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:38,545 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-13 03:26:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:26:38,545 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 116 [2018-04-13 03:26:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:38,546 INFO L225 Difference]: With dead ends: 242 [2018-04-13 03:26:38,546 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 03:26:38,546 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-13 03:26:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 03:26:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 121. [2018-04-13 03:26:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-13 03:26:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-04-13 03:26:38,548 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-04-13 03:26:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:38,548 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-04-13 03:26:38,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 03:26:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-04-13 03:26:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-04-13 03:26:38,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:38,549 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:38,549 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 933638603, now seen corresponding path program 24 times [2018-04-13 03:26:38,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:38,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:38,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 03:26:38,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:38,751 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-13 03:26:38,751 INFO L182 omatonBuilderFactory]: Interpolants [5601#true, 5602#false, 5603#(<= main_~i~0 0), 5604#(<= main_~i~0 1), 5605#(<= main_~i~0 2), 5606#(<= main_~i~0 3), 5607#(<= main_~i~0 4), 5608#(<= main_~i~0 5), 5609#(<= main_~i~0 6), 5610#(<= main_~i~0 7), 5611#(<= main_~i~0 8), 5612#(<= main_~i~0 9), 5613#(<= main_~i~0 10), 5614#(<= main_~i~0 11), 5615#(<= main_~i~0 12), 5616#(<= main_~i~0 13), 5617#(<= main_~i~0 14), 5618#(<= main_~i~0 15), 5619#(<= main_~i~0 16), 5620#(<= main_~i~0 17), 5621#(<= main_~i~0 18), 5622#(<= main_~i~0 19), 5623#(<= main_~i~0 20), 5624#(<= main_~i~0 21), 5625#(<= main_~i~0 22), 5626#(<= main_~i~0 23), 5627#(<= main_~i~0 24), 5628#(<= main_~i~0 25)] [2018-04-13 03:26:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:38,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:26:38,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:26:38,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:26:38,752 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 28 states. [2018-04-13 03:26:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:38,985 INFO L93 Difference]: Finished difference Result 251 states and 275 transitions. [2018-04-13 03:26:38,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:26:38,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 120 [2018-04-13 03:26:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:38,987 INFO L225 Difference]: With dead ends: 251 [2018-04-13 03:26:38,987 INFO L226 Difference]: Without dead ends: 251 [2018-04-13 03:26:38,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:26:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-13 03:26:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 125. [2018-04-13 03:26:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-13 03:26:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-04-13 03:26:38,990 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 120 [2018-04-13 03:26:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:38,990 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-04-13 03:26:38,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:26:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-04-13 03:26:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 03:26:38,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:38,991 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:38,991 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2011672636, now seen corresponding path program 25 times [2018-04-13 03:26:38,992 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:39,001 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:39,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:39,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-13 03:26:39,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:39,227 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-13 03:26:39,227 INFO L182 omatonBuilderFactory]: Interpolants [6016#(<= main_~i~0 9), 6017#(<= main_~i~0 10), 6018#(<= main_~i~0 11), 6019#(<= main_~i~0 12), 6020#(<= main_~i~0 13), 6021#(<= main_~i~0 14), 6022#(<= main_~i~0 15), 6023#(<= main_~i~0 16), 6024#(<= main_~i~0 17), 6025#(<= main_~i~0 18), 6026#(<= main_~i~0 19), 6027#(<= main_~i~0 20), 6028#(<= main_~i~0 21), 6029#(<= main_~i~0 22), 6030#(<= main_~i~0 23), 6031#(<= main_~i~0 24), 6032#(<= main_~i~0 25), 6033#(<= main_~i~0 26), 6005#true, 6006#false, 6007#(<= main_~i~0 0), 6008#(<= main_~i~0 1), 6009#(<= main_~i~0 2), 6010#(<= main_~i~0 3), 6011#(<= main_~i~0 4), 6012#(<= main_~i~0 5), 6013#(<= main_~i~0 6), 6014#(<= main_~i~0 7), 6015#(<= main_~i~0 8)] [2018-04-13 03:26:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:39,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 03:26:39,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 03:26:39,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:26:39,228 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 29 states. [2018-04-13 03:26:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:39,475 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2018-04-13 03:26:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 03:26:39,475 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-04-13 03:26:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:39,476 INFO L225 Difference]: With dead ends: 260 [2018-04-13 03:26:39,477 INFO L226 Difference]: Without dead ends: 260 [2018-04-13 03:26:39,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:26:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-13 03:26:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 129. [2018-04-13 03:26:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 03:26:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-13 03:26:39,480 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-04-13 03:26:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:39,480 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-13 03:26:39,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 03:26:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-13 03:26:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-13 03:26:39,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:39,481 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:39,481 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash -169293507, now seen corresponding path program 26 times [2018-04-13 03:26:39,482 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:39,491 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:39,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:39,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 03:26:39,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:39,748 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-13 03:26:39,748 INFO L182 omatonBuilderFactory]: Interpolants [6423#true, 6424#false, 6425#(<= main_~i~0 0), 6426#(<= main_~i~0 1), 6427#(<= main_~i~0 2), 6428#(<= main_~i~0 3), 6429#(<= main_~i~0 4), 6430#(<= main_~i~0 5), 6431#(<= main_~i~0 6), 6432#(<= main_~i~0 7), 6433#(<= main_~i~0 8), 6434#(<= main_~i~0 9), 6435#(<= main_~i~0 10), 6436#(<= main_~i~0 11), 6437#(<= main_~i~0 12), 6438#(<= main_~i~0 13), 6439#(<= main_~i~0 14), 6440#(<= main_~i~0 15), 6441#(<= main_~i~0 16), 6442#(<= main_~i~0 17), 6443#(<= main_~i~0 18), 6444#(<= main_~i~0 19), 6445#(<= main_~i~0 20), 6446#(<= main_~i~0 21), 6447#(<= main_~i~0 22), 6448#(<= main_~i~0 23), 6449#(<= main_~i~0 24), 6450#(<= main_~i~0 25), 6451#(<= main_~i~0 26), 6452#(<= main_~i~0 27)] [2018-04-13 03:26:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:39,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:26:39,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:26:39,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:26:39,749 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 30 states. [2018-04-13 03:26:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:39,882 INFO L93 Difference]: Finished difference Result 269 states and 295 transitions. [2018-04-13 03:26:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 03:26:39,883 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 128 [2018-04-13 03:26:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:39,883 INFO L225 Difference]: With dead ends: 269 [2018-04-13 03:26:39,883 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 03:26:39,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:26:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 03:26:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 133. [2018-04-13 03:26:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 03:26:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-04-13 03:26:39,886 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-04-13 03:26:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:39,886 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-04-13 03:26:39,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:26:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-04-13 03:26:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-13 03:26:39,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:39,887 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:39,887 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1417814474, now seen corresponding path program 27 times [2018-04-13 03:26:39,888 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:39,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:40,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:40,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 03:26:40,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:40,195 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-13 03:26:40,195 INFO L182 omatonBuilderFactory]: Interpolants [6855#true, 6856#false, 6857#(<= main_~i~0 0), 6858#(<= main_~i~0 1), 6859#(<= main_~i~0 2), 6860#(<= main_~i~0 3), 6861#(<= main_~i~0 4), 6862#(<= main_~i~0 5), 6863#(<= main_~i~0 6), 6864#(<= main_~i~0 7), 6865#(<= main_~i~0 8), 6866#(<= main_~i~0 9), 6867#(<= main_~i~0 10), 6868#(<= main_~i~0 11), 6869#(<= main_~i~0 12), 6870#(<= main_~i~0 13), 6871#(<= main_~i~0 14), 6872#(<= main_~i~0 15), 6873#(<= main_~i~0 16), 6874#(<= main_~i~0 17), 6875#(<= main_~i~0 18), 6876#(<= main_~i~0 19), 6877#(<= main_~i~0 20), 6878#(<= main_~i~0 21), 6879#(<= main_~i~0 22), 6880#(<= main_~i~0 23), 6881#(<= main_~i~0 24), 6882#(<= main_~i~0 25), 6883#(<= main_~i~0 26), 6884#(<= main_~i~0 27), 6885#(<= main_~i~0 28)] [2018-04-13 03:26:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:40,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:26:40,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:26:40,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:26:40,196 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 31 states. [2018-04-13 03:26:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:40,338 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2018-04-13 03:26:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 03:26:40,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 132 [2018-04-13 03:26:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:40,339 INFO L225 Difference]: With dead ends: 278 [2018-04-13 03:26:40,339 INFO L226 Difference]: Without dead ends: 278 [2018-04-13 03:26:40,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:26:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-13 03:26:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 137. [2018-04-13 03:26:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 03:26:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-13 03:26:40,342 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-04-13 03:26:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:40,343 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-13 03:26:40,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:26:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-13 03:26:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-13 03:26:40,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:40,344 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:40,344 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1239560529, now seen corresponding path program 28 times [2018-04-13 03:26:40,345 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:40,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:40,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:40,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 03:26:40,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:40,666 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-13 03:26:40,666 INFO L182 omatonBuilderFactory]: Interpolants [7301#true, 7302#false, 7303#(<= main_~i~0 0), 7304#(<= main_~i~0 1), 7305#(<= main_~i~0 2), 7306#(<= main_~i~0 3), 7307#(<= main_~i~0 4), 7308#(<= main_~i~0 5), 7309#(<= main_~i~0 6), 7310#(<= main_~i~0 7), 7311#(<= main_~i~0 8), 7312#(<= main_~i~0 9), 7313#(<= main_~i~0 10), 7314#(<= main_~i~0 11), 7315#(<= main_~i~0 12), 7316#(<= main_~i~0 13), 7317#(<= main_~i~0 14), 7318#(<= main_~i~0 15), 7319#(<= main_~i~0 16), 7320#(<= main_~i~0 17), 7321#(<= main_~i~0 18), 7322#(<= main_~i~0 19), 7323#(<= main_~i~0 20), 7324#(<= main_~i~0 21), 7325#(<= main_~i~0 22), 7326#(<= main_~i~0 23), 7327#(<= main_~i~0 24), 7328#(<= main_~i~0 25), 7329#(<= main_~i~0 26), 7330#(<= main_~i~0 27), 7331#(<= main_~i~0 28), 7332#(<= main_~i~0 29)] [2018-04-13 03:26:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:40,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 03:26:40,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 03:26:40,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:26:40,667 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 32 states. [2018-04-13 03:26:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:40,849 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2018-04-13 03:26:40,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 03:26:40,850 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 136 [2018-04-13 03:26:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:40,851 INFO L225 Difference]: With dead ends: 287 [2018-04-13 03:26:40,851 INFO L226 Difference]: Without dead ends: 287 [2018-04-13 03:26:40,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-13 03:26:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-13 03:26:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 141. [2018-04-13 03:26:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-13 03:26:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-04-13 03:26:40,853 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 136 [2018-04-13 03:26:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:40,853 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-04-13 03:26:40,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 03:26:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-04-13 03:26:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-04-13 03:26:40,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:40,854 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:40,854 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1779508568, now seen corresponding path program 29 times [2018-04-13 03:26:40,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:40,861 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:41,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:41,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 03:26:41,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:41,245 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-13 03:26:41,245 INFO L182 omatonBuilderFactory]: Interpolants [7761#true, 7762#false, 7763#(<= main_~i~0 0), 7764#(<= main_~i~0 1), 7765#(<= main_~i~0 2), 7766#(<= main_~i~0 3), 7767#(<= main_~i~0 4), 7768#(<= main_~i~0 5), 7769#(<= main_~i~0 6), 7770#(<= main_~i~0 7), 7771#(<= main_~i~0 8), 7772#(<= main_~i~0 9), 7773#(<= main_~i~0 10), 7774#(<= main_~i~0 11), 7775#(<= main_~i~0 12), 7776#(<= main_~i~0 13), 7777#(<= main_~i~0 14), 7778#(<= main_~i~0 15), 7779#(<= main_~i~0 16), 7780#(<= main_~i~0 17), 7781#(<= main_~i~0 18), 7782#(<= main_~i~0 19), 7783#(<= main_~i~0 20), 7784#(<= main_~i~0 21), 7785#(<= main_~i~0 22), 7786#(<= main_~i~0 23), 7787#(<= main_~i~0 24), 7788#(<= main_~i~0 25), 7789#(<= main_~i~0 26), 7790#(<= main_~i~0 27), 7791#(<= main_~i~0 28), 7792#(<= main_~i~0 29), 7793#(<= main_~i~0 30)] [2018-04-13 03:26:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:41,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:26:41,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:26:41,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:26:41,247 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 33 states. [2018-04-13 03:26:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:41,487 INFO L93 Difference]: Finished difference Result 296 states and 325 transitions. [2018-04-13 03:26:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:26:41,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 140 [2018-04-13 03:26:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:41,488 INFO L225 Difference]: With dead ends: 296 [2018-04-13 03:26:41,488 INFO L226 Difference]: Without dead ends: 296 [2018-04-13 03:26:41,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:26:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-13 03:26:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 145. [2018-04-13 03:26:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 03:26:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-13 03:26:41,492 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-04-13 03:26:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:41,492 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-13 03:26:41,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:26:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-13 03:26:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-13 03:26:41,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:41,493 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:41,493 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash -839433695, now seen corresponding path program 30 times [2018-04-13 03:26:41,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:41,505 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:41,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:41,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 03:26:41,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:41,775 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-13 03:26:41,775 INFO L182 omatonBuilderFactory]: Interpolants [8256#(<= main_~i~0 19), 8257#(<= main_~i~0 20), 8258#(<= main_~i~0 21), 8259#(<= main_~i~0 22), 8260#(<= main_~i~0 23), 8261#(<= main_~i~0 24), 8262#(<= main_~i~0 25), 8263#(<= main_~i~0 26), 8264#(<= main_~i~0 27), 8265#(<= main_~i~0 28), 8266#(<= main_~i~0 29), 8267#(<= main_~i~0 30), 8268#(<= main_~i~0 31), 8235#true, 8236#false, 8237#(<= main_~i~0 0), 8238#(<= main_~i~0 1), 8239#(<= main_~i~0 2), 8240#(<= main_~i~0 3), 8241#(<= main_~i~0 4), 8242#(<= main_~i~0 5), 8243#(<= main_~i~0 6), 8244#(<= main_~i~0 7), 8245#(<= main_~i~0 8), 8246#(<= main_~i~0 9), 8247#(<= main_~i~0 10), 8248#(<= main_~i~0 11), 8249#(<= main_~i~0 12), 8250#(<= main_~i~0 13), 8251#(<= main_~i~0 14), 8252#(<= main_~i~0 15), 8253#(<= main_~i~0 16), 8254#(<= main_~i~0 17), 8255#(<= main_~i~0 18)] [2018-04-13 03:26:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1931 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:41,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 03:26:41,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 03:26:41,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:26:41,777 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 34 states. [2018-04-13 03:26:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:41,955 INFO L93 Difference]: Finished difference Result 305 states and 335 transitions. [2018-04-13 03:26:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 03:26:41,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 144 [2018-04-13 03:26:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:41,957 INFO L225 Difference]: With dead ends: 305 [2018-04-13 03:26:41,957 INFO L226 Difference]: Without dead ends: 305 [2018-04-13 03:26:41,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 03:26:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-13 03:26:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 149. [2018-04-13 03:26:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-13 03:26:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-04-13 03:26:41,960 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-04-13 03:26:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:41,960 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-04-13 03:26:41,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 03:26:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-04-13 03:26:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-13 03:26:41,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:41,961 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:41,961 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1948075290, now seen corresponding path program 31 times [2018-04-13 03:26:41,962 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:41,968 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:42,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:42,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 03:26:42,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:42,236 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-13 03:26:42,236 INFO L182 omatonBuilderFactory]: Interpolants [8723#true, 8724#false, 8725#(<= main_~i~0 0), 8726#(<= main_~i~0 1), 8727#(<= main_~i~0 2), 8728#(<= main_~i~0 3), 8729#(<= main_~i~0 4), 8730#(<= main_~i~0 5), 8731#(<= main_~i~0 6), 8732#(<= main_~i~0 7), 8733#(<= main_~i~0 8), 8734#(<= main_~i~0 9), 8735#(<= main_~i~0 10), 8736#(<= main_~i~0 11), 8737#(<= main_~i~0 12), 8738#(<= main_~i~0 13), 8739#(<= main_~i~0 14), 8740#(<= main_~i~0 15), 8741#(<= main_~i~0 16), 8742#(<= main_~i~0 17), 8743#(<= main_~i~0 18), 8744#(<= main_~i~0 19), 8745#(<= main_~i~0 20), 8746#(<= main_~i~0 21), 8747#(<= main_~i~0 22), 8748#(<= main_~i~0 23), 8749#(<= main_~i~0 24), 8750#(<= main_~i~0 25), 8751#(<= main_~i~0 26), 8752#(<= main_~i~0 27), 8753#(<= main_~i~0 28), 8754#(<= main_~i~0 29), 8755#(<= main_~i~0 30), 8756#(<= main_~i~0 31), 8757#(<= main_~i~0 32)] [2018-04-13 03:26:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:42,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 03:26:42,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 03:26:42,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:26:42,238 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 35 states. [2018-04-13 03:26:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:42,455 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2018-04-13 03:26:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 03:26:42,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2018-04-13 03:26:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:42,457 INFO L225 Difference]: With dead ends: 314 [2018-04-13 03:26:42,457 INFO L226 Difference]: Without dead ends: 314 [2018-04-13 03:26:42,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 03:26:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-13 03:26:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 153. [2018-04-13 03:26:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-13 03:26:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-04-13 03:26:42,461 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-04-13 03:26:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:42,461 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-04-13 03:26:42,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 03:26:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-04-13 03:26:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-13 03:26:42,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:42,462 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:42,462 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1054399597, now seen corresponding path program 32 times [2018-04-13 03:26:42,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:42,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:42,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:42,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 03:26:42,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:42,881 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-13 03:26:42,881 INFO L182 omatonBuilderFactory]: Interpolants [9225#true, 9226#false, 9227#(<= main_~i~0 0), 9228#(<= main_~i~0 1), 9229#(<= main_~i~0 2), 9230#(<= main_~i~0 3), 9231#(<= main_~i~0 4), 9232#(<= main_~i~0 5), 9233#(<= main_~i~0 6), 9234#(<= main_~i~0 7), 9235#(<= main_~i~0 8), 9236#(<= main_~i~0 9), 9237#(<= main_~i~0 10), 9238#(<= main_~i~0 11), 9239#(<= main_~i~0 12), 9240#(<= main_~i~0 13), 9241#(<= main_~i~0 14), 9242#(<= main_~i~0 15), 9243#(<= main_~i~0 16), 9244#(<= main_~i~0 17), 9245#(<= main_~i~0 18), 9246#(<= main_~i~0 19), 9247#(<= main_~i~0 20), 9248#(<= main_~i~0 21), 9249#(<= main_~i~0 22), 9250#(<= main_~i~0 23), 9251#(<= main_~i~0 24), 9252#(<= main_~i~0 25), 9253#(<= main_~i~0 26), 9254#(<= main_~i~0 27), 9255#(<= main_~i~0 28), 9256#(<= main_~i~0 29), 9257#(<= main_~i~0 30), 9258#(<= main_~i~0 31), 9259#(<= main_~i~0 32), 9260#(<= main_~i~0 33)] [2018-04-13 03:26:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:42,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 03:26:42,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 03:26:42,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:26:42,883 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 36 states. [2018-04-13 03:26:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:43,112 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-04-13 03:26:43,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:26:43,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 152 [2018-04-13 03:26:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:43,113 INFO L225 Difference]: With dead ends: 323 [2018-04-13 03:26:43,114 INFO L226 Difference]: Without dead ends: 323 [2018-04-13 03:26:43,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:26:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-13 03:26:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 157. [2018-04-13 03:26:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-13 03:26:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-04-13 03:26:43,117 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2018-04-13 03:26:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:43,118 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-04-13 03:26:43,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 03:26:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-04-13 03:26:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-04-13 03:26:43,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:43,119 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:43,119 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1598349940, now seen corresponding path program 33 times [2018-04-13 03:26:43,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:43,129 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:43,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:43,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 03:26:43,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:43,616 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-13 03:26:43,616 INFO L182 omatonBuilderFactory]: Interpolants [9741#true, 9742#false, 9743#(<= main_~i~0 0), 9744#(<= main_~i~0 1), 9745#(<= main_~i~0 2), 9746#(<= main_~i~0 3), 9747#(<= main_~i~0 4), 9748#(<= main_~i~0 5), 9749#(<= main_~i~0 6), 9750#(<= main_~i~0 7), 9751#(<= main_~i~0 8), 9752#(<= main_~i~0 9), 9753#(<= main_~i~0 10), 9754#(<= main_~i~0 11), 9755#(<= main_~i~0 12), 9756#(<= main_~i~0 13), 9757#(<= main_~i~0 14), 9758#(<= main_~i~0 15), 9759#(<= main_~i~0 16), 9760#(<= main_~i~0 17), 9761#(<= main_~i~0 18), 9762#(<= main_~i~0 19), 9763#(<= main_~i~0 20), 9764#(<= main_~i~0 21), 9765#(<= main_~i~0 22), 9766#(<= main_~i~0 23), 9767#(<= main_~i~0 24), 9768#(<= main_~i~0 25), 9769#(<= main_~i~0 26), 9770#(<= main_~i~0 27), 9771#(<= main_~i~0 28), 9772#(<= main_~i~0 29), 9773#(<= main_~i~0 30), 9774#(<= main_~i~0 31), 9775#(<= main_~i~0 32), 9776#(<= main_~i~0 33), 9777#(<= main_~i~0 34)] [2018-04-13 03:26:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:43,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:26:43,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:26:43,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:26:43,617 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 37 states. [2018-04-13 03:26:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:43,860 INFO L93 Difference]: Finished difference Result 332 states and 365 transitions. [2018-04-13 03:26:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 03:26:43,860 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 156 [2018-04-13 03:26:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:43,861 INFO L225 Difference]: With dead ends: 332 [2018-04-13 03:26:43,861 INFO L226 Difference]: Without dead ends: 332 [2018-04-13 03:26:43,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:26:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-13 03:26:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 161. [2018-04-13 03:26:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 03:26:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-04-13 03:26:43,864 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-04-13 03:26:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:43,865 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-04-13 03:26:43,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:26:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-04-13 03:26:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-04-13 03:26:43,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:43,866 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:43,866 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1096774405, now seen corresponding path program 34 times [2018-04-13 03:26:43,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:43,876 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:44,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:44,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 03:26:44,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:26:44,328 INFO L182 omatonBuilderFactory]: Interpolants [10304#(<= main_~i~0 31), 10305#(<= main_~i~0 32), 10306#(<= main_~i~0 33), 10307#(<= main_~i~0 34), 10308#(<= main_~i~0 35), 10271#true, 10272#false, 10273#(<= main_~i~0 0), 10274#(<= main_~i~0 1), 10275#(<= main_~i~0 2), 10276#(<= main_~i~0 3), 10277#(<= main_~i~0 4), 10278#(<= main_~i~0 5), 10279#(<= main_~i~0 6), 10280#(<= main_~i~0 7), 10281#(<= main_~i~0 8), 10282#(<= main_~i~0 9), 10283#(<= main_~i~0 10), 10284#(<= main_~i~0 11), 10285#(<= main_~i~0 12), 10286#(<= main_~i~0 13), 10287#(<= main_~i~0 14), 10288#(<= main_~i~0 15), 10289#(<= main_~i~0 16), 10290#(<= main_~i~0 17), 10291#(<= main_~i~0 18), 10292#(<= main_~i~0 19), 10293#(<= main_~i~0 20), 10294#(<= main_~i~0 21), 10295#(<= main_~i~0 22), 10296#(<= main_~i~0 23), 10297#(<= main_~i~0 24), 10298#(<= main_~i~0 25), 10299#(<= main_~i~0 26), 10300#(<= main_~i~0 27), 10301#(<= main_~i~0 28), 10302#(<= main_~i~0 29), 10303#(<= main_~i~0 30)] [2018-04-13 03:26:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2459 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:44,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 03:26:44,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 03:26:44,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:26:44,329 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 38 states. [2018-04-13 03:26:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:44,540 INFO L93 Difference]: Finished difference Result 341 states and 375 transitions. [2018-04-13 03:26:44,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 03:26:44,540 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 160 [2018-04-13 03:26:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:44,541 INFO L225 Difference]: With dead ends: 341 [2018-04-13 03:26:44,541 INFO L226 Difference]: Without dead ends: 341 [2018-04-13 03:26:44,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 03:26:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-13 03:26:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 165. [2018-04-13 03:26:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-13 03:26:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-04-13 03:26:44,544 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 160 [2018-04-13 03:26:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:44,544 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-04-13 03:26:44,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 03:26:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-04-13 03:26:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-13 03:26:44,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:44,545 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:44,545 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1535482882, now seen corresponding path program 35 times [2018-04-13 03:26:44,545 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:44,552 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:45,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:45,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 03:26:45,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:45,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-13 03:26:45,048 INFO L182 omatonBuilderFactory]: Interpolants [10816#false, 10817#(<= main_~i~0 0), 10818#(<= main_~i~0 1), 10819#(<= main_~i~0 2), 10820#(<= main_~i~0 3), 10821#(<= main_~i~0 4), 10822#(<= main_~i~0 5), 10823#(<= main_~i~0 6), 10824#(<= main_~i~0 7), 10825#(<= main_~i~0 8), 10826#(<= main_~i~0 9), 10827#(<= main_~i~0 10), 10828#(<= main_~i~0 11), 10829#(<= main_~i~0 12), 10830#(<= main_~i~0 13), 10831#(<= main_~i~0 14), 10832#(<= main_~i~0 15), 10833#(<= main_~i~0 16), 10834#(<= main_~i~0 17), 10835#(<= main_~i~0 18), 10836#(<= main_~i~0 19), 10837#(<= main_~i~0 20), 10838#(<= main_~i~0 21), 10839#(<= main_~i~0 22), 10840#(<= main_~i~0 23), 10841#(<= main_~i~0 24), 10842#(<= main_~i~0 25), 10843#(<= main_~i~0 26), 10844#(<= main_~i~0 27), 10845#(<= main_~i~0 28), 10846#(<= main_~i~0 29), 10847#(<= main_~i~0 30), 10848#(<= main_~i~0 31), 10849#(<= main_~i~0 32), 10850#(<= main_~i~0 33), 10851#(<= main_~i~0 34), 10852#(<= main_~i~0 35), 10853#(<= main_~i~0 36), 10815#true] [2018-04-13 03:26:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:45,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:26:45,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:26:45,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:26:45,049 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 39 states. [2018-04-13 03:26:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:45,254 INFO L93 Difference]: Finished difference Result 350 states and 385 transitions. [2018-04-13 03:26:45,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 03:26:45,255 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 164 [2018-04-13 03:26:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:45,255 INFO L225 Difference]: With dead ends: 350 [2018-04-13 03:26:45,256 INFO L226 Difference]: Without dead ends: 350 [2018-04-13 03:26:45,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:26:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-13 03:26:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 169. [2018-04-13 03:26:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-13 03:26:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-04-13 03:26:45,258 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-04-13 03:26:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:45,258 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-04-13 03:26:45,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:26:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-04-13 03:26:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-04-13 03:26:45,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:45,259 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:45,259 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 777138295, now seen corresponding path program 36 times [2018-04-13 03:26:45,259 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:45,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:45,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:45,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 03:26:45,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:45,679 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-13 03:26:45,679 INFO L182 omatonBuilderFactory]: Interpolants [11392#(<= main_~i~0 17), 11393#(<= main_~i~0 18), 11394#(<= main_~i~0 19), 11395#(<= main_~i~0 20), 11396#(<= main_~i~0 21), 11397#(<= main_~i~0 22), 11398#(<= main_~i~0 23), 11399#(<= main_~i~0 24), 11400#(<= main_~i~0 25), 11401#(<= main_~i~0 26), 11402#(<= main_~i~0 27), 11403#(<= main_~i~0 28), 11404#(<= main_~i~0 29), 11405#(<= main_~i~0 30), 11406#(<= main_~i~0 31), 11407#(<= main_~i~0 32), 11408#(<= main_~i~0 33), 11409#(<= main_~i~0 34), 11410#(<= main_~i~0 35), 11411#(<= main_~i~0 36), 11412#(<= main_~i~0 37), 11373#true, 11374#false, 11375#(<= main_~i~0 0), 11376#(<= main_~i~0 1), 11377#(<= main_~i~0 2), 11378#(<= main_~i~0 3), 11379#(<= main_~i~0 4), 11380#(<= main_~i~0 5), 11381#(<= main_~i~0 6), 11382#(<= main_~i~0 7), 11383#(<= main_~i~0 8), 11384#(<= main_~i~0 9), 11385#(<= main_~i~0 10), 11386#(<= main_~i~0 11), 11387#(<= main_~i~0 12), 11388#(<= main_~i~0 13), 11389#(<= main_~i~0 14), 11390#(<= main_~i~0 15), 11391#(<= main_~i~0 16)] [2018-04-13 03:26:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2747 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:45,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 03:26:45,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 03:26:45,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:26:45,680 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 40 states. [2018-04-13 03:26:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:45,960 INFO L93 Difference]: Finished difference Result 359 states and 395 transitions. [2018-04-13 03:26:45,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:26:45,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 168 [2018-04-13 03:26:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:45,961 INFO L225 Difference]: With dead ends: 359 [2018-04-13 03:26:45,961 INFO L226 Difference]: Without dead ends: 359 [2018-04-13 03:26:45,962 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 03:26:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-13 03:26:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 173. [2018-04-13 03:26:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-13 03:26:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-04-13 03:26:45,964 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 168 [2018-04-13 03:26:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:45,964 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-04-13 03:26:45,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 03:26:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-04-13 03:26:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 03:26:45,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:45,965 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:45,965 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:45,965 INFO L82 PathProgramCache]: Analyzing trace with hash 906827888, now seen corresponding path program 37 times [2018-04-13 03:26:45,966 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:45,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:46,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:46,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 03:26:46,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:46,486 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-13 03:26:46,486 INFO L182 omatonBuilderFactory]: Interpolants [11968#(<= main_~i~0 21), 11969#(<= main_~i~0 22), 11970#(<= main_~i~0 23), 11971#(<= main_~i~0 24), 11972#(<= main_~i~0 25), 11973#(<= main_~i~0 26), 11974#(<= main_~i~0 27), 11975#(<= main_~i~0 28), 11976#(<= main_~i~0 29), 11977#(<= main_~i~0 30), 11978#(<= main_~i~0 31), 11979#(<= main_~i~0 32), 11980#(<= main_~i~0 33), 11981#(<= main_~i~0 34), 11982#(<= main_~i~0 35), 11983#(<= main_~i~0 36), 11984#(<= main_~i~0 37), 11985#(<= main_~i~0 38), 11945#true, 11946#false, 11947#(<= main_~i~0 0), 11948#(<= main_~i~0 1), 11949#(<= main_~i~0 2), 11950#(<= main_~i~0 3), 11951#(<= main_~i~0 4), 11952#(<= main_~i~0 5), 11953#(<= main_~i~0 6), 11954#(<= main_~i~0 7), 11955#(<= main_~i~0 8), 11956#(<= main_~i~0 9), 11957#(<= main_~i~0 10), 11958#(<= main_~i~0 11), 11959#(<= main_~i~0 12), 11960#(<= main_~i~0 13), 11961#(<= main_~i~0 14), 11962#(<= main_~i~0 15), 11963#(<= main_~i~0 16), 11964#(<= main_~i~0 17), 11965#(<= main_~i~0 18), 11966#(<= main_~i~0 19), 11967#(<= main_~i~0 20)] [2018-04-13 03:26:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2897 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:46,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:26:46,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:26:46,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:26:46,487 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 41 states. [2018-04-13 03:26:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:46,686 INFO L93 Difference]: Finished difference Result 368 states and 405 transitions. [2018-04-13 03:26:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:26:46,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-04-13 03:26:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:46,688 INFO L225 Difference]: With dead ends: 368 [2018-04-13 03:26:46,688 INFO L226 Difference]: Without dead ends: 368 [2018-04-13 03:26:46,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:26:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-13 03:26:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 177. [2018-04-13 03:26:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-13 03:26:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-04-13 03:26:46,690 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-04-13 03:26:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:46,690 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-04-13 03:26:46,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:26:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-04-13 03:26:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-04-13 03:26:46,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:46,691 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:46,691 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1783538711, now seen corresponding path program 38 times [2018-04-13 03:26:46,691 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:46,698 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:47,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:47,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 03:26:47,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:47,090 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-13 03:26:47,090 INFO L182 omatonBuilderFactory]: Interpolants [12544#(<= main_~i~0 11), 12545#(<= main_~i~0 12), 12546#(<= main_~i~0 13), 12547#(<= main_~i~0 14), 12548#(<= main_~i~0 15), 12549#(<= main_~i~0 16), 12550#(<= main_~i~0 17), 12551#(<= main_~i~0 18), 12552#(<= main_~i~0 19), 12553#(<= main_~i~0 20), 12554#(<= main_~i~0 21), 12555#(<= main_~i~0 22), 12556#(<= main_~i~0 23), 12557#(<= main_~i~0 24), 12558#(<= main_~i~0 25), 12559#(<= main_~i~0 26), 12560#(<= main_~i~0 27), 12561#(<= main_~i~0 28), 12562#(<= main_~i~0 29), 12563#(<= main_~i~0 30), 12564#(<= main_~i~0 31), 12565#(<= main_~i~0 32), 12566#(<= main_~i~0 33), 12567#(<= main_~i~0 34), 12568#(<= main_~i~0 35), 12569#(<= main_~i~0 36), 12570#(<= main_~i~0 37), 12571#(<= main_~i~0 38), 12572#(<= main_~i~0 39), 12531#true, 12532#false, 12533#(<= main_~i~0 0), 12534#(<= main_~i~0 1), 12535#(<= main_~i~0 2), 12536#(<= main_~i~0 3), 12537#(<= main_~i~0 4), 12538#(<= main_~i~0 5), 12539#(<= main_~i~0 6), 12540#(<= main_~i~0 7), 12541#(<= main_~i~0 8), 12542#(<= main_~i~0 9), 12543#(<= main_~i~0 10)] [2018-04-13 03:26:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3051 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:47,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 03:26:47,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 03:26:47,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:26:47,092 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 42 states. [2018-04-13 03:26:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:47,312 INFO L93 Difference]: Finished difference Result 377 states and 415 transitions. [2018-04-13 03:26:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 03:26:47,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 176 [2018-04-13 03:26:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:47,313 INFO L225 Difference]: With dead ends: 377 [2018-04-13 03:26:47,313 INFO L226 Difference]: Without dead ends: 377 [2018-04-13 03:26:47,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 03:26:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-13 03:26:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 181. [2018-04-13 03:26:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-13 03:26:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-04-13 03:26:47,316 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2018-04-13 03:26:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:47,316 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-04-13 03:26:47,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 03:26:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-04-13 03:26:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-13 03:26:47,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:47,317 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:47,317 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 975518434, now seen corresponding path program 39 times [2018-04-13 03:26:47,317 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:47,323 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:47,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:47,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 03:26:47,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:47,731 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-13 03:26:47,731 INFO L182 omatonBuilderFactory]: Interpolants [13131#true, 13132#false, 13133#(<= main_~i~0 0), 13134#(<= main_~i~0 1), 13135#(<= main_~i~0 2), 13136#(<= main_~i~0 3), 13137#(<= main_~i~0 4), 13138#(<= main_~i~0 5), 13139#(<= main_~i~0 6), 13140#(<= main_~i~0 7), 13141#(<= main_~i~0 8), 13142#(<= main_~i~0 9), 13143#(<= main_~i~0 10), 13144#(<= main_~i~0 11), 13145#(<= main_~i~0 12), 13146#(<= main_~i~0 13), 13147#(<= main_~i~0 14), 13148#(<= main_~i~0 15), 13149#(<= main_~i~0 16), 13150#(<= main_~i~0 17), 13151#(<= main_~i~0 18), 13152#(<= main_~i~0 19), 13153#(<= main_~i~0 20), 13154#(<= main_~i~0 21), 13155#(<= main_~i~0 22), 13156#(<= main_~i~0 23), 13157#(<= main_~i~0 24), 13158#(<= main_~i~0 25), 13159#(<= main_~i~0 26), 13160#(<= main_~i~0 27), 13161#(<= main_~i~0 28), 13162#(<= main_~i~0 29), 13163#(<= main_~i~0 30), 13164#(<= main_~i~0 31), 13165#(<= main_~i~0 32), 13166#(<= main_~i~0 33), 13167#(<= main_~i~0 34), 13168#(<= main_~i~0 35), 13169#(<= main_~i~0 36), 13170#(<= main_~i~0 37), 13171#(<= main_~i~0 38), 13172#(<= main_~i~0 39), 13173#(<= main_~i~0 40)] [2018-04-13 03:26:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3209 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:47,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:26:47,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:26:47,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:26:47,733 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 43 states. [2018-04-13 03:26:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:48,031 INFO L93 Difference]: Finished difference Result 386 states and 425 transitions. [2018-04-13 03:26:48,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 03:26:48,031 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 180 [2018-04-13 03:26:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:48,032 INFO L225 Difference]: With dead ends: 386 [2018-04-13 03:26:48,032 INFO L226 Difference]: Without dead ends: 386 [2018-04-13 03:26:48,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:26:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-13 03:26:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 185. [2018-04-13 03:26:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 03:26:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-13 03:26:48,034 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-04-13 03:26:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:48,034 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-13 03:26:48,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:26:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-13 03:26:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-13 03:26:48,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:48,034 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:48,034 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1288768165, now seen corresponding path program 40 times [2018-04-13 03:26:48,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:48,044 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:48,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:48,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 03:26:48,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:48,500 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-13 03:26:48,500 INFO L182 omatonBuilderFactory]: Interpolants [13760#(<= main_~i~0 13), 13761#(<= main_~i~0 14), 13762#(<= main_~i~0 15), 13763#(<= main_~i~0 16), 13764#(<= main_~i~0 17), 13765#(<= main_~i~0 18), 13766#(<= main_~i~0 19), 13767#(<= main_~i~0 20), 13768#(<= main_~i~0 21), 13769#(<= main_~i~0 22), 13770#(<= main_~i~0 23), 13771#(<= main_~i~0 24), 13772#(<= main_~i~0 25), 13773#(<= main_~i~0 26), 13774#(<= main_~i~0 27), 13775#(<= main_~i~0 28), 13776#(<= main_~i~0 29), 13777#(<= main_~i~0 30), 13778#(<= main_~i~0 31), 13779#(<= main_~i~0 32), 13780#(<= main_~i~0 33), 13781#(<= main_~i~0 34), 13782#(<= main_~i~0 35), 13783#(<= main_~i~0 36), 13784#(<= main_~i~0 37), 13785#(<= main_~i~0 38), 13786#(<= main_~i~0 39), 13787#(<= main_~i~0 40), 13788#(<= main_~i~0 41), 13745#true, 13746#false, 13747#(<= main_~i~0 0), 13748#(<= main_~i~0 1), 13749#(<= main_~i~0 2), 13750#(<= main_~i~0 3), 13751#(<= main_~i~0 4), 13752#(<= main_~i~0 5), 13753#(<= main_~i~0 6), 13754#(<= main_~i~0 7), 13755#(<= main_~i~0 8), 13756#(<= main_~i~0 9), 13757#(<= main_~i~0 10), 13758#(<= main_~i~0 11), 13759#(<= main_~i~0 12)] [2018-04-13 03:26:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3371 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:48,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 03:26:48,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 03:26:48,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:26:48,501 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 44 states. [2018-04-13 03:26:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:48,751 INFO L93 Difference]: Finished difference Result 395 states and 435 transitions. [2018-04-13 03:26:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 03:26:48,752 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 184 [2018-04-13 03:26:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:48,753 INFO L225 Difference]: With dead ends: 395 [2018-04-13 03:26:48,753 INFO L226 Difference]: Without dead ends: 395 [2018-04-13 03:26:48,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 03:26:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-13 03:26:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 189. [2018-04-13 03:26:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 03:26:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-04-13 03:26:48,755 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-04-13 03:26:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:48,755 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-04-13 03:26:48,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 03:26:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-04-13 03:26:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-13 03:26:48,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:48,756 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:48,756 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1015755948, now seen corresponding path program 41 times [2018-04-13 03:26:48,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:48,762 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:49,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:49,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 03:26:49,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:49,213 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-13 03:26:49,213 INFO L182 omatonBuilderFactory]: Interpolants [14400#(<= main_~i~0 25), 14401#(<= main_~i~0 26), 14402#(<= main_~i~0 27), 14403#(<= main_~i~0 28), 14404#(<= main_~i~0 29), 14405#(<= main_~i~0 30), 14406#(<= main_~i~0 31), 14407#(<= main_~i~0 32), 14408#(<= main_~i~0 33), 14409#(<= main_~i~0 34), 14410#(<= main_~i~0 35), 14411#(<= main_~i~0 36), 14412#(<= main_~i~0 37), 14413#(<= main_~i~0 38), 14414#(<= main_~i~0 39), 14415#(<= main_~i~0 40), 14416#(<= main_~i~0 41), 14417#(<= main_~i~0 42), 14373#true, 14374#false, 14375#(<= main_~i~0 0), 14376#(<= main_~i~0 1), 14377#(<= main_~i~0 2), 14378#(<= main_~i~0 3), 14379#(<= main_~i~0 4), 14380#(<= main_~i~0 5), 14381#(<= main_~i~0 6), 14382#(<= main_~i~0 7), 14383#(<= main_~i~0 8), 14384#(<= main_~i~0 9), 14385#(<= main_~i~0 10), 14386#(<= main_~i~0 11), 14387#(<= main_~i~0 12), 14388#(<= main_~i~0 13), 14389#(<= main_~i~0 14), 14390#(<= main_~i~0 15), 14391#(<= main_~i~0 16), 14392#(<= main_~i~0 17), 14393#(<= main_~i~0 18), 14394#(<= main_~i~0 19), 14395#(<= main_~i~0 20), 14396#(<= main_~i~0 21), 14397#(<= main_~i~0 22), 14398#(<= main_~i~0 23), 14399#(<= main_~i~0 24)] [2018-04-13 03:26:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:49,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 03:26:49,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 03:26:49,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:26:49,214 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 45 states. [2018-04-13 03:26:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:49,458 INFO L93 Difference]: Finished difference Result 404 states and 445 transitions. [2018-04-13 03:26:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 03:26:49,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 188 [2018-04-13 03:26:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:49,459 INFO L225 Difference]: With dead ends: 404 [2018-04-13 03:26:49,459 INFO L226 Difference]: Without dead ends: 404 [2018-04-13 03:26:49,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 03:26:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-13 03:26:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 193. [2018-04-13 03:26:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 03:26:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-04-13 03:26:49,461 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-04-13 03:26:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:49,461 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-04-13 03:26:49,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 03:26:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-04-13 03:26:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-13 03:26:49,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:49,462 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:49,462 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -260244275, now seen corresponding path program 42 times [2018-04-13 03:26:49,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:49,468 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:49,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:49,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 03:26:49,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:49,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-13 03:26:49,905 INFO L182 omatonBuilderFactory]: Interpolants [15040#(<= main_~i~0 23), 15041#(<= main_~i~0 24), 15042#(<= main_~i~0 25), 15043#(<= main_~i~0 26), 15044#(<= main_~i~0 27), 15045#(<= main_~i~0 28), 15046#(<= main_~i~0 29), 15047#(<= main_~i~0 30), 15048#(<= main_~i~0 31), 15049#(<= main_~i~0 32), 15050#(<= main_~i~0 33), 15051#(<= main_~i~0 34), 15052#(<= main_~i~0 35), 15053#(<= main_~i~0 36), 15054#(<= main_~i~0 37), 15055#(<= main_~i~0 38), 15056#(<= main_~i~0 39), 15057#(<= main_~i~0 40), 15058#(<= main_~i~0 41), 15059#(<= main_~i~0 42), 15060#(<= main_~i~0 43), 15015#true, 15016#false, 15017#(<= main_~i~0 0), 15018#(<= main_~i~0 1), 15019#(<= main_~i~0 2), 15020#(<= main_~i~0 3), 15021#(<= main_~i~0 4), 15022#(<= main_~i~0 5), 15023#(<= main_~i~0 6), 15024#(<= main_~i~0 7), 15025#(<= main_~i~0 8), 15026#(<= main_~i~0 9), 15027#(<= main_~i~0 10), 15028#(<= main_~i~0 11), 15029#(<= main_~i~0 12), 15030#(<= main_~i~0 13), 15031#(<= main_~i~0 14), 15032#(<= main_~i~0 15), 15033#(<= main_~i~0 16), 15034#(<= main_~i~0 17), 15035#(<= main_~i~0 18), 15036#(<= main_~i~0 19), 15037#(<= main_~i~0 20), 15038#(<= main_~i~0 21), 15039#(<= main_~i~0 22)] [2018-04-13 03:26:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3707 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:49,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 03:26:49,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 03:26:49,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:26:49,906 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 46 states. [2018-04-13 03:26:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:50,172 INFO L93 Difference]: Finished difference Result 413 states and 455 transitions. [2018-04-13 03:26:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 03:26:50,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 192 [2018-04-13 03:26:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:50,174 INFO L225 Difference]: With dead ends: 413 [2018-04-13 03:26:50,174 INFO L226 Difference]: Without dead ends: 413 [2018-04-13 03:26:50,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 03:26:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-13 03:26:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 197. [2018-04-13 03:26:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-13 03:26:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-04-13 03:26:50,176 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 192 [2018-04-13 03:26:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:50,176 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-04-13 03:26:50,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 03:26:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-04-13 03:26:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-13 03:26:50,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:50,177 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:50,177 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash 313379270, now seen corresponding path program 43 times [2018-04-13 03:26:50,178 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:50,207 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:50,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:50,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-13 03:26:50,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:50,691 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-13 03:26:50,691 INFO L182 omatonBuilderFactory]: Interpolants [15680#(<= main_~i~0 7), 15681#(<= main_~i~0 8), 15682#(<= main_~i~0 9), 15683#(<= main_~i~0 10), 15684#(<= main_~i~0 11), 15685#(<= main_~i~0 12), 15686#(<= main_~i~0 13), 15687#(<= main_~i~0 14), 15688#(<= main_~i~0 15), 15689#(<= main_~i~0 16), 15690#(<= main_~i~0 17), 15691#(<= main_~i~0 18), 15692#(<= main_~i~0 19), 15693#(<= main_~i~0 20), 15694#(<= main_~i~0 21), 15695#(<= main_~i~0 22), 15696#(<= main_~i~0 23), 15697#(<= main_~i~0 24), 15698#(<= main_~i~0 25), 15699#(<= main_~i~0 26), 15700#(<= main_~i~0 27), 15701#(<= main_~i~0 28), 15702#(<= main_~i~0 29), 15703#(<= main_~i~0 30), 15704#(<= main_~i~0 31), 15705#(<= main_~i~0 32), 15706#(<= main_~i~0 33), 15707#(<= main_~i~0 34), 15708#(<= main_~i~0 35), 15709#(<= main_~i~0 36), 15710#(<= main_~i~0 37), 15711#(<= main_~i~0 38), 15712#(<= main_~i~0 39), 15713#(<= main_~i~0 40), 15714#(<= main_~i~0 41), 15715#(<= main_~i~0 42), 15716#(<= main_~i~0 43), 15717#(<= main_~i~0 44), 15671#true, 15672#false, 15673#(<= main_~i~0 0), 15674#(<= main_~i~0 1), 15675#(<= main_~i~0 2), 15676#(<= main_~i~0 3), 15677#(<= main_~i~0 4), 15678#(<= main_~i~0 5), 15679#(<= main_~i~0 6)] [2018-04-13 03:26:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3881 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:50,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 03:26:50,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 03:26:50,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 03:26:50,692 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 47 states. [2018-04-13 03:26:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:50,989 INFO L93 Difference]: Finished difference Result 422 states and 465 transitions. [2018-04-13 03:26:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:26:50,989 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 196 [2018-04-13 03:26:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:50,990 INFO L225 Difference]: With dead ends: 422 [2018-04-13 03:26:50,991 INFO L226 Difference]: Without dead ends: 422 [2018-04-13 03:26:50,991 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 03:26:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-13 03:26:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 201. [2018-04-13 03:26:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-13 03:26:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-04-13 03:26:50,994 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-04-13 03:26:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:50,994 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-04-13 03:26:50,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 03:26:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-04-13 03:26:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-04-13 03:26:50,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:50,995 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:50,995 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash -447909313, now seen corresponding path program 44 times [2018-04-13 03:26:50,996 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:51,005 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:51,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:51,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 03:26:51,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:51,607 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-13 03:26:51,607 INFO L182 omatonBuilderFactory]: Interpolants [16384#(<= main_~i~0 41), 16385#(<= main_~i~0 42), 16386#(<= main_~i~0 43), 16387#(<= main_~i~0 44), 16388#(<= main_~i~0 45), 16341#true, 16342#false, 16343#(<= main_~i~0 0), 16344#(<= main_~i~0 1), 16345#(<= main_~i~0 2), 16346#(<= main_~i~0 3), 16347#(<= main_~i~0 4), 16348#(<= main_~i~0 5), 16349#(<= main_~i~0 6), 16350#(<= main_~i~0 7), 16351#(<= main_~i~0 8), 16352#(<= main_~i~0 9), 16353#(<= main_~i~0 10), 16354#(<= main_~i~0 11), 16355#(<= main_~i~0 12), 16356#(<= main_~i~0 13), 16357#(<= main_~i~0 14), 16358#(<= main_~i~0 15), 16359#(<= main_~i~0 16), 16360#(<= main_~i~0 17), 16361#(<= main_~i~0 18), 16362#(<= main_~i~0 19), 16363#(<= main_~i~0 20), 16364#(<= main_~i~0 21), 16365#(<= main_~i~0 22), 16366#(<= main_~i~0 23), 16367#(<= main_~i~0 24), 16368#(<= main_~i~0 25), 16369#(<= main_~i~0 26), 16370#(<= main_~i~0 27), 16371#(<= main_~i~0 28), 16372#(<= main_~i~0 29), 16373#(<= main_~i~0 30), 16374#(<= main_~i~0 31), 16375#(<= main_~i~0 32), 16376#(<= main_~i~0 33), 16377#(<= main_~i~0 34), 16378#(<= main_~i~0 35), 16379#(<= main_~i~0 36), 16380#(<= main_~i~0 37), 16381#(<= main_~i~0 38), 16382#(<= main_~i~0 39), 16383#(<= main_~i~0 40)] [2018-04-13 03:26:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4059 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:51,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 03:26:51,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 03:26:51,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:26:51,608 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 48 states. [2018-04-13 03:26:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:51,893 INFO L93 Difference]: Finished difference Result 431 states and 475 transitions. [2018-04-13 03:26:51,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 03:26:51,893 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 200 [2018-04-13 03:26:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:51,895 INFO L225 Difference]: With dead ends: 431 [2018-04-13 03:26:51,895 INFO L226 Difference]: Without dead ends: 431 [2018-04-13 03:26:51,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:26:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-13 03:26:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 205. [2018-04-13 03:26:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-13 03:26:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-04-13 03:26:51,897 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 200 [2018-04-13 03:26:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:51,897 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-04-13 03:26:51,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 03:26:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-04-13 03:26:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-13 03:26:51,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:51,898 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:51,898 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1769851336, now seen corresponding path program 45 times [2018-04-13 03:26:51,899 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:51,908 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:52,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:52,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 03:26:52,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:52,358 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-13 03:26:52,359 INFO L182 omatonBuilderFactory]: Interpolants [17025#true, 17026#false, 17027#(<= main_~i~0 0), 17028#(<= main_~i~0 1), 17029#(<= main_~i~0 2), 17030#(<= main_~i~0 3), 17031#(<= main_~i~0 4), 17032#(<= main_~i~0 5), 17033#(<= main_~i~0 6), 17034#(<= main_~i~0 7), 17035#(<= main_~i~0 8), 17036#(<= main_~i~0 9), 17037#(<= main_~i~0 10), 17038#(<= main_~i~0 11), 17039#(<= main_~i~0 12), 17040#(<= main_~i~0 13), 17041#(<= main_~i~0 14), 17042#(<= main_~i~0 15), 17043#(<= main_~i~0 16), 17044#(<= main_~i~0 17), 17045#(<= main_~i~0 18), 17046#(<= main_~i~0 19), 17047#(<= main_~i~0 20), 17048#(<= main_~i~0 21), 17049#(<= main_~i~0 22), 17050#(<= main_~i~0 23), 17051#(<= main_~i~0 24), 17052#(<= main_~i~0 25), 17053#(<= main_~i~0 26), 17054#(<= main_~i~0 27), 17055#(<= main_~i~0 28), 17056#(<= main_~i~0 29), 17057#(<= main_~i~0 30), 17058#(<= main_~i~0 31), 17059#(<= main_~i~0 32), 17060#(<= main_~i~0 33), 17061#(<= main_~i~0 34), 17062#(<= main_~i~0 35), 17063#(<= main_~i~0 36), 17064#(<= main_~i~0 37), 17065#(<= main_~i~0 38), 17066#(<= main_~i~0 39), 17067#(<= main_~i~0 40), 17068#(<= main_~i~0 41), 17069#(<= main_~i~0 42), 17070#(<= main_~i~0 43), 17071#(<= main_~i~0 44), 17072#(<= main_~i~0 45), 17073#(<= main_~i~0 46)] [2018-04-13 03:26:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:52,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 03:26:52,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 03:26:52,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:26:52,359 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 49 states. [2018-04-13 03:26:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:52,706 INFO L93 Difference]: Finished difference Result 440 states and 485 transitions. [2018-04-13 03:26:52,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 03:26:52,706 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-04-13 03:26:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:52,707 INFO L225 Difference]: With dead ends: 440 [2018-04-13 03:26:52,707 INFO L226 Difference]: Without dead ends: 440 [2018-04-13 03:26:52,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:26:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-13 03:26:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 209. [2018-04-13 03:26:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-13 03:26:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-04-13 03:26:52,710 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-04-13 03:26:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:52,711 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-04-13 03:26:52,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 03:26:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-04-13 03:26:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-04-13 03:26:52,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:52,712 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:52,712 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1465013681, now seen corresponding path program 46 times [2018-04-13 03:26:52,713 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:52,723 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:53,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:53,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 03:26:53,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:53,242 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-13 03:26:53,242 INFO L182 omatonBuilderFactory]: Interpolants [17723#true, 17724#false, 17725#(<= main_~i~0 0), 17726#(<= main_~i~0 1), 17727#(<= main_~i~0 2), 17728#(<= main_~i~0 3), 17729#(<= main_~i~0 4), 17730#(<= main_~i~0 5), 17731#(<= main_~i~0 6), 17732#(<= main_~i~0 7), 17733#(<= main_~i~0 8), 17734#(<= main_~i~0 9), 17735#(<= main_~i~0 10), 17736#(<= main_~i~0 11), 17737#(<= main_~i~0 12), 17738#(<= main_~i~0 13), 17739#(<= main_~i~0 14), 17740#(<= main_~i~0 15), 17741#(<= main_~i~0 16), 17742#(<= main_~i~0 17), 17743#(<= main_~i~0 18), 17744#(<= main_~i~0 19), 17745#(<= main_~i~0 20), 17746#(<= main_~i~0 21), 17747#(<= main_~i~0 22), 17748#(<= main_~i~0 23), 17749#(<= main_~i~0 24), 17750#(<= main_~i~0 25), 17751#(<= main_~i~0 26), 17752#(<= main_~i~0 27), 17753#(<= main_~i~0 28), 17754#(<= main_~i~0 29), 17755#(<= main_~i~0 30), 17756#(<= main_~i~0 31), 17757#(<= main_~i~0 32), 17758#(<= main_~i~0 33), 17759#(<= main_~i~0 34), 17760#(<= main_~i~0 35), 17761#(<= main_~i~0 36), 17762#(<= main_~i~0 37), 17763#(<= main_~i~0 38), 17764#(<= main_~i~0 39), 17765#(<= main_~i~0 40), 17766#(<= main_~i~0 41), 17767#(<= main_~i~0 42), 17768#(<= main_~i~0 43), 17769#(<= main_~i~0 44), 17770#(<= main_~i~0 45), 17771#(<= main_~i~0 46), 17772#(<= main_~i~0 47)] [2018-04-13 03:26:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4427 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:53,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 03:26:53,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 03:26:53,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:26:53,243 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 50 states. [2018-04-13 03:26:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:53,589 INFO L93 Difference]: Finished difference Result 449 states and 495 transitions. [2018-04-13 03:26:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 03:26:53,590 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 208 [2018-04-13 03:26:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:53,591 INFO L225 Difference]: With dead ends: 449 [2018-04-13 03:26:53,591 INFO L226 Difference]: Without dead ends: 449 [2018-04-13 03:26:53,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 03:26:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-13 03:26:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 213. [2018-04-13 03:26:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-13 03:26:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-04-13 03:26:53,593 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 208 [2018-04-13 03:26:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:53,593 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-04-13 03:26:53,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 03:26:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-04-13 03:26:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-13 03:26:53,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:53,594 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:53,594 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash -341569366, now seen corresponding path program 47 times [2018-04-13 03:26:53,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:53,601 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:54,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:54,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 03:26:54,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:54,153 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-13 03:26:54,153 INFO L182 omatonBuilderFactory]: Interpolants [18435#true, 18436#false, 18437#(<= main_~i~0 0), 18438#(<= main_~i~0 1), 18439#(<= main_~i~0 2), 18440#(<= main_~i~0 3), 18441#(<= main_~i~0 4), 18442#(<= main_~i~0 5), 18443#(<= main_~i~0 6), 18444#(<= main_~i~0 7), 18445#(<= main_~i~0 8), 18446#(<= main_~i~0 9), 18447#(<= main_~i~0 10), 18448#(<= main_~i~0 11), 18449#(<= main_~i~0 12), 18450#(<= main_~i~0 13), 18451#(<= main_~i~0 14), 18452#(<= main_~i~0 15), 18453#(<= main_~i~0 16), 18454#(<= main_~i~0 17), 18455#(<= main_~i~0 18), 18456#(<= main_~i~0 19), 18457#(<= main_~i~0 20), 18458#(<= main_~i~0 21), 18459#(<= main_~i~0 22), 18460#(<= main_~i~0 23), 18461#(<= main_~i~0 24), 18462#(<= main_~i~0 25), 18463#(<= main_~i~0 26), 18464#(<= main_~i~0 27), 18465#(<= main_~i~0 28), 18466#(<= main_~i~0 29), 18467#(<= main_~i~0 30), 18468#(<= main_~i~0 31), 18469#(<= main_~i~0 32), 18470#(<= main_~i~0 33), 18471#(<= main_~i~0 34), 18472#(<= main_~i~0 35), 18473#(<= main_~i~0 36), 18474#(<= main_~i~0 37), 18475#(<= main_~i~0 38), 18476#(<= main_~i~0 39), 18477#(<= main_~i~0 40), 18478#(<= main_~i~0 41), 18479#(<= main_~i~0 42), 18480#(<= main_~i~0 43), 18481#(<= main_~i~0 44), 18482#(<= main_~i~0 45), 18483#(<= main_~i~0 46), 18484#(<= main_~i~0 47), 18485#(<= main_~i~0 48)] [2018-04-13 03:26:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:54,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 03:26:54,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 03:26:54,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 03:26:54,153 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 51 states. [2018-04-13 03:26:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:54,519 INFO L93 Difference]: Finished difference Result 458 states and 505 transitions. [2018-04-13 03:26:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 03:26:54,520 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 212 [2018-04-13 03:26:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:54,521 INFO L225 Difference]: With dead ends: 458 [2018-04-13 03:26:54,521 INFO L226 Difference]: Without dead ends: 458 [2018-04-13 03:26:54,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 03:26:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-13 03:26:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 217. [2018-04-13 03:26:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-13 03:26:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-04-13 03:26:54,523 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-04-13 03:26:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:54,523 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-04-13 03:26:54,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 03:26:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-04-13 03:26:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-04-13 03:26:54,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:54,525 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:54,525 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash 977119011, now seen corresponding path program 48 times [2018-04-13 03:26:54,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:54,537 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:55,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:55,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 03:26:55,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:55,092 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-13 03:26:55,092 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 37), 19201#(<= main_~i~0 38), 19202#(<= main_~i~0 39), 19203#(<= main_~i~0 40), 19204#(<= main_~i~0 41), 19205#(<= main_~i~0 42), 19206#(<= main_~i~0 43), 19207#(<= main_~i~0 44), 19208#(<= main_~i~0 45), 19209#(<= main_~i~0 46), 19210#(<= main_~i~0 47), 19211#(<= main_~i~0 48), 19212#(<= main_~i~0 49), 19161#true, 19162#false, 19163#(<= main_~i~0 0), 19164#(<= main_~i~0 1), 19165#(<= main_~i~0 2), 19166#(<= main_~i~0 3), 19167#(<= main_~i~0 4), 19168#(<= main_~i~0 5), 19169#(<= main_~i~0 6), 19170#(<= main_~i~0 7), 19171#(<= main_~i~0 8), 19172#(<= main_~i~0 9), 19173#(<= main_~i~0 10), 19174#(<= main_~i~0 11), 19175#(<= main_~i~0 12), 19176#(<= main_~i~0 13), 19177#(<= main_~i~0 14), 19178#(<= main_~i~0 15), 19179#(<= main_~i~0 16), 19180#(<= main_~i~0 17), 19181#(<= main_~i~0 18), 19182#(<= main_~i~0 19), 19183#(<= main_~i~0 20), 19184#(<= main_~i~0 21), 19185#(<= main_~i~0 22), 19186#(<= main_~i~0 23), 19187#(<= main_~i~0 24), 19188#(<= main_~i~0 25), 19189#(<= main_~i~0 26), 19190#(<= main_~i~0 27), 19191#(<= main_~i~0 28), 19192#(<= main_~i~0 29), 19193#(<= main_~i~0 30), 19194#(<= main_~i~0 31), 19195#(<= main_~i~0 32), 19196#(<= main_~i~0 33), 19197#(<= main_~i~0 34), 19198#(<= main_~i~0 35), 19199#(<= main_~i~0 36)] [2018-04-13 03:26:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4811 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:55,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 03:26:55,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 03:26:55,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:26:55,093 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 52 states. [2018-04-13 03:26:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:55,439 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2018-04-13 03:26:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 03:26:55,439 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 216 [2018-04-13 03:26:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:55,440 INFO L225 Difference]: With dead ends: 467 [2018-04-13 03:26:55,440 INFO L226 Difference]: Without dead ends: 467 [2018-04-13 03:26:55,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:26:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-13 03:26:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 221. [2018-04-13 03:26:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-13 03:26:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-04-13 03:26:55,462 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 216 [2018-04-13 03:26:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:55,462 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-04-13 03:26:55,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 03:26:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-04-13 03:26:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-13 03:26:55,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:55,463 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:55,463 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash -591046372, now seen corresponding path program 49 times [2018-04-13 03:26:55,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:55,474 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:56,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:56,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 03:26:56,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:56,052 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-13 03:26:56,052 INFO L182 omatonBuilderFactory]: Interpolants [19901#true, 19902#false, 19903#(<= main_~i~0 0), 19904#(<= main_~i~0 1), 19905#(<= main_~i~0 2), 19906#(<= main_~i~0 3), 19907#(<= main_~i~0 4), 19908#(<= main_~i~0 5), 19909#(<= main_~i~0 6), 19910#(<= main_~i~0 7), 19911#(<= main_~i~0 8), 19912#(<= main_~i~0 9), 19913#(<= main_~i~0 10), 19914#(<= main_~i~0 11), 19915#(<= main_~i~0 12), 19916#(<= main_~i~0 13), 19917#(<= main_~i~0 14), 19918#(<= main_~i~0 15), 19919#(<= main_~i~0 16), 19920#(<= main_~i~0 17), 19921#(<= main_~i~0 18), 19922#(<= main_~i~0 19), 19923#(<= main_~i~0 20), 19924#(<= main_~i~0 21), 19925#(<= main_~i~0 22), 19926#(<= main_~i~0 23), 19927#(<= main_~i~0 24), 19928#(<= main_~i~0 25), 19929#(<= main_~i~0 26), 19930#(<= main_~i~0 27), 19931#(<= main_~i~0 28), 19932#(<= main_~i~0 29), 19933#(<= main_~i~0 30), 19934#(<= main_~i~0 31), 19935#(<= main_~i~0 32), 19936#(<= main_~i~0 33), 19937#(<= main_~i~0 34), 19938#(<= main_~i~0 35), 19939#(<= main_~i~0 36), 19940#(<= main_~i~0 37), 19941#(<= main_~i~0 38), 19942#(<= main_~i~0 39), 19943#(<= main_~i~0 40), 19944#(<= main_~i~0 41), 19945#(<= main_~i~0 42), 19946#(<= main_~i~0 43), 19947#(<= main_~i~0 44), 19948#(<= main_~i~0 45), 19949#(<= main_~i~0 46), 19950#(<= main_~i~0 47), 19951#(<= main_~i~0 48), 19952#(<= main_~i~0 49), 19953#(<= main_~i~0 50)] [2018-04-13 03:26:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:56,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 03:26:56,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 03:26:56,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 03:26:56,053 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 53 states. [2018-04-13 03:26:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:56,437 INFO L93 Difference]: Finished difference Result 476 states and 525 transitions. [2018-04-13 03:26:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 03:26:56,437 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 220 [2018-04-13 03:26:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:56,438 INFO L225 Difference]: With dead ends: 476 [2018-04-13 03:26:56,438 INFO L226 Difference]: Without dead ends: 476 [2018-04-13 03:26:56,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 03:26:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-13 03:26:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 225. [2018-04-13 03:26:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 03:26:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-13 03:26:56,441 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-04-13 03:26:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:56,441 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-13 03:26:56,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 03:26:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-13 03:26:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-13 03:26:56,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:56,442 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:56,442 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1346279787, now seen corresponding path program 50 times [2018-04-13 03:26:56,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:56,449 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:57,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:57,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 03:26:57,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:57,069 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-13 03:26:57,069 INFO L182 omatonBuilderFactory]: Interpolants [20655#true, 20656#false, 20657#(<= main_~i~0 0), 20658#(<= main_~i~0 1), 20659#(<= main_~i~0 2), 20660#(<= main_~i~0 3), 20661#(<= main_~i~0 4), 20662#(<= main_~i~0 5), 20663#(<= main_~i~0 6), 20664#(<= main_~i~0 7), 20665#(<= main_~i~0 8), 20666#(<= main_~i~0 9), 20667#(<= main_~i~0 10), 20668#(<= main_~i~0 11), 20669#(<= main_~i~0 12), 20670#(<= main_~i~0 13), 20671#(<= main_~i~0 14), 20672#(<= main_~i~0 15), 20673#(<= main_~i~0 16), 20674#(<= main_~i~0 17), 20675#(<= main_~i~0 18), 20676#(<= main_~i~0 19), 20677#(<= main_~i~0 20), 20678#(<= main_~i~0 21), 20679#(<= main_~i~0 22), 20680#(<= main_~i~0 23), 20681#(<= main_~i~0 24), 20682#(<= main_~i~0 25), 20683#(<= main_~i~0 26), 20684#(<= main_~i~0 27), 20685#(<= main_~i~0 28), 20686#(<= main_~i~0 29), 20687#(<= main_~i~0 30), 20688#(<= main_~i~0 31), 20689#(<= main_~i~0 32), 20690#(<= main_~i~0 33), 20691#(<= main_~i~0 34), 20692#(<= main_~i~0 35), 20693#(<= main_~i~0 36), 20694#(<= main_~i~0 37), 20695#(<= main_~i~0 38), 20696#(<= main_~i~0 39), 20697#(<= main_~i~0 40), 20698#(<= main_~i~0 41), 20699#(<= main_~i~0 42), 20700#(<= main_~i~0 43), 20701#(<= main_~i~0 44), 20702#(<= main_~i~0 45), 20703#(<= main_~i~0 46), 20704#(<= main_~i~0 47), 20705#(<= main_~i~0 48), 20706#(<= main_~i~0 49), 20707#(<= main_~i~0 50), 20708#(<= main_~i~0 51)] [2018-04-13 03:26:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5211 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:57,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 03:26:57,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 03:26:57,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:26:57,070 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 54 states. [2018-04-13 03:26:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:57,445 INFO L93 Difference]: Finished difference Result 485 states and 535 transitions. [2018-04-13 03:26:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 03:26:57,445 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 224 [2018-04-13 03:26:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:57,446 INFO L225 Difference]: With dead ends: 485 [2018-04-13 03:26:57,446 INFO L226 Difference]: Without dead ends: 485 [2018-04-13 03:26:57,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:26:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-13 03:26:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 229. [2018-04-13 03:26:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-13 03:26:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-04-13 03:26:57,449 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-04-13 03:26:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:57,450 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-04-13 03:26:57,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 03:26:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-04-13 03:26:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-13 03:26:57,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:57,451 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:57,451 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1654132622, now seen corresponding path program 51 times [2018-04-13 03:26:57,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:57,463 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:58,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:58,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 03:26:58,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:58,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-13 03:26:58,061 INFO L182 omatonBuilderFactory]: Interpolants [21423#true, 21424#false, 21425#(<= main_~i~0 0), 21426#(<= main_~i~0 1), 21427#(<= main_~i~0 2), 21428#(<= main_~i~0 3), 21429#(<= main_~i~0 4), 21430#(<= main_~i~0 5), 21431#(<= main_~i~0 6), 21432#(<= main_~i~0 7), 21433#(<= main_~i~0 8), 21434#(<= main_~i~0 9), 21435#(<= main_~i~0 10), 21436#(<= main_~i~0 11), 21437#(<= main_~i~0 12), 21438#(<= main_~i~0 13), 21439#(<= main_~i~0 14), 21440#(<= main_~i~0 15), 21441#(<= main_~i~0 16), 21442#(<= main_~i~0 17), 21443#(<= main_~i~0 18), 21444#(<= main_~i~0 19), 21445#(<= main_~i~0 20), 21446#(<= main_~i~0 21), 21447#(<= main_~i~0 22), 21448#(<= main_~i~0 23), 21449#(<= main_~i~0 24), 21450#(<= main_~i~0 25), 21451#(<= main_~i~0 26), 21452#(<= main_~i~0 27), 21453#(<= main_~i~0 28), 21454#(<= main_~i~0 29), 21455#(<= main_~i~0 30), 21456#(<= main_~i~0 31), 21457#(<= main_~i~0 32), 21458#(<= main_~i~0 33), 21459#(<= main_~i~0 34), 21460#(<= main_~i~0 35), 21461#(<= main_~i~0 36), 21462#(<= main_~i~0 37), 21463#(<= main_~i~0 38), 21464#(<= main_~i~0 39), 21465#(<= main_~i~0 40), 21466#(<= main_~i~0 41), 21467#(<= main_~i~0 42), 21468#(<= main_~i~0 43), 21469#(<= main_~i~0 44), 21470#(<= main_~i~0 45), 21471#(<= main_~i~0 46), 21472#(<= main_~i~0 47), 21473#(<= main_~i~0 48), 21474#(<= main_~i~0 49), 21475#(<= main_~i~0 50), 21476#(<= main_~i~0 51), 21477#(<= main_~i~0 52)] [2018-04-13 03:26:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5417 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:58,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 03:26:58,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 03:26:58,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:26:58,062 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 55 states. [2018-04-13 03:26:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:58,481 INFO L93 Difference]: Finished difference Result 494 states and 545 transitions. [2018-04-13 03:26:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 03:26:58,481 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 228 [2018-04-13 03:26:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:58,482 INFO L225 Difference]: With dead ends: 494 [2018-04-13 03:26:58,482 INFO L226 Difference]: Without dead ends: 494 [2018-04-13 03:26:58,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:26:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-13 03:26:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 233. [2018-04-13 03:26:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-13 03:26:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-13 03:26:58,484 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-04-13 03:26:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:58,484 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-13 03:26:58,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 03:26:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-13 03:26:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-13 03:26:58,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:58,485 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:58,485 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 126850055, now seen corresponding path program 52 times [2018-04-13 03:26:58,486 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:58,493 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:26:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:59,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:26:59,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-13 03:26:59,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:26:59,149 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-13 03:26:59,149 INFO L182 omatonBuilderFactory]: Interpolants [22205#true, 22206#false, 22207#(<= main_~i~0 0), 22208#(<= main_~i~0 1), 22209#(<= main_~i~0 2), 22210#(<= main_~i~0 3), 22211#(<= main_~i~0 4), 22212#(<= main_~i~0 5), 22213#(<= main_~i~0 6), 22214#(<= main_~i~0 7), 22215#(<= main_~i~0 8), 22216#(<= main_~i~0 9), 22217#(<= main_~i~0 10), 22218#(<= main_~i~0 11), 22219#(<= main_~i~0 12), 22220#(<= main_~i~0 13), 22221#(<= main_~i~0 14), 22222#(<= main_~i~0 15), 22223#(<= main_~i~0 16), 22224#(<= main_~i~0 17), 22225#(<= main_~i~0 18), 22226#(<= main_~i~0 19), 22227#(<= main_~i~0 20), 22228#(<= main_~i~0 21), 22229#(<= main_~i~0 22), 22230#(<= main_~i~0 23), 22231#(<= main_~i~0 24), 22232#(<= main_~i~0 25), 22233#(<= main_~i~0 26), 22234#(<= main_~i~0 27), 22235#(<= main_~i~0 28), 22236#(<= main_~i~0 29), 22237#(<= main_~i~0 30), 22238#(<= main_~i~0 31), 22239#(<= main_~i~0 32), 22240#(<= main_~i~0 33), 22241#(<= main_~i~0 34), 22242#(<= main_~i~0 35), 22243#(<= main_~i~0 36), 22244#(<= main_~i~0 37), 22245#(<= main_~i~0 38), 22246#(<= main_~i~0 39), 22247#(<= main_~i~0 40), 22248#(<= main_~i~0 41), 22249#(<= main_~i~0 42), 22250#(<= main_~i~0 43), 22251#(<= main_~i~0 44), 22252#(<= main_~i~0 45), 22253#(<= main_~i~0 46), 22254#(<= main_~i~0 47), 22255#(<= main_~i~0 48), 22256#(<= main_~i~0 49), 22257#(<= main_~i~0 50), 22258#(<= main_~i~0 51), 22259#(<= main_~i~0 52), 22260#(<= main_~i~0 53)] [2018-04-13 03:26:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5627 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:26:59,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 03:26:59,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 03:26:59,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:26:59,150 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 56 states. [2018-04-13 03:26:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:26:59,598 INFO L93 Difference]: Finished difference Result 503 states and 555 transitions. [2018-04-13 03:26:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 03:26:59,598 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 232 [2018-04-13 03:26:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:26:59,599 INFO L225 Difference]: With dead ends: 503 [2018-04-13 03:26:59,599 INFO L226 Difference]: Without dead ends: 503 [2018-04-13 03:26:59,600 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 03:26:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-13 03:26:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 237. [2018-04-13 03:26:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-13 03:26:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-04-13 03:26:59,602 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 232 [2018-04-13 03:26:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:26:59,602 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-04-13 03:26:59,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 03:26:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-04-13 03:26:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-13 03:26:59,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:26:59,602 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:26:59,602 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:26:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1546767360, now seen corresponding path program 53 times [2018-04-13 03:26:59,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:26:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:26:59,614 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:00,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:00,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 03:27:00,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:00,309 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-13 03:27:00,309 INFO L182 omatonBuilderFactory]: Interpolants [23040#(<= main_~i~0 37), 23041#(<= main_~i~0 38), 23042#(<= main_~i~0 39), 23043#(<= main_~i~0 40), 23044#(<= main_~i~0 41), 23045#(<= main_~i~0 42), 23046#(<= main_~i~0 43), 23047#(<= main_~i~0 44), 23048#(<= main_~i~0 45), 23049#(<= main_~i~0 46), 23050#(<= main_~i~0 47), 23051#(<= main_~i~0 48), 23052#(<= main_~i~0 49), 23053#(<= main_~i~0 50), 23054#(<= main_~i~0 51), 23055#(<= main_~i~0 52), 23056#(<= main_~i~0 53), 23057#(<= main_~i~0 54), 23001#true, 23002#false, 23003#(<= main_~i~0 0), 23004#(<= main_~i~0 1), 23005#(<= main_~i~0 2), 23006#(<= main_~i~0 3), 23007#(<= main_~i~0 4), 23008#(<= main_~i~0 5), 23009#(<= main_~i~0 6), 23010#(<= main_~i~0 7), 23011#(<= main_~i~0 8), 23012#(<= main_~i~0 9), 23013#(<= main_~i~0 10), 23014#(<= main_~i~0 11), 23015#(<= main_~i~0 12), 23016#(<= main_~i~0 13), 23017#(<= main_~i~0 14), 23018#(<= main_~i~0 15), 23019#(<= main_~i~0 16), 23020#(<= main_~i~0 17), 23021#(<= main_~i~0 18), 23022#(<= main_~i~0 19), 23023#(<= main_~i~0 20), 23024#(<= main_~i~0 21), 23025#(<= main_~i~0 22), 23026#(<= main_~i~0 23), 23027#(<= main_~i~0 24), 23028#(<= main_~i~0 25), 23029#(<= main_~i~0 26), 23030#(<= main_~i~0 27), 23031#(<= main_~i~0 28), 23032#(<= main_~i~0 29), 23033#(<= main_~i~0 30), 23034#(<= main_~i~0 31), 23035#(<= main_~i~0 32), 23036#(<= main_~i~0 33), 23037#(<= main_~i~0 34), 23038#(<= main_~i~0 35), 23039#(<= main_~i~0 36)] [2018-04-13 03:27:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5841 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:00,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 03:27:00,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 03:27:00,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 03:27:00,310 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 57 states. [2018-04-13 03:27:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:00,708 INFO L93 Difference]: Finished difference Result 512 states and 565 transitions. [2018-04-13 03:27:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 03:27:00,709 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 236 [2018-04-13 03:27:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:00,710 INFO L225 Difference]: With dead ends: 512 [2018-04-13 03:27:00,710 INFO L226 Difference]: Without dead ends: 512 [2018-04-13 03:27:00,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 03:27:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-13 03:27:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 241. [2018-04-13 03:27:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-13 03:27:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-04-13 03:27:00,712 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-04-13 03:27:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:00,712 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-04-13 03:27:00,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 03:27:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-04-13 03:27:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-04-13 03:27:00,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:00,713 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:00,713 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1084608647, now seen corresponding path program 54 times [2018-04-13 03:27:00,713 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:00,721 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:01,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:01,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-13 03:27:01,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:01,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-13 03:27:01,406 INFO L182 omatonBuilderFactory]: Interpolants [23811#true, 23812#false, 23813#(<= main_~i~0 0), 23814#(<= main_~i~0 1), 23815#(<= main_~i~0 2), 23816#(<= main_~i~0 3), 23817#(<= main_~i~0 4), 23818#(<= main_~i~0 5), 23819#(<= main_~i~0 6), 23820#(<= main_~i~0 7), 23821#(<= main_~i~0 8), 23822#(<= main_~i~0 9), 23823#(<= main_~i~0 10), 23824#(<= main_~i~0 11), 23825#(<= main_~i~0 12), 23826#(<= main_~i~0 13), 23827#(<= main_~i~0 14), 23828#(<= main_~i~0 15), 23829#(<= main_~i~0 16), 23830#(<= main_~i~0 17), 23831#(<= main_~i~0 18), 23832#(<= main_~i~0 19), 23833#(<= main_~i~0 20), 23834#(<= main_~i~0 21), 23835#(<= main_~i~0 22), 23836#(<= main_~i~0 23), 23837#(<= main_~i~0 24), 23838#(<= main_~i~0 25), 23839#(<= main_~i~0 26), 23840#(<= main_~i~0 27), 23841#(<= main_~i~0 28), 23842#(<= main_~i~0 29), 23843#(<= main_~i~0 30), 23844#(<= main_~i~0 31), 23845#(<= main_~i~0 32), 23846#(<= main_~i~0 33), 23847#(<= main_~i~0 34), 23848#(<= main_~i~0 35), 23849#(<= main_~i~0 36), 23850#(<= main_~i~0 37), 23851#(<= main_~i~0 38), 23852#(<= main_~i~0 39), 23853#(<= main_~i~0 40), 23854#(<= main_~i~0 41), 23855#(<= main_~i~0 42), 23856#(<= main_~i~0 43), 23857#(<= main_~i~0 44), 23858#(<= main_~i~0 45), 23859#(<= main_~i~0 46), 23860#(<= main_~i~0 47), 23861#(<= main_~i~0 48), 23862#(<= main_~i~0 49), 23863#(<= main_~i~0 50), 23864#(<= main_~i~0 51), 23865#(<= main_~i~0 52), 23866#(<= main_~i~0 53), 23867#(<= main_~i~0 54), 23868#(<= main_~i~0 55)] [2018-04-13 03:27:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6059 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:01,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 03:27:01,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 03:27:01,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:27:01,407 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 58 states. [2018-04-13 03:27:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:02,113 INFO L93 Difference]: Finished difference Result 521 states and 575 transitions. [2018-04-13 03:27:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 03:27:02,114 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 240 [2018-04-13 03:27:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:02,115 INFO L225 Difference]: With dead ends: 521 [2018-04-13 03:27:02,115 INFO L226 Difference]: Without dead ends: 521 [2018-04-13 03:27:02,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 03:27:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-13 03:27:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 245. [2018-04-13 03:27:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-13 03:27:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-04-13 03:27:02,117 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 240 [2018-04-13 03:27:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:02,117 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-04-13 03:27:02,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 03:27:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-04-13 03:27:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-13 03:27:02,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:02,118 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:02,118 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash -182860174, now seen corresponding path program 55 times [2018-04-13 03:27:02,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:02,127 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:02,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:02,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-13 03:27:02,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:02,823 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-13 03:27:02,823 INFO L182 omatonBuilderFactory]: Interpolants [24635#true, 24636#false, 24637#(<= main_~i~0 0), 24638#(<= main_~i~0 1), 24639#(<= main_~i~0 2), 24640#(<= main_~i~0 3), 24641#(<= main_~i~0 4), 24642#(<= main_~i~0 5), 24643#(<= main_~i~0 6), 24644#(<= main_~i~0 7), 24645#(<= main_~i~0 8), 24646#(<= main_~i~0 9), 24647#(<= main_~i~0 10), 24648#(<= main_~i~0 11), 24649#(<= main_~i~0 12), 24650#(<= main_~i~0 13), 24651#(<= main_~i~0 14), 24652#(<= main_~i~0 15), 24653#(<= main_~i~0 16), 24654#(<= main_~i~0 17), 24655#(<= main_~i~0 18), 24656#(<= main_~i~0 19), 24657#(<= main_~i~0 20), 24658#(<= main_~i~0 21), 24659#(<= main_~i~0 22), 24660#(<= main_~i~0 23), 24661#(<= main_~i~0 24), 24662#(<= main_~i~0 25), 24663#(<= main_~i~0 26), 24664#(<= main_~i~0 27), 24665#(<= main_~i~0 28), 24666#(<= main_~i~0 29), 24667#(<= main_~i~0 30), 24668#(<= main_~i~0 31), 24669#(<= main_~i~0 32), 24670#(<= main_~i~0 33), 24671#(<= main_~i~0 34), 24672#(<= main_~i~0 35), 24673#(<= main_~i~0 36), 24674#(<= main_~i~0 37), 24675#(<= main_~i~0 38), 24676#(<= main_~i~0 39), 24677#(<= main_~i~0 40), 24678#(<= main_~i~0 41), 24679#(<= main_~i~0 42), 24680#(<= main_~i~0 43), 24681#(<= main_~i~0 44), 24682#(<= main_~i~0 45), 24683#(<= main_~i~0 46), 24684#(<= main_~i~0 47), 24685#(<= main_~i~0 48), 24686#(<= main_~i~0 49), 24687#(<= main_~i~0 50), 24688#(<= main_~i~0 51), 24689#(<= main_~i~0 52), 24690#(<= main_~i~0 53), 24691#(<= main_~i~0 54), 24692#(<= main_~i~0 55), 24693#(<= main_~i~0 56)] [2018-04-13 03:27:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6281 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:02,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 03:27:02,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 03:27:02,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:27:02,824 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 59 states. [2018-04-13 03:27:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:03,354 INFO L93 Difference]: Finished difference Result 530 states and 585 transitions. [2018-04-13 03:27:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 03:27:03,355 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 244 [2018-04-13 03:27:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:03,356 INFO L225 Difference]: With dead ends: 530 [2018-04-13 03:27:03,356 INFO L226 Difference]: Without dead ends: 530 [2018-04-13 03:27:03,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:27:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-13 03:27:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 249. [2018-04-13 03:27:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-13 03:27:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-04-13 03:27:03,358 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-04-13 03:27:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:03,359 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-04-13 03:27:03,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 03:27:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-04-13 03:27:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-04-13 03:27:03,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:03,360 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:03,360 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2100086549, now seen corresponding path program 56 times [2018-04-13 03:27:03,361 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:03,369 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:04,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:04,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 03:27:04,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:04,177 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-13 03:27:04,177 INFO L182 omatonBuilderFactory]: Interpolants [25473#true, 25474#false, 25475#(<= main_~i~0 0), 25476#(<= main_~i~0 1), 25477#(<= main_~i~0 2), 25478#(<= main_~i~0 3), 25479#(<= main_~i~0 4), 25480#(<= main_~i~0 5), 25481#(<= main_~i~0 6), 25482#(<= main_~i~0 7), 25483#(<= main_~i~0 8), 25484#(<= main_~i~0 9), 25485#(<= main_~i~0 10), 25486#(<= main_~i~0 11), 25487#(<= main_~i~0 12), 25488#(<= main_~i~0 13), 25489#(<= main_~i~0 14), 25490#(<= main_~i~0 15), 25491#(<= main_~i~0 16), 25492#(<= main_~i~0 17), 25493#(<= main_~i~0 18), 25494#(<= main_~i~0 19), 25495#(<= main_~i~0 20), 25496#(<= main_~i~0 21), 25497#(<= main_~i~0 22), 25498#(<= main_~i~0 23), 25499#(<= main_~i~0 24), 25500#(<= main_~i~0 25), 25501#(<= main_~i~0 26), 25502#(<= main_~i~0 27), 25503#(<= main_~i~0 28), 25504#(<= main_~i~0 29), 25505#(<= main_~i~0 30), 25506#(<= main_~i~0 31), 25507#(<= main_~i~0 32), 25508#(<= main_~i~0 33), 25509#(<= main_~i~0 34), 25510#(<= main_~i~0 35), 25511#(<= main_~i~0 36), 25512#(<= main_~i~0 37), 25513#(<= main_~i~0 38), 25514#(<= main_~i~0 39), 25515#(<= main_~i~0 40), 25516#(<= main_~i~0 41), 25517#(<= main_~i~0 42), 25518#(<= main_~i~0 43), 25519#(<= main_~i~0 44), 25520#(<= main_~i~0 45), 25521#(<= main_~i~0 46), 25522#(<= main_~i~0 47), 25523#(<= main_~i~0 48), 25524#(<= main_~i~0 49), 25525#(<= main_~i~0 50), 25526#(<= main_~i~0 51), 25527#(<= main_~i~0 52), 25528#(<= main_~i~0 53), 25529#(<= main_~i~0 54), 25530#(<= main_~i~0 55), 25531#(<= main_~i~0 56), 25532#(<= main_~i~0 57)] [2018-04-13 03:27:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6507 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:04,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 03:27:04,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 03:27:04,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 03:27:04,178 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 60 states. [2018-04-13 03:27:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:04,708 INFO L93 Difference]: Finished difference Result 539 states and 595 transitions. [2018-04-13 03:27:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 03:27:04,708 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 248 [2018-04-13 03:27:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:04,709 INFO L225 Difference]: With dead ends: 539 [2018-04-13 03:27:04,709 INFO L226 Difference]: Without dead ends: 539 [2018-04-13 03:27:04,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 03:27:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-13 03:27:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 253. [2018-04-13 03:27:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-13 03:27:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-04-13 03:27:04,711 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 248 [2018-04-13 03:27:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:04,711 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-04-13 03:27:04,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 03:27:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-04-13 03:27:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-13 03:27:04,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:04,712 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:04,712 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash -651376924, now seen corresponding path program 57 times [2018-04-13 03:27:04,713 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:04,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:05,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:05,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-13 03:27:05,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:05,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-13 03:27:05,455 INFO L182 omatonBuilderFactory]: Interpolants [26368#(<= main_~i~0 41), 26369#(<= main_~i~0 42), 26370#(<= main_~i~0 43), 26371#(<= main_~i~0 44), 26372#(<= main_~i~0 45), 26373#(<= main_~i~0 46), 26374#(<= main_~i~0 47), 26375#(<= main_~i~0 48), 26376#(<= main_~i~0 49), 26377#(<= main_~i~0 50), 26378#(<= main_~i~0 51), 26379#(<= main_~i~0 52), 26380#(<= main_~i~0 53), 26381#(<= main_~i~0 54), 26382#(<= main_~i~0 55), 26383#(<= main_~i~0 56), 26384#(<= main_~i~0 57), 26385#(<= main_~i~0 58), 26325#true, 26326#false, 26327#(<= main_~i~0 0), 26328#(<= main_~i~0 1), 26329#(<= main_~i~0 2), 26330#(<= main_~i~0 3), 26331#(<= main_~i~0 4), 26332#(<= main_~i~0 5), 26333#(<= main_~i~0 6), 26334#(<= main_~i~0 7), 26335#(<= main_~i~0 8), 26336#(<= main_~i~0 9), 26337#(<= main_~i~0 10), 26338#(<= main_~i~0 11), 26339#(<= main_~i~0 12), 26340#(<= main_~i~0 13), 26341#(<= main_~i~0 14), 26342#(<= main_~i~0 15), 26343#(<= main_~i~0 16), 26344#(<= main_~i~0 17), 26345#(<= main_~i~0 18), 26346#(<= main_~i~0 19), 26347#(<= main_~i~0 20), 26348#(<= main_~i~0 21), 26349#(<= main_~i~0 22), 26350#(<= main_~i~0 23), 26351#(<= main_~i~0 24), 26352#(<= main_~i~0 25), 26353#(<= main_~i~0 26), 26354#(<= main_~i~0 27), 26355#(<= main_~i~0 28), 26356#(<= main_~i~0 29), 26357#(<= main_~i~0 30), 26358#(<= main_~i~0 31), 26359#(<= main_~i~0 32), 26360#(<= main_~i~0 33), 26361#(<= main_~i~0 34), 26362#(<= main_~i~0 35), 26363#(<= main_~i~0 36), 26364#(<= main_~i~0 37), 26365#(<= main_~i~0 38), 26366#(<= main_~i~0 39), 26367#(<= main_~i~0 40)] [2018-04-13 03:27:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6737 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:05,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 03:27:05,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 03:27:05,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:27:05,456 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 61 states. [2018-04-13 03:27:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:05,931 INFO L93 Difference]: Finished difference Result 548 states and 605 transitions. [2018-04-13 03:27:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 03:27:05,931 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 252 [2018-04-13 03:27:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:05,932 INFO L225 Difference]: With dead ends: 548 [2018-04-13 03:27:05,932 INFO L226 Difference]: Without dead ends: 548 [2018-04-13 03:27:05,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:27:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-13 03:27:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 257. [2018-04-13 03:27:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-13 03:27:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-04-13 03:27:05,934 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-04-13 03:27:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:05,935 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-04-13 03:27:05,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 03:27:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-04-13 03:27:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-04-13 03:27:05,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:05,936 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:05,936 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash 732737629, now seen corresponding path program 58 times [2018-04-13 03:27:05,936 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:05,943 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:06,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:06,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-13 03:27:06,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:06,686 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-13 03:27:06,686 INFO L182 omatonBuilderFactory]: Interpolants [27191#true, 27192#false, 27193#(<= main_~i~0 0), 27194#(<= main_~i~0 1), 27195#(<= main_~i~0 2), 27196#(<= main_~i~0 3), 27197#(<= main_~i~0 4), 27198#(<= main_~i~0 5), 27199#(<= main_~i~0 6), 27200#(<= main_~i~0 7), 27201#(<= main_~i~0 8), 27202#(<= main_~i~0 9), 27203#(<= main_~i~0 10), 27204#(<= main_~i~0 11), 27205#(<= main_~i~0 12), 27206#(<= main_~i~0 13), 27207#(<= main_~i~0 14), 27208#(<= main_~i~0 15), 27209#(<= main_~i~0 16), 27210#(<= main_~i~0 17), 27211#(<= main_~i~0 18), 27212#(<= main_~i~0 19), 27213#(<= main_~i~0 20), 27214#(<= main_~i~0 21), 27215#(<= main_~i~0 22), 27216#(<= main_~i~0 23), 27217#(<= main_~i~0 24), 27218#(<= main_~i~0 25), 27219#(<= main_~i~0 26), 27220#(<= main_~i~0 27), 27221#(<= main_~i~0 28), 27222#(<= main_~i~0 29), 27223#(<= main_~i~0 30), 27224#(<= main_~i~0 31), 27225#(<= main_~i~0 32), 27226#(<= main_~i~0 33), 27227#(<= main_~i~0 34), 27228#(<= main_~i~0 35), 27229#(<= main_~i~0 36), 27230#(<= main_~i~0 37), 27231#(<= main_~i~0 38), 27232#(<= main_~i~0 39), 27233#(<= main_~i~0 40), 27234#(<= main_~i~0 41), 27235#(<= main_~i~0 42), 27236#(<= main_~i~0 43), 27237#(<= main_~i~0 44), 27238#(<= main_~i~0 45), 27239#(<= main_~i~0 46), 27240#(<= main_~i~0 47), 27241#(<= main_~i~0 48), 27242#(<= main_~i~0 49), 27243#(<= main_~i~0 50), 27244#(<= main_~i~0 51), 27245#(<= main_~i~0 52), 27246#(<= main_~i~0 53), 27247#(<= main_~i~0 54), 27248#(<= main_~i~0 55), 27249#(<= main_~i~0 56), 27250#(<= main_~i~0 57), 27251#(<= main_~i~0 58), 27252#(<= main_~i~0 59)] [2018-04-13 03:27:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6971 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:06,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 03:27:06,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 03:27:06,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:27:06,688 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 62 states. [2018-04-13 03:27:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:07,247 INFO L93 Difference]: Finished difference Result 557 states and 615 transitions. [2018-04-13 03:27:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 03:27:07,248 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 256 [2018-04-13 03:27:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:07,249 INFO L225 Difference]: With dead ends: 557 [2018-04-13 03:27:07,249 INFO L226 Difference]: Without dead ends: 557 [2018-04-13 03:27:07,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:27:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-13 03:27:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 261. [2018-04-13 03:27:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-13 03:27:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-04-13 03:27:07,251 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 256 [2018-04-13 03:27:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:07,251 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-04-13 03:27:07,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 03:27:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-04-13 03:27:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-04-13 03:27:07,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:07,252 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:07,252 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 12137814, now seen corresponding path program 59 times [2018-04-13 03:27:07,253 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:07,261 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:08,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:08,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 03:27:08,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:08,124 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-13 03:27:08,124 INFO L182 omatonBuilderFactory]: Interpolants [28071#true, 28072#false, 28073#(<= main_~i~0 0), 28074#(<= main_~i~0 1), 28075#(<= main_~i~0 2), 28076#(<= main_~i~0 3), 28077#(<= main_~i~0 4), 28078#(<= main_~i~0 5), 28079#(<= main_~i~0 6), 28080#(<= main_~i~0 7), 28081#(<= main_~i~0 8), 28082#(<= main_~i~0 9), 28083#(<= main_~i~0 10), 28084#(<= main_~i~0 11), 28085#(<= main_~i~0 12), 28086#(<= main_~i~0 13), 28087#(<= main_~i~0 14), 28088#(<= main_~i~0 15), 28089#(<= main_~i~0 16), 28090#(<= main_~i~0 17), 28091#(<= main_~i~0 18), 28092#(<= main_~i~0 19), 28093#(<= main_~i~0 20), 28094#(<= main_~i~0 21), 28095#(<= main_~i~0 22), 28096#(<= main_~i~0 23), 28097#(<= main_~i~0 24), 28098#(<= main_~i~0 25), 28099#(<= main_~i~0 26), 28100#(<= main_~i~0 27), 28101#(<= main_~i~0 28), 28102#(<= main_~i~0 29), 28103#(<= main_~i~0 30), 28104#(<= main_~i~0 31), 28105#(<= main_~i~0 32), 28106#(<= main_~i~0 33), 28107#(<= main_~i~0 34), 28108#(<= main_~i~0 35), 28109#(<= main_~i~0 36), 28110#(<= main_~i~0 37), 28111#(<= main_~i~0 38), 28112#(<= main_~i~0 39), 28113#(<= main_~i~0 40), 28114#(<= main_~i~0 41), 28115#(<= main_~i~0 42), 28116#(<= main_~i~0 43), 28117#(<= main_~i~0 44), 28118#(<= main_~i~0 45), 28119#(<= main_~i~0 46), 28120#(<= main_~i~0 47), 28121#(<= main_~i~0 48), 28122#(<= main_~i~0 49), 28123#(<= main_~i~0 50), 28124#(<= main_~i~0 51), 28125#(<= main_~i~0 52), 28126#(<= main_~i~0 53), 28127#(<= main_~i~0 54), 28128#(<= main_~i~0 55), 28129#(<= main_~i~0 56), 28130#(<= main_~i~0 57), 28131#(<= main_~i~0 58), 28132#(<= main_~i~0 59), 28133#(<= main_~i~0 60)] [2018-04-13 03:27:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:08,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 03:27:08,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 03:27:08,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 03:27:08,125 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 63 states. [2018-04-13 03:27:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:08,680 INFO L93 Difference]: Finished difference Result 566 states and 625 transitions. [2018-04-13 03:27:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 03:27:08,680 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 260 [2018-04-13 03:27:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:08,682 INFO L225 Difference]: With dead ends: 566 [2018-04-13 03:27:08,682 INFO L226 Difference]: Without dead ends: 566 [2018-04-13 03:27:08,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 03:27:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-13 03:27:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 265. [2018-04-13 03:27:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 03:27:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-13 03:27:08,684 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-04-13 03:27:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:08,684 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-13 03:27:08,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 03:27:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-13 03:27:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-13 03:27:08,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:08,685 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:08,685 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1046964785, now seen corresponding path program 60 times [2018-04-13 03:27:08,685 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:08,693 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:09,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:09,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 03:27:09,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:09,517 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-13 03:27:09,517 INFO L182 omatonBuilderFactory]: Interpolants [28965#true, 28966#false, 28967#(<= main_~i~0 0), 28968#(<= main_~i~0 1), 28969#(<= main_~i~0 2), 28970#(<= main_~i~0 3), 28971#(<= main_~i~0 4), 28972#(<= main_~i~0 5), 28973#(<= main_~i~0 6), 28974#(<= main_~i~0 7), 28975#(<= main_~i~0 8), 28976#(<= main_~i~0 9), 28977#(<= main_~i~0 10), 28978#(<= main_~i~0 11), 28979#(<= main_~i~0 12), 28980#(<= main_~i~0 13), 28981#(<= main_~i~0 14), 28982#(<= main_~i~0 15), 28983#(<= main_~i~0 16), 28984#(<= main_~i~0 17), 28985#(<= main_~i~0 18), 28986#(<= main_~i~0 19), 28987#(<= main_~i~0 20), 28988#(<= main_~i~0 21), 28989#(<= main_~i~0 22), 28990#(<= main_~i~0 23), 28991#(<= main_~i~0 24), 28992#(<= main_~i~0 25), 28993#(<= main_~i~0 26), 28994#(<= main_~i~0 27), 28995#(<= main_~i~0 28), 28996#(<= main_~i~0 29), 28997#(<= main_~i~0 30), 28998#(<= main_~i~0 31), 28999#(<= main_~i~0 32), 29000#(<= main_~i~0 33), 29001#(<= main_~i~0 34), 29002#(<= main_~i~0 35), 29003#(<= main_~i~0 36), 29004#(<= main_~i~0 37), 29005#(<= main_~i~0 38), 29006#(<= main_~i~0 39), 29007#(<= main_~i~0 40), 29008#(<= main_~i~0 41), 29009#(<= main_~i~0 42), 29010#(<= main_~i~0 43), 29011#(<= main_~i~0 44), 29012#(<= main_~i~0 45), 29013#(<= main_~i~0 46), 29014#(<= main_~i~0 47), 29015#(<= main_~i~0 48), 29016#(<= main_~i~0 49), 29017#(<= main_~i~0 50), 29018#(<= main_~i~0 51), 29019#(<= main_~i~0 52), 29020#(<= main_~i~0 53), 29021#(<= main_~i~0 54), 29022#(<= main_~i~0 55), 29023#(<= main_~i~0 56), 29024#(<= main_~i~0 57), 29025#(<= main_~i~0 58), 29026#(<= main_~i~0 59), 29027#(<= main_~i~0 60), 29028#(<= main_~i~0 61)] [2018-04-13 03:27:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7451 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:09,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 03:27:09,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 03:27:09,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:27:09,518 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 64 states. [2018-04-13 03:27:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:10,091 INFO L93 Difference]: Finished difference Result 575 states and 635 transitions. [2018-04-13 03:27:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 03:27:10,091 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 264 [2018-04-13 03:27:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:10,092 INFO L225 Difference]: With dead ends: 575 [2018-04-13 03:27:10,092 INFO L226 Difference]: Without dead ends: 575 [2018-04-13 03:27:10,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:27:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-13 03:27:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 269. [2018-04-13 03:27:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-04-13 03:27:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-04-13 03:27:10,095 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-04-13 03:27:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:10,095 INFO L459 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-04-13 03:27:10,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 03:27:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-04-13 03:27:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-04-13 03:27:10,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:10,096 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:10,096 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1248924104, now seen corresponding path program 61 times [2018-04-13 03:27:10,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:10,104 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:10,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:10,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-13 03:27:10,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:10,943 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-13 03:27:10,943 INFO L182 omatonBuilderFactory]: Interpolants [29873#true, 29874#false, 29875#(<= main_~i~0 0), 29876#(<= main_~i~0 1), 29877#(<= main_~i~0 2), 29878#(<= main_~i~0 3), 29879#(<= main_~i~0 4), 29880#(<= main_~i~0 5), 29881#(<= main_~i~0 6), 29882#(<= main_~i~0 7), 29883#(<= main_~i~0 8), 29884#(<= main_~i~0 9), 29885#(<= main_~i~0 10), 29886#(<= main_~i~0 11), 29887#(<= main_~i~0 12), 29888#(<= main_~i~0 13), 29889#(<= main_~i~0 14), 29890#(<= main_~i~0 15), 29891#(<= main_~i~0 16), 29892#(<= main_~i~0 17), 29893#(<= main_~i~0 18), 29894#(<= main_~i~0 19), 29895#(<= main_~i~0 20), 29896#(<= main_~i~0 21), 29897#(<= main_~i~0 22), 29898#(<= main_~i~0 23), 29899#(<= main_~i~0 24), 29900#(<= main_~i~0 25), 29901#(<= main_~i~0 26), 29902#(<= main_~i~0 27), 29903#(<= main_~i~0 28), 29904#(<= main_~i~0 29), 29905#(<= main_~i~0 30), 29906#(<= main_~i~0 31), 29907#(<= main_~i~0 32), 29908#(<= main_~i~0 33), 29909#(<= main_~i~0 34), 29910#(<= main_~i~0 35), 29911#(<= main_~i~0 36), 29912#(<= main_~i~0 37), 29913#(<= main_~i~0 38), 29914#(<= main_~i~0 39), 29915#(<= main_~i~0 40), 29916#(<= main_~i~0 41), 29917#(<= main_~i~0 42), 29918#(<= main_~i~0 43), 29919#(<= main_~i~0 44), 29920#(<= main_~i~0 45), 29921#(<= main_~i~0 46), 29922#(<= main_~i~0 47), 29923#(<= main_~i~0 48), 29924#(<= main_~i~0 49), 29925#(<= main_~i~0 50), 29926#(<= main_~i~0 51), 29927#(<= main_~i~0 52), 29928#(<= main_~i~0 53), 29929#(<= main_~i~0 54), 29930#(<= main_~i~0 55), 29931#(<= main_~i~0 56), 29932#(<= main_~i~0 57), 29933#(<= main_~i~0 58), 29934#(<= main_~i~0 59), 29935#(<= main_~i~0 60), 29936#(<= main_~i~0 61), 29937#(<= main_~i~0 62)] [2018-04-13 03:27:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7697 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:10,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 03:27:10,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 03:27:10,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 03:27:10,945 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 65 states. [2018-04-13 03:27:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:11,588 INFO L93 Difference]: Finished difference Result 584 states and 645 transitions. [2018-04-13 03:27:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 03:27:11,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 268 [2018-04-13 03:27:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:11,590 INFO L225 Difference]: With dead ends: 584 [2018-04-13 03:27:11,590 INFO L226 Difference]: Without dead ends: 584 [2018-04-13 03:27:11,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 03:27:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-04-13 03:27:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 273. [2018-04-13 03:27:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-13 03:27:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-04-13 03:27:11,593 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-04-13 03:27:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:11,593 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-04-13 03:27:11,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 03:27:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-04-13 03:27:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-13 03:27:11,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:11,594 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:11,594 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2051598657, now seen corresponding path program 62 times [2018-04-13 03:27:11,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:11,602 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:12,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:12,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-13 03:27:12,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:12,530 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-13 03:27:12,530 INFO L182 omatonBuilderFactory]: Interpolants [30848#(<= main_~i~0 51), 30849#(<= main_~i~0 52), 30850#(<= main_~i~0 53), 30851#(<= main_~i~0 54), 30852#(<= main_~i~0 55), 30853#(<= main_~i~0 56), 30854#(<= main_~i~0 57), 30855#(<= main_~i~0 58), 30856#(<= main_~i~0 59), 30857#(<= main_~i~0 60), 30858#(<= main_~i~0 61), 30859#(<= main_~i~0 62), 30860#(<= main_~i~0 63), 30795#true, 30796#false, 30797#(<= main_~i~0 0), 30798#(<= main_~i~0 1), 30799#(<= main_~i~0 2), 30800#(<= main_~i~0 3), 30801#(<= main_~i~0 4), 30802#(<= main_~i~0 5), 30803#(<= main_~i~0 6), 30804#(<= main_~i~0 7), 30805#(<= main_~i~0 8), 30806#(<= main_~i~0 9), 30807#(<= main_~i~0 10), 30808#(<= main_~i~0 11), 30809#(<= main_~i~0 12), 30810#(<= main_~i~0 13), 30811#(<= main_~i~0 14), 30812#(<= main_~i~0 15), 30813#(<= main_~i~0 16), 30814#(<= main_~i~0 17), 30815#(<= main_~i~0 18), 30816#(<= main_~i~0 19), 30817#(<= main_~i~0 20), 30818#(<= main_~i~0 21), 30819#(<= main_~i~0 22), 30820#(<= main_~i~0 23), 30821#(<= main_~i~0 24), 30822#(<= main_~i~0 25), 30823#(<= main_~i~0 26), 30824#(<= main_~i~0 27), 30825#(<= main_~i~0 28), 30826#(<= main_~i~0 29), 30827#(<= main_~i~0 30), 30828#(<= main_~i~0 31), 30829#(<= main_~i~0 32), 30830#(<= main_~i~0 33), 30831#(<= main_~i~0 34), 30832#(<= main_~i~0 35), 30833#(<= main_~i~0 36), 30834#(<= main_~i~0 37), 30835#(<= main_~i~0 38), 30836#(<= main_~i~0 39), 30837#(<= main_~i~0 40), 30838#(<= main_~i~0 41), 30839#(<= main_~i~0 42), 30840#(<= main_~i~0 43), 30841#(<= main_~i~0 44), 30842#(<= main_~i~0 45), 30843#(<= main_~i~0 46), 30844#(<= main_~i~0 47), 30845#(<= main_~i~0 48), 30846#(<= main_~i~0 49), 30847#(<= main_~i~0 50)] [2018-04-13 03:27:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7947 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:12,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 03:27:12,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 03:27:12,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 03:27:12,531 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 66 states. [2018-04-13 03:27:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:13,156 INFO L93 Difference]: Finished difference Result 593 states and 655 transitions. [2018-04-13 03:27:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 03:27:13,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 272 [2018-04-13 03:27:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:13,158 INFO L225 Difference]: With dead ends: 593 [2018-04-13 03:27:13,158 INFO L226 Difference]: Without dead ends: 593 [2018-04-13 03:27:13,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 03:27:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-13 03:27:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 277. [2018-04-13 03:27:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-04-13 03:27:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-04-13 03:27:13,160 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 272 [2018-04-13 03:27:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:13,161 INFO L459 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-04-13 03:27:13,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 03:27:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-04-13 03:27:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-04-13 03:27:13,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:13,161 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:13,161 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1022993350, now seen corresponding path program 63 times [2018-04-13 03:27:13,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:13,169 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:14,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:14,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-13 03:27:14,084 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:14,084 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-13 03:27:14,084 INFO L182 omatonBuilderFactory]: Interpolants [31744#(<= main_~i~0 11), 31745#(<= main_~i~0 12), 31746#(<= main_~i~0 13), 31747#(<= main_~i~0 14), 31748#(<= main_~i~0 15), 31749#(<= main_~i~0 16), 31750#(<= main_~i~0 17), 31751#(<= main_~i~0 18), 31752#(<= main_~i~0 19), 31753#(<= main_~i~0 20), 31754#(<= main_~i~0 21), 31755#(<= main_~i~0 22), 31756#(<= main_~i~0 23), 31757#(<= main_~i~0 24), 31758#(<= main_~i~0 25), 31759#(<= main_~i~0 26), 31760#(<= main_~i~0 27), 31761#(<= main_~i~0 28), 31762#(<= main_~i~0 29), 31763#(<= main_~i~0 30), 31764#(<= main_~i~0 31), 31765#(<= main_~i~0 32), 31766#(<= main_~i~0 33), 31767#(<= main_~i~0 34), 31768#(<= main_~i~0 35), 31769#(<= main_~i~0 36), 31770#(<= main_~i~0 37), 31771#(<= main_~i~0 38), 31772#(<= main_~i~0 39), 31773#(<= main_~i~0 40), 31774#(<= main_~i~0 41), 31775#(<= main_~i~0 42), 31776#(<= main_~i~0 43), 31777#(<= main_~i~0 44), 31778#(<= main_~i~0 45), 31779#(<= main_~i~0 46), 31780#(<= main_~i~0 47), 31781#(<= main_~i~0 48), 31782#(<= main_~i~0 49), 31783#(<= main_~i~0 50), 31784#(<= main_~i~0 51), 31785#(<= main_~i~0 52), 31786#(<= main_~i~0 53), 31787#(<= main_~i~0 54), 31788#(<= main_~i~0 55), 31789#(<= main_~i~0 56), 31790#(<= main_~i~0 57), 31791#(<= main_~i~0 58), 31792#(<= main_~i~0 59), 31793#(<= main_~i~0 60), 31794#(<= main_~i~0 61), 31795#(<= main_~i~0 62), 31796#(<= main_~i~0 63), 31797#(<= main_~i~0 64), 31731#true, 31732#false, 31733#(<= main_~i~0 0), 31734#(<= main_~i~0 1), 31735#(<= main_~i~0 2), 31736#(<= main_~i~0 3), 31737#(<= main_~i~0 4), 31738#(<= main_~i~0 5), 31739#(<= main_~i~0 6), 31740#(<= main_~i~0 7), 31741#(<= main_~i~0 8), 31742#(<= main_~i~0 9), 31743#(<= main_~i~0 10)] [2018-04-13 03:27:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8201 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:14,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 03:27:14,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 03:27:14,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 03:27:14,085 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 67 states. [2018-04-13 03:27:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:14,689 INFO L93 Difference]: Finished difference Result 602 states and 665 transitions. [2018-04-13 03:27:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 03:27:14,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 276 [2018-04-13 03:27:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:14,690 INFO L225 Difference]: With dead ends: 602 [2018-04-13 03:27:14,690 INFO L226 Difference]: Without dead ends: 602 [2018-04-13 03:27:14,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 03:27:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-04-13 03:27:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 281. [2018-04-13 03:27:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-13 03:27:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-04-13 03:27:14,693 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-04-13 03:27:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:14,693 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-04-13 03:27:14,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 03:27:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-04-13 03:27:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-04-13 03:27:14,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:14,694 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:14,694 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1183864141, now seen corresponding path program 64 times [2018-04-13 03:27:14,694 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:14,702 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:15,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:15,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 03:27:15,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:15,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-13 03:27:15,586 INFO L182 omatonBuilderFactory]: Interpolants [32681#true, 32682#false, 32683#(<= main_~i~0 0), 32684#(<= main_~i~0 1), 32685#(<= main_~i~0 2), 32686#(<= main_~i~0 3), 32687#(<= main_~i~0 4), 32688#(<= main_~i~0 5), 32689#(<= main_~i~0 6), 32690#(<= main_~i~0 7), 32691#(<= main_~i~0 8), 32692#(<= main_~i~0 9), 32693#(<= main_~i~0 10), 32694#(<= main_~i~0 11), 32695#(<= main_~i~0 12), 32696#(<= main_~i~0 13), 32697#(<= main_~i~0 14), 32698#(<= main_~i~0 15), 32699#(<= main_~i~0 16), 32700#(<= main_~i~0 17), 32701#(<= main_~i~0 18), 32702#(<= main_~i~0 19), 32703#(<= main_~i~0 20), 32704#(<= main_~i~0 21), 32705#(<= main_~i~0 22), 32706#(<= main_~i~0 23), 32707#(<= main_~i~0 24), 32708#(<= main_~i~0 25), 32709#(<= main_~i~0 26), 32710#(<= main_~i~0 27), 32711#(<= main_~i~0 28), 32712#(<= main_~i~0 29), 32713#(<= main_~i~0 30), 32714#(<= main_~i~0 31), 32715#(<= main_~i~0 32), 32716#(<= main_~i~0 33), 32717#(<= main_~i~0 34), 32718#(<= main_~i~0 35), 32719#(<= main_~i~0 36), 32720#(<= main_~i~0 37), 32721#(<= main_~i~0 38), 32722#(<= main_~i~0 39), 32723#(<= main_~i~0 40), 32724#(<= main_~i~0 41), 32725#(<= main_~i~0 42), 32726#(<= main_~i~0 43), 32727#(<= main_~i~0 44), 32728#(<= main_~i~0 45), 32729#(<= main_~i~0 46), 32730#(<= main_~i~0 47), 32731#(<= main_~i~0 48), 32732#(<= main_~i~0 49), 32733#(<= main_~i~0 50), 32734#(<= main_~i~0 51), 32735#(<= main_~i~0 52), 32736#(<= main_~i~0 53), 32737#(<= main_~i~0 54), 32738#(<= main_~i~0 55), 32739#(<= main_~i~0 56), 32740#(<= main_~i~0 57), 32741#(<= main_~i~0 58), 32742#(<= main_~i~0 59), 32743#(<= main_~i~0 60), 32744#(<= main_~i~0 61), 32745#(<= main_~i~0 62), 32746#(<= main_~i~0 63), 32747#(<= main_~i~0 64), 32748#(<= main_~i~0 65)] [2018-04-13 03:27:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8459 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:15,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 03:27:15,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 03:27:15,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:27:15,587 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 68 states. [2018-04-13 03:27:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:16,352 INFO L93 Difference]: Finished difference Result 611 states and 675 transitions. [2018-04-13 03:27:16,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 03:27:16,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 280 [2018-04-13 03:27:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:16,353 INFO L225 Difference]: With dead ends: 611 [2018-04-13 03:27:16,353 INFO L226 Difference]: Without dead ends: 611 [2018-04-13 03:27:16,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 03:27:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-04-13 03:27:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 285. [2018-04-13 03:27:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 03:27:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-04-13 03:27:16,356 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 280 [2018-04-13 03:27:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:16,356 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-04-13 03:27:16,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 03:27:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-04-13 03:27:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-13 03:27:16,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:16,357 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:16,357 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1523903316, now seen corresponding path program 65 times [2018-04-13 03:27:16,358 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:16,366 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:17,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:17,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 03:27:17,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:17,370 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-13 03:27:17,370 INFO L182 omatonBuilderFactory]: Interpolants [33664#(<= main_~i~0 17), 33665#(<= main_~i~0 18), 33666#(<= main_~i~0 19), 33667#(<= main_~i~0 20), 33668#(<= main_~i~0 21), 33669#(<= main_~i~0 22), 33670#(<= main_~i~0 23), 33671#(<= main_~i~0 24), 33672#(<= main_~i~0 25), 33673#(<= main_~i~0 26), 33674#(<= main_~i~0 27), 33675#(<= main_~i~0 28), 33676#(<= main_~i~0 29), 33677#(<= main_~i~0 30), 33678#(<= main_~i~0 31), 33679#(<= main_~i~0 32), 33680#(<= main_~i~0 33), 33681#(<= main_~i~0 34), 33682#(<= main_~i~0 35), 33683#(<= main_~i~0 36), 33684#(<= main_~i~0 37), 33685#(<= main_~i~0 38), 33686#(<= main_~i~0 39), 33687#(<= main_~i~0 40), 33688#(<= main_~i~0 41), 33689#(<= main_~i~0 42), 33690#(<= main_~i~0 43), 33691#(<= main_~i~0 44), 33692#(<= main_~i~0 45), 33693#(<= main_~i~0 46), 33694#(<= main_~i~0 47), 33695#(<= main_~i~0 48), 33696#(<= main_~i~0 49), 33697#(<= main_~i~0 50), 33698#(<= main_~i~0 51), 33699#(<= main_~i~0 52), 33700#(<= main_~i~0 53), 33701#(<= main_~i~0 54), 33702#(<= main_~i~0 55), 33703#(<= main_~i~0 56), 33704#(<= main_~i~0 57), 33705#(<= main_~i~0 58), 33706#(<= main_~i~0 59), 33707#(<= main_~i~0 60), 33708#(<= main_~i~0 61), 33709#(<= main_~i~0 62), 33710#(<= main_~i~0 63), 33711#(<= main_~i~0 64), 33712#(<= main_~i~0 65), 33713#(<= main_~i~0 66), 33645#true, 33646#false, 33647#(<= main_~i~0 0), 33648#(<= main_~i~0 1), 33649#(<= main_~i~0 2), 33650#(<= main_~i~0 3), 33651#(<= main_~i~0 4), 33652#(<= main_~i~0 5), 33653#(<= main_~i~0 6), 33654#(<= main_~i~0 7), 33655#(<= main_~i~0 8), 33656#(<= main_~i~0 9), 33657#(<= main_~i~0 10), 33658#(<= main_~i~0 11), 33659#(<= main_~i~0 12), 33660#(<= main_~i~0 13), 33661#(<= main_~i~0 14), 33662#(<= main_~i~0 15), 33663#(<= main_~i~0 16)] [2018-04-13 03:27:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8721 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:17,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 03:27:17,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 03:27:17,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:27:17,371 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 69 states. [2018-04-13 03:27:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:18,063 INFO L93 Difference]: Finished difference Result 620 states and 685 transitions. [2018-04-13 03:27:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 03:27:18,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 284 [2018-04-13 03:27:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:18,065 INFO L225 Difference]: With dead ends: 620 [2018-04-13 03:27:18,065 INFO L226 Difference]: Without dead ends: 620 [2018-04-13 03:27:18,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:27:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-04-13 03:27:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 289. [2018-04-13 03:27:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-13 03:27:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-13 03:27:18,068 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-04-13 03:27:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:18,068 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-13 03:27:18,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 03:27:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-13 03:27:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-13 03:27:18,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:18,069 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:18,069 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 280943141, now seen corresponding path program 66 times [2018-04-13 03:27:18,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:18,078 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:19,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:19,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-13 03:27:19,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:19,046 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-13 03:27:19,046 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 63), 34689#(<= main_~i~0 64), 34690#(<= main_~i~0 65), 34691#(<= main_~i~0 66), 34692#(<= main_~i~0 67), 34623#true, 34624#false, 34625#(<= main_~i~0 0), 34626#(<= main_~i~0 1), 34627#(<= main_~i~0 2), 34628#(<= main_~i~0 3), 34629#(<= main_~i~0 4), 34630#(<= main_~i~0 5), 34631#(<= main_~i~0 6), 34632#(<= main_~i~0 7), 34633#(<= main_~i~0 8), 34634#(<= main_~i~0 9), 34635#(<= main_~i~0 10), 34636#(<= main_~i~0 11), 34637#(<= main_~i~0 12), 34638#(<= main_~i~0 13), 34639#(<= main_~i~0 14), 34640#(<= main_~i~0 15), 34641#(<= main_~i~0 16), 34642#(<= main_~i~0 17), 34643#(<= main_~i~0 18), 34644#(<= main_~i~0 19), 34645#(<= main_~i~0 20), 34646#(<= main_~i~0 21), 34647#(<= main_~i~0 22), 34648#(<= main_~i~0 23), 34649#(<= main_~i~0 24), 34650#(<= main_~i~0 25), 34651#(<= main_~i~0 26), 34652#(<= main_~i~0 27), 34653#(<= main_~i~0 28), 34654#(<= main_~i~0 29), 34655#(<= main_~i~0 30), 34656#(<= main_~i~0 31), 34657#(<= main_~i~0 32), 34658#(<= main_~i~0 33), 34659#(<= main_~i~0 34), 34660#(<= main_~i~0 35), 34661#(<= main_~i~0 36), 34662#(<= main_~i~0 37), 34663#(<= main_~i~0 38), 34664#(<= main_~i~0 39), 34665#(<= main_~i~0 40), 34666#(<= main_~i~0 41), 34667#(<= main_~i~0 42), 34668#(<= main_~i~0 43), 34669#(<= main_~i~0 44), 34670#(<= main_~i~0 45), 34671#(<= main_~i~0 46), 34672#(<= main_~i~0 47), 34673#(<= main_~i~0 48), 34674#(<= main_~i~0 49), 34675#(<= main_~i~0 50), 34676#(<= main_~i~0 51), 34677#(<= main_~i~0 52), 34678#(<= main_~i~0 53), 34679#(<= main_~i~0 54), 34680#(<= main_~i~0 55), 34681#(<= main_~i~0 56), 34682#(<= main_~i~0 57), 34683#(<= main_~i~0 58), 34684#(<= main_~i~0 59), 34685#(<= main_~i~0 60), 34686#(<= main_~i~0 61), 34687#(<= main_~i~0 62)] [2018-04-13 03:27:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8987 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:19,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 03:27:19,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 03:27:19,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:27:19,047 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 70 states. [2018-04-13 03:27:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:19,814 INFO L93 Difference]: Finished difference Result 629 states and 695 transitions. [2018-04-13 03:27:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 03:27:19,814 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 288 [2018-04-13 03:27:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:19,815 INFO L225 Difference]: With dead ends: 629 [2018-04-13 03:27:19,815 INFO L226 Difference]: Without dead ends: 629 [2018-04-13 03:27:19,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 03:27:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-13 03:27:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 293. [2018-04-13 03:27:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-13 03:27:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-04-13 03:27:19,817 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 288 [2018-04-13 03:27:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:19,818 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-04-13 03:27:19,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 03:27:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-04-13 03:27:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-13 03:27:19,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:19,818 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:19,819 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1502690078, now seen corresponding path program 67 times [2018-04-13 03:27:19,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:19,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:20,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:20,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-13 03:27:20,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:20,792 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-13 03:27:20,792 INFO L182 omatonBuilderFactory]: Interpolants [35615#true, 35616#false, 35617#(<= main_~i~0 0), 35618#(<= main_~i~0 1), 35619#(<= main_~i~0 2), 35620#(<= main_~i~0 3), 35621#(<= main_~i~0 4), 35622#(<= main_~i~0 5), 35623#(<= main_~i~0 6), 35624#(<= main_~i~0 7), 35625#(<= main_~i~0 8), 35626#(<= main_~i~0 9), 35627#(<= main_~i~0 10), 35628#(<= main_~i~0 11), 35629#(<= main_~i~0 12), 35630#(<= main_~i~0 13), 35631#(<= main_~i~0 14), 35632#(<= main_~i~0 15), 35633#(<= main_~i~0 16), 35634#(<= main_~i~0 17), 35635#(<= main_~i~0 18), 35636#(<= main_~i~0 19), 35637#(<= main_~i~0 20), 35638#(<= main_~i~0 21), 35639#(<= main_~i~0 22), 35640#(<= main_~i~0 23), 35641#(<= main_~i~0 24), 35642#(<= main_~i~0 25), 35643#(<= main_~i~0 26), 35644#(<= main_~i~0 27), 35645#(<= main_~i~0 28), 35646#(<= main_~i~0 29), 35647#(<= main_~i~0 30), 35648#(<= main_~i~0 31), 35649#(<= main_~i~0 32), 35650#(<= main_~i~0 33), 35651#(<= main_~i~0 34), 35652#(<= main_~i~0 35), 35653#(<= main_~i~0 36), 35654#(<= main_~i~0 37), 35655#(<= main_~i~0 38), 35656#(<= main_~i~0 39), 35657#(<= main_~i~0 40), 35658#(<= main_~i~0 41), 35659#(<= main_~i~0 42), 35660#(<= main_~i~0 43), 35661#(<= main_~i~0 44), 35662#(<= main_~i~0 45), 35663#(<= main_~i~0 46), 35664#(<= main_~i~0 47), 35665#(<= main_~i~0 48), 35666#(<= main_~i~0 49), 35667#(<= main_~i~0 50), 35668#(<= main_~i~0 51), 35669#(<= main_~i~0 52), 35670#(<= main_~i~0 53), 35671#(<= main_~i~0 54), 35672#(<= main_~i~0 55), 35673#(<= main_~i~0 56), 35674#(<= main_~i~0 57), 35675#(<= main_~i~0 58), 35676#(<= main_~i~0 59), 35677#(<= main_~i~0 60), 35678#(<= main_~i~0 61), 35679#(<= main_~i~0 62), 35680#(<= main_~i~0 63), 35681#(<= main_~i~0 64), 35682#(<= main_~i~0 65), 35683#(<= main_~i~0 66), 35684#(<= main_~i~0 67), 35685#(<= main_~i~0 68)] [2018-04-13 03:27:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9257 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 03:27:20,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 03:27:20,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 03:27:20,794 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 71 states. [2018-04-13 03:27:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:21,733 INFO L93 Difference]: Finished difference Result 638 states and 705 transitions. [2018-04-13 03:27:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 03:27:21,733 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 292 [2018-04-13 03:27:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:21,734 INFO L225 Difference]: With dead ends: 638 [2018-04-13 03:27:21,734 INFO L226 Difference]: Without dead ends: 638 [2018-04-13 03:27:21,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 03:27:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-13 03:27:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 297. [2018-04-13 03:27:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-13 03:27:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-04-13 03:27:21,736 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 292 [2018-04-13 03:27:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:21,736 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-04-13 03:27:21,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 03:27:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-04-13 03:27:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-04-13 03:27:21,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:21,737 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:21,737 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1072199575, now seen corresponding path program 68 times [2018-04-13 03:27:21,737 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:21,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:22,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:22,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 03:27:22,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:22,777 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-13 03:27:22,777 INFO L182 omatonBuilderFactory]: Interpolants [36621#true, 36622#false, 36623#(<= main_~i~0 0), 36624#(<= main_~i~0 1), 36625#(<= main_~i~0 2), 36626#(<= main_~i~0 3), 36627#(<= main_~i~0 4), 36628#(<= main_~i~0 5), 36629#(<= main_~i~0 6), 36630#(<= main_~i~0 7), 36631#(<= main_~i~0 8), 36632#(<= main_~i~0 9), 36633#(<= main_~i~0 10), 36634#(<= main_~i~0 11), 36635#(<= main_~i~0 12), 36636#(<= main_~i~0 13), 36637#(<= main_~i~0 14), 36638#(<= main_~i~0 15), 36639#(<= main_~i~0 16), 36640#(<= main_~i~0 17), 36641#(<= main_~i~0 18), 36642#(<= main_~i~0 19), 36643#(<= main_~i~0 20), 36644#(<= main_~i~0 21), 36645#(<= main_~i~0 22), 36646#(<= main_~i~0 23), 36647#(<= main_~i~0 24), 36648#(<= main_~i~0 25), 36649#(<= main_~i~0 26), 36650#(<= main_~i~0 27), 36651#(<= main_~i~0 28), 36652#(<= main_~i~0 29), 36653#(<= main_~i~0 30), 36654#(<= main_~i~0 31), 36655#(<= main_~i~0 32), 36656#(<= main_~i~0 33), 36657#(<= main_~i~0 34), 36658#(<= main_~i~0 35), 36659#(<= main_~i~0 36), 36660#(<= main_~i~0 37), 36661#(<= main_~i~0 38), 36662#(<= main_~i~0 39), 36663#(<= main_~i~0 40), 36664#(<= main_~i~0 41), 36665#(<= main_~i~0 42), 36666#(<= main_~i~0 43), 36667#(<= main_~i~0 44), 36668#(<= main_~i~0 45), 36669#(<= main_~i~0 46), 36670#(<= main_~i~0 47), 36671#(<= main_~i~0 48), 36672#(<= main_~i~0 49), 36673#(<= main_~i~0 50), 36674#(<= main_~i~0 51), 36675#(<= main_~i~0 52), 36676#(<= main_~i~0 53), 36677#(<= main_~i~0 54), 36678#(<= main_~i~0 55), 36679#(<= main_~i~0 56), 36680#(<= main_~i~0 57), 36681#(<= main_~i~0 58), 36682#(<= main_~i~0 59), 36683#(<= main_~i~0 60), 36684#(<= main_~i~0 61), 36685#(<= main_~i~0 62), 36686#(<= main_~i~0 63), 36687#(<= main_~i~0 64), 36688#(<= main_~i~0 65), 36689#(<= main_~i~0 66), 36690#(<= main_~i~0 67), 36691#(<= main_~i~0 68), 36692#(<= main_~i~0 69)] [2018-04-13 03:27:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9531 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:22,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 03:27:22,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 03:27:22,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 03:27:22,778 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 72 states. [2018-04-13 03:27:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:23,748 INFO L93 Difference]: Finished difference Result 647 states and 715 transitions. [2018-04-13 03:27:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 03:27:23,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 296 [2018-04-13 03:27:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:23,750 INFO L225 Difference]: With dead ends: 647 [2018-04-13 03:27:23,750 INFO L226 Difference]: Without dead ends: 647 [2018-04-13 03:27:23,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 03:27:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-04-13 03:27:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 301. [2018-04-13 03:27:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-13 03:27:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-04-13 03:27:23,753 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 296 [2018-04-13 03:27:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:23,753 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-04-13 03:27:23,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 03:27:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-04-13 03:27:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-04-13 03:27:23,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:23,754 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:23,754 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1995100048, now seen corresponding path program 69 times [2018-04-13 03:27:23,754 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:23,763 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9809 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:24,824 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:24,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-13 03:27:24,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:24,825 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-13 03:27:24,825 INFO L182 omatonBuilderFactory]: Interpolants [37641#true, 37642#false, 37643#(<= main_~i~0 0), 37644#(<= main_~i~0 1), 37645#(<= main_~i~0 2), 37646#(<= main_~i~0 3), 37647#(<= main_~i~0 4), 37648#(<= main_~i~0 5), 37649#(<= main_~i~0 6), 37650#(<= main_~i~0 7), 37651#(<= main_~i~0 8), 37652#(<= main_~i~0 9), 37653#(<= main_~i~0 10), 37654#(<= main_~i~0 11), 37655#(<= main_~i~0 12), 37656#(<= main_~i~0 13), 37657#(<= main_~i~0 14), 37658#(<= main_~i~0 15), 37659#(<= main_~i~0 16), 37660#(<= main_~i~0 17), 37661#(<= main_~i~0 18), 37662#(<= main_~i~0 19), 37663#(<= main_~i~0 20), 37664#(<= main_~i~0 21), 37665#(<= main_~i~0 22), 37666#(<= main_~i~0 23), 37667#(<= main_~i~0 24), 37668#(<= main_~i~0 25), 37669#(<= main_~i~0 26), 37670#(<= main_~i~0 27), 37671#(<= main_~i~0 28), 37672#(<= main_~i~0 29), 37673#(<= main_~i~0 30), 37674#(<= main_~i~0 31), 37675#(<= main_~i~0 32), 37676#(<= main_~i~0 33), 37677#(<= main_~i~0 34), 37678#(<= main_~i~0 35), 37679#(<= main_~i~0 36), 37680#(<= main_~i~0 37), 37681#(<= main_~i~0 38), 37682#(<= main_~i~0 39), 37683#(<= main_~i~0 40), 37684#(<= main_~i~0 41), 37685#(<= main_~i~0 42), 37686#(<= main_~i~0 43), 37687#(<= main_~i~0 44), 37688#(<= main_~i~0 45), 37689#(<= main_~i~0 46), 37690#(<= main_~i~0 47), 37691#(<= main_~i~0 48), 37692#(<= main_~i~0 49), 37693#(<= main_~i~0 50), 37694#(<= main_~i~0 51), 37695#(<= main_~i~0 52), 37696#(<= main_~i~0 53), 37697#(<= main_~i~0 54), 37698#(<= main_~i~0 55), 37699#(<= main_~i~0 56), 37700#(<= main_~i~0 57), 37701#(<= main_~i~0 58), 37702#(<= main_~i~0 59), 37703#(<= main_~i~0 60), 37704#(<= main_~i~0 61), 37705#(<= main_~i~0 62), 37706#(<= main_~i~0 63), 37707#(<= main_~i~0 64), 37708#(<= main_~i~0 65), 37709#(<= main_~i~0 66), 37710#(<= main_~i~0 67), 37711#(<= main_~i~0 68), 37712#(<= main_~i~0 69), 37713#(<= main_~i~0 70)] [2018-04-13 03:27:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9809 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:24,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 03:27:24,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 03:27:24,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:27:24,826 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 73 states. [2018-04-13 03:27:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:25,784 INFO L93 Difference]: Finished difference Result 656 states and 725 transitions. [2018-04-13 03:27:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 03:27:25,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 300 [2018-04-13 03:27:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:25,786 INFO L225 Difference]: With dead ends: 656 [2018-04-13 03:27:25,786 INFO L226 Difference]: Without dead ends: 656 [2018-04-13 03:27:25,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:27:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-04-13 03:27:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 305. [2018-04-13 03:27:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-13 03:27:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-04-13 03:27:25,789 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 300 [2018-04-13 03:27:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:25,789 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-04-13 03:27:25,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 03:27:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-04-13 03:27:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-04-13 03:27:25,790 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:25,790 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:25,790 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash 882803465, now seen corresponding path program 70 times [2018-04-13 03:27:25,791 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:25,799 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10091 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:26,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:26,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 03:27:26,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:26,877 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-13 03:27:26,877 INFO L182 omatonBuilderFactory]: Interpolants [38675#true, 38676#false, 38677#(<= main_~i~0 0), 38678#(<= main_~i~0 1), 38679#(<= main_~i~0 2), 38680#(<= main_~i~0 3), 38681#(<= main_~i~0 4), 38682#(<= main_~i~0 5), 38683#(<= main_~i~0 6), 38684#(<= main_~i~0 7), 38685#(<= main_~i~0 8), 38686#(<= main_~i~0 9), 38687#(<= main_~i~0 10), 38688#(<= main_~i~0 11), 38689#(<= main_~i~0 12), 38690#(<= main_~i~0 13), 38691#(<= main_~i~0 14), 38692#(<= main_~i~0 15), 38693#(<= main_~i~0 16), 38694#(<= main_~i~0 17), 38695#(<= main_~i~0 18), 38696#(<= main_~i~0 19), 38697#(<= main_~i~0 20), 38698#(<= main_~i~0 21), 38699#(<= main_~i~0 22), 38700#(<= main_~i~0 23), 38701#(<= main_~i~0 24), 38702#(<= main_~i~0 25), 38703#(<= main_~i~0 26), 38704#(<= main_~i~0 27), 38705#(<= main_~i~0 28), 38706#(<= main_~i~0 29), 38707#(<= main_~i~0 30), 38708#(<= main_~i~0 31), 38709#(<= main_~i~0 32), 38710#(<= main_~i~0 33), 38711#(<= main_~i~0 34), 38712#(<= main_~i~0 35), 38713#(<= main_~i~0 36), 38714#(<= main_~i~0 37), 38715#(<= main_~i~0 38), 38716#(<= main_~i~0 39), 38717#(<= main_~i~0 40), 38718#(<= main_~i~0 41), 38719#(<= main_~i~0 42), 38720#(<= main_~i~0 43), 38721#(<= main_~i~0 44), 38722#(<= main_~i~0 45), 38723#(<= main_~i~0 46), 38724#(<= main_~i~0 47), 38725#(<= main_~i~0 48), 38726#(<= main_~i~0 49), 38727#(<= main_~i~0 50), 38728#(<= main_~i~0 51), 38729#(<= main_~i~0 52), 38730#(<= main_~i~0 53), 38731#(<= main_~i~0 54), 38732#(<= main_~i~0 55), 38733#(<= main_~i~0 56), 38734#(<= main_~i~0 57), 38735#(<= main_~i~0 58), 38736#(<= main_~i~0 59), 38737#(<= main_~i~0 60), 38738#(<= main_~i~0 61), 38739#(<= main_~i~0 62), 38740#(<= main_~i~0 63), 38741#(<= main_~i~0 64), 38742#(<= main_~i~0 65), 38743#(<= main_~i~0 66), 38744#(<= main_~i~0 67), 38745#(<= main_~i~0 68), 38746#(<= main_~i~0 69), 38747#(<= main_~i~0 70), 38748#(<= main_~i~0 71)] [2018-04-13 03:27:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10091 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:26,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 03:27:26,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 03:27:26,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 03:27:26,878 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 74 states. [2018-04-13 03:27:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:27,938 INFO L93 Difference]: Finished difference Result 665 states and 735 transitions. [2018-04-13 03:27:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 03:27:27,938 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 304 [2018-04-13 03:27:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:27,939 INFO L225 Difference]: With dead ends: 665 [2018-04-13 03:27:27,939 INFO L226 Difference]: Without dead ends: 665 [2018-04-13 03:27:27,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 03:27:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-13 03:27:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 309. [2018-04-13 03:27:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-13 03:27:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-04-13 03:27:27,941 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 304 [2018-04-13 03:27:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:27,942 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-04-13 03:27:27,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 03:27:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-04-13 03:27:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-04-13 03:27:27,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:27,943 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:27,943 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1041640958, now seen corresponding path program 71 times [2018-04-13 03:27:27,943 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:27,951 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:29,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:29,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 03:27:29,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:29,103 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-13 03:27:29,103 INFO L182 omatonBuilderFactory]: Interpolants [39723#true, 39724#false, 39725#(<= main_~i~0 0), 39726#(<= main_~i~0 1), 39727#(<= main_~i~0 2), 39728#(<= main_~i~0 3), 39729#(<= main_~i~0 4), 39730#(<= main_~i~0 5), 39731#(<= main_~i~0 6), 39732#(<= main_~i~0 7), 39733#(<= main_~i~0 8), 39734#(<= main_~i~0 9), 39735#(<= main_~i~0 10), 39736#(<= main_~i~0 11), 39737#(<= main_~i~0 12), 39738#(<= main_~i~0 13), 39739#(<= main_~i~0 14), 39740#(<= main_~i~0 15), 39741#(<= main_~i~0 16), 39742#(<= main_~i~0 17), 39743#(<= main_~i~0 18), 39744#(<= main_~i~0 19), 39745#(<= main_~i~0 20), 39746#(<= main_~i~0 21), 39747#(<= main_~i~0 22), 39748#(<= main_~i~0 23), 39749#(<= main_~i~0 24), 39750#(<= main_~i~0 25), 39751#(<= main_~i~0 26), 39752#(<= main_~i~0 27), 39753#(<= main_~i~0 28), 39754#(<= main_~i~0 29), 39755#(<= main_~i~0 30), 39756#(<= main_~i~0 31), 39757#(<= main_~i~0 32), 39758#(<= main_~i~0 33), 39759#(<= main_~i~0 34), 39760#(<= main_~i~0 35), 39761#(<= main_~i~0 36), 39762#(<= main_~i~0 37), 39763#(<= main_~i~0 38), 39764#(<= main_~i~0 39), 39765#(<= main_~i~0 40), 39766#(<= main_~i~0 41), 39767#(<= main_~i~0 42), 39768#(<= main_~i~0 43), 39769#(<= main_~i~0 44), 39770#(<= main_~i~0 45), 39771#(<= main_~i~0 46), 39772#(<= main_~i~0 47), 39773#(<= main_~i~0 48), 39774#(<= main_~i~0 49), 39775#(<= main_~i~0 50), 39776#(<= main_~i~0 51), 39777#(<= main_~i~0 52), 39778#(<= main_~i~0 53), 39779#(<= main_~i~0 54), 39780#(<= main_~i~0 55), 39781#(<= main_~i~0 56), 39782#(<= main_~i~0 57), 39783#(<= main_~i~0 58), 39784#(<= main_~i~0 59), 39785#(<= main_~i~0 60), 39786#(<= main_~i~0 61), 39787#(<= main_~i~0 62), 39788#(<= main_~i~0 63), 39789#(<= main_~i~0 64), 39790#(<= main_~i~0 65), 39791#(<= main_~i~0 66), 39792#(<= main_~i~0 67), 39793#(<= main_~i~0 68), 39794#(<= main_~i~0 69), 39795#(<= main_~i~0 70), 39796#(<= main_~i~0 71), 39797#(<= main_~i~0 72)] [2018-04-13 03:27:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:29,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 03:27:29,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 03:27:29,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 03:27:29,104 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 75 states. [2018-04-13 03:27:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:30,097 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2018-04-13 03:27:30,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 03:27:30,097 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 308 [2018-04-13 03:27:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:30,099 INFO L225 Difference]: With dead ends: 674 [2018-04-13 03:27:30,099 INFO L226 Difference]: Without dead ends: 674 [2018-04-13 03:27:30,099 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 03:27:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-13 03:27:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 313. [2018-04-13 03:27:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-13 03:27:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-04-13 03:27:30,102 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 308 [2018-04-13 03:27:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:30,102 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-04-13 03:27:30,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 03:27:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-04-13 03:27:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-13 03:27:30,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:30,103 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:30,103 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 177405051, now seen corresponding path program 72 times [2018-04-13 03:27:30,103 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:30,112 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10667 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:31,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:31,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-13 03:27:31,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:31,253 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-13 03:27:31,253 INFO L182 omatonBuilderFactory]: Interpolants [40832#(<= main_~i~0 45), 40833#(<= main_~i~0 46), 40834#(<= main_~i~0 47), 40835#(<= main_~i~0 48), 40836#(<= main_~i~0 49), 40837#(<= main_~i~0 50), 40838#(<= main_~i~0 51), 40839#(<= main_~i~0 52), 40840#(<= main_~i~0 53), 40841#(<= main_~i~0 54), 40842#(<= main_~i~0 55), 40843#(<= main_~i~0 56), 40844#(<= main_~i~0 57), 40845#(<= main_~i~0 58), 40846#(<= main_~i~0 59), 40847#(<= main_~i~0 60), 40848#(<= main_~i~0 61), 40849#(<= main_~i~0 62), 40850#(<= main_~i~0 63), 40851#(<= main_~i~0 64), 40852#(<= main_~i~0 65), 40853#(<= main_~i~0 66), 40854#(<= main_~i~0 67), 40855#(<= main_~i~0 68), 40856#(<= main_~i~0 69), 40857#(<= main_~i~0 70), 40858#(<= main_~i~0 71), 40859#(<= main_~i~0 72), 40860#(<= main_~i~0 73), 40785#true, 40786#false, 40787#(<= main_~i~0 0), 40788#(<= main_~i~0 1), 40789#(<= main_~i~0 2), 40790#(<= main_~i~0 3), 40791#(<= main_~i~0 4), 40792#(<= main_~i~0 5), 40793#(<= main_~i~0 6), 40794#(<= main_~i~0 7), 40795#(<= main_~i~0 8), 40796#(<= main_~i~0 9), 40797#(<= main_~i~0 10), 40798#(<= main_~i~0 11), 40799#(<= main_~i~0 12), 40800#(<= main_~i~0 13), 40801#(<= main_~i~0 14), 40802#(<= main_~i~0 15), 40803#(<= main_~i~0 16), 40804#(<= main_~i~0 17), 40805#(<= main_~i~0 18), 40806#(<= main_~i~0 19), 40807#(<= main_~i~0 20), 40808#(<= main_~i~0 21), 40809#(<= main_~i~0 22), 40810#(<= main_~i~0 23), 40811#(<= main_~i~0 24), 40812#(<= main_~i~0 25), 40813#(<= main_~i~0 26), 40814#(<= main_~i~0 27), 40815#(<= main_~i~0 28), 40816#(<= main_~i~0 29), 40817#(<= main_~i~0 30), 40818#(<= main_~i~0 31), 40819#(<= main_~i~0 32), 40820#(<= main_~i~0 33), 40821#(<= main_~i~0 34), 40822#(<= main_~i~0 35), 40823#(<= main_~i~0 36), 40824#(<= main_~i~0 37), 40825#(<= main_~i~0 38), 40826#(<= main_~i~0 39), 40827#(<= main_~i~0 40), 40828#(<= main_~i~0 41), 40829#(<= main_~i~0 42), 40830#(<= main_~i~0 43), 40831#(<= main_~i~0 44)] [2018-04-13 03:27:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10667 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:31,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 03:27:31,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 03:27:31,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:27:31,254 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 76 states. [2018-04-13 03:27:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:32,091 INFO L93 Difference]: Finished difference Result 683 states and 755 transitions. [2018-04-13 03:27:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 03:27:32,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 312 [2018-04-13 03:27:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:32,093 INFO L225 Difference]: With dead ends: 683 [2018-04-13 03:27:32,093 INFO L226 Difference]: Without dead ends: 683 [2018-04-13 03:27:32,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:27:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-13 03:27:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 317. [2018-04-13 03:27:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-13 03:27:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-04-13 03:27:32,095 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 312 [2018-04-13 03:27:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:32,096 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-04-13 03:27:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 03:27:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-04-13 03:27:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-13 03:27:32,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:32,097 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:32,097 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 759186036, now seen corresponding path program 73 times [2018-04-13 03:27:32,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:32,107 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10961 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:33,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:33,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-13 03:27:33,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:33,348 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-13 03:27:33,348 INFO L182 omatonBuilderFactory]: Interpolants [41861#true, 41862#false, 41863#(<= main_~i~0 0), 41864#(<= main_~i~0 1), 41865#(<= main_~i~0 2), 41866#(<= main_~i~0 3), 41867#(<= main_~i~0 4), 41868#(<= main_~i~0 5), 41869#(<= main_~i~0 6), 41870#(<= main_~i~0 7), 41871#(<= main_~i~0 8), 41872#(<= main_~i~0 9), 41873#(<= main_~i~0 10), 41874#(<= main_~i~0 11), 41875#(<= main_~i~0 12), 41876#(<= main_~i~0 13), 41877#(<= main_~i~0 14), 41878#(<= main_~i~0 15), 41879#(<= main_~i~0 16), 41880#(<= main_~i~0 17), 41881#(<= main_~i~0 18), 41882#(<= main_~i~0 19), 41883#(<= main_~i~0 20), 41884#(<= main_~i~0 21), 41885#(<= main_~i~0 22), 41886#(<= main_~i~0 23), 41887#(<= main_~i~0 24), 41888#(<= main_~i~0 25), 41889#(<= main_~i~0 26), 41890#(<= main_~i~0 27), 41891#(<= main_~i~0 28), 41892#(<= main_~i~0 29), 41893#(<= main_~i~0 30), 41894#(<= main_~i~0 31), 41895#(<= main_~i~0 32), 41896#(<= main_~i~0 33), 41897#(<= main_~i~0 34), 41898#(<= main_~i~0 35), 41899#(<= main_~i~0 36), 41900#(<= main_~i~0 37), 41901#(<= main_~i~0 38), 41902#(<= main_~i~0 39), 41903#(<= main_~i~0 40), 41904#(<= main_~i~0 41), 41905#(<= main_~i~0 42), 41906#(<= main_~i~0 43), 41907#(<= main_~i~0 44), 41908#(<= main_~i~0 45), 41909#(<= main_~i~0 46), 41910#(<= main_~i~0 47), 41911#(<= main_~i~0 48), 41912#(<= main_~i~0 49), 41913#(<= main_~i~0 50), 41914#(<= main_~i~0 51), 41915#(<= main_~i~0 52), 41916#(<= main_~i~0 53), 41917#(<= main_~i~0 54), 41918#(<= main_~i~0 55), 41919#(<= main_~i~0 56), 41920#(<= main_~i~0 57), 41921#(<= main_~i~0 58), 41922#(<= main_~i~0 59), 41923#(<= main_~i~0 60), 41924#(<= main_~i~0 61), 41925#(<= main_~i~0 62), 41926#(<= main_~i~0 63), 41927#(<= main_~i~0 64), 41928#(<= main_~i~0 65), 41929#(<= main_~i~0 66), 41930#(<= main_~i~0 67), 41931#(<= main_~i~0 68), 41932#(<= main_~i~0 69), 41933#(<= main_~i~0 70), 41934#(<= main_~i~0 71), 41935#(<= main_~i~0 72), 41936#(<= main_~i~0 73), 41937#(<= main_~i~0 74)] [2018-04-13 03:27:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10961 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:33,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 03:27:33,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 03:27:33,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 03:27:33,349 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 77 states. [2018-04-13 03:27:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:34,443 INFO L93 Difference]: Finished difference Result 692 states and 765 transitions. [2018-04-13 03:27:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 03:27:34,444 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 316 [2018-04-13 03:27:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:34,445 INFO L225 Difference]: With dead ends: 692 [2018-04-13 03:27:34,445 INFO L226 Difference]: Without dead ends: 692 [2018-04-13 03:27:34,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 03:27:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-04-13 03:27:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 321. [2018-04-13 03:27:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-13 03:27:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-04-13 03:27:34,448 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 316 [2018-04-13 03:27:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:34,448 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-04-13 03:27:34,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 03:27:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-04-13 03:27:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-04-13 03:27:34,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:34,449 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:34,449 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash 192406509, now seen corresponding path program 74 times [2018-04-13 03:27:34,450 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:34,458 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11259 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:35,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:35,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-13 03:27:35,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:35,619 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-13 03:27:35,619 INFO L182 omatonBuilderFactory]: Interpolants [43008#(<= main_~i~0 55), 43009#(<= main_~i~0 56), 43010#(<= main_~i~0 57), 43011#(<= main_~i~0 58), 43012#(<= main_~i~0 59), 43013#(<= main_~i~0 60), 43014#(<= main_~i~0 61), 43015#(<= main_~i~0 62), 43016#(<= main_~i~0 63), 43017#(<= main_~i~0 64), 43018#(<= main_~i~0 65), 43019#(<= main_~i~0 66), 43020#(<= main_~i~0 67), 43021#(<= main_~i~0 68), 43022#(<= main_~i~0 69), 43023#(<= main_~i~0 70), 43024#(<= main_~i~0 71), 43025#(<= main_~i~0 72), 43026#(<= main_~i~0 73), 43027#(<= main_~i~0 74), 43028#(<= main_~i~0 75), 42951#true, 42952#false, 42953#(<= main_~i~0 0), 42954#(<= main_~i~0 1), 42955#(<= main_~i~0 2), 42956#(<= main_~i~0 3), 42957#(<= main_~i~0 4), 42958#(<= main_~i~0 5), 42959#(<= main_~i~0 6), 42960#(<= main_~i~0 7), 42961#(<= main_~i~0 8), 42962#(<= main_~i~0 9), 42963#(<= main_~i~0 10), 42964#(<= main_~i~0 11), 42965#(<= main_~i~0 12), 42966#(<= main_~i~0 13), 42967#(<= main_~i~0 14), 42968#(<= main_~i~0 15), 42969#(<= main_~i~0 16), 42970#(<= main_~i~0 17), 42971#(<= main_~i~0 18), 42972#(<= main_~i~0 19), 42973#(<= main_~i~0 20), 42974#(<= main_~i~0 21), 42975#(<= main_~i~0 22), 42976#(<= main_~i~0 23), 42977#(<= main_~i~0 24), 42978#(<= main_~i~0 25), 42979#(<= main_~i~0 26), 42980#(<= main_~i~0 27), 42981#(<= main_~i~0 28), 42982#(<= main_~i~0 29), 42983#(<= main_~i~0 30), 42984#(<= main_~i~0 31), 42985#(<= main_~i~0 32), 42986#(<= main_~i~0 33), 42987#(<= main_~i~0 34), 42988#(<= main_~i~0 35), 42989#(<= main_~i~0 36), 42990#(<= main_~i~0 37), 42991#(<= main_~i~0 38), 42992#(<= main_~i~0 39), 42993#(<= main_~i~0 40), 42994#(<= main_~i~0 41), 42995#(<= main_~i~0 42), 42996#(<= main_~i~0 43), 42997#(<= main_~i~0 44), 42998#(<= main_~i~0 45), 42999#(<= main_~i~0 46), 43000#(<= main_~i~0 47), 43001#(<= main_~i~0 48), 43002#(<= main_~i~0 49), 43003#(<= main_~i~0 50), 43004#(<= main_~i~0 51), 43005#(<= main_~i~0 52), 43006#(<= main_~i~0 53), 43007#(<= main_~i~0 54)] [2018-04-13 03:27:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11259 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:35,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 03:27:35,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 03:27:35,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 03:27:35,620 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 78 states. [2018-04-13 03:27:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:36,677 INFO L93 Difference]: Finished difference Result 701 states and 775 transitions. [2018-04-13 03:27:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 03:27:36,677 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 320 [2018-04-13 03:27:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:36,678 INFO L225 Difference]: With dead ends: 701 [2018-04-13 03:27:36,678 INFO L226 Difference]: Without dead ends: 701 [2018-04-13 03:27:36,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 03:27:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-13 03:27:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 325. [2018-04-13 03:27:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-13 03:27:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-04-13 03:27:36,681 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 320 [2018-04-13 03:27:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:36,682 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-04-13 03:27:36,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 03:27:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-04-13 03:27:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-13 03:27:36,682 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:36,683 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:36,683 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash -643817242, now seen corresponding path program 75 times [2018-04-13 03:27:36,683 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:36,692 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11561 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:37,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:37,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 03:27:37,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:37,960 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-13 03:27:37,960 INFO L182 omatonBuilderFactory]: Interpolants [44055#true, 44056#false, 44057#(<= main_~i~0 0), 44058#(<= main_~i~0 1), 44059#(<= main_~i~0 2), 44060#(<= main_~i~0 3), 44061#(<= main_~i~0 4), 44062#(<= main_~i~0 5), 44063#(<= main_~i~0 6), 44064#(<= main_~i~0 7), 44065#(<= main_~i~0 8), 44066#(<= main_~i~0 9), 44067#(<= main_~i~0 10), 44068#(<= main_~i~0 11), 44069#(<= main_~i~0 12), 44070#(<= main_~i~0 13), 44071#(<= main_~i~0 14), 44072#(<= main_~i~0 15), 44073#(<= main_~i~0 16), 44074#(<= main_~i~0 17), 44075#(<= main_~i~0 18), 44076#(<= main_~i~0 19), 44077#(<= main_~i~0 20), 44078#(<= main_~i~0 21), 44079#(<= main_~i~0 22), 44080#(<= main_~i~0 23), 44081#(<= main_~i~0 24), 44082#(<= main_~i~0 25), 44083#(<= main_~i~0 26), 44084#(<= main_~i~0 27), 44085#(<= main_~i~0 28), 44086#(<= main_~i~0 29), 44087#(<= main_~i~0 30), 44088#(<= main_~i~0 31), 44089#(<= main_~i~0 32), 44090#(<= main_~i~0 33), 44091#(<= main_~i~0 34), 44092#(<= main_~i~0 35), 44093#(<= main_~i~0 36), 44094#(<= main_~i~0 37), 44095#(<= main_~i~0 38), 44096#(<= main_~i~0 39), 44097#(<= main_~i~0 40), 44098#(<= main_~i~0 41), 44099#(<= main_~i~0 42), 44100#(<= main_~i~0 43), 44101#(<= main_~i~0 44), 44102#(<= main_~i~0 45), 44103#(<= main_~i~0 46), 44104#(<= main_~i~0 47), 44105#(<= main_~i~0 48), 44106#(<= main_~i~0 49), 44107#(<= main_~i~0 50), 44108#(<= main_~i~0 51), 44109#(<= main_~i~0 52), 44110#(<= main_~i~0 53), 44111#(<= main_~i~0 54), 44112#(<= main_~i~0 55), 44113#(<= main_~i~0 56), 44114#(<= main_~i~0 57), 44115#(<= main_~i~0 58), 44116#(<= main_~i~0 59), 44117#(<= main_~i~0 60), 44118#(<= main_~i~0 61), 44119#(<= main_~i~0 62), 44120#(<= main_~i~0 63), 44121#(<= main_~i~0 64), 44122#(<= main_~i~0 65), 44123#(<= main_~i~0 66), 44124#(<= main_~i~0 67), 44125#(<= main_~i~0 68), 44126#(<= main_~i~0 69), 44127#(<= main_~i~0 70), 44128#(<= main_~i~0 71), 44129#(<= main_~i~0 72), 44130#(<= main_~i~0 73), 44131#(<= main_~i~0 74), 44132#(<= main_~i~0 75), 44133#(<= main_~i~0 76)] [2018-04-13 03:27:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11561 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:37,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 03:27:37,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 03:27:37,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:27:37,962 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 79 states. [2018-04-13 03:27:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:39,207 INFO L93 Difference]: Finished difference Result 710 states and 785 transitions. [2018-04-13 03:27:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 03:27:39,207 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 324 [2018-04-13 03:27:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:39,208 INFO L225 Difference]: With dead ends: 710 [2018-04-13 03:27:39,208 INFO L226 Difference]: Without dead ends: 710 [2018-04-13 03:27:39,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 03:27:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-13 03:27:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 329. [2018-04-13 03:27:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-13 03:27:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-04-13 03:27:39,211 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-04-13 03:27:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:39,211 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-04-13 03:27:39,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 03:27:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-04-13 03:27:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-04-13 03:27:39,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:39,212 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:39,212 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1359005345, now seen corresponding path program 76 times [2018-04-13 03:27:39,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:39,222 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11867 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:40,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:40,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-13 03:27:40,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:40,487 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-13 03:27:40,487 INFO L182 omatonBuilderFactory]: Interpolants [45184#(<= main_~i~0 9), 45185#(<= main_~i~0 10), 45186#(<= main_~i~0 11), 45187#(<= main_~i~0 12), 45188#(<= main_~i~0 13), 45189#(<= main_~i~0 14), 45190#(<= main_~i~0 15), 45191#(<= main_~i~0 16), 45192#(<= main_~i~0 17), 45193#(<= main_~i~0 18), 45194#(<= main_~i~0 19), 45195#(<= main_~i~0 20), 45196#(<= main_~i~0 21), 45197#(<= main_~i~0 22), 45198#(<= main_~i~0 23), 45199#(<= main_~i~0 24), 45200#(<= main_~i~0 25), 45201#(<= main_~i~0 26), 45202#(<= main_~i~0 27), 45203#(<= main_~i~0 28), 45204#(<= main_~i~0 29), 45205#(<= main_~i~0 30), 45206#(<= main_~i~0 31), 45207#(<= main_~i~0 32), 45208#(<= main_~i~0 33), 45209#(<= main_~i~0 34), 45210#(<= main_~i~0 35), 45211#(<= main_~i~0 36), 45212#(<= main_~i~0 37), 45213#(<= main_~i~0 38), 45214#(<= main_~i~0 39), 45215#(<= main_~i~0 40), 45216#(<= main_~i~0 41), 45217#(<= main_~i~0 42), 45218#(<= main_~i~0 43), 45219#(<= main_~i~0 44), 45220#(<= main_~i~0 45), 45221#(<= main_~i~0 46), 45222#(<= main_~i~0 47), 45223#(<= main_~i~0 48), 45224#(<= main_~i~0 49), 45225#(<= main_~i~0 50), 45226#(<= main_~i~0 51), 45227#(<= main_~i~0 52), 45228#(<= main_~i~0 53), 45229#(<= main_~i~0 54), 45230#(<= main_~i~0 55), 45231#(<= main_~i~0 56), 45232#(<= main_~i~0 57), 45233#(<= main_~i~0 58), 45234#(<= main_~i~0 59), 45235#(<= main_~i~0 60), 45236#(<= main_~i~0 61), 45237#(<= main_~i~0 62), 45238#(<= main_~i~0 63), 45239#(<= main_~i~0 64), 45240#(<= main_~i~0 65), 45241#(<= main_~i~0 66), 45242#(<= main_~i~0 67), 45243#(<= main_~i~0 68), 45244#(<= main_~i~0 69), 45245#(<= main_~i~0 70), 45246#(<= main_~i~0 71), 45247#(<= main_~i~0 72), 45248#(<= main_~i~0 73), 45249#(<= main_~i~0 74), 45250#(<= main_~i~0 75), 45251#(<= main_~i~0 76), 45252#(<= main_~i~0 77), 45173#true, 45174#false, 45175#(<= main_~i~0 0), 45176#(<= main_~i~0 1), 45177#(<= main_~i~0 2), 45178#(<= main_~i~0 3), 45179#(<= main_~i~0 4), 45180#(<= main_~i~0 5), 45181#(<= main_~i~0 6), 45182#(<= main_~i~0 7), 45183#(<= main_~i~0 8)] [2018-04-13 03:27:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11867 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:40,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 03:27:40,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 03:27:40,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 03:27:40,489 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 80 states. [2018-04-13 03:27:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:41,721 INFO L93 Difference]: Finished difference Result 719 states and 795 transitions. [2018-04-13 03:27:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 03:27:41,721 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 328 [2018-04-13 03:27:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:41,723 INFO L225 Difference]: With dead ends: 719 [2018-04-13 03:27:41,723 INFO L226 Difference]: Without dead ends: 719 [2018-04-13 03:27:41,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 03:27:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-13 03:27:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 333. [2018-04-13 03:27:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-13 03:27:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-04-13 03:27:41,727 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 328 [2018-04-13 03:27:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:41,727 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-04-13 03:27:41,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 03:27:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-04-13 03:27:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 03:27:41,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:41,728 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:41,728 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 364604760, now seen corresponding path program 77 times [2018-04-13 03:27:41,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:41,738 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12177 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:43,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:43,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 03:27:43,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:43,038 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-13 03:27:43,039 INFO L182 omatonBuilderFactory]: Interpolants [46336#(<= main_~i~0 29), 46337#(<= main_~i~0 30), 46338#(<= main_~i~0 31), 46339#(<= main_~i~0 32), 46340#(<= main_~i~0 33), 46341#(<= main_~i~0 34), 46342#(<= main_~i~0 35), 46343#(<= main_~i~0 36), 46344#(<= main_~i~0 37), 46345#(<= main_~i~0 38), 46346#(<= main_~i~0 39), 46347#(<= main_~i~0 40), 46348#(<= main_~i~0 41), 46349#(<= main_~i~0 42), 46350#(<= main_~i~0 43), 46351#(<= main_~i~0 44), 46352#(<= main_~i~0 45), 46353#(<= main_~i~0 46), 46354#(<= main_~i~0 47), 46355#(<= main_~i~0 48), 46356#(<= main_~i~0 49), 46357#(<= main_~i~0 50), 46358#(<= main_~i~0 51), 46359#(<= main_~i~0 52), 46360#(<= main_~i~0 53), 46361#(<= main_~i~0 54), 46362#(<= main_~i~0 55), 46363#(<= main_~i~0 56), 46364#(<= main_~i~0 57), 46365#(<= main_~i~0 58), 46366#(<= main_~i~0 59), 46367#(<= main_~i~0 60), 46368#(<= main_~i~0 61), 46369#(<= main_~i~0 62), 46370#(<= main_~i~0 63), 46371#(<= main_~i~0 64), 46372#(<= main_~i~0 65), 46373#(<= main_~i~0 66), 46374#(<= main_~i~0 67), 46375#(<= main_~i~0 68), 46376#(<= main_~i~0 69), 46377#(<= main_~i~0 70), 46378#(<= main_~i~0 71), 46379#(<= main_~i~0 72), 46380#(<= main_~i~0 73), 46381#(<= main_~i~0 74), 46382#(<= main_~i~0 75), 46383#(<= main_~i~0 76), 46384#(<= main_~i~0 77), 46385#(<= main_~i~0 78), 46305#true, 46306#false, 46307#(<= main_~i~0 0), 46308#(<= main_~i~0 1), 46309#(<= main_~i~0 2), 46310#(<= main_~i~0 3), 46311#(<= main_~i~0 4), 46312#(<= main_~i~0 5), 46313#(<= main_~i~0 6), 46314#(<= main_~i~0 7), 46315#(<= main_~i~0 8), 46316#(<= main_~i~0 9), 46317#(<= main_~i~0 10), 46318#(<= main_~i~0 11), 46319#(<= main_~i~0 12), 46320#(<= main_~i~0 13), 46321#(<= main_~i~0 14), 46322#(<= main_~i~0 15), 46323#(<= main_~i~0 16), 46324#(<= main_~i~0 17), 46325#(<= main_~i~0 18), 46326#(<= main_~i~0 19), 46327#(<= main_~i~0 20), 46328#(<= main_~i~0 21), 46329#(<= main_~i~0 22), 46330#(<= main_~i~0 23), 46331#(<= main_~i~0 24), 46332#(<= main_~i~0 25), 46333#(<= main_~i~0 26), 46334#(<= main_~i~0 27), 46335#(<= main_~i~0 28)] [2018-04-13 03:27:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12177 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:43,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 03:27:43,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 03:27:43,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 03:27:43,040 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 81 states. [2018-04-13 03:27:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:44,088 INFO L93 Difference]: Finished difference Result 728 states and 805 transitions. [2018-04-13 03:27:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 03:27:44,088 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 332 [2018-04-13 03:27:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:44,089 INFO L225 Difference]: With dead ends: 728 [2018-04-13 03:27:44,089 INFO L226 Difference]: Without dead ends: 728 [2018-04-13 03:27:44,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 03:27:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-04-13 03:27:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 337. [2018-04-13 03:27:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-13 03:27:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-13 03:27:44,092 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 332 [2018-04-13 03:27:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:44,092 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-13 03:27:44,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 03:27:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-13 03:27:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-04-13 03:27:44,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:44,093 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:44,093 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1696924463, now seen corresponding path program 78 times [2018-04-13 03:27:44,094 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:44,103 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12491 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:45,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:45,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-13 03:27:45,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:45,462 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-13 03:27:45,462 INFO L182 omatonBuilderFactory]: Interpolants [47488#(<= main_~i~0 35), 47489#(<= main_~i~0 36), 47490#(<= main_~i~0 37), 47491#(<= main_~i~0 38), 47492#(<= main_~i~0 39), 47493#(<= main_~i~0 40), 47494#(<= main_~i~0 41), 47495#(<= main_~i~0 42), 47496#(<= main_~i~0 43), 47497#(<= main_~i~0 44), 47498#(<= main_~i~0 45), 47499#(<= main_~i~0 46), 47500#(<= main_~i~0 47), 47501#(<= main_~i~0 48), 47502#(<= main_~i~0 49), 47503#(<= main_~i~0 50), 47504#(<= main_~i~0 51), 47505#(<= main_~i~0 52), 47506#(<= main_~i~0 53), 47507#(<= main_~i~0 54), 47508#(<= main_~i~0 55), 47509#(<= main_~i~0 56), 47510#(<= main_~i~0 57), 47511#(<= main_~i~0 58), 47512#(<= main_~i~0 59), 47513#(<= main_~i~0 60), 47514#(<= main_~i~0 61), 47515#(<= main_~i~0 62), 47516#(<= main_~i~0 63), 47517#(<= main_~i~0 64), 47518#(<= main_~i~0 65), 47519#(<= main_~i~0 66), 47520#(<= main_~i~0 67), 47521#(<= main_~i~0 68), 47522#(<= main_~i~0 69), 47523#(<= main_~i~0 70), 47524#(<= main_~i~0 71), 47525#(<= main_~i~0 72), 47526#(<= main_~i~0 73), 47527#(<= main_~i~0 74), 47528#(<= main_~i~0 75), 47529#(<= main_~i~0 76), 47530#(<= main_~i~0 77), 47531#(<= main_~i~0 78), 47532#(<= main_~i~0 79), 47451#true, 47452#false, 47453#(<= main_~i~0 0), 47454#(<= main_~i~0 1), 47455#(<= main_~i~0 2), 47456#(<= main_~i~0 3), 47457#(<= main_~i~0 4), 47458#(<= main_~i~0 5), 47459#(<= main_~i~0 6), 47460#(<= main_~i~0 7), 47461#(<= main_~i~0 8), 47462#(<= main_~i~0 9), 47463#(<= main_~i~0 10), 47464#(<= main_~i~0 11), 47465#(<= main_~i~0 12), 47466#(<= main_~i~0 13), 47467#(<= main_~i~0 14), 47468#(<= main_~i~0 15), 47469#(<= main_~i~0 16), 47470#(<= main_~i~0 17), 47471#(<= main_~i~0 18), 47472#(<= main_~i~0 19), 47473#(<= main_~i~0 20), 47474#(<= main_~i~0 21), 47475#(<= main_~i~0 22), 47476#(<= main_~i~0 23), 47477#(<= main_~i~0 24), 47478#(<= main_~i~0 25), 47479#(<= main_~i~0 26), 47480#(<= main_~i~0 27), 47481#(<= main_~i~0 28), 47482#(<= main_~i~0 29), 47483#(<= main_~i~0 30), 47484#(<= main_~i~0 31), 47485#(<= main_~i~0 32), 47486#(<= main_~i~0 33), 47487#(<= main_~i~0 34)] [2018-04-13 03:27:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12491 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:45,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 03:27:45,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 03:27:45,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 03:27:45,463 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 82 states. [2018-04-13 03:27:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:46,598 INFO L93 Difference]: Finished difference Result 737 states and 815 transitions. [2018-04-13 03:27:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 03:27:46,599 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 336 [2018-04-13 03:27:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:46,600 INFO L225 Difference]: With dead ends: 737 [2018-04-13 03:27:46,600 INFO L226 Difference]: Without dead ends: 737 [2018-04-13 03:27:46,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 03:27:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-13 03:27:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 341. [2018-04-13 03:27:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-13 03:27:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-04-13 03:27:46,604 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 336 [2018-04-13 03:27:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:46,604 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-04-13 03:27:46,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 03:27:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-04-13 03:27:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-04-13 03:27:46,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:46,605 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:46,605 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1581524938, now seen corresponding path program 79 times [2018-04-13 03:27:46,606 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:46,617 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:48,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:48,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-13 03:27:48,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:48,016 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-13 03:27:48,016 INFO L182 omatonBuilderFactory]: Interpolants [48640#(<= main_~i~0 27), 48641#(<= main_~i~0 28), 48642#(<= main_~i~0 29), 48643#(<= main_~i~0 30), 48644#(<= main_~i~0 31), 48645#(<= main_~i~0 32), 48646#(<= main_~i~0 33), 48647#(<= main_~i~0 34), 48648#(<= main_~i~0 35), 48649#(<= main_~i~0 36), 48650#(<= main_~i~0 37), 48651#(<= main_~i~0 38), 48652#(<= main_~i~0 39), 48653#(<= main_~i~0 40), 48654#(<= main_~i~0 41), 48655#(<= main_~i~0 42), 48656#(<= main_~i~0 43), 48657#(<= main_~i~0 44), 48658#(<= main_~i~0 45), 48659#(<= main_~i~0 46), 48660#(<= main_~i~0 47), 48661#(<= main_~i~0 48), 48662#(<= main_~i~0 49), 48663#(<= main_~i~0 50), 48664#(<= main_~i~0 51), 48665#(<= main_~i~0 52), 48666#(<= main_~i~0 53), 48667#(<= main_~i~0 54), 48668#(<= main_~i~0 55), 48669#(<= main_~i~0 56), 48670#(<= main_~i~0 57), 48671#(<= main_~i~0 58), 48672#(<= main_~i~0 59), 48673#(<= main_~i~0 60), 48674#(<= main_~i~0 61), 48675#(<= main_~i~0 62), 48676#(<= main_~i~0 63), 48677#(<= main_~i~0 64), 48678#(<= main_~i~0 65), 48679#(<= main_~i~0 66), 48680#(<= main_~i~0 67), 48681#(<= main_~i~0 68), 48682#(<= main_~i~0 69), 48683#(<= main_~i~0 70), 48684#(<= main_~i~0 71), 48685#(<= main_~i~0 72), 48686#(<= main_~i~0 73), 48687#(<= main_~i~0 74), 48688#(<= main_~i~0 75), 48689#(<= main_~i~0 76), 48690#(<= main_~i~0 77), 48691#(<= main_~i~0 78), 48692#(<= main_~i~0 79), 48693#(<= main_~i~0 80), 48611#true, 48612#false, 48613#(<= main_~i~0 0), 48614#(<= main_~i~0 1), 48615#(<= main_~i~0 2), 48616#(<= main_~i~0 3), 48617#(<= main_~i~0 4), 48618#(<= main_~i~0 5), 48619#(<= main_~i~0 6), 48620#(<= main_~i~0 7), 48621#(<= main_~i~0 8), 48622#(<= main_~i~0 9), 48623#(<= main_~i~0 10), 48624#(<= main_~i~0 11), 48625#(<= main_~i~0 12), 48626#(<= main_~i~0 13), 48627#(<= main_~i~0 14), 48628#(<= main_~i~0 15), 48629#(<= main_~i~0 16), 48630#(<= main_~i~0 17), 48631#(<= main_~i~0 18), 48632#(<= main_~i~0 19), 48633#(<= main_~i~0 20), 48634#(<= main_~i~0 21), 48635#(<= main_~i~0 22), 48636#(<= main_~i~0 23), 48637#(<= main_~i~0 24), 48638#(<= main_~i~0 25), 48639#(<= main_~i~0 26)] [2018-04-13 03:27:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12809 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:48,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 03:27:48,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 03:27:48,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 03:27:48,018 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 83 states. [2018-04-13 03:27:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:49,224 INFO L93 Difference]: Finished difference Result 746 states and 825 transitions. [2018-04-13 03:27:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 03:27:49,225 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 340 [2018-04-13 03:27:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:49,226 INFO L225 Difference]: With dead ends: 746 [2018-04-13 03:27:49,226 INFO L226 Difference]: Without dead ends: 746 [2018-04-13 03:27:49,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 03:27:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-04-13 03:27:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 345. [2018-04-13 03:27:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-13 03:27:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-04-13 03:27:49,229 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 340 [2018-04-13 03:27:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:49,229 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-04-13 03:27:49,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 03:27:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-04-13 03:27:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-04-13 03:27:49,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:49,230 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:49,231 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:49,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1564660157, now seen corresponding path program 80 times [2018-04-13 03:27:49,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:49,241 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13131 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:50,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:50,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-13 03:27:50,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:50,748 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-13 03:27:50,748 INFO L182 omatonBuilderFactory]: Interpolants [49792#(<= main_~i~0 5), 49793#(<= main_~i~0 6), 49794#(<= main_~i~0 7), 49795#(<= main_~i~0 8), 49796#(<= main_~i~0 9), 49797#(<= main_~i~0 10), 49798#(<= main_~i~0 11), 49799#(<= main_~i~0 12), 49800#(<= main_~i~0 13), 49801#(<= main_~i~0 14), 49802#(<= main_~i~0 15), 49803#(<= main_~i~0 16), 49804#(<= main_~i~0 17), 49805#(<= main_~i~0 18), 49806#(<= main_~i~0 19), 49807#(<= main_~i~0 20), 49808#(<= main_~i~0 21), 49809#(<= main_~i~0 22), 49810#(<= main_~i~0 23), 49811#(<= main_~i~0 24), 49812#(<= main_~i~0 25), 49813#(<= main_~i~0 26), 49814#(<= main_~i~0 27), 49815#(<= main_~i~0 28), 49816#(<= main_~i~0 29), 49817#(<= main_~i~0 30), 49818#(<= main_~i~0 31), 49819#(<= main_~i~0 32), 49820#(<= main_~i~0 33), 49821#(<= main_~i~0 34), 49822#(<= main_~i~0 35), 49823#(<= main_~i~0 36), 49824#(<= main_~i~0 37), 49825#(<= main_~i~0 38), 49826#(<= main_~i~0 39), 49827#(<= main_~i~0 40), 49828#(<= main_~i~0 41), 49829#(<= main_~i~0 42), 49830#(<= main_~i~0 43), 49831#(<= main_~i~0 44), 49832#(<= main_~i~0 45), 49833#(<= main_~i~0 46), 49834#(<= main_~i~0 47), 49835#(<= main_~i~0 48), 49836#(<= main_~i~0 49), 49837#(<= main_~i~0 50), 49838#(<= main_~i~0 51), 49839#(<= main_~i~0 52), 49840#(<= main_~i~0 53), 49841#(<= main_~i~0 54), 49842#(<= main_~i~0 55), 49843#(<= main_~i~0 56), 49844#(<= main_~i~0 57), 49845#(<= main_~i~0 58), 49846#(<= main_~i~0 59), 49847#(<= main_~i~0 60), 49848#(<= main_~i~0 61), 49849#(<= main_~i~0 62), 49850#(<= main_~i~0 63), 49851#(<= main_~i~0 64), 49852#(<= main_~i~0 65), 49853#(<= main_~i~0 66), 49854#(<= main_~i~0 67), 49855#(<= main_~i~0 68), 49856#(<= main_~i~0 69), 49857#(<= main_~i~0 70), 49858#(<= main_~i~0 71), 49859#(<= main_~i~0 72), 49860#(<= main_~i~0 73), 49861#(<= main_~i~0 74), 49862#(<= main_~i~0 75), 49863#(<= main_~i~0 76), 49864#(<= main_~i~0 77), 49865#(<= main_~i~0 78), 49866#(<= main_~i~0 79), 49867#(<= main_~i~0 80), 49868#(<= main_~i~0 81), 49785#true, 49786#false, 49787#(<= main_~i~0 0), 49788#(<= main_~i~0 1), 49789#(<= main_~i~0 2), 49790#(<= main_~i~0 3), 49791#(<= main_~i~0 4)] [2018-04-13 03:27:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13131 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:50,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 03:27:50,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 03:27:50,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 03:27:50,750 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 84 states. [2018-04-13 03:27:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:52,203 INFO L93 Difference]: Finished difference Result 755 states and 835 transitions. [2018-04-13 03:27:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 03:27:52,203 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 344 [2018-04-13 03:27:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:52,204 INFO L225 Difference]: With dead ends: 755 [2018-04-13 03:27:52,204 INFO L226 Difference]: Without dead ends: 755 [2018-04-13 03:27:52,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 03:27:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-04-13 03:27:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 349. [2018-04-13 03:27:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-13 03:27:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-04-13 03:27:52,207 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 344 [2018-04-13 03:27:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:52,207 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-04-13 03:27:52,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 03:27:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-04-13 03:27:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-04-13 03:27:52,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:52,208 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:52,208 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1575768124, now seen corresponding path program 81 times [2018-04-13 03:27:52,208 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:52,217 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13457 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:53,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:53,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-13 03:27:53,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:53,626 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-13 03:27:53,626 INFO L182 omatonBuilderFactory]: Interpolants [50973#true, 50974#false, 50975#(<= main_~i~0 0), 50976#(<= main_~i~0 1), 50977#(<= main_~i~0 2), 50978#(<= main_~i~0 3), 50979#(<= main_~i~0 4), 50980#(<= main_~i~0 5), 50981#(<= main_~i~0 6), 50982#(<= main_~i~0 7), 50983#(<= main_~i~0 8), 50984#(<= main_~i~0 9), 50985#(<= main_~i~0 10), 50986#(<= main_~i~0 11), 50987#(<= main_~i~0 12), 50988#(<= main_~i~0 13), 50989#(<= main_~i~0 14), 50990#(<= main_~i~0 15), 50991#(<= main_~i~0 16), 50992#(<= main_~i~0 17), 50993#(<= main_~i~0 18), 50994#(<= main_~i~0 19), 50995#(<= main_~i~0 20), 50996#(<= main_~i~0 21), 50997#(<= main_~i~0 22), 50998#(<= main_~i~0 23), 50999#(<= main_~i~0 24), 51000#(<= main_~i~0 25), 51001#(<= main_~i~0 26), 51002#(<= main_~i~0 27), 51003#(<= main_~i~0 28), 51004#(<= main_~i~0 29), 51005#(<= main_~i~0 30), 51006#(<= main_~i~0 31), 51007#(<= main_~i~0 32), 51008#(<= main_~i~0 33), 51009#(<= main_~i~0 34), 51010#(<= main_~i~0 35), 51011#(<= main_~i~0 36), 51012#(<= main_~i~0 37), 51013#(<= main_~i~0 38), 51014#(<= main_~i~0 39), 51015#(<= main_~i~0 40), 51016#(<= main_~i~0 41), 51017#(<= main_~i~0 42), 51018#(<= main_~i~0 43), 51019#(<= main_~i~0 44), 51020#(<= main_~i~0 45), 51021#(<= main_~i~0 46), 51022#(<= main_~i~0 47), 51023#(<= main_~i~0 48), 51024#(<= main_~i~0 49), 51025#(<= main_~i~0 50), 51026#(<= main_~i~0 51), 51027#(<= main_~i~0 52), 51028#(<= main_~i~0 53), 51029#(<= main_~i~0 54), 51030#(<= main_~i~0 55), 51031#(<= main_~i~0 56), 51032#(<= main_~i~0 57), 51033#(<= main_~i~0 58), 51034#(<= main_~i~0 59), 51035#(<= main_~i~0 60), 51036#(<= main_~i~0 61), 51037#(<= main_~i~0 62), 51038#(<= main_~i~0 63), 51039#(<= main_~i~0 64), 51040#(<= main_~i~0 65), 51041#(<= main_~i~0 66), 51042#(<= main_~i~0 67), 51043#(<= main_~i~0 68), 51044#(<= main_~i~0 69), 51045#(<= main_~i~0 70), 51046#(<= main_~i~0 71), 51047#(<= main_~i~0 72), 51048#(<= main_~i~0 73), 51049#(<= main_~i~0 74), 51050#(<= main_~i~0 75), 51051#(<= main_~i~0 76), 51052#(<= main_~i~0 77), 51053#(<= main_~i~0 78), 51054#(<= main_~i~0 79), 51055#(<= main_~i~0 80), 51056#(<= main_~i~0 81), 51057#(<= main_~i~0 82)] [2018-04-13 03:27:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13457 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 03:27:53,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 03:27:53,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 03:27:53,627 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 85 states. [2018-04-13 03:27:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:55,205 INFO L93 Difference]: Finished difference Result 764 states and 845 transitions. [2018-04-13 03:27:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 03:27:55,206 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 348 [2018-04-13 03:27:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:55,206 INFO L225 Difference]: With dead ends: 764 [2018-04-13 03:27:55,206 INFO L226 Difference]: Without dead ends: 764 [2018-04-13 03:27:55,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 03:27:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-13 03:27:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 353. [2018-04-13 03:27:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-13 03:27:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-04-13 03:27:55,209 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 348 [2018-04-13 03:27:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:55,209 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-04-13 03:27:55,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 03:27:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-04-13 03:27:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-13 03:27:55,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:55,210 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:55,210 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash -933769803, now seen corresponding path program 82 times [2018-04-13 03:27:55,211 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:55,220 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13787 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:56,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:56,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-13 03:27:56,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:56,651 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-13 03:27:56,651 INFO L182 omatonBuilderFactory]: Interpolants [52224#(<= main_~i~0 47), 52225#(<= main_~i~0 48), 52226#(<= main_~i~0 49), 52227#(<= main_~i~0 50), 52228#(<= main_~i~0 51), 52229#(<= main_~i~0 52), 52230#(<= main_~i~0 53), 52231#(<= main_~i~0 54), 52232#(<= main_~i~0 55), 52233#(<= main_~i~0 56), 52234#(<= main_~i~0 57), 52235#(<= main_~i~0 58), 52236#(<= main_~i~0 59), 52237#(<= main_~i~0 60), 52238#(<= main_~i~0 61), 52239#(<= main_~i~0 62), 52240#(<= main_~i~0 63), 52241#(<= main_~i~0 64), 52242#(<= main_~i~0 65), 52243#(<= main_~i~0 66), 52244#(<= main_~i~0 67), 52245#(<= main_~i~0 68), 52246#(<= main_~i~0 69), 52247#(<= main_~i~0 70), 52248#(<= main_~i~0 71), 52249#(<= main_~i~0 72), 52250#(<= main_~i~0 73), 52251#(<= main_~i~0 74), 52252#(<= main_~i~0 75), 52253#(<= main_~i~0 76), 52254#(<= main_~i~0 77), 52255#(<= main_~i~0 78), 52256#(<= main_~i~0 79), 52257#(<= main_~i~0 80), 52258#(<= main_~i~0 81), 52259#(<= main_~i~0 82), 52260#(<= main_~i~0 83), 52175#true, 52176#false, 52177#(<= main_~i~0 0), 52178#(<= main_~i~0 1), 52179#(<= main_~i~0 2), 52180#(<= main_~i~0 3), 52181#(<= main_~i~0 4), 52182#(<= main_~i~0 5), 52183#(<= main_~i~0 6), 52184#(<= main_~i~0 7), 52185#(<= main_~i~0 8), 52186#(<= main_~i~0 9), 52187#(<= main_~i~0 10), 52188#(<= main_~i~0 11), 52189#(<= main_~i~0 12), 52190#(<= main_~i~0 13), 52191#(<= main_~i~0 14), 52192#(<= main_~i~0 15), 52193#(<= main_~i~0 16), 52194#(<= main_~i~0 17), 52195#(<= main_~i~0 18), 52196#(<= main_~i~0 19), 52197#(<= main_~i~0 20), 52198#(<= main_~i~0 21), 52199#(<= main_~i~0 22), 52200#(<= main_~i~0 23), 52201#(<= main_~i~0 24), 52202#(<= main_~i~0 25), 52203#(<= main_~i~0 26), 52204#(<= main_~i~0 27), 52205#(<= main_~i~0 28), 52206#(<= main_~i~0 29), 52207#(<= main_~i~0 30), 52208#(<= main_~i~0 31), 52209#(<= main_~i~0 32), 52210#(<= main_~i~0 33), 52211#(<= main_~i~0 34), 52212#(<= main_~i~0 35), 52213#(<= main_~i~0 36), 52214#(<= main_~i~0 37), 52215#(<= main_~i~0 38), 52216#(<= main_~i~0 39), 52217#(<= main_~i~0 40), 52218#(<= main_~i~0 41), 52219#(<= main_~i~0 42), 52220#(<= main_~i~0 43), 52221#(<= main_~i~0 44), 52222#(<= main_~i~0 45), 52223#(<= main_~i~0 46)] [2018-04-13 03:27:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13787 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:56,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 03:27:56,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 03:27:56,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 03:27:56,653 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 86 states. [2018-04-13 03:27:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:27:57,985 INFO L93 Difference]: Finished difference Result 773 states and 855 transitions. [2018-04-13 03:27:57,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 03:27:57,986 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 352 [2018-04-13 03:27:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:27:57,987 INFO L225 Difference]: With dead ends: 773 [2018-04-13 03:27:57,987 INFO L226 Difference]: Without dead ends: 773 [2018-04-13 03:27:57,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 03:27:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-13 03:27:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 357. [2018-04-13 03:27:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-13 03:27:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-04-13 03:27:57,990 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 352 [2018-04-13 03:27:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:27:57,990 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-04-13 03:27:57,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 03:27:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-04-13 03:27:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-04-13 03:27:57,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:27:57,991 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:27:57,991 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:27:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -312088914, now seen corresponding path program 83 times [2018-04-13 03:27:57,992 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:27:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:27:58,001 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:27:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14121 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:59,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:27:59,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 03:27:59,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:27:59,495 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-13 03:27:59,495 INFO L182 omatonBuilderFactory]: Interpolants [53391#true, 53392#false, 53393#(<= main_~i~0 0), 53394#(<= main_~i~0 1), 53395#(<= main_~i~0 2), 53396#(<= main_~i~0 3), 53397#(<= main_~i~0 4), 53398#(<= main_~i~0 5), 53399#(<= main_~i~0 6), 53400#(<= main_~i~0 7), 53401#(<= main_~i~0 8), 53402#(<= main_~i~0 9), 53403#(<= main_~i~0 10), 53404#(<= main_~i~0 11), 53405#(<= main_~i~0 12), 53406#(<= main_~i~0 13), 53407#(<= main_~i~0 14), 53408#(<= main_~i~0 15), 53409#(<= main_~i~0 16), 53410#(<= main_~i~0 17), 53411#(<= main_~i~0 18), 53412#(<= main_~i~0 19), 53413#(<= main_~i~0 20), 53414#(<= main_~i~0 21), 53415#(<= main_~i~0 22), 53416#(<= main_~i~0 23), 53417#(<= main_~i~0 24), 53418#(<= main_~i~0 25), 53419#(<= main_~i~0 26), 53420#(<= main_~i~0 27), 53421#(<= main_~i~0 28), 53422#(<= main_~i~0 29), 53423#(<= main_~i~0 30), 53424#(<= main_~i~0 31), 53425#(<= main_~i~0 32), 53426#(<= main_~i~0 33), 53427#(<= main_~i~0 34), 53428#(<= main_~i~0 35), 53429#(<= main_~i~0 36), 53430#(<= main_~i~0 37), 53431#(<= main_~i~0 38), 53432#(<= main_~i~0 39), 53433#(<= main_~i~0 40), 53434#(<= main_~i~0 41), 53435#(<= main_~i~0 42), 53436#(<= main_~i~0 43), 53437#(<= main_~i~0 44), 53438#(<= main_~i~0 45), 53439#(<= main_~i~0 46), 53440#(<= main_~i~0 47), 53441#(<= main_~i~0 48), 53442#(<= main_~i~0 49), 53443#(<= main_~i~0 50), 53444#(<= main_~i~0 51), 53445#(<= main_~i~0 52), 53446#(<= main_~i~0 53), 53447#(<= main_~i~0 54), 53448#(<= main_~i~0 55), 53449#(<= main_~i~0 56), 53450#(<= main_~i~0 57), 53451#(<= main_~i~0 58), 53452#(<= main_~i~0 59), 53453#(<= main_~i~0 60), 53454#(<= main_~i~0 61), 53455#(<= main_~i~0 62), 53456#(<= main_~i~0 63), 53457#(<= main_~i~0 64), 53458#(<= main_~i~0 65), 53459#(<= main_~i~0 66), 53460#(<= main_~i~0 67), 53461#(<= main_~i~0 68), 53462#(<= main_~i~0 69), 53463#(<= main_~i~0 70), 53464#(<= main_~i~0 71), 53465#(<= main_~i~0 72), 53466#(<= main_~i~0 73), 53467#(<= main_~i~0 74), 53468#(<= main_~i~0 75), 53469#(<= main_~i~0 76), 53470#(<= main_~i~0 77), 53471#(<= main_~i~0 78), 53472#(<= main_~i~0 79), 53473#(<= main_~i~0 80), 53474#(<= main_~i~0 81), 53475#(<= main_~i~0 82), 53476#(<= main_~i~0 83), 53477#(<= main_~i~0 84)] [2018-04-13 03:27:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14121 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:27:59,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 03:27:59,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 03:27:59,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 03:27:59,497 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 87 states. [2018-04-13 03:28:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:01,234 INFO L93 Difference]: Finished difference Result 782 states and 865 transitions. [2018-04-13 03:28:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 03:28:01,235 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 356 [2018-04-13 03:28:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:01,236 INFO L225 Difference]: With dead ends: 782 [2018-04-13 03:28:01,236 INFO L226 Difference]: Without dead ends: 782 [2018-04-13 03:28:01,236 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 03:28:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-13 03:28:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 361. [2018-04-13 03:28:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-13 03:28:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-04-13 03:28:01,239 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 356 [2018-04-13 03:28:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:01,240 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-04-13 03:28:01,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 03:28:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-04-13 03:28:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-04-13 03:28:01,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:01,241 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:01,241 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash 995941159, now seen corresponding path program 84 times [2018-04-13 03:28:01,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:01,252 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14459 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:03,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:03,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-13 03:28:03,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:03,081 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-13 03:28:03,081 INFO L182 omatonBuilderFactory]: Interpolants [54656#(<= main_~i~0 33), 54657#(<= main_~i~0 34), 54658#(<= main_~i~0 35), 54659#(<= main_~i~0 36), 54660#(<= main_~i~0 37), 54661#(<= main_~i~0 38), 54662#(<= main_~i~0 39), 54663#(<= main_~i~0 40), 54664#(<= main_~i~0 41), 54665#(<= main_~i~0 42), 54666#(<= main_~i~0 43), 54667#(<= main_~i~0 44), 54668#(<= main_~i~0 45), 54669#(<= main_~i~0 46), 54670#(<= main_~i~0 47), 54671#(<= main_~i~0 48), 54672#(<= main_~i~0 49), 54673#(<= main_~i~0 50), 54674#(<= main_~i~0 51), 54675#(<= main_~i~0 52), 54676#(<= main_~i~0 53), 54677#(<= main_~i~0 54), 54678#(<= main_~i~0 55), 54679#(<= main_~i~0 56), 54680#(<= main_~i~0 57), 54681#(<= main_~i~0 58), 54682#(<= main_~i~0 59), 54683#(<= main_~i~0 60), 54684#(<= main_~i~0 61), 54685#(<= main_~i~0 62), 54686#(<= main_~i~0 63), 54687#(<= main_~i~0 64), 54688#(<= main_~i~0 65), 54689#(<= main_~i~0 66), 54690#(<= main_~i~0 67), 54691#(<= main_~i~0 68), 54692#(<= main_~i~0 69), 54693#(<= main_~i~0 70), 54694#(<= main_~i~0 71), 54695#(<= main_~i~0 72), 54696#(<= main_~i~0 73), 54697#(<= main_~i~0 74), 54698#(<= main_~i~0 75), 54699#(<= main_~i~0 76), 54700#(<= main_~i~0 77), 54701#(<= main_~i~0 78), 54702#(<= main_~i~0 79), 54703#(<= main_~i~0 80), 54704#(<= main_~i~0 81), 54705#(<= main_~i~0 82), 54706#(<= main_~i~0 83), 54707#(<= main_~i~0 84), 54708#(<= main_~i~0 85), 54621#true, 54622#false, 54623#(<= main_~i~0 0), 54624#(<= main_~i~0 1), 54625#(<= main_~i~0 2), 54626#(<= main_~i~0 3), 54627#(<= main_~i~0 4), 54628#(<= main_~i~0 5), 54629#(<= main_~i~0 6), 54630#(<= main_~i~0 7), 54631#(<= main_~i~0 8), 54632#(<= main_~i~0 9), 54633#(<= main_~i~0 10), 54634#(<= main_~i~0 11), 54635#(<= main_~i~0 12), 54636#(<= main_~i~0 13), 54637#(<= main_~i~0 14), 54638#(<= main_~i~0 15), 54639#(<= main_~i~0 16), 54640#(<= main_~i~0 17), 54641#(<= main_~i~0 18), 54642#(<= main_~i~0 19), 54643#(<= main_~i~0 20), 54644#(<= main_~i~0 21), 54645#(<= main_~i~0 22), 54646#(<= main_~i~0 23), 54647#(<= main_~i~0 24), 54648#(<= main_~i~0 25), 54649#(<= main_~i~0 26), 54650#(<= main_~i~0 27), 54651#(<= main_~i~0 28), 54652#(<= main_~i~0 29), 54653#(<= main_~i~0 30), 54654#(<= main_~i~0 31), 54655#(<= main_~i~0 32)] [2018-04-13 03:28:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14459 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:03,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 03:28:03,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 03:28:03,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 03:28:03,082 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 88 states. [2018-04-13 03:28:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:04,328 INFO L93 Difference]: Finished difference Result 791 states and 875 transitions. [2018-04-13 03:28:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 03:28:04,328 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 360 [2018-04-13 03:28:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:04,329 INFO L225 Difference]: With dead ends: 791 [2018-04-13 03:28:04,329 INFO L226 Difference]: Without dead ends: 791 [2018-04-13 03:28:04,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 03:28:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-04-13 03:28:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 365. [2018-04-13 03:28:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-13 03:28:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-04-13 03:28:04,332 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 360 [2018-04-13 03:28:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:04,332 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-04-13 03:28:04,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 03:28:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-04-13 03:28:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-13 03:28:04,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:04,333 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:04,333 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 325249824, now seen corresponding path program 85 times [2018-04-13 03:28:04,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:04,343 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14801 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:05,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:05,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-13 03:28:05,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:05,845 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-13 03:28:05,845 INFO L182 omatonBuilderFactory]: Interpolants [55936#(<= main_~i~0 69), 55937#(<= main_~i~0 70), 55938#(<= main_~i~0 71), 55939#(<= main_~i~0 72), 55940#(<= main_~i~0 73), 55941#(<= main_~i~0 74), 55942#(<= main_~i~0 75), 55943#(<= main_~i~0 76), 55944#(<= main_~i~0 77), 55945#(<= main_~i~0 78), 55946#(<= main_~i~0 79), 55947#(<= main_~i~0 80), 55948#(<= main_~i~0 81), 55949#(<= main_~i~0 82), 55950#(<= main_~i~0 83), 55951#(<= main_~i~0 84), 55952#(<= main_~i~0 85), 55953#(<= main_~i~0 86), 55865#true, 55866#false, 55867#(<= main_~i~0 0), 55868#(<= main_~i~0 1), 55869#(<= main_~i~0 2), 55870#(<= main_~i~0 3), 55871#(<= main_~i~0 4), 55872#(<= main_~i~0 5), 55873#(<= main_~i~0 6), 55874#(<= main_~i~0 7), 55875#(<= main_~i~0 8), 55876#(<= main_~i~0 9), 55877#(<= main_~i~0 10), 55878#(<= main_~i~0 11), 55879#(<= main_~i~0 12), 55880#(<= main_~i~0 13), 55881#(<= main_~i~0 14), 55882#(<= main_~i~0 15), 55883#(<= main_~i~0 16), 55884#(<= main_~i~0 17), 55885#(<= main_~i~0 18), 55886#(<= main_~i~0 19), 55887#(<= main_~i~0 20), 55888#(<= main_~i~0 21), 55889#(<= main_~i~0 22), 55890#(<= main_~i~0 23), 55891#(<= main_~i~0 24), 55892#(<= main_~i~0 25), 55893#(<= main_~i~0 26), 55894#(<= main_~i~0 27), 55895#(<= main_~i~0 28), 55896#(<= main_~i~0 29), 55897#(<= main_~i~0 30), 55898#(<= main_~i~0 31), 55899#(<= main_~i~0 32), 55900#(<= main_~i~0 33), 55901#(<= main_~i~0 34), 55902#(<= main_~i~0 35), 55903#(<= main_~i~0 36), 55904#(<= main_~i~0 37), 55905#(<= main_~i~0 38), 55906#(<= main_~i~0 39), 55907#(<= main_~i~0 40), 55908#(<= main_~i~0 41), 55909#(<= main_~i~0 42), 55910#(<= main_~i~0 43), 55911#(<= main_~i~0 44), 55912#(<= main_~i~0 45), 55913#(<= main_~i~0 46), 55914#(<= main_~i~0 47), 55915#(<= main_~i~0 48), 55916#(<= main_~i~0 49), 55917#(<= main_~i~0 50), 55918#(<= main_~i~0 51), 55919#(<= main_~i~0 52), 55920#(<= main_~i~0 53), 55921#(<= main_~i~0 54), 55922#(<= main_~i~0 55), 55923#(<= main_~i~0 56), 55924#(<= main_~i~0 57), 55925#(<= main_~i~0 58), 55926#(<= main_~i~0 59), 55927#(<= main_~i~0 60), 55928#(<= main_~i~0 61), 55929#(<= main_~i~0 62), 55930#(<= main_~i~0 63), 55931#(<= main_~i~0 64), 55932#(<= main_~i~0 65), 55933#(<= main_~i~0 66), 55934#(<= main_~i~0 67), 55935#(<= main_~i~0 68)] [2018-04-13 03:28:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14801 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:05,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 03:28:05,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 03:28:05,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 03:28:05,847 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 89 states. [2018-04-13 03:28:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:07,484 INFO L93 Difference]: Finished difference Result 800 states and 885 transitions. [2018-04-13 03:28:07,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 03:28:07,485 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 364 [2018-04-13 03:28:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:07,485 INFO L225 Difference]: With dead ends: 800 [2018-04-13 03:28:07,485 INFO L226 Difference]: Without dead ends: 800 [2018-04-13 03:28:07,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 03:28:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-04-13 03:28:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 369. [2018-04-13 03:28:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-04-13 03:28:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-04-13 03:28:07,488 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-04-13 03:28:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:07,488 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-04-13 03:28:07,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 03:28:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-04-13 03:28:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-04-13 03:28:07,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:07,489 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:07,489 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:07,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1501451929, now seen corresponding path program 86 times [2018-04-13 03:28:07,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:07,500 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15147 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:09,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:09,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-13 03:28:09,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:09,062 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-13 03:28:09,062 INFO L182 omatonBuilderFactory]: Interpolants [57123#true, 57124#false, 57125#(<= main_~i~0 0), 57126#(<= main_~i~0 1), 57127#(<= main_~i~0 2), 57128#(<= main_~i~0 3), 57129#(<= main_~i~0 4), 57130#(<= main_~i~0 5), 57131#(<= main_~i~0 6), 57132#(<= main_~i~0 7), 57133#(<= main_~i~0 8), 57134#(<= main_~i~0 9), 57135#(<= main_~i~0 10), 57136#(<= main_~i~0 11), 57137#(<= main_~i~0 12), 57138#(<= main_~i~0 13), 57139#(<= main_~i~0 14), 57140#(<= main_~i~0 15), 57141#(<= main_~i~0 16), 57142#(<= main_~i~0 17), 57143#(<= main_~i~0 18), 57144#(<= main_~i~0 19), 57145#(<= main_~i~0 20), 57146#(<= main_~i~0 21), 57147#(<= main_~i~0 22), 57148#(<= main_~i~0 23), 57149#(<= main_~i~0 24), 57150#(<= main_~i~0 25), 57151#(<= main_~i~0 26), 57152#(<= main_~i~0 27), 57153#(<= main_~i~0 28), 57154#(<= main_~i~0 29), 57155#(<= main_~i~0 30), 57156#(<= main_~i~0 31), 57157#(<= main_~i~0 32), 57158#(<= main_~i~0 33), 57159#(<= main_~i~0 34), 57160#(<= main_~i~0 35), 57161#(<= main_~i~0 36), 57162#(<= main_~i~0 37), 57163#(<= main_~i~0 38), 57164#(<= main_~i~0 39), 57165#(<= main_~i~0 40), 57166#(<= main_~i~0 41), 57167#(<= main_~i~0 42), 57168#(<= main_~i~0 43), 57169#(<= main_~i~0 44), 57170#(<= main_~i~0 45), 57171#(<= main_~i~0 46), 57172#(<= main_~i~0 47), 57173#(<= main_~i~0 48), 57174#(<= main_~i~0 49), 57175#(<= main_~i~0 50), 57176#(<= main_~i~0 51), 57177#(<= main_~i~0 52), 57178#(<= main_~i~0 53), 57179#(<= main_~i~0 54), 57180#(<= main_~i~0 55), 57181#(<= main_~i~0 56), 57182#(<= main_~i~0 57), 57183#(<= main_~i~0 58), 57184#(<= main_~i~0 59), 57185#(<= main_~i~0 60), 57186#(<= main_~i~0 61), 57187#(<= main_~i~0 62), 57188#(<= main_~i~0 63), 57189#(<= main_~i~0 64), 57190#(<= main_~i~0 65), 57191#(<= main_~i~0 66), 57192#(<= main_~i~0 67), 57193#(<= main_~i~0 68), 57194#(<= main_~i~0 69), 57195#(<= main_~i~0 70), 57196#(<= main_~i~0 71), 57197#(<= main_~i~0 72), 57198#(<= main_~i~0 73), 57199#(<= main_~i~0 74), 57200#(<= main_~i~0 75), 57201#(<= main_~i~0 76), 57202#(<= main_~i~0 77), 57203#(<= main_~i~0 78), 57204#(<= main_~i~0 79), 57205#(<= main_~i~0 80), 57206#(<= main_~i~0 81), 57207#(<= main_~i~0 82), 57208#(<= main_~i~0 83), 57209#(<= main_~i~0 84), 57210#(<= main_~i~0 85), 57211#(<= main_~i~0 86), 57212#(<= main_~i~0 87)] [2018-04-13 03:28:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15147 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:09,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 03:28:09,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 03:28:09,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 03:28:09,063 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 90 states. [2018-04-13 03:28:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:11,106 INFO L93 Difference]: Finished difference Result 809 states and 895 transitions. [2018-04-13 03:28:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 03:28:11,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 368 [2018-04-13 03:28:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:11,107 INFO L225 Difference]: With dead ends: 809 [2018-04-13 03:28:11,107 INFO L226 Difference]: Without dead ends: 809 [2018-04-13 03:28:11,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 03:28:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-13 03:28:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 373. [2018-04-13 03:28:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-13 03:28:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-04-13 03:28:11,110 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 368 [2018-04-13 03:28:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:11,110 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-04-13 03:28:11,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 03:28:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-04-13 03:28:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-13 03:28:11,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:11,111 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:11,112 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 76897682, now seen corresponding path program 87 times [2018-04-13 03:28:11,112 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:11,122 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15497 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:12,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:12,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 03:28:12,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:12,797 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-13 03:28:12,797 INFO L182 omatonBuilderFactory]: Interpolants [58395#true, 58396#false, 58397#(<= main_~i~0 0), 58398#(<= main_~i~0 1), 58399#(<= main_~i~0 2), 58400#(<= main_~i~0 3), 58401#(<= main_~i~0 4), 58402#(<= main_~i~0 5), 58403#(<= main_~i~0 6), 58404#(<= main_~i~0 7), 58405#(<= main_~i~0 8), 58406#(<= main_~i~0 9), 58407#(<= main_~i~0 10), 58408#(<= main_~i~0 11), 58409#(<= main_~i~0 12), 58410#(<= main_~i~0 13), 58411#(<= main_~i~0 14), 58412#(<= main_~i~0 15), 58413#(<= main_~i~0 16), 58414#(<= main_~i~0 17), 58415#(<= main_~i~0 18), 58416#(<= main_~i~0 19), 58417#(<= main_~i~0 20), 58418#(<= main_~i~0 21), 58419#(<= main_~i~0 22), 58420#(<= main_~i~0 23), 58421#(<= main_~i~0 24), 58422#(<= main_~i~0 25), 58423#(<= main_~i~0 26), 58424#(<= main_~i~0 27), 58425#(<= main_~i~0 28), 58426#(<= main_~i~0 29), 58427#(<= main_~i~0 30), 58428#(<= main_~i~0 31), 58429#(<= main_~i~0 32), 58430#(<= main_~i~0 33), 58431#(<= main_~i~0 34), 58432#(<= main_~i~0 35), 58433#(<= main_~i~0 36), 58434#(<= main_~i~0 37), 58435#(<= main_~i~0 38), 58436#(<= main_~i~0 39), 58437#(<= main_~i~0 40), 58438#(<= main_~i~0 41), 58439#(<= main_~i~0 42), 58440#(<= main_~i~0 43), 58441#(<= main_~i~0 44), 58442#(<= main_~i~0 45), 58443#(<= main_~i~0 46), 58444#(<= main_~i~0 47), 58445#(<= main_~i~0 48), 58446#(<= main_~i~0 49), 58447#(<= main_~i~0 50), 58448#(<= main_~i~0 51), 58449#(<= main_~i~0 52), 58450#(<= main_~i~0 53), 58451#(<= main_~i~0 54), 58452#(<= main_~i~0 55), 58453#(<= main_~i~0 56), 58454#(<= main_~i~0 57), 58455#(<= main_~i~0 58), 58456#(<= main_~i~0 59), 58457#(<= main_~i~0 60), 58458#(<= main_~i~0 61), 58459#(<= main_~i~0 62), 58460#(<= main_~i~0 63), 58461#(<= main_~i~0 64), 58462#(<= main_~i~0 65), 58463#(<= main_~i~0 66), 58464#(<= main_~i~0 67), 58465#(<= main_~i~0 68), 58466#(<= main_~i~0 69), 58467#(<= main_~i~0 70), 58468#(<= main_~i~0 71), 58469#(<= main_~i~0 72), 58470#(<= main_~i~0 73), 58471#(<= main_~i~0 74), 58472#(<= main_~i~0 75), 58473#(<= main_~i~0 76), 58474#(<= main_~i~0 77), 58475#(<= main_~i~0 78), 58476#(<= main_~i~0 79), 58477#(<= main_~i~0 80), 58478#(<= main_~i~0 81), 58479#(<= main_~i~0 82), 58480#(<= main_~i~0 83), 58481#(<= main_~i~0 84), 58482#(<= main_~i~0 85), 58483#(<= main_~i~0 86), 58484#(<= main_~i~0 87), 58485#(<= main_~i~0 88)] [2018-04-13 03:28:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15497 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:12,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 03:28:12,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 03:28:12,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 03:28:12,799 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 91 states. [2018-04-13 03:28:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:14,752 INFO L93 Difference]: Finished difference Result 818 states and 905 transitions. [2018-04-13 03:28:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 03:28:14,752 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 372 [2018-04-13 03:28:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:14,753 INFO L225 Difference]: With dead ends: 818 [2018-04-13 03:28:14,753 INFO L226 Difference]: Without dead ends: 818 [2018-04-13 03:28:14,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 03:28:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-04-13 03:28:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 377. [2018-04-13 03:28:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-04-13 03:28:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-04-13 03:28:14,756 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 372 [2018-04-13 03:28:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:14,757 INFO L459 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-04-13 03:28:14,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 03:28:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-04-13 03:28:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-04-13 03:28:14,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:14,758 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:14,758 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1368506357, now seen corresponding path program 88 times [2018-04-13 03:28:14,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:14,769 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15851 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:16,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:16,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-13 03:28:16,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:16,539 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-13 03:28:16,539 INFO L182 omatonBuilderFactory]: Interpolants [59681#true, 59682#false, 59683#(<= main_~i~0 0), 59684#(<= main_~i~0 1), 59685#(<= main_~i~0 2), 59686#(<= main_~i~0 3), 59687#(<= main_~i~0 4), 59688#(<= main_~i~0 5), 59689#(<= main_~i~0 6), 59690#(<= main_~i~0 7), 59691#(<= main_~i~0 8), 59692#(<= main_~i~0 9), 59693#(<= main_~i~0 10), 59694#(<= main_~i~0 11), 59695#(<= main_~i~0 12), 59696#(<= main_~i~0 13), 59697#(<= main_~i~0 14), 59698#(<= main_~i~0 15), 59699#(<= main_~i~0 16), 59700#(<= main_~i~0 17), 59701#(<= main_~i~0 18), 59702#(<= main_~i~0 19), 59703#(<= main_~i~0 20), 59704#(<= main_~i~0 21), 59705#(<= main_~i~0 22), 59706#(<= main_~i~0 23), 59707#(<= main_~i~0 24), 59708#(<= main_~i~0 25), 59709#(<= main_~i~0 26), 59710#(<= main_~i~0 27), 59711#(<= main_~i~0 28), 59712#(<= main_~i~0 29), 59713#(<= main_~i~0 30), 59714#(<= main_~i~0 31), 59715#(<= main_~i~0 32), 59716#(<= main_~i~0 33), 59717#(<= main_~i~0 34), 59718#(<= main_~i~0 35), 59719#(<= main_~i~0 36), 59720#(<= main_~i~0 37), 59721#(<= main_~i~0 38), 59722#(<= main_~i~0 39), 59723#(<= main_~i~0 40), 59724#(<= main_~i~0 41), 59725#(<= main_~i~0 42), 59726#(<= main_~i~0 43), 59727#(<= main_~i~0 44), 59728#(<= main_~i~0 45), 59729#(<= main_~i~0 46), 59730#(<= main_~i~0 47), 59731#(<= main_~i~0 48), 59732#(<= main_~i~0 49), 59733#(<= main_~i~0 50), 59734#(<= main_~i~0 51), 59735#(<= main_~i~0 52), 59736#(<= main_~i~0 53), 59737#(<= main_~i~0 54), 59738#(<= main_~i~0 55), 59739#(<= main_~i~0 56), 59740#(<= main_~i~0 57), 59741#(<= main_~i~0 58), 59742#(<= main_~i~0 59), 59743#(<= main_~i~0 60), 59744#(<= main_~i~0 61), 59745#(<= main_~i~0 62), 59746#(<= main_~i~0 63), 59747#(<= main_~i~0 64), 59748#(<= main_~i~0 65), 59749#(<= main_~i~0 66), 59750#(<= main_~i~0 67), 59751#(<= main_~i~0 68), 59752#(<= main_~i~0 69), 59753#(<= main_~i~0 70), 59754#(<= main_~i~0 71), 59755#(<= main_~i~0 72), 59756#(<= main_~i~0 73), 59757#(<= main_~i~0 74), 59758#(<= main_~i~0 75), 59759#(<= main_~i~0 76), 59760#(<= main_~i~0 77), 59761#(<= main_~i~0 78), 59762#(<= main_~i~0 79), 59763#(<= main_~i~0 80), 59764#(<= main_~i~0 81), 59765#(<= main_~i~0 82), 59766#(<= main_~i~0 83), 59767#(<= main_~i~0 84), 59768#(<= main_~i~0 85), 59769#(<= main_~i~0 86), 59770#(<= main_~i~0 87), 59771#(<= main_~i~0 88), 59772#(<= main_~i~0 89)] [2018-04-13 03:28:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15851 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:16,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 03:28:16,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 03:28:16,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 03:28:16,541 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 92 states. [2018-04-13 03:28:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:18,440 INFO L93 Difference]: Finished difference Result 827 states and 915 transitions. [2018-04-13 03:28:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 03:28:18,440 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 376 [2018-04-13 03:28:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:18,441 INFO L225 Difference]: With dead ends: 827 [2018-04-13 03:28:18,441 INFO L226 Difference]: Without dead ends: 827 [2018-04-13 03:28:18,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 03:28:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-04-13 03:28:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 381. [2018-04-13 03:28:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-04-13 03:28:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-04-13 03:28:18,444 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 376 [2018-04-13 03:28:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:18,444 INFO L459 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-04-13 03:28:18,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 03:28:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-04-13 03:28:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-04-13 03:28:18,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:18,445 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:18,445 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash 598687236, now seen corresponding path program 89 times [2018-04-13 03:28:18,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:18,456 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16209 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:20,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:20,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 03:28:20,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:20,090 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-13 03:28:20,090 INFO L182 omatonBuilderFactory]: Interpolants [61056#(<= main_~i~0 73), 61057#(<= main_~i~0 74), 61058#(<= main_~i~0 75), 61059#(<= main_~i~0 76), 61060#(<= main_~i~0 77), 61061#(<= main_~i~0 78), 61062#(<= main_~i~0 79), 61063#(<= main_~i~0 80), 61064#(<= main_~i~0 81), 61065#(<= main_~i~0 82), 61066#(<= main_~i~0 83), 61067#(<= main_~i~0 84), 61068#(<= main_~i~0 85), 61069#(<= main_~i~0 86), 61070#(<= main_~i~0 87), 61071#(<= main_~i~0 88), 61072#(<= main_~i~0 89), 61073#(<= main_~i~0 90), 60981#true, 60982#false, 60983#(<= main_~i~0 0), 60984#(<= main_~i~0 1), 60985#(<= main_~i~0 2), 60986#(<= main_~i~0 3), 60987#(<= main_~i~0 4), 60988#(<= main_~i~0 5), 60989#(<= main_~i~0 6), 60990#(<= main_~i~0 7), 60991#(<= main_~i~0 8), 60992#(<= main_~i~0 9), 60993#(<= main_~i~0 10), 60994#(<= main_~i~0 11), 60995#(<= main_~i~0 12), 60996#(<= main_~i~0 13), 60997#(<= main_~i~0 14), 60998#(<= main_~i~0 15), 60999#(<= main_~i~0 16), 61000#(<= main_~i~0 17), 61001#(<= main_~i~0 18), 61002#(<= main_~i~0 19), 61003#(<= main_~i~0 20), 61004#(<= main_~i~0 21), 61005#(<= main_~i~0 22), 61006#(<= main_~i~0 23), 61007#(<= main_~i~0 24), 61008#(<= main_~i~0 25), 61009#(<= main_~i~0 26), 61010#(<= main_~i~0 27), 61011#(<= main_~i~0 28), 61012#(<= main_~i~0 29), 61013#(<= main_~i~0 30), 61014#(<= main_~i~0 31), 61015#(<= main_~i~0 32), 61016#(<= main_~i~0 33), 61017#(<= main_~i~0 34), 61018#(<= main_~i~0 35), 61019#(<= main_~i~0 36), 61020#(<= main_~i~0 37), 61021#(<= main_~i~0 38), 61022#(<= main_~i~0 39), 61023#(<= main_~i~0 40), 61024#(<= main_~i~0 41), 61025#(<= main_~i~0 42), 61026#(<= main_~i~0 43), 61027#(<= main_~i~0 44), 61028#(<= main_~i~0 45), 61029#(<= main_~i~0 46), 61030#(<= main_~i~0 47), 61031#(<= main_~i~0 48), 61032#(<= main_~i~0 49), 61033#(<= main_~i~0 50), 61034#(<= main_~i~0 51), 61035#(<= main_~i~0 52), 61036#(<= main_~i~0 53), 61037#(<= main_~i~0 54), 61038#(<= main_~i~0 55), 61039#(<= main_~i~0 56), 61040#(<= main_~i~0 57), 61041#(<= main_~i~0 58), 61042#(<= main_~i~0 59), 61043#(<= main_~i~0 60), 61044#(<= main_~i~0 61), 61045#(<= main_~i~0 62), 61046#(<= main_~i~0 63), 61047#(<= main_~i~0 64), 61048#(<= main_~i~0 65), 61049#(<= main_~i~0 66), 61050#(<= main_~i~0 67), 61051#(<= main_~i~0 68), 61052#(<= main_~i~0 69), 61053#(<= main_~i~0 70), 61054#(<= main_~i~0 71), 61055#(<= main_~i~0 72)] [2018-04-13 03:28:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16209 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:20,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 03:28:20,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 03:28:20,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 03:28:20,092 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 93 states. [2018-04-13 03:28:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:21,810 INFO L93 Difference]: Finished difference Result 836 states and 925 transitions. [2018-04-13 03:28:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 03:28:21,810 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 380 [2018-04-13 03:28:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:21,811 INFO L225 Difference]: With dead ends: 836 [2018-04-13 03:28:21,811 INFO L226 Difference]: Without dead ends: 836 [2018-04-13 03:28:21,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 03:28:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-04-13 03:28:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 385. [2018-04-13 03:28:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 03:28:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-13 03:28:21,814 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 380 [2018-04-13 03:28:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:21,814 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-13 03:28:21,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 03:28:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-13 03:28:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-13 03:28:21,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:21,816 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:21,816 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -203516035, now seen corresponding path program 90 times [2018-04-13 03:28:21,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:21,827 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16571 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:23,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:23,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-13 03:28:23,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:23,550 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-13 03:28:23,550 INFO L182 omatonBuilderFactory]: Interpolants [62336#(<= main_~i~0 39), 62337#(<= main_~i~0 40), 62338#(<= main_~i~0 41), 62339#(<= main_~i~0 42), 62340#(<= main_~i~0 43), 62341#(<= main_~i~0 44), 62342#(<= main_~i~0 45), 62343#(<= main_~i~0 46), 62344#(<= main_~i~0 47), 62345#(<= main_~i~0 48), 62346#(<= main_~i~0 49), 62347#(<= main_~i~0 50), 62348#(<= main_~i~0 51), 62349#(<= main_~i~0 52), 62350#(<= main_~i~0 53), 62351#(<= main_~i~0 54), 62352#(<= main_~i~0 55), 62353#(<= main_~i~0 56), 62354#(<= main_~i~0 57), 62355#(<= main_~i~0 58), 62356#(<= main_~i~0 59), 62357#(<= main_~i~0 60), 62358#(<= main_~i~0 61), 62359#(<= main_~i~0 62), 62360#(<= main_~i~0 63), 62361#(<= main_~i~0 64), 62362#(<= main_~i~0 65), 62363#(<= main_~i~0 66), 62364#(<= main_~i~0 67), 62365#(<= main_~i~0 68), 62366#(<= main_~i~0 69), 62367#(<= main_~i~0 70), 62368#(<= main_~i~0 71), 62369#(<= main_~i~0 72), 62370#(<= main_~i~0 73), 62371#(<= main_~i~0 74), 62372#(<= main_~i~0 75), 62373#(<= main_~i~0 76), 62374#(<= main_~i~0 77), 62375#(<= main_~i~0 78), 62376#(<= main_~i~0 79), 62377#(<= main_~i~0 80), 62378#(<= main_~i~0 81), 62379#(<= main_~i~0 82), 62380#(<= main_~i~0 83), 62381#(<= main_~i~0 84), 62382#(<= main_~i~0 85), 62383#(<= main_~i~0 86), 62384#(<= main_~i~0 87), 62385#(<= main_~i~0 88), 62386#(<= main_~i~0 89), 62387#(<= main_~i~0 90), 62388#(<= main_~i~0 91), 62295#true, 62296#false, 62297#(<= main_~i~0 0), 62298#(<= main_~i~0 1), 62299#(<= main_~i~0 2), 62300#(<= main_~i~0 3), 62301#(<= main_~i~0 4), 62302#(<= main_~i~0 5), 62303#(<= main_~i~0 6), 62304#(<= main_~i~0 7), 62305#(<= main_~i~0 8), 62306#(<= main_~i~0 9), 62307#(<= main_~i~0 10), 62308#(<= main_~i~0 11), 62309#(<= main_~i~0 12), 62310#(<= main_~i~0 13), 62311#(<= main_~i~0 14), 62312#(<= main_~i~0 15), 62313#(<= main_~i~0 16), 62314#(<= main_~i~0 17), 62315#(<= main_~i~0 18), 62316#(<= main_~i~0 19), 62317#(<= main_~i~0 20), 62318#(<= main_~i~0 21), 62319#(<= main_~i~0 22), 62320#(<= main_~i~0 23), 62321#(<= main_~i~0 24), 62322#(<= main_~i~0 25), 62323#(<= main_~i~0 26), 62324#(<= main_~i~0 27), 62325#(<= main_~i~0 28), 62326#(<= main_~i~0 29), 62327#(<= main_~i~0 30), 62328#(<= main_~i~0 31), 62329#(<= main_~i~0 32), 62330#(<= main_~i~0 33), 62331#(<= main_~i~0 34), 62332#(<= main_~i~0 35), 62333#(<= main_~i~0 36), 62334#(<= main_~i~0 37), 62335#(<= main_~i~0 38)] [2018-04-13 03:28:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16571 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:23,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 03:28:23,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 03:28:23,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 03:28:23,552 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 94 states. [2018-04-13 03:28:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:25,250 INFO L93 Difference]: Finished difference Result 845 states and 935 transitions. [2018-04-13 03:28:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 03:28:25,250 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 384 [2018-04-13 03:28:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:25,251 INFO L225 Difference]: With dead ends: 845 [2018-04-13 03:28:25,252 INFO L226 Difference]: Without dead ends: 845 [2018-04-13 03:28:25,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 03:28:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-13 03:28:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 389. [2018-04-13 03:28:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-13 03:28:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-04-13 03:28:25,255 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-04-13 03:28:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:25,255 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-04-13 03:28:25,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 03:28:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-04-13 03:28:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-13 03:28:25,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:25,256 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:25,256 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:25,256 INFO L82 PathProgramCache]: Analyzing trace with hash 23235702, now seen corresponding path program 91 times [2018-04-13 03:28:25,256 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:25,267 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16937 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:27,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:27,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-04-13 03:28:27,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:27,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-13 03:28:27,180 INFO L182 omatonBuilderFactory]: Interpolants [63623#true, 63624#false, 63625#(<= main_~i~0 0), 63626#(<= main_~i~0 1), 63627#(<= main_~i~0 2), 63628#(<= main_~i~0 3), 63629#(<= main_~i~0 4), 63630#(<= main_~i~0 5), 63631#(<= main_~i~0 6), 63632#(<= main_~i~0 7), 63633#(<= main_~i~0 8), 63634#(<= main_~i~0 9), 63635#(<= main_~i~0 10), 63636#(<= main_~i~0 11), 63637#(<= main_~i~0 12), 63638#(<= main_~i~0 13), 63639#(<= main_~i~0 14), 63640#(<= main_~i~0 15), 63641#(<= main_~i~0 16), 63642#(<= main_~i~0 17), 63643#(<= main_~i~0 18), 63644#(<= main_~i~0 19), 63645#(<= main_~i~0 20), 63646#(<= main_~i~0 21), 63647#(<= main_~i~0 22), 63648#(<= main_~i~0 23), 63649#(<= main_~i~0 24), 63650#(<= main_~i~0 25), 63651#(<= main_~i~0 26), 63652#(<= main_~i~0 27), 63653#(<= main_~i~0 28), 63654#(<= main_~i~0 29), 63655#(<= main_~i~0 30), 63656#(<= main_~i~0 31), 63657#(<= main_~i~0 32), 63658#(<= main_~i~0 33), 63659#(<= main_~i~0 34), 63660#(<= main_~i~0 35), 63661#(<= main_~i~0 36), 63662#(<= main_~i~0 37), 63663#(<= main_~i~0 38), 63664#(<= main_~i~0 39), 63665#(<= main_~i~0 40), 63666#(<= main_~i~0 41), 63667#(<= main_~i~0 42), 63668#(<= main_~i~0 43), 63669#(<= main_~i~0 44), 63670#(<= main_~i~0 45), 63671#(<= main_~i~0 46), 63672#(<= main_~i~0 47), 63673#(<= main_~i~0 48), 63674#(<= main_~i~0 49), 63675#(<= main_~i~0 50), 63676#(<= main_~i~0 51), 63677#(<= main_~i~0 52), 63678#(<= main_~i~0 53), 63679#(<= main_~i~0 54), 63680#(<= main_~i~0 55), 63681#(<= main_~i~0 56), 63682#(<= main_~i~0 57), 63683#(<= main_~i~0 58), 63684#(<= main_~i~0 59), 63685#(<= main_~i~0 60), 63686#(<= main_~i~0 61), 63687#(<= main_~i~0 62), 63688#(<= main_~i~0 63), 63689#(<= main_~i~0 64), 63690#(<= main_~i~0 65), 63691#(<= main_~i~0 66), 63692#(<= main_~i~0 67), 63693#(<= main_~i~0 68), 63694#(<= main_~i~0 69), 63695#(<= main_~i~0 70), 63696#(<= main_~i~0 71), 63697#(<= main_~i~0 72), 63698#(<= main_~i~0 73), 63699#(<= main_~i~0 74), 63700#(<= main_~i~0 75), 63701#(<= main_~i~0 76), 63702#(<= main_~i~0 77), 63703#(<= main_~i~0 78), 63704#(<= main_~i~0 79), 63705#(<= main_~i~0 80), 63706#(<= main_~i~0 81), 63707#(<= main_~i~0 82), 63708#(<= main_~i~0 83), 63709#(<= main_~i~0 84), 63710#(<= main_~i~0 85), 63711#(<= main_~i~0 86), 63712#(<= main_~i~0 87), 63713#(<= main_~i~0 88), 63714#(<= main_~i~0 89), 63715#(<= main_~i~0 90), 63716#(<= main_~i~0 91), 63717#(<= main_~i~0 92)] [2018-04-13 03:28:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16937 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:27,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 03:28:27,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 03:28:27,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 03:28:27,182 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 95 states. [2018-04-13 03:28:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:29,631 INFO L93 Difference]: Finished difference Result 854 states and 945 transitions. [2018-04-13 03:28:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 03:28:29,631 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 388 [2018-04-13 03:28:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:29,632 INFO L225 Difference]: With dead ends: 854 [2018-04-13 03:28:29,632 INFO L226 Difference]: Without dead ends: 854 [2018-04-13 03:28:29,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 03:28:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-04-13 03:28:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 393. [2018-04-13 03:28:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-13 03:28:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-04-13 03:28:29,635 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 388 [2018-04-13 03:28:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:29,635 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-04-13 03:28:29,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 03:28:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-04-13 03:28:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-13 03:28:29,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:29,637 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:29,637 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 293690607, now seen corresponding path program 92 times [2018-04-13 03:28:29,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:29,648 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17307 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:31,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:31,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-13 03:28:31,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:31,522 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-13 03:28:31,522 INFO L182 omatonBuilderFactory]: Interpolants [65024#(<= main_~i~0 57), 65025#(<= main_~i~0 58), 65026#(<= main_~i~0 59), 65027#(<= main_~i~0 60), 65028#(<= main_~i~0 61), 65029#(<= main_~i~0 62), 65030#(<= main_~i~0 63), 65031#(<= main_~i~0 64), 65032#(<= main_~i~0 65), 65033#(<= main_~i~0 66), 65034#(<= main_~i~0 67), 65035#(<= main_~i~0 68), 65036#(<= main_~i~0 69), 65037#(<= main_~i~0 70), 65038#(<= main_~i~0 71), 65039#(<= main_~i~0 72), 65040#(<= main_~i~0 73), 65041#(<= main_~i~0 74), 65042#(<= main_~i~0 75), 65043#(<= main_~i~0 76), 65044#(<= main_~i~0 77), 65045#(<= main_~i~0 78), 65046#(<= main_~i~0 79), 65047#(<= main_~i~0 80), 65048#(<= main_~i~0 81), 65049#(<= main_~i~0 82), 65050#(<= main_~i~0 83), 65051#(<= main_~i~0 84), 65052#(<= main_~i~0 85), 65053#(<= main_~i~0 86), 65054#(<= main_~i~0 87), 65055#(<= main_~i~0 88), 65056#(<= main_~i~0 89), 65057#(<= main_~i~0 90), 65058#(<= main_~i~0 91), 65059#(<= main_~i~0 92), 65060#(<= main_~i~0 93), 64965#true, 64966#false, 64967#(<= main_~i~0 0), 64968#(<= main_~i~0 1), 64969#(<= main_~i~0 2), 64970#(<= main_~i~0 3), 64971#(<= main_~i~0 4), 64972#(<= main_~i~0 5), 64973#(<= main_~i~0 6), 64974#(<= main_~i~0 7), 64975#(<= main_~i~0 8), 64976#(<= main_~i~0 9), 64977#(<= main_~i~0 10), 64978#(<= main_~i~0 11), 64979#(<= main_~i~0 12), 64980#(<= main_~i~0 13), 64981#(<= main_~i~0 14), 64982#(<= main_~i~0 15), 64983#(<= main_~i~0 16), 64984#(<= main_~i~0 17), 64985#(<= main_~i~0 18), 64986#(<= main_~i~0 19), 64987#(<= main_~i~0 20), 64988#(<= main_~i~0 21), 64989#(<= main_~i~0 22), 64990#(<= main_~i~0 23), 64991#(<= main_~i~0 24), 64992#(<= main_~i~0 25), 64993#(<= main_~i~0 26), 64994#(<= main_~i~0 27), 64995#(<= main_~i~0 28), 64996#(<= main_~i~0 29), 64997#(<= main_~i~0 30), 64998#(<= main_~i~0 31), 64999#(<= main_~i~0 32), 65000#(<= main_~i~0 33), 65001#(<= main_~i~0 34), 65002#(<= main_~i~0 35), 65003#(<= main_~i~0 36), 65004#(<= main_~i~0 37), 65005#(<= main_~i~0 38), 65006#(<= main_~i~0 39), 65007#(<= main_~i~0 40), 65008#(<= main_~i~0 41), 65009#(<= main_~i~0 42), 65010#(<= main_~i~0 43), 65011#(<= main_~i~0 44), 65012#(<= main_~i~0 45), 65013#(<= main_~i~0 46), 65014#(<= main_~i~0 47), 65015#(<= main_~i~0 48), 65016#(<= main_~i~0 49), 65017#(<= main_~i~0 50), 65018#(<= main_~i~0 51), 65019#(<= main_~i~0 52), 65020#(<= main_~i~0 53), 65021#(<= main_~i~0 54), 65022#(<= main_~i~0 55), 65023#(<= main_~i~0 56)] [2018-04-13 03:28:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17307 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:31,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-13 03:28:31,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-13 03:28:31,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 03:28:31,523 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 96 states. [2018-04-13 03:28:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:33,254 INFO L93 Difference]: Finished difference Result 863 states and 955 transitions. [2018-04-13 03:28:33,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 03:28:33,255 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 392 [2018-04-13 03:28:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:33,256 INFO L225 Difference]: With dead ends: 863 [2018-04-13 03:28:33,256 INFO L226 Difference]: Without dead ends: 863 [2018-04-13 03:28:33,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 03:28:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-04-13 03:28:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 397. [2018-04-13 03:28:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-13 03:28:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-04-13 03:28:33,260 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 392 [2018-04-13 03:28:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:33,260 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-04-13 03:28:33,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-13 03:28:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-04-13 03:28:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-04-13 03:28:33,262 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:33,262 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:33,262 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1549879528, now seen corresponding path program 93 times [2018-04-13 03:28:33,263 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:33,275 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17681 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:35,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:35,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-13 03:28:35,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:35,142 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-13 03:28:35,142 INFO L182 omatonBuilderFactory]: Interpolants [66321#true, 66323#(<= main_~i~0 0), 66322#false, 66325#(<= main_~i~0 2), 66324#(<= main_~i~0 1), 66327#(<= main_~i~0 4), 66326#(<= main_~i~0 3), 66329#(<= main_~i~0 6), 66328#(<= main_~i~0 5), 66331#(<= main_~i~0 8), 66330#(<= main_~i~0 7), 66333#(<= main_~i~0 10), 66332#(<= main_~i~0 9), 66335#(<= main_~i~0 12), 66334#(<= main_~i~0 11), 66337#(<= main_~i~0 14), 66336#(<= main_~i~0 13), 66339#(<= main_~i~0 16), 66338#(<= main_~i~0 15), 66341#(<= main_~i~0 18), 66340#(<= main_~i~0 17), 66343#(<= main_~i~0 20), 66342#(<= main_~i~0 19), 66345#(<= main_~i~0 22), 66344#(<= main_~i~0 21), 66347#(<= main_~i~0 24), 66346#(<= main_~i~0 23), 66349#(<= main_~i~0 26), 66348#(<= main_~i~0 25), 66351#(<= main_~i~0 28), 66350#(<= main_~i~0 27), 66353#(<= main_~i~0 30), 66352#(<= main_~i~0 29), 66355#(<= main_~i~0 32), 66354#(<= main_~i~0 31), 66357#(<= main_~i~0 34), 66356#(<= main_~i~0 33), 66359#(<= main_~i~0 36), 66358#(<= main_~i~0 35), 66361#(<= main_~i~0 38), 66360#(<= main_~i~0 37), 66363#(<= main_~i~0 40), 66362#(<= main_~i~0 39), 66365#(<= main_~i~0 42), 66364#(<= main_~i~0 41), 66367#(<= main_~i~0 44), 66366#(<= main_~i~0 43), 66369#(<= main_~i~0 46), 66368#(<= main_~i~0 45), 66371#(<= main_~i~0 48), 66370#(<= main_~i~0 47), 66373#(<= main_~i~0 50), 66372#(<= main_~i~0 49), 66375#(<= main_~i~0 52), 66374#(<= main_~i~0 51), 66377#(<= main_~i~0 54), 66376#(<= main_~i~0 53), 66379#(<= main_~i~0 56), 66378#(<= main_~i~0 55), 66381#(<= main_~i~0 58), 66380#(<= main_~i~0 57), 66383#(<= main_~i~0 60), 66382#(<= main_~i~0 59), 66385#(<= main_~i~0 62), 66384#(<= main_~i~0 61), 66387#(<= main_~i~0 64), 66386#(<= main_~i~0 63), 66389#(<= main_~i~0 66), 66388#(<= main_~i~0 65), 66391#(<= main_~i~0 68), 66390#(<= main_~i~0 67), 66393#(<= main_~i~0 70), 66392#(<= main_~i~0 69), 66395#(<= main_~i~0 72), 66394#(<= main_~i~0 71), 66397#(<= main_~i~0 74), 66396#(<= main_~i~0 73), 66399#(<= main_~i~0 76), 66398#(<= main_~i~0 75), 66401#(<= main_~i~0 78), 66400#(<= main_~i~0 77), 66403#(<= main_~i~0 80), 66402#(<= main_~i~0 79), 66405#(<= main_~i~0 82), 66404#(<= main_~i~0 81), 66407#(<= main_~i~0 84), 66406#(<= main_~i~0 83), 66409#(<= main_~i~0 86), 66408#(<= main_~i~0 85), 66411#(<= main_~i~0 88), 66410#(<= main_~i~0 87), 66413#(<= main_~i~0 90), 66412#(<= main_~i~0 89), 66415#(<= main_~i~0 92), 66414#(<= main_~i~0 91), 66417#(<= main_~i~0 94), 66416#(<= main_~i~0 93)] [2018-04-13 03:28:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17681 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:35,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 03:28:35,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 03:28:35,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 03:28:35,144 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 97 states. [2018-04-13 03:28:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:37,500 INFO L93 Difference]: Finished difference Result 872 states and 965 transitions. [2018-04-13 03:28:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 03:28:37,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 396 [2018-04-13 03:28:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:37,501 INFO L225 Difference]: With dead ends: 872 [2018-04-13 03:28:37,501 INFO L226 Difference]: Without dead ends: 872 [2018-04-13 03:28:37,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 03:28:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-04-13 03:28:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 401. [2018-04-13 03:28:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-13 03:28:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-04-13 03:28:37,504 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 396 [2018-04-13 03:28:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:37,504 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-04-13 03:28:37,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 03:28:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-04-13 03:28:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-04-13 03:28:37,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:37,505 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:37,506 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 487100513, now seen corresponding path program 94 times [2018-04-13 03:28:37,506 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:37,519 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18059 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:39,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:39,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-13 03:28:39,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:39,403 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-13 03:28:39,403 INFO L182 omatonBuilderFactory]: Interpolants [67691#true, 67693#(<= main_~i~0 0), 67692#false, 67695#(<= main_~i~0 2), 67694#(<= main_~i~0 1), 67697#(<= main_~i~0 4), 67696#(<= main_~i~0 3), 67699#(<= main_~i~0 6), 67698#(<= main_~i~0 5), 67701#(<= main_~i~0 8), 67700#(<= main_~i~0 7), 67703#(<= main_~i~0 10), 67702#(<= main_~i~0 9), 67705#(<= main_~i~0 12), 67704#(<= main_~i~0 11), 67707#(<= main_~i~0 14), 67706#(<= main_~i~0 13), 67709#(<= main_~i~0 16), 67708#(<= main_~i~0 15), 67711#(<= main_~i~0 18), 67710#(<= main_~i~0 17), 67713#(<= main_~i~0 20), 67712#(<= main_~i~0 19), 67715#(<= main_~i~0 22), 67714#(<= main_~i~0 21), 67717#(<= main_~i~0 24), 67716#(<= main_~i~0 23), 67719#(<= main_~i~0 26), 67718#(<= main_~i~0 25), 67721#(<= main_~i~0 28), 67720#(<= main_~i~0 27), 67723#(<= main_~i~0 30), 67722#(<= main_~i~0 29), 67725#(<= main_~i~0 32), 67724#(<= main_~i~0 31), 67727#(<= main_~i~0 34), 67726#(<= main_~i~0 33), 67729#(<= main_~i~0 36), 67728#(<= main_~i~0 35), 67731#(<= main_~i~0 38), 67730#(<= main_~i~0 37), 67733#(<= main_~i~0 40), 67732#(<= main_~i~0 39), 67735#(<= main_~i~0 42), 67734#(<= main_~i~0 41), 67737#(<= main_~i~0 44), 67736#(<= main_~i~0 43), 67739#(<= main_~i~0 46), 67738#(<= main_~i~0 45), 67741#(<= main_~i~0 48), 67740#(<= main_~i~0 47), 67743#(<= main_~i~0 50), 67742#(<= main_~i~0 49), 67745#(<= main_~i~0 52), 67744#(<= main_~i~0 51), 67747#(<= main_~i~0 54), 67746#(<= main_~i~0 53), 67749#(<= main_~i~0 56), 67748#(<= main_~i~0 55), 67751#(<= main_~i~0 58), 67750#(<= main_~i~0 57), 67753#(<= main_~i~0 60), 67752#(<= main_~i~0 59), 67755#(<= main_~i~0 62), 67754#(<= main_~i~0 61), 67757#(<= main_~i~0 64), 67756#(<= main_~i~0 63), 67759#(<= main_~i~0 66), 67758#(<= main_~i~0 65), 67761#(<= main_~i~0 68), 67760#(<= main_~i~0 67), 67763#(<= main_~i~0 70), 67762#(<= main_~i~0 69), 67765#(<= main_~i~0 72), 67764#(<= main_~i~0 71), 67767#(<= main_~i~0 74), 67766#(<= main_~i~0 73), 67769#(<= main_~i~0 76), 67768#(<= main_~i~0 75), 67771#(<= main_~i~0 78), 67770#(<= main_~i~0 77), 67773#(<= main_~i~0 80), 67772#(<= main_~i~0 79), 67775#(<= main_~i~0 82), 67774#(<= main_~i~0 81), 67777#(<= main_~i~0 84), 67776#(<= main_~i~0 83), 67779#(<= main_~i~0 86), 67778#(<= main_~i~0 85), 67781#(<= main_~i~0 88), 67780#(<= main_~i~0 87), 67783#(<= main_~i~0 90), 67782#(<= main_~i~0 89), 67785#(<= main_~i~0 92), 67784#(<= main_~i~0 91), 67787#(<= main_~i~0 94), 67786#(<= main_~i~0 93), 67788#(<= main_~i~0 95)] [2018-04-13 03:28:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18059 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:39,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 03:28:39,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 03:28:39,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 03:28:39,405 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 98 states. [2018-04-13 03:28:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:41,757 INFO L93 Difference]: Finished difference Result 881 states and 975 transitions. [2018-04-13 03:28:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 03:28:41,757 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 400 [2018-04-13 03:28:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:41,758 INFO L225 Difference]: With dead ends: 881 [2018-04-13 03:28:41,758 INFO L226 Difference]: Without dead ends: 881 [2018-04-13 03:28:41,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 03:28:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-04-13 03:28:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 405. [2018-04-13 03:28:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-13 03:28:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-04-13 03:28:41,762 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 400 [2018-04-13 03:28:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:41,762 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-04-13 03:28:41,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 03:28:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-04-13 03:28:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-13 03:28:41,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:41,764 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:41,764 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 559772506, now seen corresponding path program 95 times [2018-04-13 03:28:41,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:41,776 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18441 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:43,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:43,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 03:28:43,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:43,736 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-13 03:28:43,736 INFO L182 omatonBuilderFactory]: Interpolants [69121#(<= main_~i~0 44), 69120#(<= main_~i~0 43), 69123#(<= main_~i~0 46), 69122#(<= main_~i~0 45), 69125#(<= main_~i~0 48), 69124#(<= main_~i~0 47), 69127#(<= main_~i~0 50), 69126#(<= main_~i~0 49), 69129#(<= main_~i~0 52), 69128#(<= main_~i~0 51), 69131#(<= main_~i~0 54), 69130#(<= main_~i~0 53), 69133#(<= main_~i~0 56), 69132#(<= main_~i~0 55), 69135#(<= main_~i~0 58), 69134#(<= main_~i~0 57), 69137#(<= main_~i~0 60), 69136#(<= main_~i~0 59), 69139#(<= main_~i~0 62), 69138#(<= main_~i~0 61), 69141#(<= main_~i~0 64), 69140#(<= main_~i~0 63), 69143#(<= main_~i~0 66), 69142#(<= main_~i~0 65), 69145#(<= main_~i~0 68), 69144#(<= main_~i~0 67), 69147#(<= main_~i~0 70), 69146#(<= main_~i~0 69), 69149#(<= main_~i~0 72), 69148#(<= main_~i~0 71), 69151#(<= main_~i~0 74), 69150#(<= main_~i~0 73), 69153#(<= main_~i~0 76), 69152#(<= main_~i~0 75), 69155#(<= main_~i~0 78), 69154#(<= main_~i~0 77), 69157#(<= main_~i~0 80), 69156#(<= main_~i~0 79), 69159#(<= main_~i~0 82), 69158#(<= main_~i~0 81), 69161#(<= main_~i~0 84), 69160#(<= main_~i~0 83), 69163#(<= main_~i~0 86), 69162#(<= main_~i~0 85), 69165#(<= main_~i~0 88), 69164#(<= main_~i~0 87), 69167#(<= main_~i~0 90), 69166#(<= main_~i~0 89), 69169#(<= main_~i~0 92), 69168#(<= main_~i~0 91), 69171#(<= main_~i~0 94), 69170#(<= main_~i~0 93), 69173#(<= main_~i~0 96), 69172#(<= main_~i~0 95), 69075#true, 69077#(<= main_~i~0 0), 69076#false, 69079#(<= main_~i~0 2), 69078#(<= main_~i~0 1), 69081#(<= main_~i~0 4), 69080#(<= main_~i~0 3), 69083#(<= main_~i~0 6), 69082#(<= main_~i~0 5), 69085#(<= main_~i~0 8), 69084#(<= main_~i~0 7), 69087#(<= main_~i~0 10), 69086#(<= main_~i~0 9), 69089#(<= main_~i~0 12), 69088#(<= main_~i~0 11), 69091#(<= main_~i~0 14), 69090#(<= main_~i~0 13), 69093#(<= main_~i~0 16), 69092#(<= main_~i~0 15), 69095#(<= main_~i~0 18), 69094#(<= main_~i~0 17), 69097#(<= main_~i~0 20), 69096#(<= main_~i~0 19), 69099#(<= main_~i~0 22), 69098#(<= main_~i~0 21), 69101#(<= main_~i~0 24), 69100#(<= main_~i~0 23), 69103#(<= main_~i~0 26), 69102#(<= main_~i~0 25), 69105#(<= main_~i~0 28), 69104#(<= main_~i~0 27), 69107#(<= main_~i~0 30), 69106#(<= main_~i~0 29), 69109#(<= main_~i~0 32), 69108#(<= main_~i~0 31), 69111#(<= main_~i~0 34), 69110#(<= main_~i~0 33), 69113#(<= main_~i~0 36), 69112#(<= main_~i~0 35), 69115#(<= main_~i~0 38), 69114#(<= main_~i~0 37), 69117#(<= main_~i~0 40), 69116#(<= main_~i~0 39), 69119#(<= main_~i~0 42), 69118#(<= main_~i~0 41)] [2018-04-13 03:28:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18441 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:43,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 03:28:43,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 03:28:43,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 03:28:43,738 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 99 states. [2018-04-13 03:28:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:45,812 INFO L93 Difference]: Finished difference Result 890 states and 985 transitions. [2018-04-13 03:28:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 03:28:45,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 404 [2018-04-13 03:28:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:45,813 INFO L225 Difference]: With dead ends: 890 [2018-04-13 03:28:45,813 INFO L226 Difference]: Without dead ends: 890 [2018-04-13 03:28:45,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 03:28:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-13 03:28:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 409. [2018-04-13 03:28:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-04-13 03:28:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-04-13 03:28:45,817 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 404 [2018-04-13 03:28:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:45,817 INFO L459 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-04-13 03:28:45,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 03:28:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-04-13 03:28:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-04-13 03:28:45,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:45,818 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:45,818 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1512452563, now seen corresponding path program 96 times [2018-04-13 03:28:45,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:45,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18827 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:47,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:47,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-04-13 03:28:47,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:47,793 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-13 03:28:47,793 INFO L182 omatonBuilderFactory]: Interpolants [70473#true, 70475#(<= main_~i~0 0), 70474#false, 70477#(<= main_~i~0 2), 70476#(<= main_~i~0 1), 70479#(<= main_~i~0 4), 70478#(<= main_~i~0 3), 70481#(<= main_~i~0 6), 70480#(<= main_~i~0 5), 70483#(<= main_~i~0 8), 70482#(<= main_~i~0 7), 70485#(<= main_~i~0 10), 70484#(<= main_~i~0 9), 70487#(<= main_~i~0 12), 70486#(<= main_~i~0 11), 70489#(<= main_~i~0 14), 70488#(<= main_~i~0 13), 70491#(<= main_~i~0 16), 70490#(<= main_~i~0 15), 70493#(<= main_~i~0 18), 70492#(<= main_~i~0 17), 70495#(<= main_~i~0 20), 70494#(<= main_~i~0 19), 70497#(<= main_~i~0 22), 70496#(<= main_~i~0 21), 70499#(<= main_~i~0 24), 70498#(<= main_~i~0 23), 70501#(<= main_~i~0 26), 70500#(<= main_~i~0 25), 70503#(<= main_~i~0 28), 70502#(<= main_~i~0 27), 70505#(<= main_~i~0 30), 70504#(<= main_~i~0 29), 70507#(<= main_~i~0 32), 70506#(<= main_~i~0 31), 70509#(<= main_~i~0 34), 70508#(<= main_~i~0 33), 70511#(<= main_~i~0 36), 70510#(<= main_~i~0 35), 70513#(<= main_~i~0 38), 70512#(<= main_~i~0 37), 70515#(<= main_~i~0 40), 70514#(<= main_~i~0 39), 70517#(<= main_~i~0 42), 70516#(<= main_~i~0 41), 70519#(<= main_~i~0 44), 70518#(<= main_~i~0 43), 70521#(<= main_~i~0 46), 70520#(<= main_~i~0 45), 70523#(<= main_~i~0 48), 70522#(<= main_~i~0 47), 70525#(<= main_~i~0 50), 70524#(<= main_~i~0 49), 70527#(<= main_~i~0 52), 70526#(<= main_~i~0 51), 70529#(<= main_~i~0 54), 70528#(<= main_~i~0 53), 70531#(<= main_~i~0 56), 70530#(<= main_~i~0 55), 70533#(<= main_~i~0 58), 70532#(<= main_~i~0 57), 70535#(<= main_~i~0 60), 70534#(<= main_~i~0 59), 70537#(<= main_~i~0 62), 70536#(<= main_~i~0 61), 70539#(<= main_~i~0 64), 70538#(<= main_~i~0 63), 70541#(<= main_~i~0 66), 70540#(<= main_~i~0 65), 70543#(<= main_~i~0 68), 70542#(<= main_~i~0 67), 70545#(<= main_~i~0 70), 70544#(<= main_~i~0 69), 70547#(<= main_~i~0 72), 70546#(<= main_~i~0 71), 70549#(<= main_~i~0 74), 70548#(<= main_~i~0 73), 70551#(<= main_~i~0 76), 70550#(<= main_~i~0 75), 70553#(<= main_~i~0 78), 70552#(<= main_~i~0 77), 70555#(<= main_~i~0 80), 70554#(<= main_~i~0 79), 70557#(<= main_~i~0 82), 70556#(<= main_~i~0 81), 70559#(<= main_~i~0 84), 70558#(<= main_~i~0 83), 70561#(<= main_~i~0 86), 70560#(<= main_~i~0 85), 70563#(<= main_~i~0 88), 70562#(<= main_~i~0 87), 70565#(<= main_~i~0 90), 70564#(<= main_~i~0 89), 70567#(<= main_~i~0 92), 70566#(<= main_~i~0 91), 70569#(<= main_~i~0 94), 70568#(<= main_~i~0 93), 70571#(<= main_~i~0 96), 70570#(<= main_~i~0 95), 70572#(<= main_~i~0 97)] [2018-04-13 03:28:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18827 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:47,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 03:28:47,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 03:28:47,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 03:28:47,795 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 100 states. [2018-04-13 03:28:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:49,877 INFO L93 Difference]: Finished difference Result 899 states and 995 transitions. [2018-04-13 03:28:49,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 03:28:49,878 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 408 [2018-04-13 03:28:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:49,879 INFO L225 Difference]: With dead ends: 899 [2018-04-13 03:28:49,879 INFO L226 Difference]: Without dead ends: 899 [2018-04-13 03:28:49,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 03:28:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-13 03:28:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 413. [2018-04-13 03:28:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-13 03:28:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-04-13 03:28:49,882 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 408 [2018-04-13 03:28:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:49,882 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-04-13 03:28:49,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 03:28:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-04-13 03:28:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 03:28:49,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:49,883 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:49,883 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1795754956, now seen corresponding path program 97 times [2018-04-13 03:28:49,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:49,894 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 19217 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:51,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:51,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-04-13 03:28:51,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:51,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-13 03:28:51,952 INFO L182 omatonBuilderFactory]: Interpolants [71937#(<= main_~i~0 50), 71936#(<= main_~i~0 49), 71939#(<= main_~i~0 52), 71938#(<= main_~i~0 51), 71941#(<= main_~i~0 54), 71940#(<= main_~i~0 53), 71943#(<= main_~i~0 56), 71942#(<= main_~i~0 55), 71945#(<= main_~i~0 58), 71944#(<= main_~i~0 57), 71947#(<= main_~i~0 60), 71946#(<= main_~i~0 59), 71949#(<= main_~i~0 62), 71948#(<= main_~i~0 61), 71951#(<= main_~i~0 64), 71950#(<= main_~i~0 63), 71953#(<= main_~i~0 66), 71952#(<= main_~i~0 65), 71955#(<= main_~i~0 68), 71954#(<= main_~i~0 67), 71957#(<= main_~i~0 70), 71956#(<= main_~i~0 69), 71959#(<= main_~i~0 72), 71958#(<= main_~i~0 71), 71961#(<= main_~i~0 74), 71960#(<= main_~i~0 73), 71963#(<= main_~i~0 76), 71962#(<= main_~i~0 75), 71965#(<= main_~i~0 78), 71964#(<= main_~i~0 77), 71967#(<= main_~i~0 80), 71966#(<= main_~i~0 79), 71969#(<= main_~i~0 82), 71968#(<= main_~i~0 81), 71971#(<= main_~i~0 84), 71970#(<= main_~i~0 83), 71973#(<= main_~i~0 86), 71972#(<= main_~i~0 85), 71975#(<= main_~i~0 88), 71974#(<= main_~i~0 87), 71977#(<= main_~i~0 90), 71976#(<= main_~i~0 89), 71979#(<= main_~i~0 92), 71978#(<= main_~i~0 91), 71981#(<= main_~i~0 94), 71980#(<= main_~i~0 93), 71983#(<= main_~i~0 96), 71982#(<= main_~i~0 95), 71985#(<= main_~i~0 98), 71984#(<= main_~i~0 97), 71885#true, 71887#(<= main_~i~0 0), 71886#false, 71889#(<= main_~i~0 2), 71888#(<= main_~i~0 1), 71891#(<= main_~i~0 4), 71890#(<= main_~i~0 3), 71893#(<= main_~i~0 6), 71892#(<= main_~i~0 5), 71895#(<= main_~i~0 8), 71894#(<= main_~i~0 7), 71897#(<= main_~i~0 10), 71896#(<= main_~i~0 9), 71899#(<= main_~i~0 12), 71898#(<= main_~i~0 11), 71901#(<= main_~i~0 14), 71900#(<= main_~i~0 13), 71903#(<= main_~i~0 16), 71902#(<= main_~i~0 15), 71905#(<= main_~i~0 18), 71904#(<= main_~i~0 17), 71907#(<= main_~i~0 20), 71906#(<= main_~i~0 19), 71909#(<= main_~i~0 22), 71908#(<= main_~i~0 21), 71911#(<= main_~i~0 24), 71910#(<= main_~i~0 23), 71913#(<= main_~i~0 26), 71912#(<= main_~i~0 25), 71915#(<= main_~i~0 28), 71914#(<= main_~i~0 27), 71917#(<= main_~i~0 30), 71916#(<= main_~i~0 29), 71919#(<= main_~i~0 32), 71918#(<= main_~i~0 31), 71921#(<= main_~i~0 34), 71920#(<= main_~i~0 33), 71923#(<= main_~i~0 36), 71922#(<= main_~i~0 35), 71925#(<= main_~i~0 38), 71924#(<= main_~i~0 37), 71927#(<= main_~i~0 40), 71926#(<= main_~i~0 39), 71929#(<= main_~i~0 42), 71928#(<= main_~i~0 41), 71931#(<= main_~i~0 44), 71930#(<= main_~i~0 43), 71933#(<= main_~i~0 46), 71932#(<= main_~i~0 45), 71935#(<= main_~i~0 48), 71934#(<= main_~i~0 47)] [2018-04-13 03:28:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19217 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:51,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 03:28:51,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 03:28:51,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 03:28:51,953 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 101 states. [2018-04-13 03:28:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:53,825 INFO L93 Difference]: Finished difference Result 908 states and 1005 transitions. [2018-04-13 03:28:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 03:28:53,825 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 412 [2018-04-13 03:28:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:53,826 INFO L225 Difference]: With dead ends: 908 [2018-04-13 03:28:53,826 INFO L226 Difference]: Without dead ends: 908 [2018-04-13 03:28:53,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 03:28:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-04-13 03:28:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 417. [2018-04-13 03:28:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-13 03:28:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-04-13 03:28:53,829 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 412 [2018-04-13 03:28:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:53,829 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-04-13 03:28:53,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 03:28:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-04-13 03:28:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-04-13 03:28:53,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:53,830 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:53,830 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 982270277, now seen corresponding path program 98 times [2018-04-13 03:28:53,831 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:53,842 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:28:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19611 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:55,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:28:55,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-04-13 03:28:55,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:28:55,837 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-13 03:28:55,837 INFO L182 omatonBuilderFactory]: Interpolants [73311#true, 73313#(<= main_~i~0 0), 73312#false, 73315#(<= main_~i~0 2), 73314#(<= main_~i~0 1), 73317#(<= main_~i~0 4), 73316#(<= main_~i~0 3), 73319#(<= main_~i~0 6), 73318#(<= main_~i~0 5), 73321#(<= main_~i~0 8), 73320#(<= main_~i~0 7), 73323#(<= main_~i~0 10), 73322#(<= main_~i~0 9), 73325#(<= main_~i~0 12), 73324#(<= main_~i~0 11), 73327#(<= main_~i~0 14), 73326#(<= main_~i~0 13), 73329#(<= main_~i~0 16), 73328#(<= main_~i~0 15), 73331#(<= main_~i~0 18), 73330#(<= main_~i~0 17), 73333#(<= main_~i~0 20), 73332#(<= main_~i~0 19), 73335#(<= main_~i~0 22), 73334#(<= main_~i~0 21), 73337#(<= main_~i~0 24), 73336#(<= main_~i~0 23), 73339#(<= main_~i~0 26), 73338#(<= main_~i~0 25), 73341#(<= main_~i~0 28), 73340#(<= main_~i~0 27), 73343#(<= main_~i~0 30), 73342#(<= main_~i~0 29), 73345#(<= main_~i~0 32), 73344#(<= main_~i~0 31), 73347#(<= main_~i~0 34), 73346#(<= main_~i~0 33), 73349#(<= main_~i~0 36), 73348#(<= main_~i~0 35), 73351#(<= main_~i~0 38), 73350#(<= main_~i~0 37), 73353#(<= main_~i~0 40), 73352#(<= main_~i~0 39), 73355#(<= main_~i~0 42), 73354#(<= main_~i~0 41), 73357#(<= main_~i~0 44), 73356#(<= main_~i~0 43), 73359#(<= main_~i~0 46), 73358#(<= main_~i~0 45), 73361#(<= main_~i~0 48), 73360#(<= main_~i~0 47), 73363#(<= main_~i~0 50), 73362#(<= main_~i~0 49), 73365#(<= main_~i~0 52), 73364#(<= main_~i~0 51), 73367#(<= main_~i~0 54), 73366#(<= main_~i~0 53), 73369#(<= main_~i~0 56), 73368#(<= main_~i~0 55), 73371#(<= main_~i~0 58), 73370#(<= main_~i~0 57), 73373#(<= main_~i~0 60), 73372#(<= main_~i~0 59), 73375#(<= main_~i~0 62), 73374#(<= main_~i~0 61), 73377#(<= main_~i~0 64), 73376#(<= main_~i~0 63), 73379#(<= main_~i~0 66), 73378#(<= main_~i~0 65), 73381#(<= main_~i~0 68), 73380#(<= main_~i~0 67), 73383#(<= main_~i~0 70), 73382#(<= main_~i~0 69), 73385#(<= main_~i~0 72), 73384#(<= main_~i~0 71), 73387#(<= main_~i~0 74), 73386#(<= main_~i~0 73), 73389#(<= main_~i~0 76), 73388#(<= main_~i~0 75), 73391#(<= main_~i~0 78), 73390#(<= main_~i~0 77), 73393#(<= main_~i~0 80), 73392#(<= main_~i~0 79), 73395#(<= main_~i~0 82), 73394#(<= main_~i~0 81), 73397#(<= main_~i~0 84), 73396#(<= main_~i~0 83), 73399#(<= main_~i~0 86), 73398#(<= main_~i~0 85), 73401#(<= main_~i~0 88), 73400#(<= main_~i~0 87), 73403#(<= main_~i~0 90), 73402#(<= main_~i~0 89), 73405#(<= main_~i~0 92), 73404#(<= main_~i~0 91), 73407#(<= main_~i~0 94), 73406#(<= main_~i~0 93), 73409#(<= main_~i~0 96), 73408#(<= main_~i~0 95), 73411#(<= main_~i~0 98), 73410#(<= main_~i~0 97), 73412#(<= main_~i~0 99)] [2018-04-13 03:28:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19611 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:28:55,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-13 03:28:55,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-13 03:28:55,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 03:28:55,839 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 102 states. [2018-04-13 03:28:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:28:57,982 INFO L93 Difference]: Finished difference Result 917 states and 1015 transitions. [2018-04-13 03:28:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 03:28:57,983 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 416 [2018-04-13 03:28:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:28:57,983 INFO L225 Difference]: With dead ends: 917 [2018-04-13 03:28:57,983 INFO L226 Difference]: Without dead ends: 917 [2018-04-13 03:28:57,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 03:28:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-13 03:28:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 421. [2018-04-13 03:28:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-13 03:28:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-04-13 03:28:57,986 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 416 [2018-04-13 03:28:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:28:57,986 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-04-13 03:28:57,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-13 03:28:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-04-13 03:28:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-04-13 03:28:57,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:28:57,987 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:28:57,987 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:28:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2112482754, now seen corresponding path program 99 times [2018-04-13 03:28:57,988 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:28:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:28:57,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20009 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:00,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:00,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-04-13 03:29:00,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:00,046 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-13 03:29:00,046 INFO L182 omatonBuilderFactory]: Interpolants [74753#(<= main_~i~0 0), 74752#false, 74755#(<= main_~i~0 2), 74754#(<= main_~i~0 1), 74757#(<= main_~i~0 4), 74756#(<= main_~i~0 3), 74759#(<= main_~i~0 6), 74758#(<= main_~i~0 5), 74761#(<= main_~i~0 8), 74760#(<= main_~i~0 7), 74763#(<= main_~i~0 10), 74762#(<= main_~i~0 9), 74765#(<= main_~i~0 12), 74764#(<= main_~i~0 11), 74767#(<= main_~i~0 14), 74766#(<= main_~i~0 13), 74769#(<= main_~i~0 16), 74768#(<= main_~i~0 15), 74771#(<= main_~i~0 18), 74770#(<= main_~i~0 17), 74773#(<= main_~i~0 20), 74772#(<= main_~i~0 19), 74775#(<= main_~i~0 22), 74774#(<= main_~i~0 21), 74777#(<= main_~i~0 24), 74776#(<= main_~i~0 23), 74779#(<= main_~i~0 26), 74778#(<= main_~i~0 25), 74781#(<= main_~i~0 28), 74780#(<= main_~i~0 27), 74783#(<= main_~i~0 30), 74782#(<= main_~i~0 29), 74785#(<= main_~i~0 32), 74784#(<= main_~i~0 31), 74787#(<= main_~i~0 34), 74786#(<= main_~i~0 33), 74789#(<= main_~i~0 36), 74788#(<= main_~i~0 35), 74791#(<= main_~i~0 38), 74790#(<= main_~i~0 37), 74793#(<= main_~i~0 40), 74792#(<= main_~i~0 39), 74795#(<= main_~i~0 42), 74794#(<= main_~i~0 41), 74797#(<= main_~i~0 44), 74796#(<= main_~i~0 43), 74799#(<= main_~i~0 46), 74798#(<= main_~i~0 45), 74801#(<= main_~i~0 48), 74800#(<= main_~i~0 47), 74803#(<= main_~i~0 50), 74802#(<= main_~i~0 49), 74805#(<= main_~i~0 52), 74804#(<= main_~i~0 51), 74807#(<= main_~i~0 54), 74806#(<= main_~i~0 53), 74809#(<= main_~i~0 56), 74808#(<= main_~i~0 55), 74811#(<= main_~i~0 58), 74810#(<= main_~i~0 57), 74813#(<= main_~i~0 60), 74812#(<= main_~i~0 59), 74815#(<= main_~i~0 62), 74814#(<= main_~i~0 61), 74817#(<= main_~i~0 64), 74816#(<= main_~i~0 63), 74819#(<= main_~i~0 66), 74818#(<= main_~i~0 65), 74821#(<= main_~i~0 68), 74820#(<= main_~i~0 67), 74823#(<= main_~i~0 70), 74822#(<= main_~i~0 69), 74825#(<= main_~i~0 72), 74824#(<= main_~i~0 71), 74827#(<= main_~i~0 74), 74826#(<= main_~i~0 73), 74829#(<= main_~i~0 76), 74828#(<= main_~i~0 75), 74831#(<= main_~i~0 78), 74830#(<= main_~i~0 77), 74833#(<= main_~i~0 80), 74832#(<= main_~i~0 79), 74835#(<= main_~i~0 82), 74834#(<= main_~i~0 81), 74837#(<= main_~i~0 84), 74836#(<= main_~i~0 83), 74839#(<= main_~i~0 86), 74838#(<= main_~i~0 85), 74841#(<= main_~i~0 88), 74840#(<= main_~i~0 87), 74843#(<= main_~i~0 90), 74842#(<= main_~i~0 89), 74845#(<= main_~i~0 92), 74844#(<= main_~i~0 91), 74847#(<= main_~i~0 94), 74846#(<= main_~i~0 93), 74849#(<= main_~i~0 96), 74848#(<= main_~i~0 95), 74851#(<= main_~i~0 98), 74850#(<= main_~i~0 97), 74853#(<= main_~i~0 100), 74852#(<= main_~i~0 99), 74751#true] [2018-04-13 03:29:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20009 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:00,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-13 03:29:00,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-13 03:29:00,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 03:29:00,048 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 103 states. [2018-04-13 03:29:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:03,668 INFO L93 Difference]: Finished difference Result 926 states and 1025 transitions. [2018-04-13 03:29:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-13 03:29:03,669 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 420 [2018-04-13 03:29:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:03,670 INFO L225 Difference]: With dead ends: 926 [2018-04-13 03:29:03,670 INFO L226 Difference]: Without dead ends: 926 [2018-04-13 03:29:03,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 03:29:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-04-13 03:29:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 425. [2018-04-13 03:29:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-13 03:29:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-04-13 03:29:03,674 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 420 [2018-04-13 03:29:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:03,675 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-04-13 03:29:03,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-13 03:29:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-04-13 03:29:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-13 03:29:03,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:03,676 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:03,677 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1575796407, now seen corresponding path program 100 times [2018-04-13 03:29:03,677 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:03,694 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20411 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:05,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:05,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-04-13 03:29:05,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:05,797 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-13 03:29:05,797 INFO L182 omatonBuilderFactory]: Interpolants [76289#(<= main_~i~0 82), 76288#(<= main_~i~0 81), 76291#(<= main_~i~0 84), 76290#(<= main_~i~0 83), 76293#(<= main_~i~0 86), 76292#(<= main_~i~0 85), 76295#(<= main_~i~0 88), 76294#(<= main_~i~0 87), 76297#(<= main_~i~0 90), 76296#(<= main_~i~0 89), 76299#(<= main_~i~0 92), 76298#(<= main_~i~0 91), 76301#(<= main_~i~0 94), 76300#(<= main_~i~0 93), 76303#(<= main_~i~0 96), 76302#(<= main_~i~0 95), 76305#(<= main_~i~0 98), 76304#(<= main_~i~0 97), 76307#(<= main_~i~0 100), 76306#(<= main_~i~0 99), 76308#(<= main_~i~0 101), 76205#true, 76207#(<= main_~i~0 0), 76206#false, 76209#(<= main_~i~0 2), 76208#(<= main_~i~0 1), 76211#(<= main_~i~0 4), 76210#(<= main_~i~0 3), 76213#(<= main_~i~0 6), 76212#(<= main_~i~0 5), 76215#(<= main_~i~0 8), 76214#(<= main_~i~0 7), 76217#(<= main_~i~0 10), 76216#(<= main_~i~0 9), 76219#(<= main_~i~0 12), 76218#(<= main_~i~0 11), 76221#(<= main_~i~0 14), 76220#(<= main_~i~0 13), 76223#(<= main_~i~0 16), 76222#(<= main_~i~0 15), 76225#(<= main_~i~0 18), 76224#(<= main_~i~0 17), 76227#(<= main_~i~0 20), 76226#(<= main_~i~0 19), 76229#(<= main_~i~0 22), 76228#(<= main_~i~0 21), 76231#(<= main_~i~0 24), 76230#(<= main_~i~0 23), 76233#(<= main_~i~0 26), 76232#(<= main_~i~0 25), 76235#(<= main_~i~0 28), 76234#(<= main_~i~0 27), 76237#(<= main_~i~0 30), 76236#(<= main_~i~0 29), 76239#(<= main_~i~0 32), 76238#(<= main_~i~0 31), 76241#(<= main_~i~0 34), 76240#(<= main_~i~0 33), 76243#(<= main_~i~0 36), 76242#(<= main_~i~0 35), 76245#(<= main_~i~0 38), 76244#(<= main_~i~0 37), 76247#(<= main_~i~0 40), 76246#(<= main_~i~0 39), 76249#(<= main_~i~0 42), 76248#(<= main_~i~0 41), 76251#(<= main_~i~0 44), 76250#(<= main_~i~0 43), 76253#(<= main_~i~0 46), 76252#(<= main_~i~0 45), 76255#(<= main_~i~0 48), 76254#(<= main_~i~0 47), 76257#(<= main_~i~0 50), 76256#(<= main_~i~0 49), 76259#(<= main_~i~0 52), 76258#(<= main_~i~0 51), 76261#(<= main_~i~0 54), 76260#(<= main_~i~0 53), 76263#(<= main_~i~0 56), 76262#(<= main_~i~0 55), 76265#(<= main_~i~0 58), 76264#(<= main_~i~0 57), 76267#(<= main_~i~0 60), 76266#(<= main_~i~0 59), 76269#(<= main_~i~0 62), 76268#(<= main_~i~0 61), 76271#(<= main_~i~0 64), 76270#(<= main_~i~0 63), 76273#(<= main_~i~0 66), 76272#(<= main_~i~0 65), 76275#(<= main_~i~0 68), 76274#(<= main_~i~0 67), 76277#(<= main_~i~0 70), 76276#(<= main_~i~0 69), 76279#(<= main_~i~0 72), 76278#(<= main_~i~0 71), 76281#(<= main_~i~0 74), 76280#(<= main_~i~0 73), 76283#(<= main_~i~0 76), 76282#(<= main_~i~0 75), 76285#(<= main_~i~0 78), 76284#(<= main_~i~0 77), 76287#(<= main_~i~0 80), 76286#(<= main_~i~0 79)] [2018-04-13 03:29:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20411 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:05,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-04-13 03:29:05,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-04-13 03:29:05,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 03:29:05,799 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 104 states. [2018-04-13 03:29:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:08,601 INFO L93 Difference]: Finished difference Result 935 states and 1035 transitions. [2018-04-13 03:29:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 03:29:08,602 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 424 [2018-04-13 03:29:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:08,603 INFO L225 Difference]: With dead ends: 935 [2018-04-13 03:29:08,603 INFO L226 Difference]: Without dead ends: 935 [2018-04-13 03:29:08,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-04-13 03:29:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-04-13 03:29:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 429. [2018-04-13 03:29:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-13 03:29:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-04-13 03:29:08,607 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 424 [2018-04-13 03:29:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:08,607 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-04-13 03:29:08,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-04-13 03:29:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-04-13 03:29:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-04-13 03:29:08,608 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:08,608 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:08,609 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash -583629136, now seen corresponding path program 101 times [2018-04-13 03:29:08,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:08,621 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20817 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:10,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:10,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-04-13 03:29:10,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:10,844 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-13 03:29:10,845 INFO L182 omatonBuilderFactory]: Interpolants [77673#true, 77675#(<= main_~i~0 0), 77674#false, 77677#(<= main_~i~0 2), 77676#(<= main_~i~0 1), 77679#(<= main_~i~0 4), 77678#(<= main_~i~0 3), 77681#(<= main_~i~0 6), 77680#(<= main_~i~0 5), 77683#(<= main_~i~0 8), 77682#(<= main_~i~0 7), 77685#(<= main_~i~0 10), 77684#(<= main_~i~0 9), 77687#(<= main_~i~0 12), 77686#(<= main_~i~0 11), 77689#(<= main_~i~0 14), 77688#(<= main_~i~0 13), 77691#(<= main_~i~0 16), 77690#(<= main_~i~0 15), 77693#(<= main_~i~0 18), 77692#(<= main_~i~0 17), 77695#(<= main_~i~0 20), 77694#(<= main_~i~0 19), 77697#(<= main_~i~0 22), 77696#(<= main_~i~0 21), 77699#(<= main_~i~0 24), 77698#(<= main_~i~0 23), 77701#(<= main_~i~0 26), 77700#(<= main_~i~0 25), 77703#(<= main_~i~0 28), 77702#(<= main_~i~0 27), 77705#(<= main_~i~0 30), 77704#(<= main_~i~0 29), 77707#(<= main_~i~0 32), 77706#(<= main_~i~0 31), 77709#(<= main_~i~0 34), 77708#(<= main_~i~0 33), 77711#(<= main_~i~0 36), 77710#(<= main_~i~0 35), 77713#(<= main_~i~0 38), 77712#(<= main_~i~0 37), 77715#(<= main_~i~0 40), 77714#(<= main_~i~0 39), 77717#(<= main_~i~0 42), 77716#(<= main_~i~0 41), 77719#(<= main_~i~0 44), 77718#(<= main_~i~0 43), 77721#(<= main_~i~0 46), 77720#(<= main_~i~0 45), 77723#(<= main_~i~0 48), 77722#(<= main_~i~0 47), 77725#(<= main_~i~0 50), 77724#(<= main_~i~0 49), 77727#(<= main_~i~0 52), 77726#(<= main_~i~0 51), 77729#(<= main_~i~0 54), 77728#(<= main_~i~0 53), 77731#(<= main_~i~0 56), 77730#(<= main_~i~0 55), 77733#(<= main_~i~0 58), 77732#(<= main_~i~0 57), 77735#(<= main_~i~0 60), 77734#(<= main_~i~0 59), 77737#(<= main_~i~0 62), 77736#(<= main_~i~0 61), 77739#(<= main_~i~0 64), 77738#(<= main_~i~0 63), 77741#(<= main_~i~0 66), 77740#(<= main_~i~0 65), 77743#(<= main_~i~0 68), 77742#(<= main_~i~0 67), 77745#(<= main_~i~0 70), 77744#(<= main_~i~0 69), 77747#(<= main_~i~0 72), 77746#(<= main_~i~0 71), 77749#(<= main_~i~0 74), 77748#(<= main_~i~0 73), 77751#(<= main_~i~0 76), 77750#(<= main_~i~0 75), 77753#(<= main_~i~0 78), 77752#(<= main_~i~0 77), 77755#(<= main_~i~0 80), 77754#(<= main_~i~0 79), 77757#(<= main_~i~0 82), 77756#(<= main_~i~0 81), 77759#(<= main_~i~0 84), 77758#(<= main_~i~0 83), 77761#(<= main_~i~0 86), 77760#(<= main_~i~0 85), 77763#(<= main_~i~0 88), 77762#(<= main_~i~0 87), 77765#(<= main_~i~0 90), 77764#(<= main_~i~0 89), 77767#(<= main_~i~0 92), 77766#(<= main_~i~0 91), 77769#(<= main_~i~0 94), 77768#(<= main_~i~0 93), 77771#(<= main_~i~0 96), 77770#(<= main_~i~0 95), 77773#(<= main_~i~0 98), 77772#(<= main_~i~0 97), 77775#(<= main_~i~0 100), 77774#(<= main_~i~0 99), 77777#(<= main_~i~0 102), 77776#(<= main_~i~0 101)] [2018-04-13 03:29:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20817 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:10,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-13 03:29:10,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-13 03:29:10,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 03:29:10,847 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 105 states. [2018-04-13 03:29:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:13,676 INFO L93 Difference]: Finished difference Result 944 states and 1045 transitions. [2018-04-13 03:29:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-13 03:29:13,676 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 428 [2018-04-13 03:29:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:13,677 INFO L225 Difference]: With dead ends: 944 [2018-04-13 03:29:13,677 INFO L226 Difference]: Without dead ends: 944 [2018-04-13 03:29:13,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 03:29:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-13 03:29:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 433. [2018-04-13 03:29:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-13 03:29:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-04-13 03:29:13,680 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 428 [2018-04-13 03:29:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:13,680 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-04-13 03:29:13,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-13 03:29:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-04-13 03:29:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-13 03:29:13,681 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:13,681 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:13,681 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1845908951, now seen corresponding path program 102 times [2018-04-13 03:29:13,682 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:13,693 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21227 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:15,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:15,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-04-13 03:29:15,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:15,919 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-13 03:29:15,919 INFO L182 omatonBuilderFactory]: Interpolants [79155#true, 79157#(<= main_~i~0 0), 79156#false, 79159#(<= main_~i~0 2), 79158#(<= main_~i~0 1), 79161#(<= main_~i~0 4), 79160#(<= main_~i~0 3), 79163#(<= main_~i~0 6), 79162#(<= main_~i~0 5), 79165#(<= main_~i~0 8), 79164#(<= main_~i~0 7), 79167#(<= main_~i~0 10), 79166#(<= main_~i~0 9), 79169#(<= main_~i~0 12), 79168#(<= main_~i~0 11), 79171#(<= main_~i~0 14), 79170#(<= main_~i~0 13), 79173#(<= main_~i~0 16), 79172#(<= main_~i~0 15), 79175#(<= main_~i~0 18), 79174#(<= main_~i~0 17), 79177#(<= main_~i~0 20), 79176#(<= main_~i~0 19), 79179#(<= main_~i~0 22), 79178#(<= main_~i~0 21), 79181#(<= main_~i~0 24), 79180#(<= main_~i~0 23), 79183#(<= main_~i~0 26), 79182#(<= main_~i~0 25), 79185#(<= main_~i~0 28), 79184#(<= main_~i~0 27), 79187#(<= main_~i~0 30), 79186#(<= main_~i~0 29), 79189#(<= main_~i~0 32), 79188#(<= main_~i~0 31), 79191#(<= main_~i~0 34), 79190#(<= main_~i~0 33), 79193#(<= main_~i~0 36), 79192#(<= main_~i~0 35), 79195#(<= main_~i~0 38), 79194#(<= main_~i~0 37), 79197#(<= main_~i~0 40), 79196#(<= main_~i~0 39), 79199#(<= main_~i~0 42), 79198#(<= main_~i~0 41), 79201#(<= main_~i~0 44), 79200#(<= main_~i~0 43), 79203#(<= main_~i~0 46), 79202#(<= main_~i~0 45), 79205#(<= main_~i~0 48), 79204#(<= main_~i~0 47), 79207#(<= main_~i~0 50), 79206#(<= main_~i~0 49), 79209#(<= main_~i~0 52), 79208#(<= main_~i~0 51), 79211#(<= main_~i~0 54), 79210#(<= main_~i~0 53), 79213#(<= main_~i~0 56), 79212#(<= main_~i~0 55), 79215#(<= main_~i~0 58), 79214#(<= main_~i~0 57), 79217#(<= main_~i~0 60), 79216#(<= main_~i~0 59), 79219#(<= main_~i~0 62), 79218#(<= main_~i~0 61), 79221#(<= main_~i~0 64), 79220#(<= main_~i~0 63), 79223#(<= main_~i~0 66), 79222#(<= main_~i~0 65), 79225#(<= main_~i~0 68), 79224#(<= main_~i~0 67), 79227#(<= main_~i~0 70), 79226#(<= main_~i~0 69), 79229#(<= main_~i~0 72), 79228#(<= main_~i~0 71), 79231#(<= main_~i~0 74), 79230#(<= main_~i~0 73), 79233#(<= main_~i~0 76), 79232#(<= main_~i~0 75), 79235#(<= main_~i~0 78), 79234#(<= main_~i~0 77), 79237#(<= main_~i~0 80), 79236#(<= main_~i~0 79), 79239#(<= main_~i~0 82), 79238#(<= main_~i~0 81), 79241#(<= main_~i~0 84), 79240#(<= main_~i~0 83), 79243#(<= main_~i~0 86), 79242#(<= main_~i~0 85), 79245#(<= main_~i~0 88), 79244#(<= main_~i~0 87), 79247#(<= main_~i~0 90), 79246#(<= main_~i~0 89), 79249#(<= main_~i~0 92), 79248#(<= main_~i~0 91), 79251#(<= main_~i~0 94), 79250#(<= main_~i~0 93), 79253#(<= main_~i~0 96), 79252#(<= main_~i~0 95), 79255#(<= main_~i~0 98), 79254#(<= main_~i~0 97), 79257#(<= main_~i~0 100), 79256#(<= main_~i~0 99), 79259#(<= main_~i~0 102), 79258#(<= main_~i~0 101), 79260#(<= main_~i~0 103)] [2018-04-13 03:29:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21227 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:15,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-13 03:29:15,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-13 03:29:15,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 03:29:15,921 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 106 states. [2018-04-13 03:29:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:18,749 INFO L93 Difference]: Finished difference Result 953 states and 1055 transitions. [2018-04-13 03:29:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-04-13 03:29:18,749 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 432 [2018-04-13 03:29:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:18,750 INFO L225 Difference]: With dead ends: 953 [2018-04-13 03:29:18,750 INFO L226 Difference]: Without dead ends: 953 [2018-04-13 03:29:18,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 03:29:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-04-13 03:29:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 437. [2018-04-13 03:29:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-13 03:29:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-04-13 03:29:18,753 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 432 [2018-04-13 03:29:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:18,753 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-04-13 03:29:18,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-13 03:29:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-04-13 03:29:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-13 03:29:18,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:18,754 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:18,754 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 555510050, now seen corresponding path program 103 times [2018-04-13 03:29:18,755 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:18,766 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21641 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:21,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:21,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-04-13 03:29:21,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:21,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-13 03:29:21,008 INFO L182 omatonBuilderFactory]: Interpolants [80651#true, 80653#(<= main_~i~0 0), 80652#false, 80655#(<= main_~i~0 2), 80654#(<= main_~i~0 1), 80657#(<= main_~i~0 4), 80656#(<= main_~i~0 3), 80659#(<= main_~i~0 6), 80658#(<= main_~i~0 5), 80661#(<= main_~i~0 8), 80660#(<= main_~i~0 7), 80663#(<= main_~i~0 10), 80662#(<= main_~i~0 9), 80665#(<= main_~i~0 12), 80664#(<= main_~i~0 11), 80667#(<= main_~i~0 14), 80666#(<= main_~i~0 13), 80669#(<= main_~i~0 16), 80668#(<= main_~i~0 15), 80671#(<= main_~i~0 18), 80670#(<= main_~i~0 17), 80673#(<= main_~i~0 20), 80672#(<= main_~i~0 19), 80675#(<= main_~i~0 22), 80674#(<= main_~i~0 21), 80677#(<= main_~i~0 24), 80676#(<= main_~i~0 23), 80679#(<= main_~i~0 26), 80678#(<= main_~i~0 25), 80681#(<= main_~i~0 28), 80680#(<= main_~i~0 27), 80683#(<= main_~i~0 30), 80682#(<= main_~i~0 29), 80685#(<= main_~i~0 32), 80684#(<= main_~i~0 31), 80687#(<= main_~i~0 34), 80686#(<= main_~i~0 33), 80689#(<= main_~i~0 36), 80688#(<= main_~i~0 35), 80691#(<= main_~i~0 38), 80690#(<= main_~i~0 37), 80693#(<= main_~i~0 40), 80692#(<= main_~i~0 39), 80695#(<= main_~i~0 42), 80694#(<= main_~i~0 41), 80697#(<= main_~i~0 44), 80696#(<= main_~i~0 43), 80699#(<= main_~i~0 46), 80698#(<= main_~i~0 45), 80701#(<= main_~i~0 48), 80700#(<= main_~i~0 47), 80703#(<= main_~i~0 50), 80702#(<= main_~i~0 49), 80705#(<= main_~i~0 52), 80704#(<= main_~i~0 51), 80707#(<= main_~i~0 54), 80706#(<= main_~i~0 53), 80709#(<= main_~i~0 56), 80708#(<= main_~i~0 55), 80711#(<= main_~i~0 58), 80710#(<= main_~i~0 57), 80713#(<= main_~i~0 60), 80712#(<= main_~i~0 59), 80715#(<= main_~i~0 62), 80714#(<= main_~i~0 61), 80717#(<= main_~i~0 64), 80716#(<= main_~i~0 63), 80719#(<= main_~i~0 66), 80718#(<= main_~i~0 65), 80721#(<= main_~i~0 68), 80720#(<= main_~i~0 67), 80723#(<= main_~i~0 70), 80722#(<= main_~i~0 69), 80725#(<= main_~i~0 72), 80724#(<= main_~i~0 71), 80727#(<= main_~i~0 74), 80726#(<= main_~i~0 73), 80729#(<= main_~i~0 76), 80728#(<= main_~i~0 75), 80731#(<= main_~i~0 78), 80730#(<= main_~i~0 77), 80733#(<= main_~i~0 80), 80732#(<= main_~i~0 79), 80735#(<= main_~i~0 82), 80734#(<= main_~i~0 81), 80737#(<= main_~i~0 84), 80736#(<= main_~i~0 83), 80739#(<= main_~i~0 86), 80738#(<= main_~i~0 85), 80741#(<= main_~i~0 88), 80740#(<= main_~i~0 87), 80743#(<= main_~i~0 90), 80742#(<= main_~i~0 89), 80745#(<= main_~i~0 92), 80744#(<= main_~i~0 91), 80747#(<= main_~i~0 94), 80746#(<= main_~i~0 93), 80749#(<= main_~i~0 96), 80748#(<= main_~i~0 95), 80751#(<= main_~i~0 98), 80750#(<= main_~i~0 97), 80753#(<= main_~i~0 100), 80752#(<= main_~i~0 99), 80755#(<= main_~i~0 102), 80754#(<= main_~i~0 101), 80757#(<= main_~i~0 104), 80756#(<= main_~i~0 103)] [2018-04-13 03:29:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21641 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:21,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 03:29:21,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 03:29:21,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 03:29:21,009 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 107 states. [2018-04-13 03:29:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:24,435 INFO L93 Difference]: Finished difference Result 962 states and 1065 transitions. [2018-04-13 03:29:24,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 03:29:24,435 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 436 [2018-04-13 03:29:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:24,436 INFO L225 Difference]: With dead ends: 962 [2018-04-13 03:29:24,436 INFO L226 Difference]: Without dead ends: 962 [2018-04-13 03:29:24,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 03:29:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-04-13 03:29:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 441. [2018-04-13 03:29:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-13 03:29:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-04-13 03:29:24,438 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 436 [2018-04-13 03:29:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:24,438 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-04-13 03:29:24,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 03:29:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-04-13 03:29:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-04-13 03:29:24,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:24,440 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:24,440 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash -765131877, now seen corresponding path program 104 times [2018-04-13 03:29:24,440 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:24,451 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22059 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:26,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:26,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-04-13 03:29:26,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:26,728 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-13 03:29:26,728 INFO L182 omatonBuilderFactory]: Interpolants [82177#(<= main_~i~0 14), 82176#(<= main_~i~0 13), 82179#(<= main_~i~0 16), 82178#(<= main_~i~0 15), 82181#(<= main_~i~0 18), 82180#(<= main_~i~0 17), 82183#(<= main_~i~0 20), 82182#(<= main_~i~0 19), 82185#(<= main_~i~0 22), 82184#(<= main_~i~0 21), 82187#(<= main_~i~0 24), 82186#(<= main_~i~0 23), 82189#(<= main_~i~0 26), 82188#(<= main_~i~0 25), 82191#(<= main_~i~0 28), 82190#(<= main_~i~0 27), 82193#(<= main_~i~0 30), 82192#(<= main_~i~0 29), 82195#(<= main_~i~0 32), 82194#(<= main_~i~0 31), 82197#(<= main_~i~0 34), 82196#(<= main_~i~0 33), 82199#(<= main_~i~0 36), 82198#(<= main_~i~0 35), 82201#(<= main_~i~0 38), 82200#(<= main_~i~0 37), 82203#(<= main_~i~0 40), 82202#(<= main_~i~0 39), 82205#(<= main_~i~0 42), 82204#(<= main_~i~0 41), 82207#(<= main_~i~0 44), 82206#(<= main_~i~0 43), 82209#(<= main_~i~0 46), 82208#(<= main_~i~0 45), 82211#(<= main_~i~0 48), 82210#(<= main_~i~0 47), 82213#(<= main_~i~0 50), 82212#(<= main_~i~0 49), 82215#(<= main_~i~0 52), 82214#(<= main_~i~0 51), 82217#(<= main_~i~0 54), 82216#(<= main_~i~0 53), 82219#(<= main_~i~0 56), 82218#(<= main_~i~0 55), 82221#(<= main_~i~0 58), 82220#(<= main_~i~0 57), 82223#(<= main_~i~0 60), 82222#(<= main_~i~0 59), 82225#(<= main_~i~0 62), 82224#(<= main_~i~0 61), 82227#(<= main_~i~0 64), 82226#(<= main_~i~0 63), 82229#(<= main_~i~0 66), 82228#(<= main_~i~0 65), 82231#(<= main_~i~0 68), 82230#(<= main_~i~0 67), 82233#(<= main_~i~0 70), 82232#(<= main_~i~0 69), 82235#(<= main_~i~0 72), 82234#(<= main_~i~0 71), 82237#(<= main_~i~0 74), 82236#(<= main_~i~0 73), 82239#(<= main_~i~0 76), 82238#(<= main_~i~0 75), 82241#(<= main_~i~0 78), 82240#(<= main_~i~0 77), 82243#(<= main_~i~0 80), 82242#(<= main_~i~0 79), 82245#(<= main_~i~0 82), 82244#(<= main_~i~0 81), 82247#(<= main_~i~0 84), 82246#(<= main_~i~0 83), 82249#(<= main_~i~0 86), 82248#(<= main_~i~0 85), 82251#(<= main_~i~0 88), 82250#(<= main_~i~0 87), 82253#(<= main_~i~0 90), 82252#(<= main_~i~0 89), 82255#(<= main_~i~0 92), 82254#(<= main_~i~0 91), 82257#(<= main_~i~0 94), 82256#(<= main_~i~0 93), 82259#(<= main_~i~0 96), 82258#(<= main_~i~0 95), 82261#(<= main_~i~0 98), 82260#(<= main_~i~0 97), 82263#(<= main_~i~0 100), 82262#(<= main_~i~0 99), 82265#(<= main_~i~0 102), 82264#(<= main_~i~0 101), 82267#(<= main_~i~0 104), 82266#(<= main_~i~0 103), 82268#(<= main_~i~0 105), 82161#true, 82163#(<= main_~i~0 0), 82162#false, 82165#(<= main_~i~0 2), 82164#(<= main_~i~0 1), 82167#(<= main_~i~0 4), 82166#(<= main_~i~0 3), 82169#(<= main_~i~0 6), 82168#(<= main_~i~0 5), 82171#(<= main_~i~0 8), 82170#(<= main_~i~0 7), 82173#(<= main_~i~0 10), 82172#(<= main_~i~0 9), 82175#(<= main_~i~0 12), 82174#(<= main_~i~0 11)] [2018-04-13 03:29:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 22059 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:26,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-13 03:29:26,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-13 03:29:26,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 03:29:26,730 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 108 states. [2018-04-13 03:29:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:29,952 INFO L93 Difference]: Finished difference Result 971 states and 1075 transitions. [2018-04-13 03:29:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-13 03:29:29,952 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 440 [2018-04-13 03:29:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:29,953 INFO L225 Difference]: With dead ends: 971 [2018-04-13 03:29:29,953 INFO L226 Difference]: Without dead ends: 971 [2018-04-13 03:29:29,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 03:29:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-04-13 03:29:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 445. [2018-04-13 03:29:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-13 03:29:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-04-13 03:29:29,956 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 440 [2018-04-13 03:29:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:29,956 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-04-13 03:29:29,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-13 03:29:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-04-13 03:29:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-04-13 03:29:29,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:29,957 INFO L355 BasicCegarLoop]: trace histogram [107, 106, 106, 106, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:29,957 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 544848276, now seen corresponding path program 105 times [2018-04-13 03:29:29,957 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:29,969 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22481 backedges. 0 proven. 22472 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:32,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:32,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-04-13 03:29:32,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:32,282 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-13 03:29:32,282 INFO L182 omatonBuilderFactory]: Interpolants [83713#(<= main_~i~0 26), 83712#(<= main_~i~0 25), 83715#(<= main_~i~0 28), 83714#(<= main_~i~0 27), 83717#(<= main_~i~0 30), 83716#(<= main_~i~0 29), 83719#(<= main_~i~0 32), 83718#(<= main_~i~0 31), 83721#(<= main_~i~0 34), 83720#(<= main_~i~0 33), 83723#(<= main_~i~0 36), 83722#(<= main_~i~0 35), 83725#(<= main_~i~0 38), 83724#(<= main_~i~0 37), 83727#(<= main_~i~0 40), 83726#(<= main_~i~0 39), 83729#(<= main_~i~0 42), 83728#(<= main_~i~0 41), 83731#(<= main_~i~0 44), 83730#(<= main_~i~0 43), 83733#(<= main_~i~0 46), 83732#(<= main_~i~0 45), 83735#(<= main_~i~0 48), 83734#(<= main_~i~0 47), 83737#(<= main_~i~0 50), 83736#(<= main_~i~0 49), 83739#(<= main_~i~0 52), 83738#(<= main_~i~0 51), 83741#(<= main_~i~0 54), 83740#(<= main_~i~0 53), 83743#(<= main_~i~0 56), 83742#(<= main_~i~0 55), 83745#(<= main_~i~0 58), 83744#(<= main_~i~0 57), 83747#(<= main_~i~0 60), 83746#(<= main_~i~0 59), 83749#(<= main_~i~0 62), 83748#(<= main_~i~0 61), 83751#(<= main_~i~0 64), 83750#(<= main_~i~0 63), 83753#(<= main_~i~0 66), 83752#(<= main_~i~0 65), 83755#(<= main_~i~0 68), 83754#(<= main_~i~0 67), 83757#(<= main_~i~0 70), 83756#(<= main_~i~0 69), 83759#(<= main_~i~0 72), 83758#(<= main_~i~0 71), 83761#(<= main_~i~0 74), 83760#(<= main_~i~0 73), 83763#(<= main_~i~0 76), 83762#(<= main_~i~0 75), 83765#(<= main_~i~0 78), 83764#(<= main_~i~0 77), 83767#(<= main_~i~0 80), 83766#(<= main_~i~0 79), 83769#(<= main_~i~0 82), 83768#(<= main_~i~0 81), 83771#(<= main_~i~0 84), 83770#(<= main_~i~0 83), 83773#(<= main_~i~0 86), 83772#(<= main_~i~0 85), 83775#(<= main_~i~0 88), 83774#(<= main_~i~0 87), 83777#(<= main_~i~0 90), 83776#(<= main_~i~0 89), 83779#(<= main_~i~0 92), 83778#(<= main_~i~0 91), 83781#(<= main_~i~0 94), 83780#(<= main_~i~0 93), 83783#(<= main_~i~0 96), 83782#(<= main_~i~0 95), 83785#(<= main_~i~0 98), 83784#(<= main_~i~0 97), 83787#(<= main_~i~0 100), 83786#(<= main_~i~0 99), 83789#(<= main_~i~0 102), 83788#(<= main_~i~0 101), 83791#(<= main_~i~0 104), 83790#(<= main_~i~0 103), 83793#(<= main_~i~0 106), 83792#(<= main_~i~0 105), 83685#true, 83687#(<= main_~i~0 0), 83686#false, 83689#(<= main_~i~0 2), 83688#(<= main_~i~0 1), 83691#(<= main_~i~0 4), 83690#(<= main_~i~0 3), 83693#(<= main_~i~0 6), 83692#(<= main_~i~0 5), 83695#(<= main_~i~0 8), 83694#(<= main_~i~0 7), 83697#(<= main_~i~0 10), 83696#(<= main_~i~0 9), 83699#(<= main_~i~0 12), 83698#(<= main_~i~0 11), 83701#(<= main_~i~0 14), 83700#(<= main_~i~0 13), 83703#(<= main_~i~0 16), 83702#(<= main_~i~0 15), 83705#(<= main_~i~0 18), 83704#(<= main_~i~0 17), 83707#(<= main_~i~0 20), 83706#(<= main_~i~0 19), 83709#(<= main_~i~0 22), 83708#(<= main_~i~0 21), 83711#(<= main_~i~0 24), 83710#(<= main_~i~0 23)] [2018-04-13 03:29:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 22481 backedges. 0 proven. 22472 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:32,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-13 03:29:32,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-13 03:29:32,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 03:29:32,283 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 109 states. [2018-04-13 03:29:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:35,244 INFO L93 Difference]: Finished difference Result 980 states and 1085 transitions. [2018-04-13 03:29:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-13 03:29:35,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 444 [2018-04-13 03:29:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:35,245 INFO L225 Difference]: With dead ends: 980 [2018-04-13 03:29:35,245 INFO L226 Difference]: Without dead ends: 980 [2018-04-13 03:29:35,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 03:29:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-04-13 03:29:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 449. [2018-04-13 03:29:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-04-13 03:29:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-04-13 03:29:35,248 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 444 [2018-04-13 03:29:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:35,248 INFO L459 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-04-13 03:29:35,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-13 03:29:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-04-13 03:29:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-04-13 03:29:35,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:35,249 INFO L355 BasicCegarLoop]: trace histogram [108, 107, 107, 107, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:35,249 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1222691597, now seen corresponding path program 106 times [2018-04-13 03:29:35,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:35,261 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22907 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:37,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:37,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-04-13 03:29:37,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:37,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-13 03:29:37,609 INFO L182 omatonBuilderFactory]: Interpolants [85249#(<= main_~i~0 24), 85248#(<= main_~i~0 23), 85251#(<= main_~i~0 26), 85250#(<= main_~i~0 25), 85253#(<= main_~i~0 28), 85252#(<= main_~i~0 27), 85255#(<= main_~i~0 30), 85254#(<= main_~i~0 29), 85257#(<= main_~i~0 32), 85256#(<= main_~i~0 31), 85259#(<= main_~i~0 34), 85258#(<= main_~i~0 33), 85261#(<= main_~i~0 36), 85260#(<= main_~i~0 35), 85263#(<= main_~i~0 38), 85262#(<= main_~i~0 37), 85265#(<= main_~i~0 40), 85264#(<= main_~i~0 39), 85267#(<= main_~i~0 42), 85266#(<= main_~i~0 41), 85269#(<= main_~i~0 44), 85268#(<= main_~i~0 43), 85271#(<= main_~i~0 46), 85270#(<= main_~i~0 45), 85273#(<= main_~i~0 48), 85272#(<= main_~i~0 47), 85275#(<= main_~i~0 50), 85274#(<= main_~i~0 49), 85277#(<= main_~i~0 52), 85276#(<= main_~i~0 51), 85279#(<= main_~i~0 54), 85278#(<= main_~i~0 53), 85281#(<= main_~i~0 56), 85280#(<= main_~i~0 55), 85283#(<= main_~i~0 58), 85282#(<= main_~i~0 57), 85285#(<= main_~i~0 60), 85284#(<= main_~i~0 59), 85287#(<= main_~i~0 62), 85286#(<= main_~i~0 61), 85289#(<= main_~i~0 64), 85288#(<= main_~i~0 63), 85291#(<= main_~i~0 66), 85290#(<= main_~i~0 65), 85293#(<= main_~i~0 68), 85292#(<= main_~i~0 67), 85295#(<= main_~i~0 70), 85294#(<= main_~i~0 69), 85297#(<= main_~i~0 72), 85296#(<= main_~i~0 71), 85299#(<= main_~i~0 74), 85298#(<= main_~i~0 73), 85301#(<= main_~i~0 76), 85300#(<= main_~i~0 75), 85303#(<= main_~i~0 78), 85302#(<= main_~i~0 77), 85305#(<= main_~i~0 80), 85304#(<= main_~i~0 79), 85307#(<= main_~i~0 82), 85306#(<= main_~i~0 81), 85309#(<= main_~i~0 84), 85308#(<= main_~i~0 83), 85311#(<= main_~i~0 86), 85310#(<= main_~i~0 85), 85313#(<= main_~i~0 88), 85312#(<= main_~i~0 87), 85315#(<= main_~i~0 90), 85314#(<= main_~i~0 89), 85317#(<= main_~i~0 92), 85316#(<= main_~i~0 91), 85319#(<= main_~i~0 94), 85318#(<= main_~i~0 93), 85321#(<= main_~i~0 96), 85320#(<= main_~i~0 95), 85323#(<= main_~i~0 98), 85322#(<= main_~i~0 97), 85325#(<= main_~i~0 100), 85324#(<= main_~i~0 99), 85327#(<= main_~i~0 102), 85326#(<= main_~i~0 101), 85329#(<= main_~i~0 104), 85328#(<= main_~i~0 103), 85331#(<= main_~i~0 106), 85330#(<= main_~i~0 105), 85332#(<= main_~i~0 107), 85223#true, 85225#(<= main_~i~0 0), 85224#false, 85227#(<= main_~i~0 2), 85226#(<= main_~i~0 1), 85229#(<= main_~i~0 4), 85228#(<= main_~i~0 3), 85231#(<= main_~i~0 6), 85230#(<= main_~i~0 5), 85233#(<= main_~i~0 8), 85232#(<= main_~i~0 7), 85235#(<= main_~i~0 10), 85234#(<= main_~i~0 9), 85237#(<= main_~i~0 12), 85236#(<= main_~i~0 11), 85239#(<= main_~i~0 14), 85238#(<= main_~i~0 13), 85241#(<= main_~i~0 16), 85240#(<= main_~i~0 15), 85243#(<= main_~i~0 18), 85242#(<= main_~i~0 17), 85245#(<= main_~i~0 20), 85244#(<= main_~i~0 19), 85247#(<= main_~i~0 22), 85246#(<= main_~i~0 21)] [2018-04-13 03:29:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22907 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:37,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-13 03:29:37,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-13 03:29:37,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 03:29:37,610 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 110 states. [2018-04-13 03:29:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:40,853 INFO L93 Difference]: Finished difference Result 989 states and 1095 transitions. [2018-04-13 03:29:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-13 03:29:40,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 448 [2018-04-13 03:29:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:40,854 INFO L225 Difference]: With dead ends: 989 [2018-04-13 03:29:40,854 INFO L226 Difference]: Without dead ends: 989 [2018-04-13 03:29:40,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 03:29:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2018-04-13 03:29:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 453. [2018-04-13 03:29:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-13 03:29:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 454 transitions. [2018-04-13 03:29:40,856 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 454 transitions. Word has length 448 [2018-04-13 03:29:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:40,857 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 454 transitions. [2018-04-13 03:29:40,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-13 03:29:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 454 transitions. [2018-04-13 03:29:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-13 03:29:40,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:40,858 INFO L355 BasicCegarLoop]: trace histogram [109, 108, 108, 108, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:40,858 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -603949050, now seen corresponding path program 107 times [2018-04-13 03:29:40,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:40,870 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23337 backedges. 0 proven. 23328 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:43,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:43,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-04-13 03:29:43,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:43,276 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-13 03:29:43,276 INFO L182 omatonBuilderFactory]: Interpolants [86785#(<= main_~i~0 8), 86784#(<= main_~i~0 7), 86787#(<= main_~i~0 10), 86786#(<= main_~i~0 9), 86789#(<= main_~i~0 12), 86788#(<= main_~i~0 11), 86791#(<= main_~i~0 14), 86790#(<= main_~i~0 13), 86793#(<= main_~i~0 16), 86792#(<= main_~i~0 15), 86795#(<= main_~i~0 18), 86794#(<= main_~i~0 17), 86797#(<= main_~i~0 20), 86796#(<= main_~i~0 19), 86799#(<= main_~i~0 22), 86798#(<= main_~i~0 21), 86801#(<= main_~i~0 24), 86800#(<= main_~i~0 23), 86803#(<= main_~i~0 26), 86802#(<= main_~i~0 25), 86805#(<= main_~i~0 28), 86804#(<= main_~i~0 27), 86807#(<= main_~i~0 30), 86806#(<= main_~i~0 29), 86809#(<= main_~i~0 32), 86808#(<= main_~i~0 31), 86811#(<= main_~i~0 34), 86810#(<= main_~i~0 33), 86813#(<= main_~i~0 36), 86812#(<= main_~i~0 35), 86815#(<= main_~i~0 38), 86814#(<= main_~i~0 37), 86817#(<= main_~i~0 40), 86816#(<= main_~i~0 39), 86819#(<= main_~i~0 42), 86818#(<= main_~i~0 41), 86821#(<= main_~i~0 44), 86820#(<= main_~i~0 43), 86823#(<= main_~i~0 46), 86822#(<= main_~i~0 45), 86825#(<= main_~i~0 48), 86824#(<= main_~i~0 47), 86827#(<= main_~i~0 50), 86826#(<= main_~i~0 49), 86829#(<= main_~i~0 52), 86828#(<= main_~i~0 51), 86831#(<= main_~i~0 54), 86830#(<= main_~i~0 53), 86833#(<= main_~i~0 56), 86832#(<= main_~i~0 55), 86835#(<= main_~i~0 58), 86834#(<= main_~i~0 57), 86837#(<= main_~i~0 60), 86836#(<= main_~i~0 59), 86839#(<= main_~i~0 62), 86838#(<= main_~i~0 61), 86841#(<= main_~i~0 64), 86840#(<= main_~i~0 63), 86843#(<= main_~i~0 66), 86842#(<= main_~i~0 65), 86845#(<= main_~i~0 68), 86844#(<= main_~i~0 67), 86847#(<= main_~i~0 70), 86846#(<= main_~i~0 69), 86849#(<= main_~i~0 72), 86848#(<= main_~i~0 71), 86851#(<= main_~i~0 74), 86850#(<= main_~i~0 73), 86853#(<= main_~i~0 76), 86852#(<= main_~i~0 75), 86855#(<= main_~i~0 78), 86854#(<= main_~i~0 77), 86857#(<= main_~i~0 80), 86856#(<= main_~i~0 79), 86859#(<= main_~i~0 82), 86858#(<= main_~i~0 81), 86861#(<= main_~i~0 84), 86860#(<= main_~i~0 83), 86863#(<= main_~i~0 86), 86862#(<= main_~i~0 85), 86865#(<= main_~i~0 88), 86864#(<= main_~i~0 87), 86867#(<= main_~i~0 90), 86866#(<= main_~i~0 89), 86869#(<= main_~i~0 92), 86868#(<= main_~i~0 91), 86871#(<= main_~i~0 94), 86870#(<= main_~i~0 93), 86873#(<= main_~i~0 96), 86872#(<= main_~i~0 95), 86875#(<= main_~i~0 98), 86874#(<= main_~i~0 97), 86877#(<= main_~i~0 100), 86876#(<= main_~i~0 99), 86879#(<= main_~i~0 102), 86878#(<= main_~i~0 101), 86881#(<= main_~i~0 104), 86880#(<= main_~i~0 103), 86883#(<= main_~i~0 106), 86882#(<= main_~i~0 105), 86885#(<= main_~i~0 108), 86884#(<= main_~i~0 107), 86775#true, 86777#(<= main_~i~0 0), 86776#false, 86779#(<= main_~i~0 2), 86778#(<= main_~i~0 1), 86781#(<= main_~i~0 4), 86780#(<= main_~i~0 3), 86783#(<= main_~i~0 6), 86782#(<= main_~i~0 5)] [2018-04-13 03:29:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23337 backedges. 0 proven. 23328 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:43,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-13 03:29:43,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-13 03:29:43,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 03:29:43,278 INFO L87 Difference]: Start difference. First operand 453 states and 454 transitions. Second operand 111 states. [2018-04-13 03:29:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:47,363 INFO L93 Difference]: Finished difference Result 998 states and 1105 transitions. [2018-04-13 03:29:47,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-13 03:29:47,363 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 452 [2018-04-13 03:29:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:47,364 INFO L225 Difference]: With dead ends: 998 [2018-04-13 03:29:47,364 INFO L226 Difference]: Without dead ends: 998 [2018-04-13 03:29:47,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 03:29:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-04-13 03:29:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 457. [2018-04-13 03:29:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-13 03:29:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 458 transitions. [2018-04-13 03:29:47,367 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 458 transitions. Word has length 452 [2018-04-13 03:29:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:47,367 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 458 transitions. [2018-04-13 03:29:47,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-13 03:29:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 458 transitions. [2018-04-13 03:29:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-04-13 03:29:47,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:47,368 INFO L355 BasicCegarLoop]: trace histogram [110, 109, 109, 109, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:47,368 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1293877375, now seen corresponding path program 108 times [2018-04-13 03:29:47,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:47,380 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23771 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:49,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:49,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-04-13 03:29:49,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:49,813 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-13 03:29:49,813 INFO L182 omatonBuilderFactory]: Interpolants [88341#true, 88343#(<= main_~i~0 0), 88342#false, 88345#(<= main_~i~0 2), 88344#(<= main_~i~0 1), 88347#(<= main_~i~0 4), 88346#(<= main_~i~0 3), 88349#(<= main_~i~0 6), 88348#(<= main_~i~0 5), 88351#(<= main_~i~0 8), 88350#(<= main_~i~0 7), 88353#(<= main_~i~0 10), 88352#(<= main_~i~0 9), 88355#(<= main_~i~0 12), 88354#(<= main_~i~0 11), 88357#(<= main_~i~0 14), 88356#(<= main_~i~0 13), 88359#(<= main_~i~0 16), 88358#(<= main_~i~0 15), 88361#(<= main_~i~0 18), 88360#(<= main_~i~0 17), 88363#(<= main_~i~0 20), 88362#(<= main_~i~0 19), 88365#(<= main_~i~0 22), 88364#(<= main_~i~0 21), 88367#(<= main_~i~0 24), 88366#(<= main_~i~0 23), 88369#(<= main_~i~0 26), 88368#(<= main_~i~0 25), 88371#(<= main_~i~0 28), 88370#(<= main_~i~0 27), 88373#(<= main_~i~0 30), 88372#(<= main_~i~0 29), 88375#(<= main_~i~0 32), 88374#(<= main_~i~0 31), 88377#(<= main_~i~0 34), 88376#(<= main_~i~0 33), 88379#(<= main_~i~0 36), 88378#(<= main_~i~0 35), 88381#(<= main_~i~0 38), 88380#(<= main_~i~0 37), 88383#(<= main_~i~0 40), 88382#(<= main_~i~0 39), 88385#(<= main_~i~0 42), 88384#(<= main_~i~0 41), 88387#(<= main_~i~0 44), 88386#(<= main_~i~0 43), 88389#(<= main_~i~0 46), 88388#(<= main_~i~0 45), 88391#(<= main_~i~0 48), 88390#(<= main_~i~0 47), 88393#(<= main_~i~0 50), 88392#(<= main_~i~0 49), 88395#(<= main_~i~0 52), 88394#(<= main_~i~0 51), 88397#(<= main_~i~0 54), 88396#(<= main_~i~0 53), 88399#(<= main_~i~0 56), 88398#(<= main_~i~0 55), 88401#(<= main_~i~0 58), 88400#(<= main_~i~0 57), 88403#(<= main_~i~0 60), 88402#(<= main_~i~0 59), 88405#(<= main_~i~0 62), 88404#(<= main_~i~0 61), 88407#(<= main_~i~0 64), 88406#(<= main_~i~0 63), 88409#(<= main_~i~0 66), 88408#(<= main_~i~0 65), 88411#(<= main_~i~0 68), 88410#(<= main_~i~0 67), 88413#(<= main_~i~0 70), 88412#(<= main_~i~0 69), 88415#(<= main_~i~0 72), 88414#(<= main_~i~0 71), 88417#(<= main_~i~0 74), 88416#(<= main_~i~0 73), 88419#(<= main_~i~0 76), 88418#(<= main_~i~0 75), 88421#(<= main_~i~0 78), 88420#(<= main_~i~0 77), 88423#(<= main_~i~0 80), 88422#(<= main_~i~0 79), 88425#(<= main_~i~0 82), 88424#(<= main_~i~0 81), 88427#(<= main_~i~0 84), 88426#(<= main_~i~0 83), 88429#(<= main_~i~0 86), 88428#(<= main_~i~0 85), 88431#(<= main_~i~0 88), 88430#(<= main_~i~0 87), 88433#(<= main_~i~0 90), 88432#(<= main_~i~0 89), 88435#(<= main_~i~0 92), 88434#(<= main_~i~0 91), 88437#(<= main_~i~0 94), 88436#(<= main_~i~0 93), 88439#(<= main_~i~0 96), 88438#(<= main_~i~0 95), 88441#(<= main_~i~0 98), 88440#(<= main_~i~0 97), 88443#(<= main_~i~0 100), 88442#(<= main_~i~0 99), 88445#(<= main_~i~0 102), 88444#(<= main_~i~0 101), 88447#(<= main_~i~0 104), 88446#(<= main_~i~0 103), 88449#(<= main_~i~0 106), 88448#(<= main_~i~0 105), 88451#(<= main_~i~0 108), 88450#(<= main_~i~0 107), 88452#(<= main_~i~0 109)] [2018-04-13 03:29:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23771 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:49,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-13 03:29:49,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-13 03:29:49,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 03:29:49,815 INFO L87 Difference]: Start difference. First operand 457 states and 458 transitions. Second operand 112 states. [2018-04-13 03:29:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:53,640 INFO L93 Difference]: Finished difference Result 1007 states and 1115 transitions. [2018-04-13 03:29:53,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-13 03:29:53,640 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 456 [2018-04-13 03:29:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:53,641 INFO L225 Difference]: With dead ends: 1007 [2018-04-13 03:29:53,641 INFO L226 Difference]: Without dead ends: 1007 [2018-04-13 03:29:53,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 03:29:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2018-04-13 03:29:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 461. [2018-04-13 03:29:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-13 03:29:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 462 transitions. [2018-04-13 03:29:53,643 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 462 transitions. Word has length 456 [2018-04-13 03:29:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:53,644 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 462 transitions. [2018-04-13 03:29:53,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-13 03:29:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 462 transitions. [2018-04-13 03:29:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-04-13 03:29:53,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:53,645 INFO L355 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:53,645 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2107464584, now seen corresponding path program 109 times [2018-04-13 03:29:53,645 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:53,657 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:29:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24209 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:56,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:29:56,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-04-13 03:29:56,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:29:56,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-13 03:29:56,169 INFO L182 omatonBuilderFactory]: Interpolants [89921#true, 89923#(<= main_~i~0 0), 89922#false, 89925#(<= main_~i~0 2), 89924#(<= main_~i~0 1), 89927#(<= main_~i~0 4), 89926#(<= main_~i~0 3), 89929#(<= main_~i~0 6), 89928#(<= main_~i~0 5), 89931#(<= main_~i~0 8), 89930#(<= main_~i~0 7), 89933#(<= main_~i~0 10), 89932#(<= main_~i~0 9), 89935#(<= main_~i~0 12), 89934#(<= main_~i~0 11), 89937#(<= main_~i~0 14), 89936#(<= main_~i~0 13), 89939#(<= main_~i~0 16), 89938#(<= main_~i~0 15), 89941#(<= main_~i~0 18), 89940#(<= main_~i~0 17), 89943#(<= main_~i~0 20), 89942#(<= main_~i~0 19), 89945#(<= main_~i~0 22), 89944#(<= main_~i~0 21), 89947#(<= main_~i~0 24), 89946#(<= main_~i~0 23), 89949#(<= main_~i~0 26), 89948#(<= main_~i~0 25), 89951#(<= main_~i~0 28), 89950#(<= main_~i~0 27), 89953#(<= main_~i~0 30), 89952#(<= main_~i~0 29), 89955#(<= main_~i~0 32), 89954#(<= main_~i~0 31), 89957#(<= main_~i~0 34), 89956#(<= main_~i~0 33), 89959#(<= main_~i~0 36), 89958#(<= main_~i~0 35), 89961#(<= main_~i~0 38), 89960#(<= main_~i~0 37), 89963#(<= main_~i~0 40), 89962#(<= main_~i~0 39), 89965#(<= main_~i~0 42), 89964#(<= main_~i~0 41), 89967#(<= main_~i~0 44), 89966#(<= main_~i~0 43), 89969#(<= main_~i~0 46), 89968#(<= main_~i~0 45), 89971#(<= main_~i~0 48), 89970#(<= main_~i~0 47), 89973#(<= main_~i~0 50), 89972#(<= main_~i~0 49), 89975#(<= main_~i~0 52), 89974#(<= main_~i~0 51), 89977#(<= main_~i~0 54), 89976#(<= main_~i~0 53), 89979#(<= main_~i~0 56), 89978#(<= main_~i~0 55), 89981#(<= main_~i~0 58), 89980#(<= main_~i~0 57), 89983#(<= main_~i~0 60), 89982#(<= main_~i~0 59), 89985#(<= main_~i~0 62), 89984#(<= main_~i~0 61), 89987#(<= main_~i~0 64), 89986#(<= main_~i~0 63), 89989#(<= main_~i~0 66), 89988#(<= main_~i~0 65), 89991#(<= main_~i~0 68), 89990#(<= main_~i~0 67), 89993#(<= main_~i~0 70), 89992#(<= main_~i~0 69), 89995#(<= main_~i~0 72), 89994#(<= main_~i~0 71), 89997#(<= main_~i~0 74), 89996#(<= main_~i~0 73), 89999#(<= main_~i~0 76), 89998#(<= main_~i~0 75), 90001#(<= main_~i~0 78), 90000#(<= main_~i~0 77), 90003#(<= main_~i~0 80), 90002#(<= main_~i~0 79), 90005#(<= main_~i~0 82), 90004#(<= main_~i~0 81), 90007#(<= main_~i~0 84), 90006#(<= main_~i~0 83), 90009#(<= main_~i~0 86), 90008#(<= main_~i~0 85), 90011#(<= main_~i~0 88), 90010#(<= main_~i~0 87), 90013#(<= main_~i~0 90), 90012#(<= main_~i~0 89), 90015#(<= main_~i~0 92), 90014#(<= main_~i~0 91), 90017#(<= main_~i~0 94), 90016#(<= main_~i~0 93), 90019#(<= main_~i~0 96), 90018#(<= main_~i~0 95), 90021#(<= main_~i~0 98), 90020#(<= main_~i~0 97), 90023#(<= main_~i~0 100), 90022#(<= main_~i~0 99), 90025#(<= main_~i~0 102), 90024#(<= main_~i~0 101), 90027#(<= main_~i~0 104), 90026#(<= main_~i~0 103), 90029#(<= main_~i~0 106), 90028#(<= main_~i~0 105), 90031#(<= main_~i~0 108), 90030#(<= main_~i~0 107), 90033#(<= main_~i~0 110), 90032#(<= main_~i~0 109)] [2018-04-13 03:29:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24209 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:29:56,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-13 03:29:56,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-13 03:29:56,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 03:29:56,170 INFO L87 Difference]: Start difference. First operand 461 states and 462 transitions. Second operand 113 states. [2018-04-13 03:29:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:29:59,721 INFO L93 Difference]: Finished difference Result 1016 states and 1125 transitions. [2018-04-13 03:29:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-13 03:29:59,721 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 460 [2018-04-13 03:29:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:29:59,722 INFO L225 Difference]: With dead ends: 1016 [2018-04-13 03:29:59,722 INFO L226 Difference]: Without dead ends: 1016 [2018-04-13 03:29:59,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 03:29:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-04-13 03:29:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 465. [2018-04-13 03:29:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-13 03:29:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-04-13 03:29:59,724 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 460 [2018-04-13 03:29:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:29:59,725 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-04-13 03:29:59,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-13 03:29:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-04-13 03:29:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-04-13 03:29:59,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:29:59,726 INFO L355 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:29:59,726 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:29:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1691460593, now seen corresponding path program 110 times [2018-04-13 03:29:59,726 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:29:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:29:59,739 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:02,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:02,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-04-13 03:30:02,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:02,480 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-13 03:30:02,480 INFO L182 omatonBuilderFactory]: Interpolants [91515#true, 91517#(<= main_~i~0 0), 91516#false, 91519#(<= main_~i~0 2), 91518#(<= main_~i~0 1), 91521#(<= main_~i~0 4), 91520#(<= main_~i~0 3), 91523#(<= main_~i~0 6), 91522#(<= main_~i~0 5), 91525#(<= main_~i~0 8), 91524#(<= main_~i~0 7), 91527#(<= main_~i~0 10), 91526#(<= main_~i~0 9), 91529#(<= main_~i~0 12), 91528#(<= main_~i~0 11), 91531#(<= main_~i~0 14), 91530#(<= main_~i~0 13), 91533#(<= main_~i~0 16), 91532#(<= main_~i~0 15), 91535#(<= main_~i~0 18), 91534#(<= main_~i~0 17), 91537#(<= main_~i~0 20), 91536#(<= main_~i~0 19), 91539#(<= main_~i~0 22), 91538#(<= main_~i~0 21), 91541#(<= main_~i~0 24), 91540#(<= main_~i~0 23), 91543#(<= main_~i~0 26), 91542#(<= main_~i~0 25), 91545#(<= main_~i~0 28), 91544#(<= main_~i~0 27), 91547#(<= main_~i~0 30), 91546#(<= main_~i~0 29), 91549#(<= main_~i~0 32), 91548#(<= main_~i~0 31), 91551#(<= main_~i~0 34), 91550#(<= main_~i~0 33), 91553#(<= main_~i~0 36), 91552#(<= main_~i~0 35), 91555#(<= main_~i~0 38), 91554#(<= main_~i~0 37), 91557#(<= main_~i~0 40), 91556#(<= main_~i~0 39), 91559#(<= main_~i~0 42), 91558#(<= main_~i~0 41), 91561#(<= main_~i~0 44), 91560#(<= main_~i~0 43), 91563#(<= main_~i~0 46), 91562#(<= main_~i~0 45), 91565#(<= main_~i~0 48), 91564#(<= main_~i~0 47), 91567#(<= main_~i~0 50), 91566#(<= main_~i~0 49), 91569#(<= main_~i~0 52), 91568#(<= main_~i~0 51), 91571#(<= main_~i~0 54), 91570#(<= main_~i~0 53), 91573#(<= main_~i~0 56), 91572#(<= main_~i~0 55), 91575#(<= main_~i~0 58), 91574#(<= main_~i~0 57), 91577#(<= main_~i~0 60), 91576#(<= main_~i~0 59), 91579#(<= main_~i~0 62), 91578#(<= main_~i~0 61), 91581#(<= main_~i~0 64), 91580#(<= main_~i~0 63), 91583#(<= main_~i~0 66), 91582#(<= main_~i~0 65), 91585#(<= main_~i~0 68), 91584#(<= main_~i~0 67), 91587#(<= main_~i~0 70), 91586#(<= main_~i~0 69), 91589#(<= main_~i~0 72), 91588#(<= main_~i~0 71), 91591#(<= main_~i~0 74), 91590#(<= main_~i~0 73), 91593#(<= main_~i~0 76), 91592#(<= main_~i~0 75), 91595#(<= main_~i~0 78), 91594#(<= main_~i~0 77), 91597#(<= main_~i~0 80), 91596#(<= main_~i~0 79), 91599#(<= main_~i~0 82), 91598#(<= main_~i~0 81), 91601#(<= main_~i~0 84), 91600#(<= main_~i~0 83), 91603#(<= main_~i~0 86), 91602#(<= main_~i~0 85), 91605#(<= main_~i~0 88), 91604#(<= main_~i~0 87), 91607#(<= main_~i~0 90), 91606#(<= main_~i~0 89), 91609#(<= main_~i~0 92), 91608#(<= main_~i~0 91), 91611#(<= main_~i~0 94), 91610#(<= main_~i~0 93), 91613#(<= main_~i~0 96), 91612#(<= main_~i~0 95), 91615#(<= main_~i~0 98), 91614#(<= main_~i~0 97), 91617#(<= main_~i~0 100), 91616#(<= main_~i~0 99), 91619#(<= main_~i~0 102), 91618#(<= main_~i~0 101), 91621#(<= main_~i~0 104), 91620#(<= main_~i~0 103), 91623#(<= main_~i~0 106), 91622#(<= main_~i~0 105), 91625#(<= main_~i~0 108), 91624#(<= main_~i~0 107), 91627#(<= main_~i~0 110), 91626#(<= main_~i~0 109), 91628#(<= main_~i~0 111)] [2018-04-13 03:30:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:02,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-04-13 03:30:02,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-04-13 03:30:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 03:30:02,483 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 114 states. [2018-04-13 03:30:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:06,642 INFO L93 Difference]: Finished difference Result 1025 states and 1135 transitions. [2018-04-13 03:30:06,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-13 03:30:06,642 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 464 [2018-04-13 03:30:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:06,643 INFO L225 Difference]: With dead ends: 1025 [2018-04-13 03:30:06,643 INFO L226 Difference]: Without dead ends: 1025 [2018-04-13 03:30:06,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 03:30:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-04-13 03:30:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 469. [2018-04-13 03:30:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-13 03:30:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-04-13 03:30:06,646 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 464 [2018-04-13 03:30:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:06,646 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-04-13 03:30:06,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-04-13 03:30:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-04-13 03:30:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-04-13 03:30:06,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:06,647 INFO L355 BasicCegarLoop]: trace histogram [113, 112, 112, 112, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:06,647 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1884438250, now seen corresponding path program 111 times [2018-04-13 03:30:06,648 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:06,659 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25097 backedges. 0 proven. 25088 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:09,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:09,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-04-13 03:30:09,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:09,210 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-13 03:30:09,210 INFO L182 omatonBuilderFactory]: Interpolants [93185#(<= main_~i~0 60), 93184#(<= main_~i~0 59), 93187#(<= main_~i~0 62), 93186#(<= main_~i~0 61), 93189#(<= main_~i~0 64), 93188#(<= main_~i~0 63), 93191#(<= main_~i~0 66), 93190#(<= main_~i~0 65), 93193#(<= main_~i~0 68), 93192#(<= main_~i~0 67), 93195#(<= main_~i~0 70), 93194#(<= main_~i~0 69), 93197#(<= main_~i~0 72), 93196#(<= main_~i~0 71), 93199#(<= main_~i~0 74), 93198#(<= main_~i~0 73), 93201#(<= main_~i~0 76), 93200#(<= main_~i~0 75), 93203#(<= main_~i~0 78), 93202#(<= main_~i~0 77), 93205#(<= main_~i~0 80), 93204#(<= main_~i~0 79), 93207#(<= main_~i~0 82), 93206#(<= main_~i~0 81), 93209#(<= main_~i~0 84), 93208#(<= main_~i~0 83), 93211#(<= main_~i~0 86), 93210#(<= main_~i~0 85), 93213#(<= main_~i~0 88), 93212#(<= main_~i~0 87), 93215#(<= main_~i~0 90), 93214#(<= main_~i~0 89), 93217#(<= main_~i~0 92), 93216#(<= main_~i~0 91), 93219#(<= main_~i~0 94), 93218#(<= main_~i~0 93), 93221#(<= main_~i~0 96), 93220#(<= main_~i~0 95), 93223#(<= main_~i~0 98), 93222#(<= main_~i~0 97), 93225#(<= main_~i~0 100), 93224#(<= main_~i~0 99), 93227#(<= main_~i~0 102), 93226#(<= main_~i~0 101), 93229#(<= main_~i~0 104), 93228#(<= main_~i~0 103), 93231#(<= main_~i~0 106), 93230#(<= main_~i~0 105), 93233#(<= main_~i~0 108), 93232#(<= main_~i~0 107), 93235#(<= main_~i~0 110), 93234#(<= main_~i~0 109), 93237#(<= main_~i~0 112), 93236#(<= main_~i~0 111), 93123#true, 93125#(<= main_~i~0 0), 93124#false, 93127#(<= main_~i~0 2), 93126#(<= main_~i~0 1), 93129#(<= main_~i~0 4), 93128#(<= main_~i~0 3), 93131#(<= main_~i~0 6), 93130#(<= main_~i~0 5), 93133#(<= main_~i~0 8), 93132#(<= main_~i~0 7), 93135#(<= main_~i~0 10), 93134#(<= main_~i~0 9), 93137#(<= main_~i~0 12), 93136#(<= main_~i~0 11), 93139#(<= main_~i~0 14), 93138#(<= main_~i~0 13), 93141#(<= main_~i~0 16), 93140#(<= main_~i~0 15), 93143#(<= main_~i~0 18), 93142#(<= main_~i~0 17), 93145#(<= main_~i~0 20), 93144#(<= main_~i~0 19), 93147#(<= main_~i~0 22), 93146#(<= main_~i~0 21), 93149#(<= main_~i~0 24), 93148#(<= main_~i~0 23), 93151#(<= main_~i~0 26), 93150#(<= main_~i~0 25), 93153#(<= main_~i~0 28), 93152#(<= main_~i~0 27), 93155#(<= main_~i~0 30), 93154#(<= main_~i~0 29), 93157#(<= main_~i~0 32), 93156#(<= main_~i~0 31), 93159#(<= main_~i~0 34), 93158#(<= main_~i~0 33), 93161#(<= main_~i~0 36), 93160#(<= main_~i~0 35), 93163#(<= main_~i~0 38), 93162#(<= main_~i~0 37), 93165#(<= main_~i~0 40), 93164#(<= main_~i~0 39), 93167#(<= main_~i~0 42), 93166#(<= main_~i~0 41), 93169#(<= main_~i~0 44), 93168#(<= main_~i~0 43), 93171#(<= main_~i~0 46), 93170#(<= main_~i~0 45), 93173#(<= main_~i~0 48), 93172#(<= main_~i~0 47), 93175#(<= main_~i~0 50), 93174#(<= main_~i~0 49), 93177#(<= main_~i~0 52), 93176#(<= main_~i~0 51), 93179#(<= main_~i~0 54), 93178#(<= main_~i~0 53), 93181#(<= main_~i~0 56), 93180#(<= main_~i~0 55), 93183#(<= main_~i~0 58), 93182#(<= main_~i~0 57)] [2018-04-13 03:30:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25097 backedges. 0 proven. 25088 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:09,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-04-13 03:30:09,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-04-13 03:30:09,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 03:30:09,212 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 115 states. [2018-04-13 03:30:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:12,538 INFO L93 Difference]: Finished difference Result 1034 states and 1145 transitions. [2018-04-13 03:30:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-13 03:30:12,538 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 468 [2018-04-13 03:30:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:12,539 INFO L225 Difference]: With dead ends: 1034 [2018-04-13 03:30:12,539 INFO L226 Difference]: Without dead ends: 1034 [2018-04-13 03:30:12,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 03:30:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-04-13 03:30:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 473. [2018-04-13 03:30:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-13 03:30:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 474 transitions. [2018-04-13 03:30:12,542 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 474 transitions. Word has length 468 [2018-04-13 03:30:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:12,542 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 474 transitions. [2018-04-13 03:30:12,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-04-13 03:30:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 474 transitions. [2018-04-13 03:30:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-04-13 03:30:12,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:12,544 INFO L355 BasicCegarLoop]: trace histogram [114, 113, 113, 113, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:12,544 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1135261027, now seen corresponding path program 112 times [2018-04-13 03:30:12,544 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:12,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 25547 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:15,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:15,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-04-13 03:30:15,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:15,190 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-13 03:30:15,190 INFO L182 omatonBuilderFactory]: Interpolants [94745#true, 94747#(<= main_~i~0 0), 94746#false, 94749#(<= main_~i~0 2), 94748#(<= main_~i~0 1), 94751#(<= main_~i~0 4), 94750#(<= main_~i~0 3), 94753#(<= main_~i~0 6), 94752#(<= main_~i~0 5), 94755#(<= main_~i~0 8), 94754#(<= main_~i~0 7), 94757#(<= main_~i~0 10), 94756#(<= main_~i~0 9), 94759#(<= main_~i~0 12), 94758#(<= main_~i~0 11), 94761#(<= main_~i~0 14), 94760#(<= main_~i~0 13), 94763#(<= main_~i~0 16), 94762#(<= main_~i~0 15), 94765#(<= main_~i~0 18), 94764#(<= main_~i~0 17), 94767#(<= main_~i~0 20), 94766#(<= main_~i~0 19), 94769#(<= main_~i~0 22), 94768#(<= main_~i~0 21), 94771#(<= main_~i~0 24), 94770#(<= main_~i~0 23), 94773#(<= main_~i~0 26), 94772#(<= main_~i~0 25), 94775#(<= main_~i~0 28), 94774#(<= main_~i~0 27), 94777#(<= main_~i~0 30), 94776#(<= main_~i~0 29), 94779#(<= main_~i~0 32), 94778#(<= main_~i~0 31), 94781#(<= main_~i~0 34), 94780#(<= main_~i~0 33), 94783#(<= main_~i~0 36), 94782#(<= main_~i~0 35), 94785#(<= main_~i~0 38), 94784#(<= main_~i~0 37), 94787#(<= main_~i~0 40), 94786#(<= main_~i~0 39), 94789#(<= main_~i~0 42), 94788#(<= main_~i~0 41), 94791#(<= main_~i~0 44), 94790#(<= main_~i~0 43), 94793#(<= main_~i~0 46), 94792#(<= main_~i~0 45), 94795#(<= main_~i~0 48), 94794#(<= main_~i~0 47), 94797#(<= main_~i~0 50), 94796#(<= main_~i~0 49), 94799#(<= main_~i~0 52), 94798#(<= main_~i~0 51), 94801#(<= main_~i~0 54), 94800#(<= main_~i~0 53), 94803#(<= main_~i~0 56), 94802#(<= main_~i~0 55), 94805#(<= main_~i~0 58), 94804#(<= main_~i~0 57), 94807#(<= main_~i~0 60), 94806#(<= main_~i~0 59), 94809#(<= main_~i~0 62), 94808#(<= main_~i~0 61), 94811#(<= main_~i~0 64), 94810#(<= main_~i~0 63), 94813#(<= main_~i~0 66), 94812#(<= main_~i~0 65), 94815#(<= main_~i~0 68), 94814#(<= main_~i~0 67), 94817#(<= main_~i~0 70), 94816#(<= main_~i~0 69), 94819#(<= main_~i~0 72), 94818#(<= main_~i~0 71), 94821#(<= main_~i~0 74), 94820#(<= main_~i~0 73), 94823#(<= main_~i~0 76), 94822#(<= main_~i~0 75), 94825#(<= main_~i~0 78), 94824#(<= main_~i~0 77), 94827#(<= main_~i~0 80), 94826#(<= main_~i~0 79), 94829#(<= main_~i~0 82), 94828#(<= main_~i~0 81), 94831#(<= main_~i~0 84), 94830#(<= main_~i~0 83), 94833#(<= main_~i~0 86), 94832#(<= main_~i~0 85), 94835#(<= main_~i~0 88), 94834#(<= main_~i~0 87), 94837#(<= main_~i~0 90), 94836#(<= main_~i~0 89), 94839#(<= main_~i~0 92), 94838#(<= main_~i~0 91), 94841#(<= main_~i~0 94), 94840#(<= main_~i~0 93), 94843#(<= main_~i~0 96), 94842#(<= main_~i~0 95), 94845#(<= main_~i~0 98), 94844#(<= main_~i~0 97), 94847#(<= main_~i~0 100), 94846#(<= main_~i~0 99), 94849#(<= main_~i~0 102), 94848#(<= main_~i~0 101), 94851#(<= main_~i~0 104), 94850#(<= main_~i~0 103), 94853#(<= main_~i~0 106), 94852#(<= main_~i~0 105), 94855#(<= main_~i~0 108), 94854#(<= main_~i~0 107), 94857#(<= main_~i~0 110), 94856#(<= main_~i~0 109), 94859#(<= main_~i~0 112), 94858#(<= main_~i~0 111), 94860#(<= main_~i~0 113)] [2018-04-13 03:30:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 25547 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:15,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-13 03:30:15,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-13 03:30:15,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 03:30:15,192 INFO L87 Difference]: Start difference. First operand 473 states and 474 transitions. Second operand 116 states. [2018-04-13 03:30:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:19,854 INFO L93 Difference]: Finished difference Result 1043 states and 1155 transitions. [2018-04-13 03:30:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-13 03:30:19,854 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 472 [2018-04-13 03:30:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:19,855 INFO L225 Difference]: With dead ends: 1043 [2018-04-13 03:30:19,855 INFO L226 Difference]: Without dead ends: 1043 [2018-04-13 03:30:19,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 03:30:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-04-13 03:30:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 477. [2018-04-13 03:30:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-04-13 03:30:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 478 transitions. [2018-04-13 03:30:19,859 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 478 transitions. Word has length 472 [2018-04-13 03:30:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:19,859 INFO L459 AbstractCegarLoop]: Abstraction has 477 states and 478 transitions. [2018-04-13 03:30:19,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-13 03:30:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 478 transitions. [2018-04-13 03:30:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-04-13 03:30:19,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:19,860 INFO L355 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:19,860 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash 813778780, now seen corresponding path program 113 times [2018-04-13 03:30:19,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:19,874 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 26001 backedges. 0 proven. 25992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:22,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:22,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-04-13 03:30:22,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:22,521 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-13 03:30:22,521 INFO L182 omatonBuilderFactory]: Interpolants [96381#true, 96383#(<= main_~i~0 0), 96382#false, 96385#(<= main_~i~0 2), 96384#(<= main_~i~0 1), 96387#(<= main_~i~0 4), 96386#(<= main_~i~0 3), 96389#(<= main_~i~0 6), 96388#(<= main_~i~0 5), 96391#(<= main_~i~0 8), 96390#(<= main_~i~0 7), 96393#(<= main_~i~0 10), 96392#(<= main_~i~0 9), 96395#(<= main_~i~0 12), 96394#(<= main_~i~0 11), 96397#(<= main_~i~0 14), 96396#(<= main_~i~0 13), 96399#(<= main_~i~0 16), 96398#(<= main_~i~0 15), 96401#(<= main_~i~0 18), 96400#(<= main_~i~0 17), 96403#(<= main_~i~0 20), 96402#(<= main_~i~0 19), 96405#(<= main_~i~0 22), 96404#(<= main_~i~0 21), 96407#(<= main_~i~0 24), 96406#(<= main_~i~0 23), 96409#(<= main_~i~0 26), 96408#(<= main_~i~0 25), 96411#(<= main_~i~0 28), 96410#(<= main_~i~0 27), 96413#(<= main_~i~0 30), 96412#(<= main_~i~0 29), 96415#(<= main_~i~0 32), 96414#(<= main_~i~0 31), 96417#(<= main_~i~0 34), 96416#(<= main_~i~0 33), 96419#(<= main_~i~0 36), 96418#(<= main_~i~0 35), 96421#(<= main_~i~0 38), 96420#(<= main_~i~0 37), 96423#(<= main_~i~0 40), 96422#(<= main_~i~0 39), 96425#(<= main_~i~0 42), 96424#(<= main_~i~0 41), 96427#(<= main_~i~0 44), 96426#(<= main_~i~0 43), 96429#(<= main_~i~0 46), 96428#(<= main_~i~0 45), 96431#(<= main_~i~0 48), 96430#(<= main_~i~0 47), 96433#(<= main_~i~0 50), 96432#(<= main_~i~0 49), 96435#(<= main_~i~0 52), 96434#(<= main_~i~0 51), 96437#(<= main_~i~0 54), 96436#(<= main_~i~0 53), 96439#(<= main_~i~0 56), 96438#(<= main_~i~0 55), 96441#(<= main_~i~0 58), 96440#(<= main_~i~0 57), 96443#(<= main_~i~0 60), 96442#(<= main_~i~0 59), 96445#(<= main_~i~0 62), 96444#(<= main_~i~0 61), 96447#(<= main_~i~0 64), 96446#(<= main_~i~0 63), 96449#(<= main_~i~0 66), 96448#(<= main_~i~0 65), 96451#(<= main_~i~0 68), 96450#(<= main_~i~0 67), 96453#(<= main_~i~0 70), 96452#(<= main_~i~0 69), 96455#(<= main_~i~0 72), 96454#(<= main_~i~0 71), 96457#(<= main_~i~0 74), 96456#(<= main_~i~0 73), 96459#(<= main_~i~0 76), 96458#(<= main_~i~0 75), 96461#(<= main_~i~0 78), 96460#(<= main_~i~0 77), 96463#(<= main_~i~0 80), 96462#(<= main_~i~0 79), 96465#(<= main_~i~0 82), 96464#(<= main_~i~0 81), 96467#(<= main_~i~0 84), 96466#(<= main_~i~0 83), 96469#(<= main_~i~0 86), 96468#(<= main_~i~0 85), 96471#(<= main_~i~0 88), 96470#(<= main_~i~0 87), 96473#(<= main_~i~0 90), 96472#(<= main_~i~0 89), 96475#(<= main_~i~0 92), 96474#(<= main_~i~0 91), 96477#(<= main_~i~0 94), 96476#(<= main_~i~0 93), 96479#(<= main_~i~0 96), 96478#(<= main_~i~0 95), 96481#(<= main_~i~0 98), 96480#(<= main_~i~0 97), 96483#(<= main_~i~0 100), 96482#(<= main_~i~0 99), 96485#(<= main_~i~0 102), 96484#(<= main_~i~0 101), 96487#(<= main_~i~0 104), 96486#(<= main_~i~0 103), 96489#(<= main_~i~0 106), 96488#(<= main_~i~0 105), 96491#(<= main_~i~0 108), 96490#(<= main_~i~0 107), 96493#(<= main_~i~0 110), 96492#(<= main_~i~0 109), 96495#(<= main_~i~0 112), 96494#(<= main_~i~0 111), 96497#(<= main_~i~0 114), 96496#(<= main_~i~0 113)] [2018-04-13 03:30:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26001 backedges. 0 proven. 25992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:22,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-13 03:30:22,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-13 03:30:22,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 03:30:22,523 INFO L87 Difference]: Start difference. First operand 477 states and 478 transitions. Second operand 117 states. [2018-04-13 03:30:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:27,218 INFO L93 Difference]: Finished difference Result 1052 states and 1165 transitions. [2018-04-13 03:30:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-13 03:30:27,218 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 476 [2018-04-13 03:30:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:27,219 INFO L225 Difference]: With dead ends: 1052 [2018-04-13 03:30:27,219 INFO L226 Difference]: Without dead ends: 1052 [2018-04-13 03:30:27,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 03:30:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-04-13 03:30:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 481. [2018-04-13 03:30:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-13 03:30:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 482 transitions. [2018-04-13 03:30:27,222 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 482 transitions. Word has length 476 [2018-04-13 03:30:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:27,222 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 482 transitions. [2018-04-13 03:30:27,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-13 03:30:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 482 transitions. [2018-04-13 03:30:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-04-13 03:30:27,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:27,223 INFO L355 BasicCegarLoop]: trace histogram [116, 115, 115, 115, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:27,223 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash -883149611, now seen corresponding path program 114 times [2018-04-13 03:30:27,224 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:27,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 26459 backedges. 0 proven. 26450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:29,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:29,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-04-13 03:30:29,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:29,930 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-13 03:30:29,930 INFO L182 omatonBuilderFactory]: Interpolants [98049#(<= main_~i~0 16), 98048#(<= main_~i~0 15), 98051#(<= main_~i~0 18), 98050#(<= main_~i~0 17), 98053#(<= main_~i~0 20), 98052#(<= main_~i~0 19), 98055#(<= main_~i~0 22), 98054#(<= main_~i~0 21), 98057#(<= main_~i~0 24), 98056#(<= main_~i~0 23), 98059#(<= main_~i~0 26), 98058#(<= main_~i~0 25), 98061#(<= main_~i~0 28), 98060#(<= main_~i~0 27), 98063#(<= main_~i~0 30), 98062#(<= main_~i~0 29), 98065#(<= main_~i~0 32), 98064#(<= main_~i~0 31), 98067#(<= main_~i~0 34), 98066#(<= main_~i~0 33), 98069#(<= main_~i~0 36), 98068#(<= main_~i~0 35), 98071#(<= main_~i~0 38), 98070#(<= main_~i~0 37), 98073#(<= main_~i~0 40), 98072#(<= main_~i~0 39), 98075#(<= main_~i~0 42), 98074#(<= main_~i~0 41), 98077#(<= main_~i~0 44), 98076#(<= main_~i~0 43), 98079#(<= main_~i~0 46), 98078#(<= main_~i~0 45), 98081#(<= main_~i~0 48), 98080#(<= main_~i~0 47), 98083#(<= main_~i~0 50), 98082#(<= main_~i~0 49), 98085#(<= main_~i~0 52), 98084#(<= main_~i~0 51), 98087#(<= main_~i~0 54), 98086#(<= main_~i~0 53), 98089#(<= main_~i~0 56), 98088#(<= main_~i~0 55), 98091#(<= main_~i~0 58), 98090#(<= main_~i~0 57), 98093#(<= main_~i~0 60), 98092#(<= main_~i~0 59), 98095#(<= main_~i~0 62), 98094#(<= main_~i~0 61), 98097#(<= main_~i~0 64), 98096#(<= main_~i~0 63), 98099#(<= main_~i~0 66), 98098#(<= main_~i~0 65), 98101#(<= main_~i~0 68), 98100#(<= main_~i~0 67), 98103#(<= main_~i~0 70), 98102#(<= main_~i~0 69), 98105#(<= main_~i~0 72), 98104#(<= main_~i~0 71), 98107#(<= main_~i~0 74), 98106#(<= main_~i~0 73), 98109#(<= main_~i~0 76), 98108#(<= main_~i~0 75), 98111#(<= main_~i~0 78), 98110#(<= main_~i~0 77), 98113#(<= main_~i~0 80), 98112#(<= main_~i~0 79), 98115#(<= main_~i~0 82), 98114#(<= main_~i~0 81), 98117#(<= main_~i~0 84), 98116#(<= main_~i~0 83), 98119#(<= main_~i~0 86), 98118#(<= main_~i~0 85), 98121#(<= main_~i~0 88), 98120#(<= main_~i~0 87), 98123#(<= main_~i~0 90), 98122#(<= main_~i~0 89), 98125#(<= main_~i~0 92), 98124#(<= main_~i~0 91), 98127#(<= main_~i~0 94), 98126#(<= main_~i~0 93), 98129#(<= main_~i~0 96), 98128#(<= main_~i~0 95), 98131#(<= main_~i~0 98), 98130#(<= main_~i~0 97), 98133#(<= main_~i~0 100), 98132#(<= main_~i~0 99), 98135#(<= main_~i~0 102), 98134#(<= main_~i~0 101), 98137#(<= main_~i~0 104), 98136#(<= main_~i~0 103), 98139#(<= main_~i~0 106), 98138#(<= main_~i~0 105), 98141#(<= main_~i~0 108), 98140#(<= main_~i~0 107), 98143#(<= main_~i~0 110), 98142#(<= main_~i~0 109), 98145#(<= main_~i~0 112), 98144#(<= main_~i~0 111), 98147#(<= main_~i~0 114), 98146#(<= main_~i~0 113), 98148#(<= main_~i~0 115), 98031#true, 98033#(<= main_~i~0 0), 98032#false, 98035#(<= main_~i~0 2), 98034#(<= main_~i~0 1), 98037#(<= main_~i~0 4), 98036#(<= main_~i~0 3), 98039#(<= main_~i~0 6), 98038#(<= main_~i~0 5), 98041#(<= main_~i~0 8), 98040#(<= main_~i~0 7), 98043#(<= main_~i~0 10), 98042#(<= main_~i~0 9), 98045#(<= main_~i~0 12), 98044#(<= main_~i~0 11), 98047#(<= main_~i~0 14), 98046#(<= main_~i~0 13)] [2018-04-13 03:30:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26459 backedges. 0 proven. 26450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:29,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-13 03:30:29,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-13 03:30:29,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 03:30:29,932 INFO L87 Difference]: Start difference. First operand 481 states and 482 transitions. Second operand 118 states. [2018-04-13 03:30:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:34,371 INFO L93 Difference]: Finished difference Result 1061 states and 1175 transitions. [2018-04-13 03:30:34,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-04-13 03:30:34,371 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 480 [2018-04-13 03:30:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:34,372 INFO L225 Difference]: With dead ends: 1061 [2018-04-13 03:30:34,372 INFO L226 Difference]: Without dead ends: 1061 [2018-04-13 03:30:34,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 03:30:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-04-13 03:30:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 485. [2018-04-13 03:30:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-13 03:30:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-04-13 03:30:34,375 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 480 [2018-04-13 03:30:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:34,376 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-04-13 03:30:34,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-13 03:30:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-04-13 03:30:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-04-13 03:30:34,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:34,377 INFO L355 BasicCegarLoop]: trace histogram [117, 116, 116, 116, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:34,377 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2074197454, now seen corresponding path program 115 times [2018-04-13 03:30:34,377 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:34,390 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 26921 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:37,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:37,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-04-13 03:30:37,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:37,152 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-13 03:30:37,152 INFO L182 omatonBuilderFactory]: Interpolants [99695#true, 99697#(<= main_~i~0 0), 99696#false, 99699#(<= main_~i~0 2), 99698#(<= main_~i~0 1), 99701#(<= main_~i~0 4), 99700#(<= main_~i~0 3), 99703#(<= main_~i~0 6), 99702#(<= main_~i~0 5), 99705#(<= main_~i~0 8), 99704#(<= main_~i~0 7), 99707#(<= main_~i~0 10), 99706#(<= main_~i~0 9), 99709#(<= main_~i~0 12), 99708#(<= main_~i~0 11), 99711#(<= main_~i~0 14), 99710#(<= main_~i~0 13), 99713#(<= main_~i~0 16), 99712#(<= main_~i~0 15), 99715#(<= main_~i~0 18), 99714#(<= main_~i~0 17), 99717#(<= main_~i~0 20), 99716#(<= main_~i~0 19), 99719#(<= main_~i~0 22), 99718#(<= main_~i~0 21), 99721#(<= main_~i~0 24), 99720#(<= main_~i~0 23), 99723#(<= main_~i~0 26), 99722#(<= main_~i~0 25), 99725#(<= main_~i~0 28), 99724#(<= main_~i~0 27), 99727#(<= main_~i~0 30), 99726#(<= main_~i~0 29), 99729#(<= main_~i~0 32), 99728#(<= main_~i~0 31), 99731#(<= main_~i~0 34), 99730#(<= main_~i~0 33), 99733#(<= main_~i~0 36), 99732#(<= main_~i~0 35), 99735#(<= main_~i~0 38), 99734#(<= main_~i~0 37), 99737#(<= main_~i~0 40), 99736#(<= main_~i~0 39), 99739#(<= main_~i~0 42), 99738#(<= main_~i~0 41), 99741#(<= main_~i~0 44), 99740#(<= main_~i~0 43), 99743#(<= main_~i~0 46), 99742#(<= main_~i~0 45), 99745#(<= main_~i~0 48), 99744#(<= main_~i~0 47), 99747#(<= main_~i~0 50), 99746#(<= main_~i~0 49), 99749#(<= main_~i~0 52), 99748#(<= main_~i~0 51), 99751#(<= main_~i~0 54), 99750#(<= main_~i~0 53), 99753#(<= main_~i~0 56), 99752#(<= main_~i~0 55), 99755#(<= main_~i~0 58), 99754#(<= main_~i~0 57), 99757#(<= main_~i~0 60), 99756#(<= main_~i~0 59), 99759#(<= main_~i~0 62), 99758#(<= main_~i~0 61), 99761#(<= main_~i~0 64), 99760#(<= main_~i~0 63), 99763#(<= main_~i~0 66), 99762#(<= main_~i~0 65), 99765#(<= main_~i~0 68), 99764#(<= main_~i~0 67), 99767#(<= main_~i~0 70), 99766#(<= main_~i~0 69), 99769#(<= main_~i~0 72), 99768#(<= main_~i~0 71), 99771#(<= main_~i~0 74), 99770#(<= main_~i~0 73), 99773#(<= main_~i~0 76), 99772#(<= main_~i~0 75), 99775#(<= main_~i~0 78), 99774#(<= main_~i~0 77), 99777#(<= main_~i~0 80), 99776#(<= main_~i~0 79), 99779#(<= main_~i~0 82), 99778#(<= main_~i~0 81), 99781#(<= main_~i~0 84), 99780#(<= main_~i~0 83), 99783#(<= main_~i~0 86), 99782#(<= main_~i~0 85), 99785#(<= main_~i~0 88), 99784#(<= main_~i~0 87), 99787#(<= main_~i~0 90), 99786#(<= main_~i~0 89), 99789#(<= main_~i~0 92), 99788#(<= main_~i~0 91), 99791#(<= main_~i~0 94), 99790#(<= main_~i~0 93), 99793#(<= main_~i~0 96), 99792#(<= main_~i~0 95), 99795#(<= main_~i~0 98), 99794#(<= main_~i~0 97), 99797#(<= main_~i~0 100), 99796#(<= main_~i~0 99), 99799#(<= main_~i~0 102), 99798#(<= main_~i~0 101), 99801#(<= main_~i~0 104), 99800#(<= main_~i~0 103), 99803#(<= main_~i~0 106), 99802#(<= main_~i~0 105), 99805#(<= main_~i~0 108), 99804#(<= main_~i~0 107), 99807#(<= main_~i~0 110), 99806#(<= main_~i~0 109), 99809#(<= main_~i~0 112), 99808#(<= main_~i~0 111), 99811#(<= main_~i~0 114), 99810#(<= main_~i~0 113), 99813#(<= main_~i~0 116), 99812#(<= main_~i~0 115)] [2018-04-13 03:30:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 26921 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:37,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 03:30:37,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 03:30:37,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 03:30:37,154 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 119 states. [2018-04-13 03:30:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:41,460 INFO L93 Difference]: Finished difference Result 1070 states and 1185 transitions. [2018-04-13 03:30:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-13 03:30:41,476 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 484 [2018-04-13 03:30:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:41,477 INFO L225 Difference]: With dead ends: 1070 [2018-04-13 03:30:41,477 INFO L226 Difference]: Without dead ends: 1070 [2018-04-13 03:30:41,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 03:30:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-04-13 03:30:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 489. [2018-04-13 03:30:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-04-13 03:30:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-04-13 03:30:41,480 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 484 [2018-04-13 03:30:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:41,480 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-04-13 03:30:41,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 03:30:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-04-13 03:30:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-04-13 03:30:41,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:41,482 INFO L355 BasicCegarLoop]: trace histogram [118, 117, 117, 117, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:41,482 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash 194519623, now seen corresponding path program 116 times [2018-04-13 03:30:41,482 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:41,495 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27387 backedges. 0 proven. 27378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:44,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:44,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-04-13 03:30:44,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:44,286 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-13 03:30:44,286 INFO L182 omatonBuilderFactory]: Interpolants [101377#(<= main_~i~0 2), 101376#(<= main_~i~0 1), 101379#(<= main_~i~0 4), 101378#(<= main_~i~0 3), 101381#(<= main_~i~0 6), 101380#(<= main_~i~0 5), 101383#(<= main_~i~0 8), 101382#(<= main_~i~0 7), 101385#(<= main_~i~0 10), 101384#(<= main_~i~0 9), 101387#(<= main_~i~0 12), 101386#(<= main_~i~0 11), 101389#(<= main_~i~0 14), 101388#(<= main_~i~0 13), 101391#(<= main_~i~0 16), 101390#(<= main_~i~0 15), 101393#(<= main_~i~0 18), 101392#(<= main_~i~0 17), 101395#(<= main_~i~0 20), 101394#(<= main_~i~0 19), 101397#(<= main_~i~0 22), 101396#(<= main_~i~0 21), 101399#(<= main_~i~0 24), 101398#(<= main_~i~0 23), 101401#(<= main_~i~0 26), 101400#(<= main_~i~0 25), 101403#(<= main_~i~0 28), 101402#(<= main_~i~0 27), 101405#(<= main_~i~0 30), 101404#(<= main_~i~0 29), 101407#(<= main_~i~0 32), 101406#(<= main_~i~0 31), 101409#(<= main_~i~0 34), 101408#(<= main_~i~0 33), 101411#(<= main_~i~0 36), 101410#(<= main_~i~0 35), 101413#(<= main_~i~0 38), 101412#(<= main_~i~0 37), 101415#(<= main_~i~0 40), 101414#(<= main_~i~0 39), 101417#(<= main_~i~0 42), 101416#(<= main_~i~0 41), 101419#(<= main_~i~0 44), 101418#(<= main_~i~0 43), 101421#(<= main_~i~0 46), 101420#(<= main_~i~0 45), 101423#(<= main_~i~0 48), 101422#(<= main_~i~0 47), 101425#(<= main_~i~0 50), 101424#(<= main_~i~0 49), 101427#(<= main_~i~0 52), 101426#(<= main_~i~0 51), 101429#(<= main_~i~0 54), 101428#(<= main_~i~0 53), 101431#(<= main_~i~0 56), 101430#(<= main_~i~0 55), 101433#(<= main_~i~0 58), 101432#(<= main_~i~0 57), 101435#(<= main_~i~0 60), 101434#(<= main_~i~0 59), 101437#(<= main_~i~0 62), 101436#(<= main_~i~0 61), 101439#(<= main_~i~0 64), 101438#(<= main_~i~0 63), 101441#(<= main_~i~0 66), 101440#(<= main_~i~0 65), 101443#(<= main_~i~0 68), 101442#(<= main_~i~0 67), 101445#(<= main_~i~0 70), 101444#(<= main_~i~0 69), 101447#(<= main_~i~0 72), 101446#(<= main_~i~0 71), 101449#(<= main_~i~0 74), 101448#(<= main_~i~0 73), 101451#(<= main_~i~0 76), 101450#(<= main_~i~0 75), 101453#(<= main_~i~0 78), 101452#(<= main_~i~0 77), 101455#(<= main_~i~0 80), 101454#(<= main_~i~0 79), 101457#(<= main_~i~0 82), 101456#(<= main_~i~0 81), 101459#(<= main_~i~0 84), 101458#(<= main_~i~0 83), 101461#(<= main_~i~0 86), 101460#(<= main_~i~0 85), 101463#(<= main_~i~0 88), 101462#(<= main_~i~0 87), 101465#(<= main_~i~0 90), 101464#(<= main_~i~0 89), 101467#(<= main_~i~0 92), 101466#(<= main_~i~0 91), 101469#(<= main_~i~0 94), 101468#(<= main_~i~0 93), 101471#(<= main_~i~0 96), 101470#(<= main_~i~0 95), 101473#(<= main_~i~0 98), 101472#(<= main_~i~0 97), 101475#(<= main_~i~0 100), 101474#(<= main_~i~0 99), 101477#(<= main_~i~0 102), 101476#(<= main_~i~0 101), 101479#(<= main_~i~0 104), 101478#(<= main_~i~0 103), 101481#(<= main_~i~0 106), 101480#(<= main_~i~0 105), 101483#(<= main_~i~0 108), 101482#(<= main_~i~0 107), 101485#(<= main_~i~0 110), 101484#(<= main_~i~0 109), 101487#(<= main_~i~0 112), 101486#(<= main_~i~0 111), 101489#(<= main_~i~0 114), 101488#(<= main_~i~0 113), 101491#(<= main_~i~0 116), 101490#(<= main_~i~0 115), 101492#(<= main_~i~0 117), 101373#true, 101375#(<= main_~i~0 0), 101374#false] [2018-04-13 03:30:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27387 backedges. 0 proven. 27378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:44,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-13 03:30:44,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-13 03:30:44,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-04-13 03:30:44,288 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 120 states. [2018-04-13 03:30:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:49,415 INFO L93 Difference]: Finished difference Result 1079 states and 1195 transitions. [2018-04-13 03:30:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-13 03:30:49,415 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 488 [2018-04-13 03:30:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:49,416 INFO L225 Difference]: With dead ends: 1079 [2018-04-13 03:30:49,416 INFO L226 Difference]: Without dead ends: 1079 [2018-04-13 03:30:49,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-04-13 03:30:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2018-04-13 03:30:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 493. [2018-04-13 03:30:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-13 03:30:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-04-13 03:30:49,419 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 488 [2018-04-13 03:30:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:49,419 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-04-13 03:30:49,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-13 03:30:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-04-13 03:30:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-13 03:30:49,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:49,420 INFO L355 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:49,420 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 946184768, now seen corresponding path program 117 times [2018-04-13 03:30:49,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:49,433 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27857 backedges. 0 proven. 27848 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:52,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:52,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-04-13 03:30:52,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:52,286 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-13 03:30:52,286 INFO L182 omatonBuilderFactory]: Interpolants [103169#(<= main_~i~0 102), 103168#(<= main_~i~0 101), 103171#(<= main_~i~0 104), 103170#(<= main_~i~0 103), 103173#(<= main_~i~0 106), 103172#(<= main_~i~0 105), 103175#(<= main_~i~0 108), 103174#(<= main_~i~0 107), 103177#(<= main_~i~0 110), 103176#(<= main_~i~0 109), 103179#(<= main_~i~0 112), 103178#(<= main_~i~0 111), 103181#(<= main_~i~0 114), 103180#(<= main_~i~0 113), 103183#(<= main_~i~0 116), 103182#(<= main_~i~0 115), 103185#(<= main_~i~0 118), 103184#(<= main_~i~0 117), 103065#true, 103067#(<= main_~i~0 0), 103066#false, 103069#(<= main_~i~0 2), 103068#(<= main_~i~0 1), 103071#(<= main_~i~0 4), 103070#(<= main_~i~0 3), 103073#(<= main_~i~0 6), 103072#(<= main_~i~0 5), 103075#(<= main_~i~0 8), 103074#(<= main_~i~0 7), 103077#(<= main_~i~0 10), 103076#(<= main_~i~0 9), 103079#(<= main_~i~0 12), 103078#(<= main_~i~0 11), 103081#(<= main_~i~0 14), 103080#(<= main_~i~0 13), 103083#(<= main_~i~0 16), 103082#(<= main_~i~0 15), 103085#(<= main_~i~0 18), 103084#(<= main_~i~0 17), 103087#(<= main_~i~0 20), 103086#(<= main_~i~0 19), 103089#(<= main_~i~0 22), 103088#(<= main_~i~0 21), 103091#(<= main_~i~0 24), 103090#(<= main_~i~0 23), 103093#(<= main_~i~0 26), 103092#(<= main_~i~0 25), 103095#(<= main_~i~0 28), 103094#(<= main_~i~0 27), 103097#(<= main_~i~0 30), 103096#(<= main_~i~0 29), 103099#(<= main_~i~0 32), 103098#(<= main_~i~0 31), 103101#(<= main_~i~0 34), 103100#(<= main_~i~0 33), 103103#(<= main_~i~0 36), 103102#(<= main_~i~0 35), 103105#(<= main_~i~0 38), 103104#(<= main_~i~0 37), 103107#(<= main_~i~0 40), 103106#(<= main_~i~0 39), 103109#(<= main_~i~0 42), 103108#(<= main_~i~0 41), 103111#(<= main_~i~0 44), 103110#(<= main_~i~0 43), 103113#(<= main_~i~0 46), 103112#(<= main_~i~0 45), 103115#(<= main_~i~0 48), 103114#(<= main_~i~0 47), 103117#(<= main_~i~0 50), 103116#(<= main_~i~0 49), 103119#(<= main_~i~0 52), 103118#(<= main_~i~0 51), 103121#(<= main_~i~0 54), 103120#(<= main_~i~0 53), 103123#(<= main_~i~0 56), 103122#(<= main_~i~0 55), 103125#(<= main_~i~0 58), 103124#(<= main_~i~0 57), 103127#(<= main_~i~0 60), 103126#(<= main_~i~0 59), 103129#(<= main_~i~0 62), 103128#(<= main_~i~0 61), 103131#(<= main_~i~0 64), 103130#(<= main_~i~0 63), 103133#(<= main_~i~0 66), 103132#(<= main_~i~0 65), 103135#(<= main_~i~0 68), 103134#(<= main_~i~0 67), 103137#(<= main_~i~0 70), 103136#(<= main_~i~0 69), 103139#(<= main_~i~0 72), 103138#(<= main_~i~0 71), 103141#(<= main_~i~0 74), 103140#(<= main_~i~0 73), 103143#(<= main_~i~0 76), 103142#(<= main_~i~0 75), 103145#(<= main_~i~0 78), 103144#(<= main_~i~0 77), 103147#(<= main_~i~0 80), 103146#(<= main_~i~0 79), 103149#(<= main_~i~0 82), 103148#(<= main_~i~0 81), 103151#(<= main_~i~0 84), 103150#(<= main_~i~0 83), 103153#(<= main_~i~0 86), 103152#(<= main_~i~0 85), 103155#(<= main_~i~0 88), 103154#(<= main_~i~0 87), 103157#(<= main_~i~0 90), 103156#(<= main_~i~0 89), 103159#(<= main_~i~0 92), 103158#(<= main_~i~0 91), 103161#(<= main_~i~0 94), 103160#(<= main_~i~0 93), 103163#(<= main_~i~0 96), 103162#(<= main_~i~0 95), 103165#(<= main_~i~0 98), 103164#(<= main_~i~0 97), 103167#(<= main_~i~0 100), 103166#(<= main_~i~0 99)] [2018-04-13 03:30:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27857 backedges. 0 proven. 27848 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:52,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-13 03:30:52,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-13 03:30:52,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 03:30:52,288 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 121 states. [2018-04-13 03:30:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:30:56,847 INFO L93 Difference]: Finished difference Result 1088 states and 1205 transitions. [2018-04-13 03:30:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-13 03:30:56,848 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 492 [2018-04-13 03:30:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:30:56,848 INFO L225 Difference]: With dead ends: 1088 [2018-04-13 03:30:56,848 INFO L226 Difference]: Without dead ends: 1088 [2018-04-13 03:30:56,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 03:30:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-04-13 03:30:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 497. [2018-04-13 03:30:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-13 03:30:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-04-13 03:30:56,851 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 492 [2018-04-13 03:30:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:30:56,851 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-04-13 03:30:56,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-13 03:30:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-04-13 03:30:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-04-13 03:30:56,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:30:56,853 INFO L355 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:30:56,853 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:30:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1108377017, now seen corresponding path program 118 times [2018-04-13 03:30:56,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:30:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:30:56,866 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:30:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28331 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:59,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:30:59,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-04-13 03:30:59,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:30:59,714 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-13 03:30:59,714 INFO L182 omatonBuilderFactory]: Interpolants [104771#true, 104773#(<= main_~i~0 0), 104772#false, 104775#(<= main_~i~0 2), 104774#(<= main_~i~0 1), 104777#(<= main_~i~0 4), 104776#(<= main_~i~0 3), 104779#(<= main_~i~0 6), 104778#(<= main_~i~0 5), 104781#(<= main_~i~0 8), 104780#(<= main_~i~0 7), 104783#(<= main_~i~0 10), 104782#(<= main_~i~0 9), 104785#(<= main_~i~0 12), 104784#(<= main_~i~0 11), 104787#(<= main_~i~0 14), 104786#(<= main_~i~0 13), 104789#(<= main_~i~0 16), 104788#(<= main_~i~0 15), 104791#(<= main_~i~0 18), 104790#(<= main_~i~0 17), 104793#(<= main_~i~0 20), 104792#(<= main_~i~0 19), 104795#(<= main_~i~0 22), 104794#(<= main_~i~0 21), 104797#(<= main_~i~0 24), 104796#(<= main_~i~0 23), 104799#(<= main_~i~0 26), 104798#(<= main_~i~0 25), 104801#(<= main_~i~0 28), 104800#(<= main_~i~0 27), 104803#(<= main_~i~0 30), 104802#(<= main_~i~0 29), 104805#(<= main_~i~0 32), 104804#(<= main_~i~0 31), 104807#(<= main_~i~0 34), 104806#(<= main_~i~0 33), 104809#(<= main_~i~0 36), 104808#(<= main_~i~0 35), 104811#(<= main_~i~0 38), 104810#(<= main_~i~0 37), 104813#(<= main_~i~0 40), 104812#(<= main_~i~0 39), 104815#(<= main_~i~0 42), 104814#(<= main_~i~0 41), 104817#(<= main_~i~0 44), 104816#(<= main_~i~0 43), 104819#(<= main_~i~0 46), 104818#(<= main_~i~0 45), 104821#(<= main_~i~0 48), 104820#(<= main_~i~0 47), 104823#(<= main_~i~0 50), 104822#(<= main_~i~0 49), 104825#(<= main_~i~0 52), 104824#(<= main_~i~0 51), 104827#(<= main_~i~0 54), 104826#(<= main_~i~0 53), 104829#(<= main_~i~0 56), 104828#(<= main_~i~0 55), 104831#(<= main_~i~0 58), 104830#(<= main_~i~0 57), 104833#(<= main_~i~0 60), 104832#(<= main_~i~0 59), 104835#(<= main_~i~0 62), 104834#(<= main_~i~0 61), 104837#(<= main_~i~0 64), 104836#(<= main_~i~0 63), 104839#(<= main_~i~0 66), 104838#(<= main_~i~0 65), 104841#(<= main_~i~0 68), 104840#(<= main_~i~0 67), 104843#(<= main_~i~0 70), 104842#(<= main_~i~0 69), 104845#(<= main_~i~0 72), 104844#(<= main_~i~0 71), 104847#(<= main_~i~0 74), 104846#(<= main_~i~0 73), 104849#(<= main_~i~0 76), 104848#(<= main_~i~0 75), 104851#(<= main_~i~0 78), 104850#(<= main_~i~0 77), 104853#(<= main_~i~0 80), 104852#(<= main_~i~0 79), 104855#(<= main_~i~0 82), 104854#(<= main_~i~0 81), 104857#(<= main_~i~0 84), 104856#(<= main_~i~0 83), 104859#(<= main_~i~0 86), 104858#(<= main_~i~0 85), 104861#(<= main_~i~0 88), 104860#(<= main_~i~0 87), 104863#(<= main_~i~0 90), 104862#(<= main_~i~0 89), 104865#(<= main_~i~0 92), 104864#(<= main_~i~0 91), 104867#(<= main_~i~0 94), 104866#(<= main_~i~0 93), 104869#(<= main_~i~0 96), 104868#(<= main_~i~0 95), 104871#(<= main_~i~0 98), 104870#(<= main_~i~0 97), 104873#(<= main_~i~0 100), 104872#(<= main_~i~0 99), 104875#(<= main_~i~0 102), 104874#(<= main_~i~0 101), 104877#(<= main_~i~0 104), 104876#(<= main_~i~0 103), 104879#(<= main_~i~0 106), 104878#(<= main_~i~0 105), 104881#(<= main_~i~0 108), 104880#(<= main_~i~0 107), 104883#(<= main_~i~0 110), 104882#(<= main_~i~0 109), 104885#(<= main_~i~0 112), 104884#(<= main_~i~0 111), 104887#(<= main_~i~0 114), 104886#(<= main_~i~0 113), 104889#(<= main_~i~0 116), 104888#(<= main_~i~0 115), 104891#(<= main_~i~0 118), 104890#(<= main_~i~0 117), 104892#(<= main_~i~0 119)] [2018-04-13 03:30:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 28331 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:30:59,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 03:30:59,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 03:30:59,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 03:30:59,716 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 122 states. [2018-04-13 03:31:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:04,165 INFO L93 Difference]: Finished difference Result 1097 states and 1215 transitions. [2018-04-13 03:31:04,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-13 03:31:04,166 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 496 [2018-04-13 03:31:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:04,166 INFO L225 Difference]: With dead ends: 1097 [2018-04-13 03:31:04,166 INFO L226 Difference]: Without dead ends: 1097 [2018-04-13 03:31:04,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 03:31:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-04-13 03:31:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 501. [2018-04-13 03:31:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-04-13 03:31:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 502 transitions. [2018-04-13 03:31:04,169 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 502 transitions. Word has length 496 [2018-04-13 03:31:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:04,170 INFO L459 AbstractCegarLoop]: Abstraction has 501 states and 502 transitions. [2018-04-13 03:31:04,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 03:31:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 502 transitions. [2018-04-13 03:31:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-04-13 03:31:04,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:04,171 INFO L355 BasicCegarLoop]: trace histogram [121, 120, 120, 120, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:04,171 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2071917746, now seen corresponding path program 119 times [2018-04-13 03:31:04,171 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:04,185 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28809 backedges. 0 proven. 28800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:07,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:07,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-04-13 03:31:07,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:07,130 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-13 03:31:07,130 INFO L182 omatonBuilderFactory]: Interpolants [106497#(<= main_~i~0 4), 106496#(<= main_~i~0 3), 106499#(<= main_~i~0 6), 106498#(<= main_~i~0 5), 106501#(<= main_~i~0 8), 106500#(<= main_~i~0 7), 106503#(<= main_~i~0 10), 106502#(<= main_~i~0 9), 106505#(<= main_~i~0 12), 106504#(<= main_~i~0 11), 106507#(<= main_~i~0 14), 106506#(<= main_~i~0 13), 106509#(<= main_~i~0 16), 106508#(<= main_~i~0 15), 106511#(<= main_~i~0 18), 106510#(<= main_~i~0 17), 106513#(<= main_~i~0 20), 106512#(<= main_~i~0 19), 106515#(<= main_~i~0 22), 106514#(<= main_~i~0 21), 106517#(<= main_~i~0 24), 106516#(<= main_~i~0 23), 106519#(<= main_~i~0 26), 106518#(<= main_~i~0 25), 106521#(<= main_~i~0 28), 106520#(<= main_~i~0 27), 106523#(<= main_~i~0 30), 106522#(<= main_~i~0 29), 106525#(<= main_~i~0 32), 106524#(<= main_~i~0 31), 106527#(<= main_~i~0 34), 106526#(<= main_~i~0 33), 106529#(<= main_~i~0 36), 106528#(<= main_~i~0 35), 106531#(<= main_~i~0 38), 106530#(<= main_~i~0 37), 106533#(<= main_~i~0 40), 106532#(<= main_~i~0 39), 106535#(<= main_~i~0 42), 106534#(<= main_~i~0 41), 106537#(<= main_~i~0 44), 106536#(<= main_~i~0 43), 106539#(<= main_~i~0 46), 106538#(<= main_~i~0 45), 106541#(<= main_~i~0 48), 106540#(<= main_~i~0 47), 106543#(<= main_~i~0 50), 106542#(<= main_~i~0 49), 106545#(<= main_~i~0 52), 106544#(<= main_~i~0 51), 106547#(<= main_~i~0 54), 106546#(<= main_~i~0 53), 106549#(<= main_~i~0 56), 106548#(<= main_~i~0 55), 106551#(<= main_~i~0 58), 106550#(<= main_~i~0 57), 106553#(<= main_~i~0 60), 106552#(<= main_~i~0 59), 106555#(<= main_~i~0 62), 106554#(<= main_~i~0 61), 106557#(<= main_~i~0 64), 106556#(<= main_~i~0 63), 106559#(<= main_~i~0 66), 106558#(<= main_~i~0 65), 106561#(<= main_~i~0 68), 106560#(<= main_~i~0 67), 106563#(<= main_~i~0 70), 106562#(<= main_~i~0 69), 106565#(<= main_~i~0 72), 106564#(<= main_~i~0 71), 106567#(<= main_~i~0 74), 106566#(<= main_~i~0 73), 106569#(<= main_~i~0 76), 106568#(<= main_~i~0 75), 106571#(<= main_~i~0 78), 106570#(<= main_~i~0 77), 106573#(<= main_~i~0 80), 106572#(<= main_~i~0 79), 106575#(<= main_~i~0 82), 106574#(<= main_~i~0 81), 106577#(<= main_~i~0 84), 106576#(<= main_~i~0 83), 106579#(<= main_~i~0 86), 106578#(<= main_~i~0 85), 106581#(<= main_~i~0 88), 106580#(<= main_~i~0 87), 106583#(<= main_~i~0 90), 106582#(<= main_~i~0 89), 106585#(<= main_~i~0 92), 106584#(<= main_~i~0 91), 106587#(<= main_~i~0 94), 106586#(<= main_~i~0 93), 106589#(<= main_~i~0 96), 106588#(<= main_~i~0 95), 106591#(<= main_~i~0 98), 106590#(<= main_~i~0 97), 106593#(<= main_~i~0 100), 106592#(<= main_~i~0 99), 106595#(<= main_~i~0 102), 106594#(<= main_~i~0 101), 106597#(<= main_~i~0 104), 106596#(<= main_~i~0 103), 106599#(<= main_~i~0 106), 106598#(<= main_~i~0 105), 106601#(<= main_~i~0 108), 106600#(<= main_~i~0 107), 106603#(<= main_~i~0 110), 106602#(<= main_~i~0 109), 106605#(<= main_~i~0 112), 106604#(<= main_~i~0 111), 106607#(<= main_~i~0 114), 106606#(<= main_~i~0 113), 106609#(<= main_~i~0 116), 106608#(<= main_~i~0 115), 106611#(<= main_~i~0 118), 106610#(<= main_~i~0 117), 106613#(<= main_~i~0 120), 106612#(<= main_~i~0 119), 106491#true, 106493#(<= main_~i~0 0), 106492#false, 106495#(<= main_~i~0 2), 106494#(<= main_~i~0 1)] [2018-04-13 03:31:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 28809 backedges. 0 proven. 28800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:07,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-13 03:31:07,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-13 03:31:07,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 03:31:07,132 INFO L87 Difference]: Start difference. First operand 501 states and 502 transitions. Second operand 123 states. [2018-04-13 03:31:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:12,410 INFO L93 Difference]: Finished difference Result 1106 states and 1225 transitions. [2018-04-13 03:31:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-13 03:31:12,410 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 500 [2018-04-13 03:31:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:12,411 INFO L225 Difference]: With dead ends: 1106 [2018-04-13 03:31:12,411 INFO L226 Difference]: Without dead ends: 1106 [2018-04-13 03:31:12,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 03:31:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-04-13 03:31:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 505. [2018-04-13 03:31:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-04-13 03:31:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2018-04-13 03:31:12,414 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 500 [2018-04-13 03:31:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:12,414 INFO L459 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2018-04-13 03:31:12,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-13 03:31:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2018-04-13 03:31:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-04-13 03:31:12,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:12,416 INFO L355 BasicCegarLoop]: trace histogram [122, 121, 121, 121, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:12,416 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -629717205, now seen corresponding path program 120 times [2018-04-13 03:31:12,416 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:12,429 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 29291 backedges. 0 proven. 29282 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:15,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:15,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-04-13 03:31:15,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:15,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-13 03:31:15,414 INFO L182 omatonBuilderFactory]: Interpolants [108289#(<= main_~i~0 62), 108288#(<= main_~i~0 61), 108291#(<= main_~i~0 64), 108290#(<= main_~i~0 63), 108293#(<= main_~i~0 66), 108292#(<= main_~i~0 65), 108295#(<= main_~i~0 68), 108294#(<= main_~i~0 67), 108297#(<= main_~i~0 70), 108296#(<= main_~i~0 69), 108299#(<= main_~i~0 72), 108298#(<= main_~i~0 71), 108301#(<= main_~i~0 74), 108300#(<= main_~i~0 73), 108303#(<= main_~i~0 76), 108302#(<= main_~i~0 75), 108305#(<= main_~i~0 78), 108304#(<= main_~i~0 77), 108307#(<= main_~i~0 80), 108306#(<= main_~i~0 79), 108309#(<= main_~i~0 82), 108308#(<= main_~i~0 81), 108311#(<= main_~i~0 84), 108310#(<= main_~i~0 83), 108313#(<= main_~i~0 86), 108312#(<= main_~i~0 85), 108315#(<= main_~i~0 88), 108314#(<= main_~i~0 87), 108317#(<= main_~i~0 90), 108316#(<= main_~i~0 89), 108319#(<= main_~i~0 92), 108318#(<= main_~i~0 91), 108321#(<= main_~i~0 94), 108320#(<= main_~i~0 93), 108323#(<= main_~i~0 96), 108322#(<= main_~i~0 95), 108325#(<= main_~i~0 98), 108324#(<= main_~i~0 97), 108327#(<= main_~i~0 100), 108326#(<= main_~i~0 99), 108329#(<= main_~i~0 102), 108328#(<= main_~i~0 101), 108331#(<= main_~i~0 104), 108330#(<= main_~i~0 103), 108333#(<= main_~i~0 106), 108332#(<= main_~i~0 105), 108335#(<= main_~i~0 108), 108334#(<= main_~i~0 107), 108337#(<= main_~i~0 110), 108336#(<= main_~i~0 109), 108339#(<= main_~i~0 112), 108338#(<= main_~i~0 111), 108341#(<= main_~i~0 114), 108340#(<= main_~i~0 113), 108343#(<= main_~i~0 116), 108342#(<= main_~i~0 115), 108345#(<= main_~i~0 118), 108344#(<= main_~i~0 117), 108347#(<= main_~i~0 120), 108346#(<= main_~i~0 119), 108348#(<= main_~i~0 121), 108225#true, 108227#(<= main_~i~0 0), 108226#false, 108229#(<= main_~i~0 2), 108228#(<= main_~i~0 1), 108231#(<= main_~i~0 4), 108230#(<= main_~i~0 3), 108233#(<= main_~i~0 6), 108232#(<= main_~i~0 5), 108235#(<= main_~i~0 8), 108234#(<= main_~i~0 7), 108237#(<= main_~i~0 10), 108236#(<= main_~i~0 9), 108239#(<= main_~i~0 12), 108238#(<= main_~i~0 11), 108241#(<= main_~i~0 14), 108240#(<= main_~i~0 13), 108243#(<= main_~i~0 16), 108242#(<= main_~i~0 15), 108245#(<= main_~i~0 18), 108244#(<= main_~i~0 17), 108247#(<= main_~i~0 20), 108246#(<= main_~i~0 19), 108249#(<= main_~i~0 22), 108248#(<= main_~i~0 21), 108251#(<= main_~i~0 24), 108250#(<= main_~i~0 23), 108253#(<= main_~i~0 26), 108252#(<= main_~i~0 25), 108255#(<= main_~i~0 28), 108254#(<= main_~i~0 27), 108257#(<= main_~i~0 30), 108256#(<= main_~i~0 29), 108259#(<= main_~i~0 32), 108258#(<= main_~i~0 31), 108261#(<= main_~i~0 34), 108260#(<= main_~i~0 33), 108263#(<= main_~i~0 36), 108262#(<= main_~i~0 35), 108265#(<= main_~i~0 38), 108264#(<= main_~i~0 37), 108267#(<= main_~i~0 40), 108266#(<= main_~i~0 39), 108269#(<= main_~i~0 42), 108268#(<= main_~i~0 41), 108271#(<= main_~i~0 44), 108270#(<= main_~i~0 43), 108273#(<= main_~i~0 46), 108272#(<= main_~i~0 45), 108275#(<= main_~i~0 48), 108274#(<= main_~i~0 47), 108277#(<= main_~i~0 50), 108276#(<= main_~i~0 49), 108279#(<= main_~i~0 52), 108278#(<= main_~i~0 51), 108281#(<= main_~i~0 54), 108280#(<= main_~i~0 53), 108283#(<= main_~i~0 56), 108282#(<= main_~i~0 55), 108285#(<= main_~i~0 58), 108284#(<= main_~i~0 57), 108287#(<= main_~i~0 60), 108286#(<= main_~i~0 59)] [2018-04-13 03:31:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 29291 backedges. 0 proven. 29282 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-04-13 03:31:15,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-04-13 03:31:15,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 03:31:15,416 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand 124 states. [2018-04-13 03:31:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:19,122 INFO L93 Difference]: Finished difference Result 1115 states and 1235 transitions. [2018-04-13 03:31:19,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-13 03:31:19,122 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 504 [2018-04-13 03:31:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:19,123 INFO L225 Difference]: With dead ends: 1115 [2018-04-13 03:31:19,123 INFO L226 Difference]: Without dead ends: 1115 [2018-04-13 03:31:19,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 03:31:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-04-13 03:31:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 509. [2018-04-13 03:31:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-04-13 03:31:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 510 transitions. [2018-04-13 03:31:19,126 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 510 transitions. Word has length 504 [2018-04-13 03:31:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:19,126 INFO L459 AbstractCegarLoop]: Abstraction has 509 states and 510 transitions. [2018-04-13 03:31:19,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-04-13 03:31:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 510 transitions. [2018-04-13 03:31:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-13 03:31:19,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:19,127 INFO L355 BasicCegarLoop]: trace histogram [123, 122, 122, 122, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:19,127 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:19,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2019576540, now seen corresponding path program 121 times [2018-04-13 03:31:19,128 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:19,140 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29777 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:22,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:22,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-04-13 03:31:22,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:22,206 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-13 03:31:22,206 INFO L182 omatonBuilderFactory]: Interpolants [110081#(<= main_~i~0 106), 110080#(<= main_~i~0 105), 110083#(<= main_~i~0 108), 110082#(<= main_~i~0 107), 110085#(<= main_~i~0 110), 110084#(<= main_~i~0 109), 110087#(<= main_~i~0 112), 110086#(<= main_~i~0 111), 110089#(<= main_~i~0 114), 110088#(<= main_~i~0 113), 110091#(<= main_~i~0 116), 110090#(<= main_~i~0 115), 110093#(<= main_~i~0 118), 110092#(<= main_~i~0 117), 110095#(<= main_~i~0 120), 110094#(<= main_~i~0 119), 110097#(<= main_~i~0 122), 110096#(<= main_~i~0 121), 109973#true, 109975#(<= main_~i~0 0), 109974#false, 109977#(<= main_~i~0 2), 109976#(<= main_~i~0 1), 109979#(<= main_~i~0 4), 109978#(<= main_~i~0 3), 109981#(<= main_~i~0 6), 109980#(<= main_~i~0 5), 109983#(<= main_~i~0 8), 109982#(<= main_~i~0 7), 109985#(<= main_~i~0 10), 109984#(<= main_~i~0 9), 109987#(<= main_~i~0 12), 109986#(<= main_~i~0 11), 109989#(<= main_~i~0 14), 109988#(<= main_~i~0 13), 109991#(<= main_~i~0 16), 109990#(<= main_~i~0 15), 109993#(<= main_~i~0 18), 109992#(<= main_~i~0 17), 109995#(<= main_~i~0 20), 109994#(<= main_~i~0 19), 109997#(<= main_~i~0 22), 109996#(<= main_~i~0 21), 109999#(<= main_~i~0 24), 109998#(<= main_~i~0 23), 110001#(<= main_~i~0 26), 110000#(<= main_~i~0 25), 110003#(<= main_~i~0 28), 110002#(<= main_~i~0 27), 110005#(<= main_~i~0 30), 110004#(<= main_~i~0 29), 110007#(<= main_~i~0 32), 110006#(<= main_~i~0 31), 110009#(<= main_~i~0 34), 110008#(<= main_~i~0 33), 110011#(<= main_~i~0 36), 110010#(<= main_~i~0 35), 110013#(<= main_~i~0 38), 110012#(<= main_~i~0 37), 110015#(<= main_~i~0 40), 110014#(<= main_~i~0 39), 110017#(<= main_~i~0 42), 110016#(<= main_~i~0 41), 110019#(<= main_~i~0 44), 110018#(<= main_~i~0 43), 110021#(<= main_~i~0 46), 110020#(<= main_~i~0 45), 110023#(<= main_~i~0 48), 110022#(<= main_~i~0 47), 110025#(<= main_~i~0 50), 110024#(<= main_~i~0 49), 110027#(<= main_~i~0 52), 110026#(<= main_~i~0 51), 110029#(<= main_~i~0 54), 110028#(<= main_~i~0 53), 110031#(<= main_~i~0 56), 110030#(<= main_~i~0 55), 110033#(<= main_~i~0 58), 110032#(<= main_~i~0 57), 110035#(<= main_~i~0 60), 110034#(<= main_~i~0 59), 110037#(<= main_~i~0 62), 110036#(<= main_~i~0 61), 110039#(<= main_~i~0 64), 110038#(<= main_~i~0 63), 110041#(<= main_~i~0 66), 110040#(<= main_~i~0 65), 110043#(<= main_~i~0 68), 110042#(<= main_~i~0 67), 110045#(<= main_~i~0 70), 110044#(<= main_~i~0 69), 110047#(<= main_~i~0 72), 110046#(<= main_~i~0 71), 110049#(<= main_~i~0 74), 110048#(<= main_~i~0 73), 110051#(<= main_~i~0 76), 110050#(<= main_~i~0 75), 110053#(<= main_~i~0 78), 110052#(<= main_~i~0 77), 110055#(<= main_~i~0 80), 110054#(<= main_~i~0 79), 110057#(<= main_~i~0 82), 110056#(<= main_~i~0 81), 110059#(<= main_~i~0 84), 110058#(<= main_~i~0 83), 110061#(<= main_~i~0 86), 110060#(<= main_~i~0 85), 110063#(<= main_~i~0 88), 110062#(<= main_~i~0 87), 110065#(<= main_~i~0 90), 110064#(<= main_~i~0 89), 110067#(<= main_~i~0 92), 110066#(<= main_~i~0 91), 110069#(<= main_~i~0 94), 110068#(<= main_~i~0 93), 110071#(<= main_~i~0 96), 110070#(<= main_~i~0 95), 110073#(<= main_~i~0 98), 110072#(<= main_~i~0 97), 110075#(<= main_~i~0 100), 110074#(<= main_~i~0 99), 110077#(<= main_~i~0 102), 110076#(<= main_~i~0 101), 110079#(<= main_~i~0 104), 110078#(<= main_~i~0 103)] [2018-04-13 03:31:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 29777 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:22,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-13 03:31:22,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-13 03:31:22,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 03:31:22,208 INFO L87 Difference]: Start difference. First operand 509 states and 510 transitions. Second operand 125 states. [2018-04-13 03:31:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:27,211 INFO L93 Difference]: Finished difference Result 1124 states and 1245 transitions. [2018-04-13 03:31:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-13 03:31:27,211 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 508 [2018-04-13 03:31:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:27,212 INFO L225 Difference]: With dead ends: 1124 [2018-04-13 03:31:27,212 INFO L226 Difference]: Without dead ends: 1124 [2018-04-13 03:31:27,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 03:31:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-04-13 03:31:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 513. [2018-04-13 03:31:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-13 03:31:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 514 transitions. [2018-04-13 03:31:27,215 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 514 transitions. Word has length 508 [2018-04-13 03:31:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:27,215 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 514 transitions. [2018-04-13 03:31:27,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-13 03:31:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 514 transitions. [2018-04-13 03:31:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-04-13 03:31:27,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:27,216 INFO L355 BasicCegarLoop]: trace histogram [124, 123, 123, 123, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:27,216 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1853783709, now seen corresponding path program 122 times [2018-04-13 03:31:27,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:27,229 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30267 backedges. 0 proven. 30258 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:30,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:30,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-04-13 03:31:30,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31: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-13 03:31:30,338 INFO L182 omatonBuilderFactory]: Interpolants [111735#true, 111737#(<= main_~i~0 0), 111736#false, 111739#(<= main_~i~0 2), 111738#(<= main_~i~0 1), 111741#(<= main_~i~0 4), 111740#(<= main_~i~0 3), 111743#(<= main_~i~0 6), 111742#(<= main_~i~0 5), 111745#(<= main_~i~0 8), 111744#(<= main_~i~0 7), 111747#(<= main_~i~0 10), 111746#(<= main_~i~0 9), 111749#(<= main_~i~0 12), 111748#(<= main_~i~0 11), 111751#(<= main_~i~0 14), 111750#(<= main_~i~0 13), 111753#(<= main_~i~0 16), 111752#(<= main_~i~0 15), 111755#(<= main_~i~0 18), 111754#(<= main_~i~0 17), 111757#(<= main_~i~0 20), 111756#(<= main_~i~0 19), 111759#(<= main_~i~0 22), 111758#(<= main_~i~0 21), 111761#(<= main_~i~0 24), 111760#(<= main_~i~0 23), 111763#(<= main_~i~0 26), 111762#(<= main_~i~0 25), 111765#(<= main_~i~0 28), 111764#(<= main_~i~0 27), 111767#(<= main_~i~0 30), 111766#(<= main_~i~0 29), 111769#(<= main_~i~0 32), 111768#(<= main_~i~0 31), 111771#(<= main_~i~0 34), 111770#(<= main_~i~0 33), 111773#(<= main_~i~0 36), 111772#(<= main_~i~0 35), 111775#(<= main_~i~0 38), 111774#(<= main_~i~0 37), 111777#(<= main_~i~0 40), 111776#(<= main_~i~0 39), 111779#(<= main_~i~0 42), 111778#(<= main_~i~0 41), 111781#(<= main_~i~0 44), 111780#(<= main_~i~0 43), 111783#(<= main_~i~0 46), 111782#(<= main_~i~0 45), 111785#(<= main_~i~0 48), 111784#(<= main_~i~0 47), 111787#(<= main_~i~0 50), 111786#(<= main_~i~0 49), 111789#(<= main_~i~0 52), 111788#(<= main_~i~0 51), 111791#(<= main_~i~0 54), 111790#(<= main_~i~0 53), 111793#(<= main_~i~0 56), 111792#(<= main_~i~0 55), 111795#(<= main_~i~0 58), 111794#(<= main_~i~0 57), 111797#(<= main_~i~0 60), 111796#(<= main_~i~0 59), 111799#(<= main_~i~0 62), 111798#(<= main_~i~0 61), 111801#(<= main_~i~0 64), 111800#(<= main_~i~0 63), 111803#(<= main_~i~0 66), 111802#(<= main_~i~0 65), 111805#(<= main_~i~0 68), 111804#(<= main_~i~0 67), 111807#(<= main_~i~0 70), 111806#(<= main_~i~0 69), 111809#(<= main_~i~0 72), 111808#(<= main_~i~0 71), 111811#(<= main_~i~0 74), 111810#(<= main_~i~0 73), 111813#(<= main_~i~0 76), 111812#(<= main_~i~0 75), 111815#(<= main_~i~0 78), 111814#(<= main_~i~0 77), 111817#(<= main_~i~0 80), 111816#(<= main_~i~0 79), 111819#(<= main_~i~0 82), 111818#(<= main_~i~0 81), 111821#(<= main_~i~0 84), 111820#(<= main_~i~0 83), 111823#(<= main_~i~0 86), 111822#(<= main_~i~0 85), 111825#(<= main_~i~0 88), 111824#(<= main_~i~0 87), 111827#(<= main_~i~0 90), 111826#(<= main_~i~0 89), 111829#(<= main_~i~0 92), 111828#(<= main_~i~0 91), 111831#(<= main_~i~0 94), 111830#(<= main_~i~0 93), 111833#(<= main_~i~0 96), 111832#(<= main_~i~0 95), 111835#(<= main_~i~0 98), 111834#(<= main_~i~0 97), 111837#(<= main_~i~0 100), 111836#(<= main_~i~0 99), 111839#(<= main_~i~0 102), 111838#(<= main_~i~0 101), 111841#(<= main_~i~0 104), 111840#(<= main_~i~0 103), 111843#(<= main_~i~0 106), 111842#(<= main_~i~0 105), 111845#(<= main_~i~0 108), 111844#(<= main_~i~0 107), 111847#(<= main_~i~0 110), 111846#(<= main_~i~0 109), 111849#(<= main_~i~0 112), 111848#(<= main_~i~0 111), 111851#(<= main_~i~0 114), 111850#(<= main_~i~0 113), 111853#(<= main_~i~0 116), 111852#(<= main_~i~0 115), 111855#(<= main_~i~0 118), 111854#(<= main_~i~0 117), 111857#(<= main_~i~0 120), 111856#(<= main_~i~0 119), 111859#(<= main_~i~0 122), 111858#(<= main_~i~0 121), 111860#(<= main_~i~0 123)] [2018-04-13 03:31:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30267 backedges. 0 proven. 30258 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:30,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-13 03:31:30,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-13 03:31:30,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 03:31:30,339 INFO L87 Difference]: Start difference. First operand 513 states and 514 transitions. Second operand 126 states. [2018-04-13 03:31:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:35,808 INFO L93 Difference]: Finished difference Result 1133 states and 1255 transitions. [2018-04-13 03:31:35,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-13 03:31:35,808 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 512 [2018-04-13 03:31:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:35,809 INFO L225 Difference]: With dead ends: 1133 [2018-04-13 03:31:35,809 INFO L226 Difference]: Without dead ends: 1133 [2018-04-13 03:31:35,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 03:31:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-13 03:31:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 517. [2018-04-13 03:31:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-04-13 03:31:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 518 transitions. [2018-04-13 03:31:35,812 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 518 transitions. Word has length 512 [2018-04-13 03:31:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:35,812 INFO L459 AbstractCegarLoop]: Abstraction has 517 states and 518 transitions. [2018-04-13 03:31:35,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-13 03:31:35,812 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 518 transitions. [2018-04-13 03:31:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-04-13 03:31:35,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:35,813 INFO L355 BasicCegarLoop]: trace histogram [125, 124, 124, 124, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:35,813 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:35,814 INFO L82 PathProgramCache]: Analyzing trace with hash -847649898, now seen corresponding path program 123 times [2018-04-13 03:31:35,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:35,828 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30761 backedges. 0 proven. 30752 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:38,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:38,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-04-13 03:31:38,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:38,943 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-13 03:31:38,944 INFO L182 omatonBuilderFactory]: Interpolants [113511#true, 113513#(<= main_~i~0 0), 113512#false, 113515#(<= main_~i~0 2), 113514#(<= main_~i~0 1), 113517#(<= main_~i~0 4), 113516#(<= main_~i~0 3), 113519#(<= main_~i~0 6), 113518#(<= main_~i~0 5), 113521#(<= main_~i~0 8), 113520#(<= main_~i~0 7), 113523#(<= main_~i~0 10), 113522#(<= main_~i~0 9), 113525#(<= main_~i~0 12), 113524#(<= main_~i~0 11), 113527#(<= main_~i~0 14), 113526#(<= main_~i~0 13), 113529#(<= main_~i~0 16), 113528#(<= main_~i~0 15), 113531#(<= main_~i~0 18), 113530#(<= main_~i~0 17), 113533#(<= main_~i~0 20), 113532#(<= main_~i~0 19), 113535#(<= main_~i~0 22), 113534#(<= main_~i~0 21), 113537#(<= main_~i~0 24), 113536#(<= main_~i~0 23), 113539#(<= main_~i~0 26), 113538#(<= main_~i~0 25), 113541#(<= main_~i~0 28), 113540#(<= main_~i~0 27), 113543#(<= main_~i~0 30), 113542#(<= main_~i~0 29), 113545#(<= main_~i~0 32), 113544#(<= main_~i~0 31), 113547#(<= main_~i~0 34), 113546#(<= main_~i~0 33), 113549#(<= main_~i~0 36), 113548#(<= main_~i~0 35), 113551#(<= main_~i~0 38), 113550#(<= main_~i~0 37), 113553#(<= main_~i~0 40), 113552#(<= main_~i~0 39), 113555#(<= main_~i~0 42), 113554#(<= main_~i~0 41), 113557#(<= main_~i~0 44), 113556#(<= main_~i~0 43), 113559#(<= main_~i~0 46), 113558#(<= main_~i~0 45), 113561#(<= main_~i~0 48), 113560#(<= main_~i~0 47), 113563#(<= main_~i~0 50), 113562#(<= main_~i~0 49), 113565#(<= main_~i~0 52), 113564#(<= main_~i~0 51), 113567#(<= main_~i~0 54), 113566#(<= main_~i~0 53), 113569#(<= main_~i~0 56), 113568#(<= main_~i~0 55), 113571#(<= main_~i~0 58), 113570#(<= main_~i~0 57), 113573#(<= main_~i~0 60), 113572#(<= main_~i~0 59), 113575#(<= main_~i~0 62), 113574#(<= main_~i~0 61), 113577#(<= main_~i~0 64), 113576#(<= main_~i~0 63), 113579#(<= main_~i~0 66), 113578#(<= main_~i~0 65), 113581#(<= main_~i~0 68), 113580#(<= main_~i~0 67), 113583#(<= main_~i~0 70), 113582#(<= main_~i~0 69), 113585#(<= main_~i~0 72), 113584#(<= main_~i~0 71), 113587#(<= main_~i~0 74), 113586#(<= main_~i~0 73), 113589#(<= main_~i~0 76), 113588#(<= main_~i~0 75), 113591#(<= main_~i~0 78), 113590#(<= main_~i~0 77), 113593#(<= main_~i~0 80), 113592#(<= main_~i~0 79), 113595#(<= main_~i~0 82), 113594#(<= main_~i~0 81), 113597#(<= main_~i~0 84), 113596#(<= main_~i~0 83), 113599#(<= main_~i~0 86), 113598#(<= main_~i~0 85), 113601#(<= main_~i~0 88), 113600#(<= main_~i~0 87), 113603#(<= main_~i~0 90), 113602#(<= main_~i~0 89), 113605#(<= main_~i~0 92), 113604#(<= main_~i~0 91), 113607#(<= main_~i~0 94), 113606#(<= main_~i~0 93), 113609#(<= main_~i~0 96), 113608#(<= main_~i~0 95), 113611#(<= main_~i~0 98), 113610#(<= main_~i~0 97), 113613#(<= main_~i~0 100), 113612#(<= main_~i~0 99), 113615#(<= main_~i~0 102), 113614#(<= main_~i~0 101), 113617#(<= main_~i~0 104), 113616#(<= main_~i~0 103), 113619#(<= main_~i~0 106), 113618#(<= main_~i~0 105), 113621#(<= main_~i~0 108), 113620#(<= main_~i~0 107), 113623#(<= main_~i~0 110), 113622#(<= main_~i~0 109), 113625#(<= main_~i~0 112), 113624#(<= main_~i~0 111), 113627#(<= main_~i~0 114), 113626#(<= main_~i~0 113), 113629#(<= main_~i~0 116), 113628#(<= main_~i~0 115), 113631#(<= main_~i~0 118), 113630#(<= main_~i~0 117), 113633#(<= main_~i~0 120), 113632#(<= main_~i~0 119), 113635#(<= main_~i~0 122), 113634#(<= main_~i~0 121), 113637#(<= main_~i~0 124), 113636#(<= main_~i~0 123)] [2018-04-13 03:31:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30761 backedges. 0 proven. 30752 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-13 03:31:38,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-13 03:31:38,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-04-13 03:31:38,946 INFO L87 Difference]: Start difference. First operand 517 states and 518 transitions. Second operand 127 states. [2018-04-13 03:31:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:44,250 INFO L93 Difference]: Finished difference Result 1142 states and 1265 transitions. [2018-04-13 03:31:44,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-13 03:31:44,278 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 516 [2018-04-13 03:31:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:44,279 INFO L225 Difference]: With dead ends: 1142 [2018-04-13 03:31:44,279 INFO L226 Difference]: Without dead ends: 1142 [2018-04-13 03:31:44,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-04-13 03:31:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-04-13 03:31:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 521. [2018-04-13 03:31:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-13 03:31:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-04-13 03:31:44,282 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 516 [2018-04-13 03:31:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:44,282 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-04-13 03:31:44,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-13 03:31:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-04-13 03:31:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-04-13 03:31:44,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:44,284 INFO L355 BasicCegarLoop]: trace histogram [126, 125, 125, 125, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:44,284 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash -975690737, now seen corresponding path program 124 times [2018-04-13 03:31:44,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:44,298 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 31259 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:47,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:47,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-04-13 03:31:47,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:47,467 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-13 03:31:47,467 INFO L182 omatonBuilderFactory]: Interpolants [115301#true, 115303#(<= main_~i~0 0), 115302#false, 115305#(<= main_~i~0 2), 115304#(<= main_~i~0 1), 115307#(<= main_~i~0 4), 115306#(<= main_~i~0 3), 115309#(<= main_~i~0 6), 115308#(<= main_~i~0 5), 115311#(<= main_~i~0 8), 115310#(<= main_~i~0 7), 115313#(<= main_~i~0 10), 115312#(<= main_~i~0 9), 115315#(<= main_~i~0 12), 115314#(<= main_~i~0 11), 115317#(<= main_~i~0 14), 115316#(<= main_~i~0 13), 115319#(<= main_~i~0 16), 115318#(<= main_~i~0 15), 115321#(<= main_~i~0 18), 115320#(<= main_~i~0 17), 115323#(<= main_~i~0 20), 115322#(<= main_~i~0 19), 115325#(<= main_~i~0 22), 115324#(<= main_~i~0 21), 115327#(<= main_~i~0 24), 115326#(<= main_~i~0 23), 115329#(<= main_~i~0 26), 115328#(<= main_~i~0 25), 115331#(<= main_~i~0 28), 115330#(<= main_~i~0 27), 115333#(<= main_~i~0 30), 115332#(<= main_~i~0 29), 115335#(<= main_~i~0 32), 115334#(<= main_~i~0 31), 115337#(<= main_~i~0 34), 115336#(<= main_~i~0 33), 115339#(<= main_~i~0 36), 115338#(<= main_~i~0 35), 115341#(<= main_~i~0 38), 115340#(<= main_~i~0 37), 115343#(<= main_~i~0 40), 115342#(<= main_~i~0 39), 115345#(<= main_~i~0 42), 115344#(<= main_~i~0 41), 115347#(<= main_~i~0 44), 115346#(<= main_~i~0 43), 115349#(<= main_~i~0 46), 115348#(<= main_~i~0 45), 115351#(<= main_~i~0 48), 115350#(<= main_~i~0 47), 115353#(<= main_~i~0 50), 115352#(<= main_~i~0 49), 115355#(<= main_~i~0 52), 115354#(<= main_~i~0 51), 115357#(<= main_~i~0 54), 115356#(<= main_~i~0 53), 115359#(<= main_~i~0 56), 115358#(<= main_~i~0 55), 115361#(<= main_~i~0 58), 115360#(<= main_~i~0 57), 115363#(<= main_~i~0 60), 115362#(<= main_~i~0 59), 115365#(<= main_~i~0 62), 115364#(<= main_~i~0 61), 115367#(<= main_~i~0 64), 115366#(<= main_~i~0 63), 115369#(<= main_~i~0 66), 115368#(<= main_~i~0 65), 115371#(<= main_~i~0 68), 115370#(<= main_~i~0 67), 115373#(<= main_~i~0 70), 115372#(<= main_~i~0 69), 115375#(<= main_~i~0 72), 115374#(<= main_~i~0 71), 115377#(<= main_~i~0 74), 115376#(<= main_~i~0 73), 115379#(<= main_~i~0 76), 115378#(<= main_~i~0 75), 115381#(<= main_~i~0 78), 115380#(<= main_~i~0 77), 115383#(<= main_~i~0 80), 115382#(<= main_~i~0 79), 115385#(<= main_~i~0 82), 115384#(<= main_~i~0 81), 115387#(<= main_~i~0 84), 115386#(<= main_~i~0 83), 115389#(<= main_~i~0 86), 115388#(<= main_~i~0 85), 115391#(<= main_~i~0 88), 115390#(<= main_~i~0 87), 115393#(<= main_~i~0 90), 115392#(<= main_~i~0 89), 115395#(<= main_~i~0 92), 115394#(<= main_~i~0 91), 115397#(<= main_~i~0 94), 115396#(<= main_~i~0 93), 115399#(<= main_~i~0 96), 115398#(<= main_~i~0 95), 115401#(<= main_~i~0 98), 115400#(<= main_~i~0 97), 115403#(<= main_~i~0 100), 115402#(<= main_~i~0 99), 115405#(<= main_~i~0 102), 115404#(<= main_~i~0 101), 115407#(<= main_~i~0 104), 115406#(<= main_~i~0 103), 115409#(<= main_~i~0 106), 115408#(<= main_~i~0 105), 115411#(<= main_~i~0 108), 115410#(<= main_~i~0 107), 115413#(<= main_~i~0 110), 115412#(<= main_~i~0 109), 115415#(<= main_~i~0 112), 115414#(<= main_~i~0 111), 115417#(<= main_~i~0 114), 115416#(<= main_~i~0 113), 115419#(<= main_~i~0 116), 115418#(<= main_~i~0 115), 115421#(<= main_~i~0 118), 115420#(<= main_~i~0 117), 115423#(<= main_~i~0 120), 115422#(<= main_~i~0 119), 115425#(<= main_~i~0 122), 115424#(<= main_~i~0 121), 115427#(<= main_~i~0 124), 115426#(<= main_~i~0 123), 115428#(<= main_~i~0 125)] [2018-04-13 03:31:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31259 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:47,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-13 03:31:47,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-13 03:31:47,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 03:31:47,469 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 128 states. [2018-04-13 03:31:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:31:52,918 INFO L93 Difference]: Finished difference Result 1151 states and 1275 transitions. [2018-04-13 03:31:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-13 03:31:52,919 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 520 [2018-04-13 03:31:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:31:52,919 INFO L225 Difference]: With dead ends: 1151 [2018-04-13 03:31:52,920 INFO L226 Difference]: Without dead ends: 1151 [2018-04-13 03:31:52,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 03:31:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-04-13 03:31:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 525. [2018-04-13 03:31:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-13 03:31:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 526 transitions. [2018-04-13 03:31:52,923 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 526 transitions. Word has length 520 [2018-04-13 03:31:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:31:52,923 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 526 transitions. [2018-04-13 03:31:52,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-13 03:31:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 526 transitions. [2018-04-13 03:31:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2018-04-13 03:31:52,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:31:52,924 INFO L355 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:31:52,924 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:31:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -339771384, now seen corresponding path program 125 times [2018-04-13 03:31:52,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:31:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:31:52,938 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:31:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 31761 backedges. 0 proven. 31752 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:56,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:31:56,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-04-13 03:31:56,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:31:56,171 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-13 03:31:56,172 INFO L182 omatonBuilderFactory]: Interpolants [117105#true, 117107#(<= main_~i~0 0), 117106#false, 117109#(<= main_~i~0 2), 117108#(<= main_~i~0 1), 117111#(<= main_~i~0 4), 117110#(<= main_~i~0 3), 117113#(<= main_~i~0 6), 117112#(<= main_~i~0 5), 117115#(<= main_~i~0 8), 117114#(<= main_~i~0 7), 117117#(<= main_~i~0 10), 117116#(<= main_~i~0 9), 117119#(<= main_~i~0 12), 117118#(<= main_~i~0 11), 117121#(<= main_~i~0 14), 117120#(<= main_~i~0 13), 117123#(<= main_~i~0 16), 117122#(<= main_~i~0 15), 117125#(<= main_~i~0 18), 117124#(<= main_~i~0 17), 117127#(<= main_~i~0 20), 117126#(<= main_~i~0 19), 117129#(<= main_~i~0 22), 117128#(<= main_~i~0 21), 117131#(<= main_~i~0 24), 117130#(<= main_~i~0 23), 117133#(<= main_~i~0 26), 117132#(<= main_~i~0 25), 117135#(<= main_~i~0 28), 117134#(<= main_~i~0 27), 117137#(<= main_~i~0 30), 117136#(<= main_~i~0 29), 117139#(<= main_~i~0 32), 117138#(<= main_~i~0 31), 117141#(<= main_~i~0 34), 117140#(<= main_~i~0 33), 117143#(<= main_~i~0 36), 117142#(<= main_~i~0 35), 117145#(<= main_~i~0 38), 117144#(<= main_~i~0 37), 117147#(<= main_~i~0 40), 117146#(<= main_~i~0 39), 117149#(<= main_~i~0 42), 117148#(<= main_~i~0 41), 117151#(<= main_~i~0 44), 117150#(<= main_~i~0 43), 117153#(<= main_~i~0 46), 117152#(<= main_~i~0 45), 117155#(<= main_~i~0 48), 117154#(<= main_~i~0 47), 117157#(<= main_~i~0 50), 117156#(<= main_~i~0 49), 117159#(<= main_~i~0 52), 117158#(<= main_~i~0 51), 117161#(<= main_~i~0 54), 117160#(<= main_~i~0 53), 117163#(<= main_~i~0 56), 117162#(<= main_~i~0 55), 117165#(<= main_~i~0 58), 117164#(<= main_~i~0 57), 117167#(<= main_~i~0 60), 117166#(<= main_~i~0 59), 117169#(<= main_~i~0 62), 117168#(<= main_~i~0 61), 117171#(<= main_~i~0 64), 117170#(<= main_~i~0 63), 117173#(<= main_~i~0 66), 117172#(<= main_~i~0 65), 117175#(<= main_~i~0 68), 117174#(<= main_~i~0 67), 117177#(<= main_~i~0 70), 117176#(<= main_~i~0 69), 117179#(<= main_~i~0 72), 117178#(<= main_~i~0 71), 117181#(<= main_~i~0 74), 117180#(<= main_~i~0 73), 117183#(<= main_~i~0 76), 117182#(<= main_~i~0 75), 117185#(<= main_~i~0 78), 117184#(<= main_~i~0 77), 117187#(<= main_~i~0 80), 117186#(<= main_~i~0 79), 117189#(<= main_~i~0 82), 117188#(<= main_~i~0 81), 117191#(<= main_~i~0 84), 117190#(<= main_~i~0 83), 117193#(<= main_~i~0 86), 117192#(<= main_~i~0 85), 117195#(<= main_~i~0 88), 117194#(<= main_~i~0 87), 117197#(<= main_~i~0 90), 117196#(<= main_~i~0 89), 117199#(<= main_~i~0 92), 117198#(<= main_~i~0 91), 117201#(<= main_~i~0 94), 117200#(<= main_~i~0 93), 117203#(<= main_~i~0 96), 117202#(<= main_~i~0 95), 117205#(<= main_~i~0 98), 117204#(<= main_~i~0 97), 117207#(<= main_~i~0 100), 117206#(<= main_~i~0 99), 117209#(<= main_~i~0 102), 117208#(<= main_~i~0 101), 117211#(<= main_~i~0 104), 117210#(<= main_~i~0 103), 117213#(<= main_~i~0 106), 117212#(<= main_~i~0 105), 117215#(<= main_~i~0 108), 117214#(<= main_~i~0 107), 117217#(<= main_~i~0 110), 117216#(<= main_~i~0 109), 117219#(<= main_~i~0 112), 117218#(<= main_~i~0 111), 117221#(<= main_~i~0 114), 117220#(<= main_~i~0 113), 117223#(<= main_~i~0 116), 117222#(<= main_~i~0 115), 117225#(<= main_~i~0 118), 117224#(<= main_~i~0 117), 117227#(<= main_~i~0 120), 117226#(<= main_~i~0 119), 117229#(<= main_~i~0 122), 117228#(<= main_~i~0 121), 117231#(<= main_~i~0 124), 117230#(<= main_~i~0 123), 117233#(<= main_~i~0 126), 117232#(<= main_~i~0 125)] [2018-04-13 03:31:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 31761 backedges. 0 proven. 31752 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:31:56,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-13 03:31:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-13 03:31:56,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 03:31:56,174 INFO L87 Difference]: Start difference. First operand 525 states and 526 transitions. Second operand 129 states. [2018-04-13 03:32:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:02,039 INFO L93 Difference]: Finished difference Result 1160 states and 1285 transitions. [2018-04-13 03:32:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-04-13 03:32:02,039 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 524 [2018-04-13 03:32:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:02,040 INFO L225 Difference]: With dead ends: 1160 [2018-04-13 03:32:02,040 INFO L226 Difference]: Without dead ends: 1160 [2018-04-13 03:32:02,040 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 03:32:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-04-13 03:32:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 529. [2018-04-13 03:32:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-13 03:32:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 530 transitions. [2018-04-13 03:32:02,043 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 530 transitions. Word has length 524 [2018-04-13 03:32:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:02,043 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 530 transitions. [2018-04-13 03:32:02,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-13 03:32:02,044 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 530 transitions. [2018-04-13 03:32:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-04-13 03:32:02,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:02,045 INFO L355 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:02,045 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -701089919, now seen corresponding path program 126 times [2018-04-13 03:32:02,046 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:02,062 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 32267 backedges. 0 proven. 32258 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:05,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:05,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-04-13 03:32:05,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:05,354 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-13 03:32:05,354 INFO L182 omatonBuilderFactory]: Interpolants [119041#(<= main_~i~0 116), 119040#(<= main_~i~0 115), 119043#(<= main_~i~0 118), 119042#(<= main_~i~0 117), 119045#(<= main_~i~0 120), 119044#(<= main_~i~0 119), 119047#(<= main_~i~0 122), 119046#(<= main_~i~0 121), 119049#(<= main_~i~0 124), 119048#(<= main_~i~0 123), 119051#(<= main_~i~0 126), 119050#(<= main_~i~0 125), 119052#(<= main_~i~0 127), 118923#true, 118925#(<= main_~i~0 0), 118924#false, 118927#(<= main_~i~0 2), 118926#(<= main_~i~0 1), 118929#(<= main_~i~0 4), 118928#(<= main_~i~0 3), 118931#(<= main_~i~0 6), 118930#(<= main_~i~0 5), 118933#(<= main_~i~0 8), 118932#(<= main_~i~0 7), 118935#(<= main_~i~0 10), 118934#(<= main_~i~0 9), 118937#(<= main_~i~0 12), 118936#(<= main_~i~0 11), 118939#(<= main_~i~0 14), 118938#(<= main_~i~0 13), 118941#(<= main_~i~0 16), 118940#(<= main_~i~0 15), 118943#(<= main_~i~0 18), 118942#(<= main_~i~0 17), 118945#(<= main_~i~0 20), 118944#(<= main_~i~0 19), 118947#(<= main_~i~0 22), 118946#(<= main_~i~0 21), 118949#(<= main_~i~0 24), 118948#(<= main_~i~0 23), 118951#(<= main_~i~0 26), 118950#(<= main_~i~0 25), 118953#(<= main_~i~0 28), 118952#(<= main_~i~0 27), 118955#(<= main_~i~0 30), 118954#(<= main_~i~0 29), 118957#(<= main_~i~0 32), 118956#(<= main_~i~0 31), 118959#(<= main_~i~0 34), 118958#(<= main_~i~0 33), 118961#(<= main_~i~0 36), 118960#(<= main_~i~0 35), 118963#(<= main_~i~0 38), 118962#(<= main_~i~0 37), 118965#(<= main_~i~0 40), 118964#(<= main_~i~0 39), 118967#(<= main_~i~0 42), 118966#(<= main_~i~0 41), 118969#(<= main_~i~0 44), 118968#(<= main_~i~0 43), 118971#(<= main_~i~0 46), 118970#(<= main_~i~0 45), 118973#(<= main_~i~0 48), 118972#(<= main_~i~0 47), 118975#(<= main_~i~0 50), 118974#(<= main_~i~0 49), 118977#(<= main_~i~0 52), 118976#(<= main_~i~0 51), 118979#(<= main_~i~0 54), 118978#(<= main_~i~0 53), 118981#(<= main_~i~0 56), 118980#(<= main_~i~0 55), 118983#(<= main_~i~0 58), 118982#(<= main_~i~0 57), 118985#(<= main_~i~0 60), 118984#(<= main_~i~0 59), 118987#(<= main_~i~0 62), 118986#(<= main_~i~0 61), 118989#(<= main_~i~0 64), 118988#(<= main_~i~0 63), 118991#(<= main_~i~0 66), 118990#(<= main_~i~0 65), 118993#(<= main_~i~0 68), 118992#(<= main_~i~0 67), 118995#(<= main_~i~0 70), 118994#(<= main_~i~0 69), 118997#(<= main_~i~0 72), 118996#(<= main_~i~0 71), 118999#(<= main_~i~0 74), 118998#(<= main_~i~0 73), 119001#(<= main_~i~0 76), 119000#(<= main_~i~0 75), 119003#(<= main_~i~0 78), 119002#(<= main_~i~0 77), 119005#(<= main_~i~0 80), 119004#(<= main_~i~0 79), 119007#(<= main_~i~0 82), 119006#(<= main_~i~0 81), 119009#(<= main_~i~0 84), 119008#(<= main_~i~0 83), 119011#(<= main_~i~0 86), 119010#(<= main_~i~0 85), 119013#(<= main_~i~0 88), 119012#(<= main_~i~0 87), 119015#(<= main_~i~0 90), 119014#(<= main_~i~0 89), 119017#(<= main_~i~0 92), 119016#(<= main_~i~0 91), 119019#(<= main_~i~0 94), 119018#(<= main_~i~0 93), 119021#(<= main_~i~0 96), 119020#(<= main_~i~0 95), 119023#(<= main_~i~0 98), 119022#(<= main_~i~0 97), 119025#(<= main_~i~0 100), 119024#(<= main_~i~0 99), 119027#(<= main_~i~0 102), 119026#(<= main_~i~0 101), 119029#(<= main_~i~0 104), 119028#(<= main_~i~0 103), 119031#(<= main_~i~0 106), 119030#(<= main_~i~0 105), 119033#(<= main_~i~0 108), 119032#(<= main_~i~0 107), 119035#(<= main_~i~0 110), 119034#(<= main_~i~0 109), 119037#(<= main_~i~0 112), 119036#(<= main_~i~0 111), 119039#(<= main_~i~0 114), 119038#(<= main_~i~0 113)] [2018-04-13 03:32:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32267 backedges. 0 proven. 32258 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:05,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-13 03:32:05,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-13 03:32:05,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 03:32:05,356 INFO L87 Difference]: Start difference. First operand 529 states and 530 transitions. Second operand 130 states. [2018-04-13 03:32:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:11,443 INFO L93 Difference]: Finished difference Result 1169 states and 1295 transitions. [2018-04-13 03:32:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-04-13 03:32:11,443 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 528 [2018-04-13 03:32:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:11,444 INFO L225 Difference]: With dead ends: 1169 [2018-04-13 03:32:11,444 INFO L226 Difference]: Without dead ends: 1169 [2018-04-13 03:32:11,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 03:32:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-04-13 03:32:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 533. [2018-04-13 03:32:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-13 03:32:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 534 transitions. [2018-04-13 03:32:11,447 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 534 transitions. Word has length 528 [2018-04-13 03:32:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:11,447 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 534 transitions. [2018-04-13 03:32:11,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-13 03:32:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 534 transitions. [2018-04-13 03:32:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-13 03:32:11,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:11,449 INFO L355 BasicCegarLoop]: trace histogram [129, 128, 128, 128, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:11,449 INFO L408 AbstractCegarLoop]: === Iteration 129 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1356690822, now seen corresponding path program 127 times [2018-04-13 03:32:11,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:11,464 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32777 backedges. 0 proven. 32768 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:14,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:14,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-04-13 03:32:14,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:14,852 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-13 03:32:14,852 INFO L182 omatonBuilderFactory]: Interpolants [120833#(<= main_~i~0 76), 120832#(<= main_~i~0 75), 120835#(<= main_~i~0 78), 120834#(<= main_~i~0 77), 120837#(<= main_~i~0 80), 120836#(<= main_~i~0 79), 120839#(<= main_~i~0 82), 120838#(<= main_~i~0 81), 120841#(<= main_~i~0 84), 120840#(<= main_~i~0 83), 120843#(<= main_~i~0 86), 120842#(<= main_~i~0 85), 120845#(<= main_~i~0 88), 120844#(<= main_~i~0 87), 120847#(<= main_~i~0 90), 120846#(<= main_~i~0 89), 120849#(<= main_~i~0 92), 120848#(<= main_~i~0 91), 120851#(<= main_~i~0 94), 120850#(<= main_~i~0 93), 120853#(<= main_~i~0 96), 120852#(<= main_~i~0 95), 120855#(<= main_~i~0 98), 120854#(<= main_~i~0 97), 120857#(<= main_~i~0 100), 120856#(<= main_~i~0 99), 120859#(<= main_~i~0 102), 120858#(<= main_~i~0 101), 120861#(<= main_~i~0 104), 120860#(<= main_~i~0 103), 120863#(<= main_~i~0 106), 120862#(<= main_~i~0 105), 120865#(<= main_~i~0 108), 120864#(<= main_~i~0 107), 120867#(<= main_~i~0 110), 120866#(<= main_~i~0 109), 120869#(<= main_~i~0 112), 120868#(<= main_~i~0 111), 120871#(<= main_~i~0 114), 120870#(<= main_~i~0 113), 120873#(<= main_~i~0 116), 120872#(<= main_~i~0 115), 120875#(<= main_~i~0 118), 120874#(<= main_~i~0 117), 120877#(<= main_~i~0 120), 120876#(<= main_~i~0 119), 120879#(<= main_~i~0 122), 120878#(<= main_~i~0 121), 120881#(<= main_~i~0 124), 120880#(<= main_~i~0 123), 120883#(<= main_~i~0 126), 120882#(<= main_~i~0 125), 120885#(<= main_~i~0 128), 120884#(<= main_~i~0 127), 120755#true, 120757#(<= main_~i~0 0), 120756#false, 120759#(<= main_~i~0 2), 120758#(<= main_~i~0 1), 120761#(<= main_~i~0 4), 120760#(<= main_~i~0 3), 120763#(<= main_~i~0 6), 120762#(<= main_~i~0 5), 120765#(<= main_~i~0 8), 120764#(<= main_~i~0 7), 120767#(<= main_~i~0 10), 120766#(<= main_~i~0 9), 120769#(<= main_~i~0 12), 120768#(<= main_~i~0 11), 120771#(<= main_~i~0 14), 120770#(<= main_~i~0 13), 120773#(<= main_~i~0 16), 120772#(<= main_~i~0 15), 120775#(<= main_~i~0 18), 120774#(<= main_~i~0 17), 120777#(<= main_~i~0 20), 120776#(<= main_~i~0 19), 120779#(<= main_~i~0 22), 120778#(<= main_~i~0 21), 120781#(<= main_~i~0 24), 120780#(<= main_~i~0 23), 120783#(<= main_~i~0 26), 120782#(<= main_~i~0 25), 120785#(<= main_~i~0 28), 120784#(<= main_~i~0 27), 120787#(<= main_~i~0 30), 120786#(<= main_~i~0 29), 120789#(<= main_~i~0 32), 120788#(<= main_~i~0 31), 120791#(<= main_~i~0 34), 120790#(<= main_~i~0 33), 120793#(<= main_~i~0 36), 120792#(<= main_~i~0 35), 120795#(<= main_~i~0 38), 120794#(<= main_~i~0 37), 120797#(<= main_~i~0 40), 120796#(<= main_~i~0 39), 120799#(<= main_~i~0 42), 120798#(<= main_~i~0 41), 120801#(<= main_~i~0 44), 120800#(<= main_~i~0 43), 120803#(<= main_~i~0 46), 120802#(<= main_~i~0 45), 120805#(<= main_~i~0 48), 120804#(<= main_~i~0 47), 120807#(<= main_~i~0 50), 120806#(<= main_~i~0 49), 120809#(<= main_~i~0 52), 120808#(<= main_~i~0 51), 120811#(<= main_~i~0 54), 120810#(<= main_~i~0 53), 120813#(<= main_~i~0 56), 120812#(<= main_~i~0 55), 120815#(<= main_~i~0 58), 120814#(<= main_~i~0 57), 120817#(<= main_~i~0 60), 120816#(<= main_~i~0 59), 120819#(<= main_~i~0 62), 120818#(<= main_~i~0 61), 120821#(<= main_~i~0 64), 120820#(<= main_~i~0 63), 120823#(<= main_~i~0 66), 120822#(<= main_~i~0 65), 120825#(<= main_~i~0 68), 120824#(<= main_~i~0 67), 120827#(<= main_~i~0 70), 120826#(<= main_~i~0 69), 120829#(<= main_~i~0 72), 120828#(<= main_~i~0 71), 120831#(<= main_~i~0 74), 120830#(<= main_~i~0 73)] [2018-04-13 03:32:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 32777 backedges. 0 proven. 32768 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-13 03:32:14,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-13 03:32:14,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 03:32:14,855 INFO L87 Difference]: Start difference. First operand 533 states and 534 transitions. Second operand 131 states. [2018-04-13 03:32:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:19,772 INFO L93 Difference]: Finished difference Result 1178 states and 1305 transitions. [2018-04-13 03:32:19,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-13 03:32:19,772 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 532 [2018-04-13 03:32:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:19,773 INFO L225 Difference]: With dead ends: 1178 [2018-04-13 03:32:19,773 INFO L226 Difference]: Without dead ends: 1178 [2018-04-13 03:32:19,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 03:32:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-04-13 03:32:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 537. [2018-04-13 03:32:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-13 03:32:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-04-13 03:32:19,777 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 532 [2018-04-13 03:32:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:19,777 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-04-13 03:32:19,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-13 03:32:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-04-13 03:32:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-04-13 03:32:19,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:19,779 INFO L355 BasicCegarLoop]: trace histogram [130, 129, 129, 129, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:19,779 INFO L408 AbstractCegarLoop]: === Iteration 130 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1018513165, now seen corresponding path program 128 times [2018-04-13 03:32:19,779 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:19,794 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 33291 backedges. 0 proven. 33282 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:23,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:23,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-04-13 03:32:23,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:23,277 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-13 03:32:23,277 INFO L182 omatonBuilderFactory]: Interpolants [122625#(<= main_~i~0 22), 122624#(<= main_~i~0 21), 122627#(<= main_~i~0 24), 122626#(<= main_~i~0 23), 122629#(<= main_~i~0 26), 122628#(<= main_~i~0 25), 122631#(<= main_~i~0 28), 122630#(<= main_~i~0 27), 122633#(<= main_~i~0 30), 122632#(<= main_~i~0 29), 122635#(<= main_~i~0 32), 122634#(<= main_~i~0 31), 122637#(<= main_~i~0 34), 122636#(<= main_~i~0 33), 122639#(<= main_~i~0 36), 122638#(<= main_~i~0 35), 122641#(<= main_~i~0 38), 122640#(<= main_~i~0 37), 122643#(<= main_~i~0 40), 122642#(<= main_~i~0 39), 122645#(<= main_~i~0 42), 122644#(<= main_~i~0 41), 122647#(<= main_~i~0 44), 122646#(<= main_~i~0 43), 122649#(<= main_~i~0 46), 122648#(<= main_~i~0 45), 122651#(<= main_~i~0 48), 122650#(<= main_~i~0 47), 122653#(<= main_~i~0 50), 122652#(<= main_~i~0 49), 122655#(<= main_~i~0 52), 122654#(<= main_~i~0 51), 122657#(<= main_~i~0 54), 122656#(<= main_~i~0 53), 122659#(<= main_~i~0 56), 122658#(<= main_~i~0 55), 122661#(<= main_~i~0 58), 122660#(<= main_~i~0 57), 122663#(<= main_~i~0 60), 122662#(<= main_~i~0 59), 122665#(<= main_~i~0 62), 122664#(<= main_~i~0 61), 122667#(<= main_~i~0 64), 122666#(<= main_~i~0 63), 122669#(<= main_~i~0 66), 122668#(<= main_~i~0 65), 122671#(<= main_~i~0 68), 122670#(<= main_~i~0 67), 122673#(<= main_~i~0 70), 122672#(<= main_~i~0 69), 122675#(<= main_~i~0 72), 122674#(<= main_~i~0 71), 122677#(<= main_~i~0 74), 122676#(<= main_~i~0 73), 122679#(<= main_~i~0 76), 122678#(<= main_~i~0 75), 122681#(<= main_~i~0 78), 122680#(<= main_~i~0 77), 122683#(<= main_~i~0 80), 122682#(<= main_~i~0 79), 122685#(<= main_~i~0 82), 122684#(<= main_~i~0 81), 122687#(<= main_~i~0 84), 122686#(<= main_~i~0 83), 122689#(<= main_~i~0 86), 122688#(<= main_~i~0 85), 122691#(<= main_~i~0 88), 122690#(<= main_~i~0 87), 122693#(<= main_~i~0 90), 122692#(<= main_~i~0 89), 122695#(<= main_~i~0 92), 122694#(<= main_~i~0 91), 122697#(<= main_~i~0 94), 122696#(<= main_~i~0 93), 122699#(<= main_~i~0 96), 122698#(<= main_~i~0 95), 122701#(<= main_~i~0 98), 122700#(<= main_~i~0 97), 122703#(<= main_~i~0 100), 122702#(<= main_~i~0 99), 122705#(<= main_~i~0 102), 122704#(<= main_~i~0 101), 122707#(<= main_~i~0 104), 122706#(<= main_~i~0 103), 122709#(<= main_~i~0 106), 122708#(<= main_~i~0 105), 122711#(<= main_~i~0 108), 122710#(<= main_~i~0 107), 122713#(<= main_~i~0 110), 122712#(<= main_~i~0 109), 122715#(<= main_~i~0 112), 122714#(<= main_~i~0 111), 122717#(<= main_~i~0 114), 122716#(<= main_~i~0 113), 122719#(<= main_~i~0 116), 122718#(<= main_~i~0 115), 122721#(<= main_~i~0 118), 122720#(<= main_~i~0 117), 122723#(<= main_~i~0 120), 122722#(<= main_~i~0 119), 122725#(<= main_~i~0 122), 122724#(<= main_~i~0 121), 122727#(<= main_~i~0 124), 122726#(<= main_~i~0 123), 122729#(<= main_~i~0 126), 122728#(<= main_~i~0 125), 122731#(<= main_~i~0 128), 122730#(<= main_~i~0 127), 122732#(<= main_~i~0 129), 122601#true, 122603#(<= main_~i~0 0), 122602#false, 122605#(<= main_~i~0 2), 122604#(<= main_~i~0 1), 122607#(<= main_~i~0 4), 122606#(<= main_~i~0 3), 122609#(<= main_~i~0 6), 122608#(<= main_~i~0 5), 122611#(<= main_~i~0 8), 122610#(<= main_~i~0 7), 122613#(<= main_~i~0 10), 122612#(<= main_~i~0 9), 122615#(<= main_~i~0 12), 122614#(<= main_~i~0 11), 122617#(<= main_~i~0 14), 122616#(<= main_~i~0 13), 122619#(<= main_~i~0 16), 122618#(<= main_~i~0 15), 122621#(<= main_~i~0 18), 122620#(<= main_~i~0 17), 122623#(<= main_~i~0 20), 122622#(<= main_~i~0 19)] [2018-04-13 03:32:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33291 backedges. 0 proven. 33282 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:23,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-13 03:32:23,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-13 03:32:23,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 03:32:23,279 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 132 states. [2018-04-13 03:32:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:29,353 INFO L93 Difference]: Finished difference Result 1187 states and 1315 transitions. [2018-04-13 03:32:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-13 03:32:29,353 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 536 [2018-04-13 03:32:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:29,354 INFO L225 Difference]: With dead ends: 1187 [2018-04-13 03:32:29,354 INFO L226 Difference]: Without dead ends: 1187 [2018-04-13 03:32:29,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 03:32:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-04-13 03:32:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 541. [2018-04-13 03:32:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-04-13 03:32:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 542 transitions. [2018-04-13 03:32:29,356 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 542 transitions. Word has length 536 [2018-04-13 03:32:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:29,357 INFO L459 AbstractCegarLoop]: Abstraction has 541 states and 542 transitions. [2018-04-13 03:32:29,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-13 03:32:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 542 transitions. [2018-04-13 03:32:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-04-13 03:32:29,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:29,358 INFO L355 BasicCegarLoop]: trace histogram [131, 130, 130, 130, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:29,358 INFO L408 AbstractCegarLoop]: === Iteration 131 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 307561196, now seen corresponding path program 129 times [2018-04-13 03:32:29,359 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:29,373 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33809 backedges. 0 proven. 33800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:32,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:32,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-04-13 03:32:32,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:32,848 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-13 03:32:32,848 INFO L182 omatonBuilderFactory]: Interpolants [124461#true, 124463#(<= main_~i~0 0), 124462#false, 124465#(<= main_~i~0 2), 124464#(<= main_~i~0 1), 124467#(<= main_~i~0 4), 124466#(<= main_~i~0 3), 124469#(<= main_~i~0 6), 124468#(<= main_~i~0 5), 124471#(<= main_~i~0 8), 124470#(<= main_~i~0 7), 124473#(<= main_~i~0 10), 124472#(<= main_~i~0 9), 124475#(<= main_~i~0 12), 124474#(<= main_~i~0 11), 124477#(<= main_~i~0 14), 124476#(<= main_~i~0 13), 124479#(<= main_~i~0 16), 124478#(<= main_~i~0 15), 124481#(<= main_~i~0 18), 124480#(<= main_~i~0 17), 124483#(<= main_~i~0 20), 124482#(<= main_~i~0 19), 124485#(<= main_~i~0 22), 124484#(<= main_~i~0 21), 124487#(<= main_~i~0 24), 124486#(<= main_~i~0 23), 124489#(<= main_~i~0 26), 124488#(<= main_~i~0 25), 124491#(<= main_~i~0 28), 124490#(<= main_~i~0 27), 124493#(<= main_~i~0 30), 124492#(<= main_~i~0 29), 124495#(<= main_~i~0 32), 124494#(<= main_~i~0 31), 124497#(<= main_~i~0 34), 124496#(<= main_~i~0 33), 124499#(<= main_~i~0 36), 124498#(<= main_~i~0 35), 124501#(<= main_~i~0 38), 124500#(<= main_~i~0 37), 124503#(<= main_~i~0 40), 124502#(<= main_~i~0 39), 124505#(<= main_~i~0 42), 124504#(<= main_~i~0 41), 124507#(<= main_~i~0 44), 124506#(<= main_~i~0 43), 124509#(<= main_~i~0 46), 124508#(<= main_~i~0 45), 124511#(<= main_~i~0 48), 124510#(<= main_~i~0 47), 124513#(<= main_~i~0 50), 124512#(<= main_~i~0 49), 124515#(<= main_~i~0 52), 124514#(<= main_~i~0 51), 124517#(<= main_~i~0 54), 124516#(<= main_~i~0 53), 124519#(<= main_~i~0 56), 124518#(<= main_~i~0 55), 124521#(<= main_~i~0 58), 124520#(<= main_~i~0 57), 124523#(<= main_~i~0 60), 124522#(<= main_~i~0 59), 124525#(<= main_~i~0 62), 124524#(<= main_~i~0 61), 124527#(<= main_~i~0 64), 124526#(<= main_~i~0 63), 124529#(<= main_~i~0 66), 124528#(<= main_~i~0 65), 124531#(<= main_~i~0 68), 124530#(<= main_~i~0 67), 124533#(<= main_~i~0 70), 124532#(<= main_~i~0 69), 124535#(<= main_~i~0 72), 124534#(<= main_~i~0 71), 124537#(<= main_~i~0 74), 124536#(<= main_~i~0 73), 124539#(<= main_~i~0 76), 124538#(<= main_~i~0 75), 124541#(<= main_~i~0 78), 124540#(<= main_~i~0 77), 124543#(<= main_~i~0 80), 124542#(<= main_~i~0 79), 124545#(<= main_~i~0 82), 124544#(<= main_~i~0 81), 124547#(<= main_~i~0 84), 124546#(<= main_~i~0 83), 124549#(<= main_~i~0 86), 124548#(<= main_~i~0 85), 124551#(<= main_~i~0 88), 124550#(<= main_~i~0 87), 124553#(<= main_~i~0 90), 124552#(<= main_~i~0 89), 124555#(<= main_~i~0 92), 124554#(<= main_~i~0 91), 124557#(<= main_~i~0 94), 124556#(<= main_~i~0 93), 124559#(<= main_~i~0 96), 124558#(<= main_~i~0 95), 124561#(<= main_~i~0 98), 124560#(<= main_~i~0 97), 124563#(<= main_~i~0 100), 124562#(<= main_~i~0 99), 124565#(<= main_~i~0 102), 124564#(<= main_~i~0 101), 124567#(<= main_~i~0 104), 124566#(<= main_~i~0 103), 124569#(<= main_~i~0 106), 124568#(<= main_~i~0 105), 124571#(<= main_~i~0 108), 124570#(<= main_~i~0 107), 124573#(<= main_~i~0 110), 124572#(<= main_~i~0 109), 124575#(<= main_~i~0 112), 124574#(<= main_~i~0 111), 124577#(<= main_~i~0 114), 124576#(<= main_~i~0 113), 124579#(<= main_~i~0 116), 124578#(<= main_~i~0 115), 124581#(<= main_~i~0 118), 124580#(<= main_~i~0 117), 124583#(<= main_~i~0 120), 124582#(<= main_~i~0 119), 124585#(<= main_~i~0 122), 124584#(<= main_~i~0 121), 124587#(<= main_~i~0 124), 124586#(<= main_~i~0 123), 124589#(<= main_~i~0 126), 124588#(<= main_~i~0 125), 124591#(<= main_~i~0 128), 124590#(<= main_~i~0 127), 124593#(<= main_~i~0 130), 124592#(<= main_~i~0 129)] [2018-04-13 03:32:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33809 backedges. 0 proven. 33800 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:32,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-13 03:32:32,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-13 03:32:32,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 03:32:32,850 INFO L87 Difference]: Start difference. First operand 541 states and 542 transitions. Second operand 133 states. [2018-04-13 03:32:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:39,345 INFO L93 Difference]: Finished difference Result 1196 states and 1325 transitions. [2018-04-13 03:32:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-04-13 03:32:39,345 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 540 [2018-04-13 03:32:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:39,346 INFO L225 Difference]: With dead ends: 1196 [2018-04-13 03:32:39,346 INFO L226 Difference]: Without dead ends: 1196 [2018-04-13 03:32:39,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 03:32:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-04-13 03:32:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 545. [2018-04-13 03:32:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-04-13 03:32:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 546 transitions. [2018-04-13 03:32:39,349 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 546 transitions. Word has length 540 [2018-04-13 03:32:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:39,349 INFO L459 AbstractCegarLoop]: Abstraction has 545 states and 546 transitions. [2018-04-13 03:32:39,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-13 03:32:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 546 transitions. [2018-04-13 03:32:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-04-13 03:32:39,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:39,351 INFO L355 BasicCegarLoop]: trace histogram [132, 131, 131, 131, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:39,351 INFO L408 AbstractCegarLoop]: === Iteration 132 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -557340571, now seen corresponding path program 130 times [2018-04-13 03:32:39,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:39,366 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 34331 backedges. 0 proven. 34322 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:42,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:42,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-04-13 03:32:42,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:42,804 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-13 03:32:42,804 INFO L182 omatonBuilderFactory]: Interpolants [126465#(<= main_~i~0 128), 126464#(<= main_~i~0 127), 126467#(<= main_~i~0 130), 126466#(<= main_~i~0 129), 126468#(<= main_~i~0 131), 126335#true, 126337#(<= main_~i~0 0), 126336#false, 126339#(<= main_~i~0 2), 126338#(<= main_~i~0 1), 126341#(<= main_~i~0 4), 126340#(<= main_~i~0 3), 126343#(<= main_~i~0 6), 126342#(<= main_~i~0 5), 126345#(<= main_~i~0 8), 126344#(<= main_~i~0 7), 126347#(<= main_~i~0 10), 126346#(<= main_~i~0 9), 126349#(<= main_~i~0 12), 126348#(<= main_~i~0 11), 126351#(<= main_~i~0 14), 126350#(<= main_~i~0 13), 126353#(<= main_~i~0 16), 126352#(<= main_~i~0 15), 126355#(<= main_~i~0 18), 126354#(<= main_~i~0 17), 126357#(<= main_~i~0 20), 126356#(<= main_~i~0 19), 126359#(<= main_~i~0 22), 126358#(<= main_~i~0 21), 126361#(<= main_~i~0 24), 126360#(<= main_~i~0 23), 126363#(<= main_~i~0 26), 126362#(<= main_~i~0 25), 126365#(<= main_~i~0 28), 126364#(<= main_~i~0 27), 126367#(<= main_~i~0 30), 126366#(<= main_~i~0 29), 126369#(<= main_~i~0 32), 126368#(<= main_~i~0 31), 126371#(<= main_~i~0 34), 126370#(<= main_~i~0 33), 126373#(<= main_~i~0 36), 126372#(<= main_~i~0 35), 126375#(<= main_~i~0 38), 126374#(<= main_~i~0 37), 126377#(<= main_~i~0 40), 126376#(<= main_~i~0 39), 126379#(<= main_~i~0 42), 126378#(<= main_~i~0 41), 126381#(<= main_~i~0 44), 126380#(<= main_~i~0 43), 126383#(<= main_~i~0 46), 126382#(<= main_~i~0 45), 126385#(<= main_~i~0 48), 126384#(<= main_~i~0 47), 126387#(<= main_~i~0 50), 126386#(<= main_~i~0 49), 126389#(<= main_~i~0 52), 126388#(<= main_~i~0 51), 126391#(<= main_~i~0 54), 126390#(<= main_~i~0 53), 126393#(<= main_~i~0 56), 126392#(<= main_~i~0 55), 126395#(<= main_~i~0 58), 126394#(<= main_~i~0 57), 126397#(<= main_~i~0 60), 126396#(<= main_~i~0 59), 126399#(<= main_~i~0 62), 126398#(<= main_~i~0 61), 126401#(<= main_~i~0 64), 126400#(<= main_~i~0 63), 126403#(<= main_~i~0 66), 126402#(<= main_~i~0 65), 126405#(<= main_~i~0 68), 126404#(<= main_~i~0 67), 126407#(<= main_~i~0 70), 126406#(<= main_~i~0 69), 126409#(<= main_~i~0 72), 126408#(<= main_~i~0 71), 126411#(<= main_~i~0 74), 126410#(<= main_~i~0 73), 126413#(<= main_~i~0 76), 126412#(<= main_~i~0 75), 126415#(<= main_~i~0 78), 126414#(<= main_~i~0 77), 126417#(<= main_~i~0 80), 126416#(<= main_~i~0 79), 126419#(<= main_~i~0 82), 126418#(<= main_~i~0 81), 126421#(<= main_~i~0 84), 126420#(<= main_~i~0 83), 126423#(<= main_~i~0 86), 126422#(<= main_~i~0 85), 126425#(<= main_~i~0 88), 126424#(<= main_~i~0 87), 126427#(<= main_~i~0 90), 126426#(<= main_~i~0 89), 126429#(<= main_~i~0 92), 126428#(<= main_~i~0 91), 126431#(<= main_~i~0 94), 126430#(<= main_~i~0 93), 126433#(<= main_~i~0 96), 126432#(<= main_~i~0 95), 126435#(<= main_~i~0 98), 126434#(<= main_~i~0 97), 126437#(<= main_~i~0 100), 126436#(<= main_~i~0 99), 126439#(<= main_~i~0 102), 126438#(<= main_~i~0 101), 126441#(<= main_~i~0 104), 126440#(<= main_~i~0 103), 126443#(<= main_~i~0 106), 126442#(<= main_~i~0 105), 126445#(<= main_~i~0 108), 126444#(<= main_~i~0 107), 126447#(<= main_~i~0 110), 126446#(<= main_~i~0 109), 126449#(<= main_~i~0 112), 126448#(<= main_~i~0 111), 126451#(<= main_~i~0 114), 126450#(<= main_~i~0 113), 126453#(<= main_~i~0 116), 126452#(<= main_~i~0 115), 126455#(<= main_~i~0 118), 126454#(<= main_~i~0 117), 126457#(<= main_~i~0 120), 126456#(<= main_~i~0 119), 126459#(<= main_~i~0 122), 126458#(<= main_~i~0 121), 126461#(<= main_~i~0 124), 126460#(<= main_~i~0 123), 126463#(<= main_~i~0 126), 126462#(<= main_~i~0 125)] [2018-04-13 03:32:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 34331 backedges. 0 proven. 34322 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:42,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-13 03:32:42,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-13 03:32:42,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 03:32:42,806 INFO L87 Difference]: Start difference. First operand 545 states and 546 transitions. Second operand 134 states. [2018-04-13 03:32:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:50,235 INFO L93 Difference]: Finished difference Result 1205 states and 1335 transitions. [2018-04-13 03:32:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-04-13 03:32:50,236 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 544 [2018-04-13 03:32:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:50,236 INFO L225 Difference]: With dead ends: 1205 [2018-04-13 03:32:50,236 INFO L226 Difference]: Without dead ends: 1205 [2018-04-13 03:32:50,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 03:32:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-04-13 03:32:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 549. [2018-04-13 03:32:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-04-13 03:32:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 550 transitions. [2018-04-13 03:32:50,240 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 550 transitions. Word has length 544 [2018-04-13 03:32:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:50,240 INFO L459 AbstractCegarLoop]: Abstraction has 549 states and 550 transitions. [2018-04-13 03:32:50,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-13 03:32:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 550 transitions. [2018-04-13 03:32:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-04-13 03:32:50,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:50,241 INFO L355 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:50,241 INFO L408 AbstractCegarLoop]: === Iteration 133 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:50,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1040771422, now seen corresponding path program 131 times [2018-04-13 03:32:50,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:50,256 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:32:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 34857 backedges. 0 proven. 34848 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:53,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:32:53,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-04-13 03:32:53,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:32:53,777 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-13 03:32:53,777 INFO L182 omatonBuilderFactory]: Interpolants [128257#(<= main_~i~0 32), 128256#(<= main_~i~0 31), 128259#(<= main_~i~0 34), 128258#(<= main_~i~0 33), 128261#(<= main_~i~0 36), 128260#(<= main_~i~0 35), 128263#(<= main_~i~0 38), 128262#(<= main_~i~0 37), 128265#(<= main_~i~0 40), 128264#(<= main_~i~0 39), 128267#(<= main_~i~0 42), 128266#(<= main_~i~0 41), 128269#(<= main_~i~0 44), 128268#(<= main_~i~0 43), 128271#(<= main_~i~0 46), 128270#(<= main_~i~0 45), 128273#(<= main_~i~0 48), 128272#(<= main_~i~0 47), 128275#(<= main_~i~0 50), 128274#(<= main_~i~0 49), 128277#(<= main_~i~0 52), 128276#(<= main_~i~0 51), 128279#(<= main_~i~0 54), 128278#(<= main_~i~0 53), 128281#(<= main_~i~0 56), 128280#(<= main_~i~0 55), 128283#(<= main_~i~0 58), 128282#(<= main_~i~0 57), 128285#(<= main_~i~0 60), 128284#(<= main_~i~0 59), 128287#(<= main_~i~0 62), 128286#(<= main_~i~0 61), 128289#(<= main_~i~0 64), 128288#(<= main_~i~0 63), 128291#(<= main_~i~0 66), 128290#(<= main_~i~0 65), 128293#(<= main_~i~0 68), 128292#(<= main_~i~0 67), 128295#(<= main_~i~0 70), 128294#(<= main_~i~0 69), 128297#(<= main_~i~0 72), 128296#(<= main_~i~0 71), 128299#(<= main_~i~0 74), 128298#(<= main_~i~0 73), 128301#(<= main_~i~0 76), 128300#(<= main_~i~0 75), 128303#(<= main_~i~0 78), 128302#(<= main_~i~0 77), 128305#(<= main_~i~0 80), 128304#(<= main_~i~0 79), 128307#(<= main_~i~0 82), 128306#(<= main_~i~0 81), 128309#(<= main_~i~0 84), 128308#(<= main_~i~0 83), 128311#(<= main_~i~0 86), 128310#(<= main_~i~0 85), 128313#(<= main_~i~0 88), 128312#(<= main_~i~0 87), 128315#(<= main_~i~0 90), 128314#(<= main_~i~0 89), 128317#(<= main_~i~0 92), 128316#(<= main_~i~0 91), 128319#(<= main_~i~0 94), 128318#(<= main_~i~0 93), 128321#(<= main_~i~0 96), 128320#(<= main_~i~0 95), 128323#(<= main_~i~0 98), 128322#(<= main_~i~0 97), 128325#(<= main_~i~0 100), 128324#(<= main_~i~0 99), 128327#(<= main_~i~0 102), 128326#(<= main_~i~0 101), 128329#(<= main_~i~0 104), 128328#(<= main_~i~0 103), 128331#(<= main_~i~0 106), 128330#(<= main_~i~0 105), 128333#(<= main_~i~0 108), 128332#(<= main_~i~0 107), 128335#(<= main_~i~0 110), 128334#(<= main_~i~0 109), 128337#(<= main_~i~0 112), 128336#(<= main_~i~0 111), 128339#(<= main_~i~0 114), 128338#(<= main_~i~0 113), 128341#(<= main_~i~0 116), 128340#(<= main_~i~0 115), 128343#(<= main_~i~0 118), 128342#(<= main_~i~0 117), 128345#(<= main_~i~0 120), 128344#(<= main_~i~0 119), 128347#(<= main_~i~0 122), 128346#(<= main_~i~0 121), 128349#(<= main_~i~0 124), 128348#(<= main_~i~0 123), 128351#(<= main_~i~0 126), 128350#(<= main_~i~0 125), 128353#(<= main_~i~0 128), 128352#(<= main_~i~0 127), 128355#(<= main_~i~0 130), 128354#(<= main_~i~0 129), 128357#(<= main_~i~0 132), 128356#(<= main_~i~0 131), 128223#true, 128225#(<= main_~i~0 0), 128224#false, 128227#(<= main_~i~0 2), 128226#(<= main_~i~0 1), 128229#(<= main_~i~0 4), 128228#(<= main_~i~0 3), 128231#(<= main_~i~0 6), 128230#(<= main_~i~0 5), 128233#(<= main_~i~0 8), 128232#(<= main_~i~0 7), 128235#(<= main_~i~0 10), 128234#(<= main_~i~0 9), 128237#(<= main_~i~0 12), 128236#(<= main_~i~0 11), 128239#(<= main_~i~0 14), 128238#(<= main_~i~0 13), 128241#(<= main_~i~0 16), 128240#(<= main_~i~0 15), 128243#(<= main_~i~0 18), 128242#(<= main_~i~0 17), 128245#(<= main_~i~0 20), 128244#(<= main_~i~0 19), 128247#(<= main_~i~0 22), 128246#(<= main_~i~0 21), 128249#(<= main_~i~0 24), 128248#(<= main_~i~0 23), 128251#(<= main_~i~0 26), 128250#(<= main_~i~0 25), 128253#(<= main_~i~0 28), 128252#(<= main_~i~0 27), 128255#(<= main_~i~0 30), 128254#(<= main_~i~0 29)] [2018-04-13 03:32:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34857 backedges. 0 proven. 34848 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:32:53,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-04-13 03:32:53,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-04-13 03:32:53,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 03:32:53,779 INFO L87 Difference]: Start difference. First operand 549 states and 550 transitions. Second operand 135 states. [2018-04-13 03:32:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:32:59,519 INFO L93 Difference]: Finished difference Result 1214 states and 1345 transitions. [2018-04-13 03:32:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-13 03:32:59,519 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 548 [2018-04-13 03:32:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:32:59,520 INFO L225 Difference]: With dead ends: 1214 [2018-04-13 03:32:59,520 INFO L226 Difference]: Without dead ends: 1214 [2018-04-13 03:32:59,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 03:32:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-04-13 03:32:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 553. [2018-04-13 03:32:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-04-13 03:32:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 554 transitions. [2018-04-13 03:32:59,523 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 554 transitions. Word has length 548 [2018-04-13 03:32:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:32:59,524 INFO L459 AbstractCegarLoop]: Abstraction has 553 states and 554 transitions. [2018-04-13 03:32:59,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-04-13 03:32:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 554 transitions. [2018-04-13 03:32:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-04-13 03:32:59,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:32:59,525 INFO L355 BasicCegarLoop]: trace histogram [134, 133, 133, 133, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:32:59,525 INFO L408 AbstractCegarLoop]: === Iteration 134 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:32:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1470167593, now seen corresponding path program 132 times [2018-04-13 03:32:59,526 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:32:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:32:59,541 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 35387 backedges. 0 proven. 35378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:03,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:03,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-04-13 03:33:03,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:03,395 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-13 03:33:03,395 INFO L182 omatonBuilderFactory]: Interpolants [130125#true, 130127#(<= main_~i~0 0), 130126#false, 130129#(<= main_~i~0 2), 130128#(<= main_~i~0 1), 130131#(<= main_~i~0 4), 130130#(<= main_~i~0 3), 130133#(<= main_~i~0 6), 130132#(<= main_~i~0 5), 130135#(<= main_~i~0 8), 130134#(<= main_~i~0 7), 130137#(<= main_~i~0 10), 130136#(<= main_~i~0 9), 130139#(<= main_~i~0 12), 130138#(<= main_~i~0 11), 130141#(<= main_~i~0 14), 130140#(<= main_~i~0 13), 130143#(<= main_~i~0 16), 130142#(<= main_~i~0 15), 130145#(<= main_~i~0 18), 130144#(<= main_~i~0 17), 130147#(<= main_~i~0 20), 130146#(<= main_~i~0 19), 130149#(<= main_~i~0 22), 130148#(<= main_~i~0 21), 130151#(<= main_~i~0 24), 130150#(<= main_~i~0 23), 130153#(<= main_~i~0 26), 130152#(<= main_~i~0 25), 130155#(<= main_~i~0 28), 130154#(<= main_~i~0 27), 130157#(<= main_~i~0 30), 130156#(<= main_~i~0 29), 130159#(<= main_~i~0 32), 130158#(<= main_~i~0 31), 130161#(<= main_~i~0 34), 130160#(<= main_~i~0 33), 130163#(<= main_~i~0 36), 130162#(<= main_~i~0 35), 130165#(<= main_~i~0 38), 130164#(<= main_~i~0 37), 130167#(<= main_~i~0 40), 130166#(<= main_~i~0 39), 130169#(<= main_~i~0 42), 130168#(<= main_~i~0 41), 130171#(<= main_~i~0 44), 130170#(<= main_~i~0 43), 130173#(<= main_~i~0 46), 130172#(<= main_~i~0 45), 130175#(<= main_~i~0 48), 130174#(<= main_~i~0 47), 130177#(<= main_~i~0 50), 130176#(<= main_~i~0 49), 130179#(<= main_~i~0 52), 130178#(<= main_~i~0 51), 130181#(<= main_~i~0 54), 130180#(<= main_~i~0 53), 130183#(<= main_~i~0 56), 130182#(<= main_~i~0 55), 130185#(<= main_~i~0 58), 130184#(<= main_~i~0 57), 130187#(<= main_~i~0 60), 130186#(<= main_~i~0 59), 130189#(<= main_~i~0 62), 130188#(<= main_~i~0 61), 130191#(<= main_~i~0 64), 130190#(<= main_~i~0 63), 130193#(<= main_~i~0 66), 130192#(<= main_~i~0 65), 130195#(<= main_~i~0 68), 130194#(<= main_~i~0 67), 130197#(<= main_~i~0 70), 130196#(<= main_~i~0 69), 130199#(<= main_~i~0 72), 130198#(<= main_~i~0 71), 130201#(<= main_~i~0 74), 130200#(<= main_~i~0 73), 130203#(<= main_~i~0 76), 130202#(<= main_~i~0 75), 130205#(<= main_~i~0 78), 130204#(<= main_~i~0 77), 130207#(<= main_~i~0 80), 130206#(<= main_~i~0 79), 130209#(<= main_~i~0 82), 130208#(<= main_~i~0 81), 130211#(<= main_~i~0 84), 130210#(<= main_~i~0 83), 130213#(<= main_~i~0 86), 130212#(<= main_~i~0 85), 130215#(<= main_~i~0 88), 130214#(<= main_~i~0 87), 130217#(<= main_~i~0 90), 130216#(<= main_~i~0 89), 130219#(<= main_~i~0 92), 130218#(<= main_~i~0 91), 130221#(<= main_~i~0 94), 130220#(<= main_~i~0 93), 130223#(<= main_~i~0 96), 130222#(<= main_~i~0 95), 130225#(<= main_~i~0 98), 130224#(<= main_~i~0 97), 130227#(<= main_~i~0 100), 130226#(<= main_~i~0 99), 130229#(<= main_~i~0 102), 130228#(<= main_~i~0 101), 130231#(<= main_~i~0 104), 130230#(<= main_~i~0 103), 130233#(<= main_~i~0 106), 130232#(<= main_~i~0 105), 130235#(<= main_~i~0 108), 130234#(<= main_~i~0 107), 130237#(<= main_~i~0 110), 130236#(<= main_~i~0 109), 130239#(<= main_~i~0 112), 130238#(<= main_~i~0 111), 130241#(<= main_~i~0 114), 130240#(<= main_~i~0 113), 130243#(<= main_~i~0 116), 130242#(<= main_~i~0 115), 130245#(<= main_~i~0 118), 130244#(<= main_~i~0 117), 130247#(<= main_~i~0 120), 130246#(<= main_~i~0 119), 130249#(<= main_~i~0 122), 130248#(<= main_~i~0 121), 130251#(<= main_~i~0 124), 130250#(<= main_~i~0 123), 130253#(<= main_~i~0 126), 130252#(<= main_~i~0 125), 130255#(<= main_~i~0 128), 130254#(<= main_~i~0 127), 130257#(<= main_~i~0 130), 130256#(<= main_~i~0 129), 130259#(<= main_~i~0 132), 130258#(<= main_~i~0 131), 130260#(<= main_~i~0 133)] [2018-04-13 03:33:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 35387 backedges. 0 proven. 35378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:03,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-13 03:33:03,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-13 03:33:03,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 03:33:03,398 INFO L87 Difference]: Start difference. First operand 553 states and 554 transitions. Second operand 136 states. [2018-04-13 03:33:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:33:10,383 INFO L93 Difference]: Finished difference Result 1223 states and 1355 transitions. [2018-04-13 03:33:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-04-13 03:33:10,383 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 552 [2018-04-13 03:33:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:33:10,384 INFO L225 Difference]: With dead ends: 1223 [2018-04-13 03:33:10,384 INFO L226 Difference]: Without dead ends: 1223 [2018-04-13 03:33:10,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 03:33:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-04-13 03:33:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 557. [2018-04-13 03:33:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-04-13 03:33:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 558 transitions. [2018-04-13 03:33:10,401 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 558 transitions. Word has length 552 [2018-04-13 03:33:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:33:10,402 INFO L459 AbstractCegarLoop]: Abstraction has 557 states and 558 transitions. [2018-04-13 03:33:10,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-13 03:33:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 558 transitions. [2018-04-13 03:33:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-04-13 03:33:10,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:33:10,403 INFO L355 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:33:10,403 INFO L408 AbstractCegarLoop]: === Iteration 135 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:33:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1997521456, now seen corresponding path program 133 times [2018-04-13 03:33:10,404 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:33:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:33:10,419 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 35921 backedges. 0 proven. 35912 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:14,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:14,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-04-13 03:33:14,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:14,183 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-13 03:33:14,183 INFO L182 omatonBuilderFactory]: Interpolants [132098#(<= main_~i~0 55), 132099#(<= main_~i~0 56), 132096#(<= main_~i~0 53), 132097#(<= main_~i~0 54), 132102#(<= main_~i~0 59), 132103#(<= main_~i~0 60), 132100#(<= main_~i~0 57), 132101#(<= main_~i~0 58), 132106#(<= main_~i~0 63), 132107#(<= main_~i~0 64), 132104#(<= main_~i~0 61), 132105#(<= main_~i~0 62), 132110#(<= main_~i~0 67), 132111#(<= main_~i~0 68), 132108#(<= main_~i~0 65), 132109#(<= main_~i~0 66), 132114#(<= main_~i~0 71), 132115#(<= main_~i~0 72), 132112#(<= main_~i~0 69), 132113#(<= main_~i~0 70), 132118#(<= main_~i~0 75), 132119#(<= main_~i~0 76), 132116#(<= main_~i~0 73), 132117#(<= main_~i~0 74), 132122#(<= main_~i~0 79), 132123#(<= main_~i~0 80), 132120#(<= main_~i~0 77), 132121#(<= main_~i~0 78), 132126#(<= main_~i~0 83), 132127#(<= main_~i~0 84), 132124#(<= main_~i~0 81), 132125#(<= main_~i~0 82), 132130#(<= main_~i~0 87), 132131#(<= main_~i~0 88), 132128#(<= main_~i~0 85), 132129#(<= main_~i~0 86), 132134#(<= main_~i~0 91), 132135#(<= main_~i~0 92), 132132#(<= main_~i~0 89), 132133#(<= main_~i~0 90), 132138#(<= main_~i~0 95), 132139#(<= main_~i~0 96), 132136#(<= main_~i~0 93), 132137#(<= main_~i~0 94), 132142#(<= main_~i~0 99), 132143#(<= main_~i~0 100), 132140#(<= main_~i~0 97), 132141#(<= main_~i~0 98), 132146#(<= main_~i~0 103), 132147#(<= main_~i~0 104), 132144#(<= main_~i~0 101), 132145#(<= main_~i~0 102), 132150#(<= main_~i~0 107), 132151#(<= main_~i~0 108), 132148#(<= main_~i~0 105), 132149#(<= main_~i~0 106), 132154#(<= main_~i~0 111), 132155#(<= main_~i~0 112), 132152#(<= main_~i~0 109), 132153#(<= main_~i~0 110), 132158#(<= main_~i~0 115), 132159#(<= main_~i~0 116), 132156#(<= main_~i~0 113), 132157#(<= main_~i~0 114), 132162#(<= main_~i~0 119), 132163#(<= main_~i~0 120), 132160#(<= main_~i~0 117), 132161#(<= main_~i~0 118), 132166#(<= main_~i~0 123), 132167#(<= main_~i~0 124), 132164#(<= main_~i~0 121), 132165#(<= main_~i~0 122), 132170#(<= main_~i~0 127), 132171#(<= main_~i~0 128), 132168#(<= main_~i~0 125), 132169#(<= main_~i~0 126), 132174#(<= main_~i~0 131), 132175#(<= main_~i~0 132), 132172#(<= main_~i~0 129), 132173#(<= main_~i~0 130), 132176#(<= main_~i~0 133), 132177#(<= main_~i~0 134), 132042#false, 132043#(<= main_~i~0 0), 132041#true, 132046#(<= main_~i~0 3), 132047#(<= main_~i~0 4), 132044#(<= main_~i~0 1), 132045#(<= main_~i~0 2), 132050#(<= main_~i~0 7), 132051#(<= main_~i~0 8), 132048#(<= main_~i~0 5), 132049#(<= main_~i~0 6), 132054#(<= main_~i~0 11), 132055#(<= main_~i~0 12), 132052#(<= main_~i~0 9), 132053#(<= main_~i~0 10), 132058#(<= main_~i~0 15), 132059#(<= main_~i~0 16), 132056#(<= main_~i~0 13), 132057#(<= main_~i~0 14), 132062#(<= main_~i~0 19), 132063#(<= main_~i~0 20), 132060#(<= main_~i~0 17), 132061#(<= main_~i~0 18), 132066#(<= main_~i~0 23), 132067#(<= main_~i~0 24), 132064#(<= main_~i~0 21), 132065#(<= main_~i~0 22), 132070#(<= main_~i~0 27), 132071#(<= main_~i~0 28), 132068#(<= main_~i~0 25), 132069#(<= main_~i~0 26), 132074#(<= main_~i~0 31), 132075#(<= main_~i~0 32), 132072#(<= main_~i~0 29), 132073#(<= main_~i~0 30), 132078#(<= main_~i~0 35), 132079#(<= main_~i~0 36), 132076#(<= main_~i~0 33), 132077#(<= main_~i~0 34), 132082#(<= main_~i~0 39), 132083#(<= main_~i~0 40), 132080#(<= main_~i~0 37), 132081#(<= main_~i~0 38), 132086#(<= main_~i~0 43), 132087#(<= main_~i~0 44), 132084#(<= main_~i~0 41), 132085#(<= main_~i~0 42), 132090#(<= main_~i~0 47), 132091#(<= main_~i~0 48), 132088#(<= main_~i~0 45), 132089#(<= main_~i~0 46), 132094#(<= main_~i~0 51), 132095#(<= main_~i~0 52), 132092#(<= main_~i~0 49), 132093#(<= main_~i~0 50)] [2018-04-13 03:33:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 35921 backedges. 0 proven. 35912 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:14,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-13 03:33:14,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-13 03:33:14,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 03:33:14,185 INFO L87 Difference]: Start difference. First operand 557 states and 558 transitions. Second operand 137 states. [2018-04-13 03:33:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:33:20,119 INFO L93 Difference]: Finished difference Result 1232 states and 1365 transitions. [2018-04-13 03:33:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 03:33:20,119 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 556 [2018-04-13 03:33:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:33:20,120 INFO L225 Difference]: With dead ends: 1232 [2018-04-13 03:33:20,120 INFO L226 Difference]: Without dead ends: 1232 [2018-04-13 03:33:20,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 03:33:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2018-04-13 03:33:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 561. [2018-04-13 03:33:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-04-13 03:33:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 562 transitions. [2018-04-13 03:33:20,124 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 562 transitions. Word has length 556 [2018-04-13 03:33:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:33:20,124 INFO L459 AbstractCegarLoop]: Abstraction has 561 states and 562 transitions. [2018-04-13 03:33:20,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-13 03:33:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 562 transitions. [2018-04-13 03:33:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-04-13 03:33:20,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:33:20,125 INFO L355 BasicCegarLoop]: trace histogram [136, 135, 135, 135, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:33:20,126 INFO L408 AbstractCegarLoop]: === Iteration 136 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:33:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash -842870455, now seen corresponding path program 134 times [2018-04-13 03:33:20,126 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:33:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:33:20,142 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36459 backedges. 0 proven. 36450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:24,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:24,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-04-13 03:33:24,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:24,028 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-13 03:33:24,028 INFO L182 omatonBuilderFactory]: Interpolants [133971#true, 133974#(<= main_~i~0 1), 133975#(<= main_~i~0 2), 133972#false, 133973#(<= main_~i~0 0), 133978#(<= main_~i~0 5), 133979#(<= main_~i~0 6), 133976#(<= main_~i~0 3), 133977#(<= main_~i~0 4), 133982#(<= main_~i~0 9), 133983#(<= main_~i~0 10), 133980#(<= main_~i~0 7), 133981#(<= main_~i~0 8), 133986#(<= main_~i~0 13), 133987#(<= main_~i~0 14), 133984#(<= main_~i~0 11), 133985#(<= main_~i~0 12), 133990#(<= main_~i~0 17), 133991#(<= main_~i~0 18), 133988#(<= main_~i~0 15), 133989#(<= main_~i~0 16), 133994#(<= main_~i~0 21), 133995#(<= main_~i~0 22), 133992#(<= main_~i~0 19), 133993#(<= main_~i~0 20), 133998#(<= main_~i~0 25), 133999#(<= main_~i~0 26), 133996#(<= main_~i~0 23), 133997#(<= main_~i~0 24), 134002#(<= main_~i~0 29), 134003#(<= main_~i~0 30), 134000#(<= main_~i~0 27), 134001#(<= main_~i~0 28), 134006#(<= main_~i~0 33), 134007#(<= main_~i~0 34), 134004#(<= main_~i~0 31), 134005#(<= main_~i~0 32), 134010#(<= main_~i~0 37), 134011#(<= main_~i~0 38), 134008#(<= main_~i~0 35), 134009#(<= main_~i~0 36), 134014#(<= main_~i~0 41), 134015#(<= main_~i~0 42), 134012#(<= main_~i~0 39), 134013#(<= main_~i~0 40), 134018#(<= main_~i~0 45), 134019#(<= main_~i~0 46), 134016#(<= main_~i~0 43), 134017#(<= main_~i~0 44), 134022#(<= main_~i~0 49), 134023#(<= main_~i~0 50), 134020#(<= main_~i~0 47), 134021#(<= main_~i~0 48), 134026#(<= main_~i~0 53), 134027#(<= main_~i~0 54), 134024#(<= main_~i~0 51), 134025#(<= main_~i~0 52), 134030#(<= main_~i~0 57), 134031#(<= main_~i~0 58), 134028#(<= main_~i~0 55), 134029#(<= main_~i~0 56), 134034#(<= main_~i~0 61), 134035#(<= main_~i~0 62), 134032#(<= main_~i~0 59), 134033#(<= main_~i~0 60), 134038#(<= main_~i~0 65), 134039#(<= main_~i~0 66), 134036#(<= main_~i~0 63), 134037#(<= main_~i~0 64), 134042#(<= main_~i~0 69), 134043#(<= main_~i~0 70), 134040#(<= main_~i~0 67), 134041#(<= main_~i~0 68), 134046#(<= main_~i~0 73), 134047#(<= main_~i~0 74), 134044#(<= main_~i~0 71), 134045#(<= main_~i~0 72), 134050#(<= main_~i~0 77), 134051#(<= main_~i~0 78), 134048#(<= main_~i~0 75), 134049#(<= main_~i~0 76), 134054#(<= main_~i~0 81), 134055#(<= main_~i~0 82), 134052#(<= main_~i~0 79), 134053#(<= main_~i~0 80), 134058#(<= main_~i~0 85), 134059#(<= main_~i~0 86), 134056#(<= main_~i~0 83), 134057#(<= main_~i~0 84), 134062#(<= main_~i~0 89), 134063#(<= main_~i~0 90), 134060#(<= main_~i~0 87), 134061#(<= main_~i~0 88), 134066#(<= main_~i~0 93), 134067#(<= main_~i~0 94), 134064#(<= main_~i~0 91), 134065#(<= main_~i~0 92), 134070#(<= main_~i~0 97), 134071#(<= main_~i~0 98), 134068#(<= main_~i~0 95), 134069#(<= main_~i~0 96), 134074#(<= main_~i~0 101), 134075#(<= main_~i~0 102), 134072#(<= main_~i~0 99), 134073#(<= main_~i~0 100), 134078#(<= main_~i~0 105), 134079#(<= main_~i~0 106), 134076#(<= main_~i~0 103), 134077#(<= main_~i~0 104), 134082#(<= main_~i~0 109), 134083#(<= main_~i~0 110), 134080#(<= main_~i~0 107), 134081#(<= main_~i~0 108), 134086#(<= main_~i~0 113), 134087#(<= main_~i~0 114), 134084#(<= main_~i~0 111), 134085#(<= main_~i~0 112), 134090#(<= main_~i~0 117), 134091#(<= main_~i~0 118), 134088#(<= main_~i~0 115), 134089#(<= main_~i~0 116), 134094#(<= main_~i~0 121), 134095#(<= main_~i~0 122), 134092#(<= main_~i~0 119), 134093#(<= main_~i~0 120), 134098#(<= main_~i~0 125), 134099#(<= main_~i~0 126), 134096#(<= main_~i~0 123), 134097#(<= main_~i~0 124), 134102#(<= main_~i~0 129), 134103#(<= main_~i~0 130), 134100#(<= main_~i~0 127), 134101#(<= main_~i~0 128), 134106#(<= main_~i~0 133), 134107#(<= main_~i~0 134), 134104#(<= main_~i~0 131), 134105#(<= main_~i~0 132), 134108#(<= main_~i~0 135)] [2018-04-13 03:33:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36459 backedges. 0 proven. 36450 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:24,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-04-13 03:33:24,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-04-13 03:33:24,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 03:33:24,030 INFO L87 Difference]: Start difference. First operand 561 states and 562 transitions. Second operand 138 states. [2018-04-13 03:33:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:33:31,372 INFO L93 Difference]: Finished difference Result 1241 states and 1375 transitions. [2018-04-13 03:33:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-04-13 03:33:31,372 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 560 [2018-04-13 03:33:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:33:31,373 INFO L225 Difference]: With dead ends: 1241 [2018-04-13 03:33:31,373 INFO L226 Difference]: Without dead ends: 1241 [2018-04-13 03:33:31,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 03:33:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-04-13 03:33:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 565. [2018-04-13 03:33:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-04-13 03:33:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-04-13 03:33:31,376 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 560 [2018-04-13 03:33:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:33:31,377 INFO L459 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-04-13 03:33:31,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-04-13 03:33:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-04-13 03:33:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-04-13 03:33:31,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:33:31,378 INFO L355 BasicCegarLoop]: trace histogram [137, 136, 136, 136, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:33:31,378 INFO L408 AbstractCegarLoop]: === Iteration 137 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:33:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2008875074, now seen corresponding path program 135 times [2018-04-13 03:33:31,379 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:33:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:33:31,394 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37001 backedges. 0 proven. 36992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:35,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:35,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-04-13 03:33:35,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:35,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-13 03:33:35,340 INFO L182 omatonBuilderFactory]: Interpolants [135938#(<= main_~i~0 21), 135939#(<= main_~i~0 22), 135936#(<= main_~i~0 19), 135937#(<= main_~i~0 20), 135942#(<= main_~i~0 25), 135943#(<= main_~i~0 26), 135940#(<= main_~i~0 23), 135941#(<= main_~i~0 24), 135946#(<= main_~i~0 29), 135947#(<= main_~i~0 30), 135944#(<= main_~i~0 27), 135945#(<= main_~i~0 28), 135950#(<= main_~i~0 33), 135951#(<= main_~i~0 34), 135948#(<= main_~i~0 31), 135949#(<= main_~i~0 32), 135954#(<= main_~i~0 37), 135955#(<= main_~i~0 38), 135952#(<= main_~i~0 35), 135953#(<= main_~i~0 36), 135958#(<= main_~i~0 41), 135959#(<= main_~i~0 42), 135956#(<= main_~i~0 39), 135957#(<= main_~i~0 40), 135962#(<= main_~i~0 45), 135963#(<= main_~i~0 46), 135960#(<= main_~i~0 43), 135961#(<= main_~i~0 44), 135966#(<= main_~i~0 49), 135967#(<= main_~i~0 50), 135964#(<= main_~i~0 47), 135965#(<= main_~i~0 48), 135970#(<= main_~i~0 53), 135971#(<= main_~i~0 54), 135968#(<= main_~i~0 51), 135969#(<= main_~i~0 52), 135974#(<= main_~i~0 57), 135975#(<= main_~i~0 58), 135972#(<= main_~i~0 55), 135973#(<= main_~i~0 56), 135978#(<= main_~i~0 61), 135979#(<= main_~i~0 62), 135976#(<= main_~i~0 59), 135977#(<= main_~i~0 60), 135982#(<= main_~i~0 65), 135983#(<= main_~i~0 66), 135980#(<= main_~i~0 63), 135981#(<= main_~i~0 64), 135986#(<= main_~i~0 69), 135987#(<= main_~i~0 70), 135984#(<= main_~i~0 67), 135985#(<= main_~i~0 68), 135990#(<= main_~i~0 73), 135991#(<= main_~i~0 74), 135988#(<= main_~i~0 71), 135989#(<= main_~i~0 72), 135994#(<= main_~i~0 77), 135995#(<= main_~i~0 78), 135992#(<= main_~i~0 75), 135993#(<= main_~i~0 76), 135998#(<= main_~i~0 81), 135999#(<= main_~i~0 82), 135996#(<= main_~i~0 79), 135997#(<= main_~i~0 80), 136002#(<= main_~i~0 85), 136003#(<= main_~i~0 86), 136000#(<= main_~i~0 83), 136001#(<= main_~i~0 84), 136006#(<= main_~i~0 89), 136007#(<= main_~i~0 90), 136004#(<= main_~i~0 87), 136005#(<= main_~i~0 88), 136010#(<= main_~i~0 93), 136011#(<= main_~i~0 94), 136008#(<= main_~i~0 91), 136009#(<= main_~i~0 92), 136014#(<= main_~i~0 97), 136015#(<= main_~i~0 98), 136012#(<= main_~i~0 95), 136013#(<= main_~i~0 96), 136018#(<= main_~i~0 101), 136019#(<= main_~i~0 102), 136016#(<= main_~i~0 99), 136017#(<= main_~i~0 100), 136022#(<= main_~i~0 105), 136023#(<= main_~i~0 106), 136020#(<= main_~i~0 103), 136021#(<= main_~i~0 104), 136026#(<= main_~i~0 109), 136027#(<= main_~i~0 110), 136024#(<= main_~i~0 107), 136025#(<= main_~i~0 108), 136030#(<= main_~i~0 113), 136031#(<= main_~i~0 114), 136028#(<= main_~i~0 111), 136029#(<= main_~i~0 112), 136034#(<= main_~i~0 117), 136035#(<= main_~i~0 118), 136032#(<= main_~i~0 115), 136033#(<= main_~i~0 116), 136038#(<= main_~i~0 121), 136039#(<= main_~i~0 122), 136036#(<= main_~i~0 119), 136037#(<= main_~i~0 120), 136042#(<= main_~i~0 125), 136043#(<= main_~i~0 126), 136040#(<= main_~i~0 123), 136041#(<= main_~i~0 124), 136046#(<= main_~i~0 129), 136047#(<= main_~i~0 130), 136044#(<= main_~i~0 127), 136045#(<= main_~i~0 128), 136050#(<= main_~i~0 133), 136051#(<= main_~i~0 134), 136048#(<= main_~i~0 131), 136049#(<= main_~i~0 132), 136052#(<= main_~i~0 135), 136053#(<= main_~i~0 136), 135915#true, 135918#(<= main_~i~0 1), 135919#(<= main_~i~0 2), 135916#false, 135917#(<= main_~i~0 0), 135922#(<= main_~i~0 5), 135923#(<= main_~i~0 6), 135920#(<= main_~i~0 3), 135921#(<= main_~i~0 4), 135926#(<= main_~i~0 9), 135927#(<= main_~i~0 10), 135924#(<= main_~i~0 7), 135925#(<= main_~i~0 8), 135930#(<= main_~i~0 13), 135931#(<= main_~i~0 14), 135928#(<= main_~i~0 11), 135929#(<= main_~i~0 12), 135934#(<= main_~i~0 17), 135935#(<= main_~i~0 18), 135932#(<= main_~i~0 15), 135933#(<= main_~i~0 16)] [2018-04-13 03:33:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 37001 backedges. 0 proven. 36992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:35,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-04-13 03:33:35,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-04-13 03:33:35,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-04-13 03:33:35,343 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 139 states. [2018-04-13 03:33:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:33:42,577 INFO L93 Difference]: Finished difference Result 1250 states and 1385 transitions. [2018-04-13 03:33:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-04-13 03:33:42,578 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 564 [2018-04-13 03:33:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:33:42,578 INFO L225 Difference]: With dead ends: 1250 [2018-04-13 03:33:42,579 INFO L226 Difference]: Without dead ends: 1250 [2018-04-13 03:33:42,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-04-13 03:33:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-13 03:33:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 569. [2018-04-13 03:33:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-04-13 03:33:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 570 transitions. [2018-04-13 03:33:42,581 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 570 transitions. Word has length 564 [2018-04-13 03:33:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:33:42,582 INFO L459 AbstractCegarLoop]: Abstraction has 569 states and 570 transitions. [2018-04-13 03:33:42,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-04-13 03:33:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 570 transitions. [2018-04-13 03:33:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-04-13 03:33:42,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:33:42,583 INFO L355 BasicCegarLoop]: trace histogram [138, 137, 137, 137, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:33:42,583 INFO L408 AbstractCegarLoop]: === Iteration 138 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:33:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash 715459259, now seen corresponding path program 136 times [2018-04-13 03:33:42,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:33:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:33:42,600 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 37547 backedges. 0 proven. 37538 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:46,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:46,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-04-13 03:33:46,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:46,597 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-13 03:33:46,597 INFO L182 omatonBuilderFactory]: Interpolants [137986#(<= main_~i~0 111), 137987#(<= main_~i~0 112), 137984#(<= main_~i~0 109), 137985#(<= main_~i~0 110), 137990#(<= main_~i~0 115), 137991#(<= main_~i~0 116), 137988#(<= main_~i~0 113), 137989#(<= main_~i~0 114), 137994#(<= main_~i~0 119), 137995#(<= main_~i~0 120), 137992#(<= main_~i~0 117), 137993#(<= main_~i~0 118), 137998#(<= main_~i~0 123), 137999#(<= main_~i~0 124), 137996#(<= main_~i~0 121), 137997#(<= main_~i~0 122), 138002#(<= main_~i~0 127), 138003#(<= main_~i~0 128), 138000#(<= main_~i~0 125), 138001#(<= main_~i~0 126), 138006#(<= main_~i~0 131), 138007#(<= main_~i~0 132), 138004#(<= main_~i~0 129), 138005#(<= main_~i~0 130), 138010#(<= main_~i~0 135), 138011#(<= main_~i~0 136), 138008#(<= main_~i~0 133), 138009#(<= main_~i~0 134), 138012#(<= main_~i~0 137), 137874#false, 137875#(<= main_~i~0 0), 137873#true, 137878#(<= main_~i~0 3), 137879#(<= main_~i~0 4), 137876#(<= main_~i~0 1), 137877#(<= main_~i~0 2), 137882#(<= main_~i~0 7), 137883#(<= main_~i~0 8), 137880#(<= main_~i~0 5), 137881#(<= main_~i~0 6), 137886#(<= main_~i~0 11), 137887#(<= main_~i~0 12), 137884#(<= main_~i~0 9), 137885#(<= main_~i~0 10), 137890#(<= main_~i~0 15), 137891#(<= main_~i~0 16), 137888#(<= main_~i~0 13), 137889#(<= main_~i~0 14), 137894#(<= main_~i~0 19), 137895#(<= main_~i~0 20), 137892#(<= main_~i~0 17), 137893#(<= main_~i~0 18), 137898#(<= main_~i~0 23), 137899#(<= main_~i~0 24), 137896#(<= main_~i~0 21), 137897#(<= main_~i~0 22), 137902#(<= main_~i~0 27), 137903#(<= main_~i~0 28), 137900#(<= main_~i~0 25), 137901#(<= main_~i~0 26), 137906#(<= main_~i~0 31), 137907#(<= main_~i~0 32), 137904#(<= main_~i~0 29), 137905#(<= main_~i~0 30), 137910#(<= main_~i~0 35), 137911#(<= main_~i~0 36), 137908#(<= main_~i~0 33), 137909#(<= main_~i~0 34), 137914#(<= main_~i~0 39), 137915#(<= main_~i~0 40), 137912#(<= main_~i~0 37), 137913#(<= main_~i~0 38), 137918#(<= main_~i~0 43), 137919#(<= main_~i~0 44), 137916#(<= main_~i~0 41), 137917#(<= main_~i~0 42), 137922#(<= main_~i~0 47), 137923#(<= main_~i~0 48), 137920#(<= main_~i~0 45), 137921#(<= main_~i~0 46), 137926#(<= main_~i~0 51), 137927#(<= main_~i~0 52), 137924#(<= main_~i~0 49), 137925#(<= main_~i~0 50), 137930#(<= main_~i~0 55), 137931#(<= main_~i~0 56), 137928#(<= main_~i~0 53), 137929#(<= main_~i~0 54), 137934#(<= main_~i~0 59), 137935#(<= main_~i~0 60), 137932#(<= main_~i~0 57), 137933#(<= main_~i~0 58), 137938#(<= main_~i~0 63), 137939#(<= main_~i~0 64), 137936#(<= main_~i~0 61), 137937#(<= main_~i~0 62), 137942#(<= main_~i~0 67), 137943#(<= main_~i~0 68), 137940#(<= main_~i~0 65), 137941#(<= main_~i~0 66), 137946#(<= main_~i~0 71), 137947#(<= main_~i~0 72), 137944#(<= main_~i~0 69), 137945#(<= main_~i~0 70), 137950#(<= main_~i~0 75), 137951#(<= main_~i~0 76), 137948#(<= main_~i~0 73), 137949#(<= main_~i~0 74), 137954#(<= main_~i~0 79), 137955#(<= main_~i~0 80), 137952#(<= main_~i~0 77), 137953#(<= main_~i~0 78), 137958#(<= main_~i~0 83), 137959#(<= main_~i~0 84), 137956#(<= main_~i~0 81), 137957#(<= main_~i~0 82), 137962#(<= main_~i~0 87), 137963#(<= main_~i~0 88), 137960#(<= main_~i~0 85), 137961#(<= main_~i~0 86), 137966#(<= main_~i~0 91), 137967#(<= main_~i~0 92), 137964#(<= main_~i~0 89), 137965#(<= main_~i~0 90), 137970#(<= main_~i~0 95), 137971#(<= main_~i~0 96), 137968#(<= main_~i~0 93), 137969#(<= main_~i~0 94), 137974#(<= main_~i~0 99), 137975#(<= main_~i~0 100), 137972#(<= main_~i~0 97), 137973#(<= main_~i~0 98), 137978#(<= main_~i~0 103), 137979#(<= main_~i~0 104), 137976#(<= main_~i~0 101), 137977#(<= main_~i~0 102), 137982#(<= main_~i~0 107), 137983#(<= main_~i~0 108), 137980#(<= main_~i~0 105), 137981#(<= main_~i~0 106)] [2018-04-13 03:33:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 37547 backedges. 0 proven. 37538 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:46,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-13 03:33:46,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-13 03:33:46,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 03:33:46,600 INFO L87 Difference]: Start difference. First operand 569 states and 570 transitions. Second operand 140 states. [2018-04-13 03:33:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:33:53,899 INFO L93 Difference]: Finished difference Result 1259 states and 1395 transitions. [2018-04-13 03:33:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-13 03:33:53,899 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 568 [2018-04-13 03:33:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:33:53,900 INFO L225 Difference]: With dead ends: 1259 [2018-04-13 03:33:53,900 INFO L226 Difference]: Without dead ends: 1259 [2018-04-13 03:33:53,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 03:33:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2018-04-13 03:33:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 573. [2018-04-13 03:33:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-04-13 03:33:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 574 transitions. [2018-04-13 03:33:53,903 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 574 transitions. Word has length 568 [2018-04-13 03:33:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:33:53,903 INFO L459 AbstractCegarLoop]: Abstraction has 573 states and 574 transitions. [2018-04-13 03:33:53,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-13 03:33:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 574 transitions. [2018-04-13 03:33:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-04-13 03:33:53,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:33:53,905 INFO L355 BasicCegarLoop]: trace histogram [139, 138, 138, 138, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:33:53,905 INFO L408 AbstractCegarLoop]: === Iteration 139 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:33:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1121898316, now seen corresponding path program 137 times [2018-04-13 03:33:53,905 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:33:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:33:53,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:33:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 38097 backedges. 0 proven. 38088 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:57,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:33:57,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-04-13 03:33:57,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:33:57,987 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-13 03:33:57,987 INFO L182 omatonBuilderFactory]: Interpolants [139846#false, 139847#(<= main_~i~0 0), 139845#true, 139850#(<= main_~i~0 3), 139851#(<= main_~i~0 4), 139848#(<= main_~i~0 1), 139849#(<= main_~i~0 2), 139854#(<= main_~i~0 7), 139855#(<= main_~i~0 8), 139852#(<= main_~i~0 5), 139853#(<= main_~i~0 6), 139858#(<= main_~i~0 11), 139859#(<= main_~i~0 12), 139856#(<= main_~i~0 9), 139857#(<= main_~i~0 10), 139862#(<= main_~i~0 15), 139863#(<= main_~i~0 16), 139860#(<= main_~i~0 13), 139861#(<= main_~i~0 14), 139866#(<= main_~i~0 19), 139867#(<= main_~i~0 20), 139864#(<= main_~i~0 17), 139865#(<= main_~i~0 18), 139870#(<= main_~i~0 23), 139871#(<= main_~i~0 24), 139868#(<= main_~i~0 21), 139869#(<= main_~i~0 22), 139874#(<= main_~i~0 27), 139875#(<= main_~i~0 28), 139872#(<= main_~i~0 25), 139873#(<= main_~i~0 26), 139878#(<= main_~i~0 31), 139879#(<= main_~i~0 32), 139876#(<= main_~i~0 29), 139877#(<= main_~i~0 30), 139882#(<= main_~i~0 35), 139883#(<= main_~i~0 36), 139880#(<= main_~i~0 33), 139881#(<= main_~i~0 34), 139886#(<= main_~i~0 39), 139887#(<= main_~i~0 40), 139884#(<= main_~i~0 37), 139885#(<= main_~i~0 38), 139890#(<= main_~i~0 43), 139891#(<= main_~i~0 44), 139888#(<= main_~i~0 41), 139889#(<= main_~i~0 42), 139894#(<= main_~i~0 47), 139895#(<= main_~i~0 48), 139892#(<= main_~i~0 45), 139893#(<= main_~i~0 46), 139898#(<= main_~i~0 51), 139899#(<= main_~i~0 52), 139896#(<= main_~i~0 49), 139897#(<= main_~i~0 50), 139902#(<= main_~i~0 55), 139903#(<= main_~i~0 56), 139900#(<= main_~i~0 53), 139901#(<= main_~i~0 54), 139906#(<= main_~i~0 59), 139907#(<= main_~i~0 60), 139904#(<= main_~i~0 57), 139905#(<= main_~i~0 58), 139910#(<= main_~i~0 63), 139911#(<= main_~i~0 64), 139908#(<= main_~i~0 61), 139909#(<= main_~i~0 62), 139914#(<= main_~i~0 67), 139915#(<= main_~i~0 68), 139912#(<= main_~i~0 65), 139913#(<= main_~i~0 66), 139918#(<= main_~i~0 71), 139919#(<= main_~i~0 72), 139916#(<= main_~i~0 69), 139917#(<= main_~i~0 70), 139922#(<= main_~i~0 75), 139923#(<= main_~i~0 76), 139920#(<= main_~i~0 73), 139921#(<= main_~i~0 74), 139926#(<= main_~i~0 79), 139927#(<= main_~i~0 80), 139924#(<= main_~i~0 77), 139925#(<= main_~i~0 78), 139930#(<= main_~i~0 83), 139931#(<= main_~i~0 84), 139928#(<= main_~i~0 81), 139929#(<= main_~i~0 82), 139934#(<= main_~i~0 87), 139935#(<= main_~i~0 88), 139932#(<= main_~i~0 85), 139933#(<= main_~i~0 86), 139938#(<= main_~i~0 91), 139939#(<= main_~i~0 92), 139936#(<= main_~i~0 89), 139937#(<= main_~i~0 90), 139942#(<= main_~i~0 95), 139943#(<= main_~i~0 96), 139940#(<= main_~i~0 93), 139941#(<= main_~i~0 94), 139946#(<= main_~i~0 99), 139947#(<= main_~i~0 100), 139944#(<= main_~i~0 97), 139945#(<= main_~i~0 98), 139950#(<= main_~i~0 103), 139951#(<= main_~i~0 104), 139948#(<= main_~i~0 101), 139949#(<= main_~i~0 102), 139954#(<= main_~i~0 107), 139955#(<= main_~i~0 108), 139952#(<= main_~i~0 105), 139953#(<= main_~i~0 106), 139958#(<= main_~i~0 111), 139959#(<= main_~i~0 112), 139956#(<= main_~i~0 109), 139957#(<= main_~i~0 110), 139962#(<= main_~i~0 115), 139963#(<= main_~i~0 116), 139960#(<= main_~i~0 113), 139961#(<= main_~i~0 114), 139966#(<= main_~i~0 119), 139967#(<= main_~i~0 120), 139964#(<= main_~i~0 117), 139965#(<= main_~i~0 118), 139970#(<= main_~i~0 123), 139971#(<= main_~i~0 124), 139968#(<= main_~i~0 121), 139969#(<= main_~i~0 122), 139974#(<= main_~i~0 127), 139975#(<= main_~i~0 128), 139972#(<= main_~i~0 125), 139973#(<= main_~i~0 126), 139978#(<= main_~i~0 131), 139979#(<= main_~i~0 132), 139976#(<= main_~i~0 129), 139977#(<= main_~i~0 130), 139982#(<= main_~i~0 135), 139983#(<= main_~i~0 136), 139980#(<= main_~i~0 133), 139981#(<= main_~i~0 134), 139984#(<= main_~i~0 137), 139985#(<= main_~i~0 138)] [2018-04-13 03:33:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 38097 backedges. 0 proven. 38088 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:33:57,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-13 03:33:57,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-13 03:33:57,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 03:33:57,990 INFO L87 Difference]: Start difference. First operand 573 states and 574 transitions. Second operand 141 states. [2018-04-13 03:34:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:34:06,281 INFO L93 Difference]: Finished difference Result 1268 states and 1405 transitions. [2018-04-13 03:34:06,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-04-13 03:34:06,281 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 572 [2018-04-13 03:34:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:34:06,282 INFO L225 Difference]: With dead ends: 1268 [2018-04-13 03:34:06,283 INFO L226 Difference]: Without dead ends: 1268 [2018-04-13 03:34:06,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 03:34:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-04-13 03:34:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 577. [2018-04-13 03:34:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-04-13 03:34:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 578 transitions. [2018-04-13 03:34:06,286 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 578 transitions. Word has length 572 [2018-04-13 03:34:06,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:34:06,287 INFO L459 AbstractCegarLoop]: Abstraction has 577 states and 578 transitions. [2018-04-13 03:34:06,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-13 03:34:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 578 transitions. [2018-04-13 03:34:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-04-13 03:34:06,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:34:06,288 INFO L355 BasicCegarLoop]: trace histogram [140, 139, 139, 139, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:34:06,288 INFO L408 AbstractCegarLoop]: === Iteration 140 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:34:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash -927485395, now seen corresponding path program 138 times [2018-04-13 03:34:06,289 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:34:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:34:06,307 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:34:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 38651 backedges. 0 proven. 38642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:10,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:34:10,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-04-13 03:34:10,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:34:10,467 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-13 03:34:10,467 INFO L182 omatonBuilderFactory]: Interpolants [141831#true, 141834#(<= main_~i~0 1), 141835#(<= main_~i~0 2), 141832#false, 141833#(<= main_~i~0 0), 141838#(<= main_~i~0 5), 141839#(<= main_~i~0 6), 141836#(<= main_~i~0 3), 141837#(<= main_~i~0 4), 141842#(<= main_~i~0 9), 141843#(<= main_~i~0 10), 141840#(<= main_~i~0 7), 141841#(<= main_~i~0 8), 141846#(<= main_~i~0 13), 141847#(<= main_~i~0 14), 141844#(<= main_~i~0 11), 141845#(<= main_~i~0 12), 141850#(<= main_~i~0 17), 141851#(<= main_~i~0 18), 141848#(<= main_~i~0 15), 141849#(<= main_~i~0 16), 141854#(<= main_~i~0 21), 141855#(<= main_~i~0 22), 141852#(<= main_~i~0 19), 141853#(<= main_~i~0 20), 141858#(<= main_~i~0 25), 141859#(<= main_~i~0 26), 141856#(<= main_~i~0 23), 141857#(<= main_~i~0 24), 141862#(<= main_~i~0 29), 141863#(<= main_~i~0 30), 141860#(<= main_~i~0 27), 141861#(<= main_~i~0 28), 141866#(<= main_~i~0 33), 141867#(<= main_~i~0 34), 141864#(<= main_~i~0 31), 141865#(<= main_~i~0 32), 141870#(<= main_~i~0 37), 141871#(<= main_~i~0 38), 141868#(<= main_~i~0 35), 141869#(<= main_~i~0 36), 141874#(<= main_~i~0 41), 141875#(<= main_~i~0 42), 141872#(<= main_~i~0 39), 141873#(<= main_~i~0 40), 141878#(<= main_~i~0 45), 141879#(<= main_~i~0 46), 141876#(<= main_~i~0 43), 141877#(<= main_~i~0 44), 141882#(<= main_~i~0 49), 141883#(<= main_~i~0 50), 141880#(<= main_~i~0 47), 141881#(<= main_~i~0 48), 141886#(<= main_~i~0 53), 141887#(<= main_~i~0 54), 141884#(<= main_~i~0 51), 141885#(<= main_~i~0 52), 141890#(<= main_~i~0 57), 141891#(<= main_~i~0 58), 141888#(<= main_~i~0 55), 141889#(<= main_~i~0 56), 141894#(<= main_~i~0 61), 141895#(<= main_~i~0 62), 141892#(<= main_~i~0 59), 141893#(<= main_~i~0 60), 141898#(<= main_~i~0 65), 141899#(<= main_~i~0 66), 141896#(<= main_~i~0 63), 141897#(<= main_~i~0 64), 141902#(<= main_~i~0 69), 141903#(<= main_~i~0 70), 141900#(<= main_~i~0 67), 141901#(<= main_~i~0 68), 141906#(<= main_~i~0 73), 141907#(<= main_~i~0 74), 141904#(<= main_~i~0 71), 141905#(<= main_~i~0 72), 141910#(<= main_~i~0 77), 141911#(<= main_~i~0 78), 141908#(<= main_~i~0 75), 141909#(<= main_~i~0 76), 141914#(<= main_~i~0 81), 141915#(<= main_~i~0 82), 141912#(<= main_~i~0 79), 141913#(<= main_~i~0 80), 141918#(<= main_~i~0 85), 141919#(<= main_~i~0 86), 141916#(<= main_~i~0 83), 141917#(<= main_~i~0 84), 141922#(<= main_~i~0 89), 141923#(<= main_~i~0 90), 141920#(<= main_~i~0 87), 141921#(<= main_~i~0 88), 141926#(<= main_~i~0 93), 141927#(<= main_~i~0 94), 141924#(<= main_~i~0 91), 141925#(<= main_~i~0 92), 141930#(<= main_~i~0 97), 141931#(<= main_~i~0 98), 141928#(<= main_~i~0 95), 141929#(<= main_~i~0 96), 141934#(<= main_~i~0 101), 141935#(<= main_~i~0 102), 141932#(<= main_~i~0 99), 141933#(<= main_~i~0 100), 141938#(<= main_~i~0 105), 141939#(<= main_~i~0 106), 141936#(<= main_~i~0 103), 141937#(<= main_~i~0 104), 141942#(<= main_~i~0 109), 141943#(<= main_~i~0 110), 141940#(<= main_~i~0 107), 141941#(<= main_~i~0 108), 141946#(<= main_~i~0 113), 141947#(<= main_~i~0 114), 141944#(<= main_~i~0 111), 141945#(<= main_~i~0 112), 141950#(<= main_~i~0 117), 141951#(<= main_~i~0 118), 141948#(<= main_~i~0 115), 141949#(<= main_~i~0 116), 141954#(<= main_~i~0 121), 141955#(<= main_~i~0 122), 141952#(<= main_~i~0 119), 141953#(<= main_~i~0 120), 141958#(<= main_~i~0 125), 141959#(<= main_~i~0 126), 141956#(<= main_~i~0 123), 141957#(<= main_~i~0 124), 141962#(<= main_~i~0 129), 141963#(<= main_~i~0 130), 141960#(<= main_~i~0 127), 141961#(<= main_~i~0 128), 141966#(<= main_~i~0 133), 141967#(<= main_~i~0 134), 141964#(<= main_~i~0 131), 141965#(<= main_~i~0 132), 141970#(<= main_~i~0 137), 141971#(<= main_~i~0 138), 141968#(<= main_~i~0 135), 141969#(<= main_~i~0 136), 141972#(<= main_~i~0 139)] [2018-04-13 03:34:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 38651 backedges. 0 proven. 38642 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:10,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-04-13 03:34:10,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-04-13 03:34:10,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 03:34:10,469 INFO L87 Difference]: Start difference. First operand 577 states and 578 transitions. Second operand 142 states. [2018-04-13 03:34:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:34:19,858 INFO L93 Difference]: Finished difference Result 1277 states and 1415 transitions. [2018-04-13 03:34:19,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-04-13 03:34:19,858 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 576 [2018-04-13 03:34:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:34:19,859 INFO L225 Difference]: With dead ends: 1277 [2018-04-13 03:34:19,859 INFO L226 Difference]: Without dead ends: 1277 [2018-04-13 03:34:19,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 03:34:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-04-13 03:34:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 581. [2018-04-13 03:34:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2018-04-13 03:34:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 582 transitions. [2018-04-13 03:34:19,862 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 582 transitions. Word has length 576 [2018-04-13 03:34:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:34:19,863 INFO L459 AbstractCegarLoop]: Abstraction has 581 states and 582 transitions. [2018-04-13 03:34:19,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-04-13 03:34:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 582 transitions. [2018-04-13 03:34:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-04-13 03:34:19,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:34:19,864 INFO L355 BasicCegarLoop]: trace histogram [141, 140, 140, 140, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:34:19,864 INFO L408 AbstractCegarLoop]: === Iteration 141 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:34:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 969854758, now seen corresponding path program 139 times [2018-04-13 03:34:19,865 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:34:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:34:19,882 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:34:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 39209 backedges. 0 proven. 39200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:23,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:34:23,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-04-13 03:34:23,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:34:23,785 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-13 03:34:23,785 INFO L182 omatonBuilderFactory]: Interpolants [143874#(<= main_~i~0 41), 143875#(<= main_~i~0 42), 143872#(<= main_~i~0 39), 143873#(<= main_~i~0 40), 143878#(<= main_~i~0 45), 143879#(<= main_~i~0 46), 143876#(<= main_~i~0 43), 143877#(<= main_~i~0 44), 143882#(<= main_~i~0 49), 143883#(<= main_~i~0 50), 143880#(<= main_~i~0 47), 143881#(<= main_~i~0 48), 143886#(<= main_~i~0 53), 143887#(<= main_~i~0 54), 143884#(<= main_~i~0 51), 143885#(<= main_~i~0 52), 143890#(<= main_~i~0 57), 143891#(<= main_~i~0 58), 143888#(<= main_~i~0 55), 143889#(<= main_~i~0 56), 143894#(<= main_~i~0 61), 143895#(<= main_~i~0 62), 143892#(<= main_~i~0 59), 143893#(<= main_~i~0 60), 143898#(<= main_~i~0 65), 143899#(<= main_~i~0 66), 143896#(<= main_~i~0 63), 143897#(<= main_~i~0 64), 143902#(<= main_~i~0 69), 143903#(<= main_~i~0 70), 143900#(<= main_~i~0 67), 143901#(<= main_~i~0 68), 143906#(<= main_~i~0 73), 143907#(<= main_~i~0 74), 143904#(<= main_~i~0 71), 143905#(<= main_~i~0 72), 143910#(<= main_~i~0 77), 143911#(<= main_~i~0 78), 143908#(<= main_~i~0 75), 143909#(<= main_~i~0 76), 143914#(<= main_~i~0 81), 143915#(<= main_~i~0 82), 143912#(<= main_~i~0 79), 143913#(<= main_~i~0 80), 143918#(<= main_~i~0 85), 143919#(<= main_~i~0 86), 143916#(<= main_~i~0 83), 143917#(<= main_~i~0 84), 143922#(<= main_~i~0 89), 143923#(<= main_~i~0 90), 143920#(<= main_~i~0 87), 143921#(<= main_~i~0 88), 143926#(<= main_~i~0 93), 143927#(<= main_~i~0 94), 143924#(<= main_~i~0 91), 143925#(<= main_~i~0 92), 143930#(<= main_~i~0 97), 143931#(<= main_~i~0 98), 143928#(<= main_~i~0 95), 143929#(<= main_~i~0 96), 143934#(<= main_~i~0 101), 143935#(<= main_~i~0 102), 143932#(<= main_~i~0 99), 143933#(<= main_~i~0 100), 143938#(<= main_~i~0 105), 143939#(<= main_~i~0 106), 143936#(<= main_~i~0 103), 143937#(<= main_~i~0 104), 143942#(<= main_~i~0 109), 143943#(<= main_~i~0 110), 143940#(<= main_~i~0 107), 143941#(<= main_~i~0 108), 143946#(<= main_~i~0 113), 143947#(<= main_~i~0 114), 143944#(<= main_~i~0 111), 143945#(<= main_~i~0 112), 143950#(<= main_~i~0 117), 143951#(<= main_~i~0 118), 143948#(<= main_~i~0 115), 143949#(<= main_~i~0 116), 143954#(<= main_~i~0 121), 143955#(<= main_~i~0 122), 143952#(<= main_~i~0 119), 143953#(<= main_~i~0 120), 143958#(<= main_~i~0 125), 143959#(<= main_~i~0 126), 143956#(<= main_~i~0 123), 143957#(<= main_~i~0 124), 143962#(<= main_~i~0 129), 143963#(<= main_~i~0 130), 143960#(<= main_~i~0 127), 143961#(<= main_~i~0 128), 143966#(<= main_~i~0 133), 143967#(<= main_~i~0 134), 143964#(<= main_~i~0 131), 143965#(<= main_~i~0 132), 143970#(<= main_~i~0 137), 143971#(<= main_~i~0 138), 143968#(<= main_~i~0 135), 143969#(<= main_~i~0 136), 143972#(<= main_~i~0 139), 143973#(<= main_~i~0 140), 143831#true, 143834#(<= main_~i~0 1), 143835#(<= main_~i~0 2), 143832#false, 143833#(<= main_~i~0 0), 143838#(<= main_~i~0 5), 143839#(<= main_~i~0 6), 143836#(<= main_~i~0 3), 143837#(<= main_~i~0 4), 143842#(<= main_~i~0 9), 143843#(<= main_~i~0 10), 143840#(<= main_~i~0 7), 143841#(<= main_~i~0 8), 143846#(<= main_~i~0 13), 143847#(<= main_~i~0 14), 143844#(<= main_~i~0 11), 143845#(<= main_~i~0 12), 143850#(<= main_~i~0 17), 143851#(<= main_~i~0 18), 143848#(<= main_~i~0 15), 143849#(<= main_~i~0 16), 143854#(<= main_~i~0 21), 143855#(<= main_~i~0 22), 143852#(<= main_~i~0 19), 143853#(<= main_~i~0 20), 143858#(<= main_~i~0 25), 143859#(<= main_~i~0 26), 143856#(<= main_~i~0 23), 143857#(<= main_~i~0 24), 143862#(<= main_~i~0 29), 143863#(<= main_~i~0 30), 143860#(<= main_~i~0 27), 143861#(<= main_~i~0 28), 143866#(<= main_~i~0 33), 143867#(<= main_~i~0 34), 143864#(<= main_~i~0 31), 143865#(<= main_~i~0 32), 143870#(<= main_~i~0 37), 143871#(<= main_~i~0 38), 143868#(<= main_~i~0 35), 143869#(<= main_~i~0 36)] [2018-04-13 03:34:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 39209 backedges. 0 proven. 39200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:23,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-04-13 03:34:23,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-04-13 03:34:23,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 03:34:23,787 INFO L87 Difference]: Start difference. First operand 581 states and 582 transitions. Second operand 143 states. [2018-04-13 03:34:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:34:30,027 INFO L93 Difference]: Finished difference Result 1286 states and 1425 transitions. [2018-04-13 03:34:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-04-13 03:34:30,027 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 580 [2018-04-13 03:34:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:34:30,028 INFO L225 Difference]: With dead ends: 1286 [2018-04-13 03:34:30,028 INFO L226 Difference]: Without dead ends: 1286 [2018-04-13 03:34:30,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 03:34:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-04-13 03:34:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 585. [2018-04-13 03:34:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-04-13 03:34:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-04-13 03:34:30,031 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 580 [2018-04-13 03:34:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:34:30,031 INFO L459 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-04-13 03:34:30,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-04-13 03:34:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-04-13 03:34:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-04-13 03:34:30,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:34:30,033 INFO L355 BasicCegarLoop]: trace histogram [142, 141, 141, 141, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:34:30,033 INFO L408 AbstractCegarLoop]: === Iteration 142 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:34:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash -542324833, now seen corresponding path program 140 times [2018-04-13 03:34:30,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:34:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:34:30,050 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:34:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 39771 backedges. 0 proven. 39762 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:33,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:34:33,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-04-13 03:34:33,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:34:33,865 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-13 03:34:33,865 INFO L182 omatonBuilderFactory]: Interpolants [145922#(<= main_~i~0 75), 145923#(<= main_~i~0 76), 145920#(<= main_~i~0 73), 145921#(<= main_~i~0 74), 145926#(<= main_~i~0 79), 145927#(<= main_~i~0 80), 145924#(<= main_~i~0 77), 145925#(<= main_~i~0 78), 145930#(<= main_~i~0 83), 145931#(<= main_~i~0 84), 145928#(<= main_~i~0 81), 145929#(<= main_~i~0 82), 145934#(<= main_~i~0 87), 145935#(<= main_~i~0 88), 145932#(<= main_~i~0 85), 145933#(<= main_~i~0 86), 145938#(<= main_~i~0 91), 145939#(<= main_~i~0 92), 145936#(<= main_~i~0 89), 145937#(<= main_~i~0 90), 145942#(<= main_~i~0 95), 145943#(<= main_~i~0 96), 145940#(<= main_~i~0 93), 145941#(<= main_~i~0 94), 145946#(<= main_~i~0 99), 145947#(<= main_~i~0 100), 145944#(<= main_~i~0 97), 145945#(<= main_~i~0 98), 145950#(<= main_~i~0 103), 145951#(<= main_~i~0 104), 145948#(<= main_~i~0 101), 145949#(<= main_~i~0 102), 145954#(<= main_~i~0 107), 145955#(<= main_~i~0 108), 145952#(<= main_~i~0 105), 145953#(<= main_~i~0 106), 145958#(<= main_~i~0 111), 145959#(<= main_~i~0 112), 145956#(<= main_~i~0 109), 145957#(<= main_~i~0 110), 145962#(<= main_~i~0 115), 145963#(<= main_~i~0 116), 145960#(<= main_~i~0 113), 145961#(<= main_~i~0 114), 145966#(<= main_~i~0 119), 145967#(<= main_~i~0 120), 145964#(<= main_~i~0 117), 145965#(<= main_~i~0 118), 145970#(<= main_~i~0 123), 145971#(<= main_~i~0 124), 145968#(<= main_~i~0 121), 145969#(<= main_~i~0 122), 145974#(<= main_~i~0 127), 145975#(<= main_~i~0 128), 145972#(<= main_~i~0 125), 145973#(<= main_~i~0 126), 145978#(<= main_~i~0 131), 145979#(<= main_~i~0 132), 145976#(<= main_~i~0 129), 145977#(<= main_~i~0 130), 145982#(<= main_~i~0 135), 145983#(<= main_~i~0 136), 145980#(<= main_~i~0 133), 145981#(<= main_~i~0 134), 145986#(<= main_~i~0 139), 145987#(<= main_~i~0 140), 145984#(<= main_~i~0 137), 145985#(<= main_~i~0 138), 145988#(<= main_~i~0 141), 145846#false, 145847#(<= main_~i~0 0), 145845#true, 145850#(<= main_~i~0 3), 145851#(<= main_~i~0 4), 145848#(<= main_~i~0 1), 145849#(<= main_~i~0 2), 145854#(<= main_~i~0 7), 145855#(<= main_~i~0 8), 145852#(<= main_~i~0 5), 145853#(<= main_~i~0 6), 145858#(<= main_~i~0 11), 145859#(<= main_~i~0 12), 145856#(<= main_~i~0 9), 145857#(<= main_~i~0 10), 145862#(<= main_~i~0 15), 145863#(<= main_~i~0 16), 145860#(<= main_~i~0 13), 145861#(<= main_~i~0 14), 145866#(<= main_~i~0 19), 145867#(<= main_~i~0 20), 145864#(<= main_~i~0 17), 145865#(<= main_~i~0 18), 145870#(<= main_~i~0 23), 145871#(<= main_~i~0 24), 145868#(<= main_~i~0 21), 145869#(<= main_~i~0 22), 145874#(<= main_~i~0 27), 145875#(<= main_~i~0 28), 145872#(<= main_~i~0 25), 145873#(<= main_~i~0 26), 145878#(<= main_~i~0 31), 145879#(<= main_~i~0 32), 145876#(<= main_~i~0 29), 145877#(<= main_~i~0 30), 145882#(<= main_~i~0 35), 145883#(<= main_~i~0 36), 145880#(<= main_~i~0 33), 145881#(<= main_~i~0 34), 145886#(<= main_~i~0 39), 145887#(<= main_~i~0 40), 145884#(<= main_~i~0 37), 145885#(<= main_~i~0 38), 145890#(<= main_~i~0 43), 145891#(<= main_~i~0 44), 145888#(<= main_~i~0 41), 145889#(<= main_~i~0 42), 145894#(<= main_~i~0 47), 145895#(<= main_~i~0 48), 145892#(<= main_~i~0 45), 145893#(<= main_~i~0 46), 145898#(<= main_~i~0 51), 145899#(<= main_~i~0 52), 145896#(<= main_~i~0 49), 145897#(<= main_~i~0 50), 145902#(<= main_~i~0 55), 145903#(<= main_~i~0 56), 145900#(<= main_~i~0 53), 145901#(<= main_~i~0 54), 145906#(<= main_~i~0 59), 145907#(<= main_~i~0 60), 145904#(<= main_~i~0 57), 145905#(<= main_~i~0 58), 145910#(<= main_~i~0 63), 145911#(<= main_~i~0 64), 145908#(<= main_~i~0 61), 145909#(<= main_~i~0 62), 145914#(<= main_~i~0 67), 145915#(<= main_~i~0 68), 145912#(<= main_~i~0 65), 145913#(<= main_~i~0 66), 145918#(<= main_~i~0 71), 145919#(<= main_~i~0 72), 145916#(<= main_~i~0 69), 145917#(<= main_~i~0 70)] [2018-04-13 03:34:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 39771 backedges. 0 proven. 39762 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:33,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-04-13 03:34:33,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-04-13 03:34:33,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 03:34:33,867 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand 144 states. [2018-04-13 03:34:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:34:39,797 INFO L93 Difference]: Finished difference Result 1295 states and 1435 transitions. [2018-04-13 03:34:39,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-04-13 03:34:39,798 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 584 [2018-04-13 03:34:39,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:34:39,799 INFO L225 Difference]: With dead ends: 1295 [2018-04-13 03:34:39,799 INFO L226 Difference]: Without dead ends: 1295 [2018-04-13 03:34:39,799 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 03:34:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-04-13 03:34:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 589. [2018-04-13 03:34:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-04-13 03:34:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 590 transitions. [2018-04-13 03:34:39,803 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 590 transitions. Word has length 584 [2018-04-13 03:34:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:34:39,803 INFO L459 AbstractCegarLoop]: Abstraction has 589 states and 590 transitions. [2018-04-13 03:34:39,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-04-13 03:34:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 590 transitions. [2018-04-13 03:34:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-04-13 03:34:39,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:34:39,805 INFO L355 BasicCegarLoop]: trace histogram [143, 142, 142, 142, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:34:39,805 INFO L408 AbstractCegarLoop]: === Iteration 143 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:34:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash -59253864, now seen corresponding path program 141 times [2018-04-13 03:34:39,806 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:34:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:34:39,820 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:34:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40337 backedges. 0 proven. 40328 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:43,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:34:43,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-04-13 03:34:43,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:34:43,654 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-13 03:34:43,654 INFO L182 omatonBuilderFactory]: Interpolants [147970#(<= main_~i~0 95), 147971#(<= main_~i~0 96), 147968#(<= main_~i~0 93), 147969#(<= main_~i~0 94), 147974#(<= main_~i~0 99), 147975#(<= main_~i~0 100), 147972#(<= main_~i~0 97), 147973#(<= main_~i~0 98), 147978#(<= main_~i~0 103), 147979#(<= main_~i~0 104), 147976#(<= main_~i~0 101), 147977#(<= main_~i~0 102), 147982#(<= main_~i~0 107), 147983#(<= main_~i~0 108), 147980#(<= main_~i~0 105), 147981#(<= main_~i~0 106), 147986#(<= main_~i~0 111), 147987#(<= main_~i~0 112), 147984#(<= main_~i~0 109), 147985#(<= main_~i~0 110), 147990#(<= main_~i~0 115), 147991#(<= main_~i~0 116), 147988#(<= main_~i~0 113), 147989#(<= main_~i~0 114), 147994#(<= main_~i~0 119), 147995#(<= main_~i~0 120), 147992#(<= main_~i~0 117), 147993#(<= main_~i~0 118), 147998#(<= main_~i~0 123), 147999#(<= main_~i~0 124), 147996#(<= main_~i~0 121), 147997#(<= main_~i~0 122), 148002#(<= main_~i~0 127), 148003#(<= main_~i~0 128), 148000#(<= main_~i~0 125), 148001#(<= main_~i~0 126), 148006#(<= main_~i~0 131), 148007#(<= main_~i~0 132), 148004#(<= main_~i~0 129), 148005#(<= main_~i~0 130), 148010#(<= main_~i~0 135), 148011#(<= main_~i~0 136), 148008#(<= main_~i~0 133), 148009#(<= main_~i~0 134), 148014#(<= main_~i~0 139), 148015#(<= main_~i~0 140), 148012#(<= main_~i~0 137), 148013#(<= main_~i~0 138), 148016#(<= main_~i~0 141), 148017#(<= main_~i~0 142), 147874#false, 147875#(<= main_~i~0 0), 147873#true, 147878#(<= main_~i~0 3), 147879#(<= main_~i~0 4), 147876#(<= main_~i~0 1), 147877#(<= main_~i~0 2), 147882#(<= main_~i~0 7), 147883#(<= main_~i~0 8), 147880#(<= main_~i~0 5), 147881#(<= main_~i~0 6), 147886#(<= main_~i~0 11), 147887#(<= main_~i~0 12), 147884#(<= main_~i~0 9), 147885#(<= main_~i~0 10), 147890#(<= main_~i~0 15), 147891#(<= main_~i~0 16), 147888#(<= main_~i~0 13), 147889#(<= main_~i~0 14), 147894#(<= main_~i~0 19), 147895#(<= main_~i~0 20), 147892#(<= main_~i~0 17), 147893#(<= main_~i~0 18), 147898#(<= main_~i~0 23), 147899#(<= main_~i~0 24), 147896#(<= main_~i~0 21), 147897#(<= main_~i~0 22), 147902#(<= main_~i~0 27), 147903#(<= main_~i~0 28), 147900#(<= main_~i~0 25), 147901#(<= main_~i~0 26), 147906#(<= main_~i~0 31), 147907#(<= main_~i~0 32), 147904#(<= main_~i~0 29), 147905#(<= main_~i~0 30), 147910#(<= main_~i~0 35), 147911#(<= main_~i~0 36), 147908#(<= main_~i~0 33), 147909#(<= main_~i~0 34), 147914#(<= main_~i~0 39), 147915#(<= main_~i~0 40), 147912#(<= main_~i~0 37), 147913#(<= main_~i~0 38), 147918#(<= main_~i~0 43), 147919#(<= main_~i~0 44), 147916#(<= main_~i~0 41), 147917#(<= main_~i~0 42), 147922#(<= main_~i~0 47), 147923#(<= main_~i~0 48), 147920#(<= main_~i~0 45), 147921#(<= main_~i~0 46), 147926#(<= main_~i~0 51), 147927#(<= main_~i~0 52), 147924#(<= main_~i~0 49), 147925#(<= main_~i~0 50), 147930#(<= main_~i~0 55), 147931#(<= main_~i~0 56), 147928#(<= main_~i~0 53), 147929#(<= main_~i~0 54), 147934#(<= main_~i~0 59), 147935#(<= main_~i~0 60), 147932#(<= main_~i~0 57), 147933#(<= main_~i~0 58), 147938#(<= main_~i~0 63), 147939#(<= main_~i~0 64), 147936#(<= main_~i~0 61), 147937#(<= main_~i~0 62), 147942#(<= main_~i~0 67), 147943#(<= main_~i~0 68), 147940#(<= main_~i~0 65), 147941#(<= main_~i~0 66), 147946#(<= main_~i~0 71), 147947#(<= main_~i~0 72), 147944#(<= main_~i~0 69), 147945#(<= main_~i~0 70), 147950#(<= main_~i~0 75), 147951#(<= main_~i~0 76), 147948#(<= main_~i~0 73), 147949#(<= main_~i~0 74), 147954#(<= main_~i~0 79), 147955#(<= main_~i~0 80), 147952#(<= main_~i~0 77), 147953#(<= main_~i~0 78), 147958#(<= main_~i~0 83), 147959#(<= main_~i~0 84), 147956#(<= main_~i~0 81), 147957#(<= main_~i~0 82), 147962#(<= main_~i~0 87), 147963#(<= main_~i~0 88), 147960#(<= main_~i~0 85), 147961#(<= main_~i~0 86), 147966#(<= main_~i~0 91), 147967#(<= main_~i~0 92), 147964#(<= main_~i~0 89), 147965#(<= main_~i~0 90)] [2018-04-13 03:34:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40337 backedges. 0 proven. 40328 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:43,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-04-13 03:34:43,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-04-13 03:34:43,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 03:34:43,656 INFO L87 Difference]: Start difference. First operand 589 states and 590 transitions. Second operand 145 states. [2018-04-13 03:34:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:34:50,431 INFO L93 Difference]: Finished difference Result 1304 states and 1445 transitions. [2018-04-13 03:34:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-04-13 03:34:50,431 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 588 [2018-04-13 03:34:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:34:50,432 INFO L225 Difference]: With dead ends: 1304 [2018-04-13 03:34:50,432 INFO L226 Difference]: Without dead ends: 1304 [2018-04-13 03:34:50,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 03:34:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2018-04-13 03:34:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 593. [2018-04-13 03:34:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-04-13 03:34:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-04-13 03:34:50,435 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 588 [2018-04-13 03:34:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:34:50,435 INFO L459 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-04-13 03:34:50,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-04-13 03:34:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-04-13 03:34:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-13 03:34:50,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:34:50,437 INFO L355 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:34:50,437 INFO L408 AbstractCegarLoop]: === Iteration 144 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:34:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash -717862127, now seen corresponding path program 142 times [2018-04-13 03:34:50,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:34:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:34:50,452 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:34:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 40907 backedges. 0 proven. 40898 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:54,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:34:54,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-04-13 03:34:54,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:34:54,332 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-13 03:34:54,332 INFO L182 omatonBuilderFactory]: Interpolants [150018#(<= main_~i~0 101), 150019#(<= main_~i~0 102), 150016#(<= main_~i~0 99), 150017#(<= main_~i~0 100), 150022#(<= main_~i~0 105), 150023#(<= main_~i~0 106), 150020#(<= main_~i~0 103), 150021#(<= main_~i~0 104), 150026#(<= main_~i~0 109), 150027#(<= main_~i~0 110), 150024#(<= main_~i~0 107), 150025#(<= main_~i~0 108), 150030#(<= main_~i~0 113), 150031#(<= main_~i~0 114), 150028#(<= main_~i~0 111), 150029#(<= main_~i~0 112), 150034#(<= main_~i~0 117), 150035#(<= main_~i~0 118), 150032#(<= main_~i~0 115), 150033#(<= main_~i~0 116), 150038#(<= main_~i~0 121), 150039#(<= main_~i~0 122), 150036#(<= main_~i~0 119), 150037#(<= main_~i~0 120), 150042#(<= main_~i~0 125), 150043#(<= main_~i~0 126), 150040#(<= main_~i~0 123), 150041#(<= main_~i~0 124), 150046#(<= main_~i~0 129), 150047#(<= main_~i~0 130), 150044#(<= main_~i~0 127), 150045#(<= main_~i~0 128), 150050#(<= main_~i~0 133), 150051#(<= main_~i~0 134), 150048#(<= main_~i~0 131), 150049#(<= main_~i~0 132), 150054#(<= main_~i~0 137), 150055#(<= main_~i~0 138), 150052#(<= main_~i~0 135), 150053#(<= main_~i~0 136), 150058#(<= main_~i~0 141), 150059#(<= main_~i~0 142), 150056#(<= main_~i~0 139), 150057#(<= main_~i~0 140), 150060#(<= main_~i~0 143), 149915#true, 149918#(<= main_~i~0 1), 149919#(<= main_~i~0 2), 149916#false, 149917#(<= main_~i~0 0), 149922#(<= main_~i~0 5), 149923#(<= main_~i~0 6), 149920#(<= main_~i~0 3), 149921#(<= main_~i~0 4), 149926#(<= main_~i~0 9), 149927#(<= main_~i~0 10), 149924#(<= main_~i~0 7), 149925#(<= main_~i~0 8), 149930#(<= main_~i~0 13), 149931#(<= main_~i~0 14), 149928#(<= main_~i~0 11), 149929#(<= main_~i~0 12), 149934#(<= main_~i~0 17), 149935#(<= main_~i~0 18), 149932#(<= main_~i~0 15), 149933#(<= main_~i~0 16), 149938#(<= main_~i~0 21), 149939#(<= main_~i~0 22), 149936#(<= main_~i~0 19), 149937#(<= main_~i~0 20), 149942#(<= main_~i~0 25), 149943#(<= main_~i~0 26), 149940#(<= main_~i~0 23), 149941#(<= main_~i~0 24), 149946#(<= main_~i~0 29), 149947#(<= main_~i~0 30), 149944#(<= main_~i~0 27), 149945#(<= main_~i~0 28), 149950#(<= main_~i~0 33), 149951#(<= main_~i~0 34), 149948#(<= main_~i~0 31), 149949#(<= main_~i~0 32), 149954#(<= main_~i~0 37), 149955#(<= main_~i~0 38), 149952#(<= main_~i~0 35), 149953#(<= main_~i~0 36), 149958#(<= main_~i~0 41), 149959#(<= main_~i~0 42), 149956#(<= main_~i~0 39), 149957#(<= main_~i~0 40), 149962#(<= main_~i~0 45), 149963#(<= main_~i~0 46), 149960#(<= main_~i~0 43), 149961#(<= main_~i~0 44), 149966#(<= main_~i~0 49), 149967#(<= main_~i~0 50), 149964#(<= main_~i~0 47), 149965#(<= main_~i~0 48), 149970#(<= main_~i~0 53), 149971#(<= main_~i~0 54), 149968#(<= main_~i~0 51), 149969#(<= main_~i~0 52), 149974#(<= main_~i~0 57), 149975#(<= main_~i~0 58), 149972#(<= main_~i~0 55), 149973#(<= main_~i~0 56), 149978#(<= main_~i~0 61), 149979#(<= main_~i~0 62), 149976#(<= main_~i~0 59), 149977#(<= main_~i~0 60), 149982#(<= main_~i~0 65), 149983#(<= main_~i~0 66), 149980#(<= main_~i~0 63), 149981#(<= main_~i~0 64), 149986#(<= main_~i~0 69), 149987#(<= main_~i~0 70), 149984#(<= main_~i~0 67), 149985#(<= main_~i~0 68), 149990#(<= main_~i~0 73), 149991#(<= main_~i~0 74), 149988#(<= main_~i~0 71), 149989#(<= main_~i~0 72), 149994#(<= main_~i~0 77), 149995#(<= main_~i~0 78), 149992#(<= main_~i~0 75), 149993#(<= main_~i~0 76), 149998#(<= main_~i~0 81), 149999#(<= main_~i~0 82), 149996#(<= main_~i~0 79), 149997#(<= main_~i~0 80), 150002#(<= main_~i~0 85), 150003#(<= main_~i~0 86), 150000#(<= main_~i~0 83), 150001#(<= main_~i~0 84), 150006#(<= main_~i~0 89), 150007#(<= main_~i~0 90), 150004#(<= main_~i~0 87), 150005#(<= main_~i~0 88), 150010#(<= main_~i~0 93), 150011#(<= main_~i~0 94), 150008#(<= main_~i~0 91), 150009#(<= main_~i~0 92), 150014#(<= main_~i~0 97), 150015#(<= main_~i~0 98), 150012#(<= main_~i~0 95), 150013#(<= main_~i~0 96)] [2018-04-13 03:34:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 40907 backedges. 0 proven. 40898 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:34:54,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-04-13 03:34:54,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-04-13 03:34:54,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 03:34:54,334 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 146 states. [2018-04-13 03:35:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:35:01,390 INFO L93 Difference]: Finished difference Result 1313 states and 1455 transitions. [2018-04-13 03:35:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-13 03:35:01,390 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 592 [2018-04-13 03:35:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:35:01,392 INFO L225 Difference]: With dead ends: 1313 [2018-04-13 03:35:01,392 INFO L226 Difference]: Without dead ends: 1313 [2018-04-13 03:35:01,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 03:35:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2018-04-13 03:35:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 597. [2018-04-13 03:35:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-04-13 03:35:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 598 transitions. [2018-04-13 03:35:01,396 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 598 transitions. Word has length 592 [2018-04-13 03:35:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:35:01,396 INFO L459 AbstractCegarLoop]: Abstraction has 597 states and 598 transitions. [2018-04-13 03:35:01,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-04-13 03:35:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 598 transitions. [2018-04-13 03:35:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-04-13 03:35:01,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:35:01,398 INFO L355 BasicCegarLoop]: trace histogram [145, 144, 144, 144, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:35:01,398 INFO L408 AbstractCegarLoop]: === Iteration 145 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:35:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1104041482, now seen corresponding path program 143 times [2018-04-13 03:35:01,398 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:35:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:35:01,417 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:35:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 41481 backedges. 0 proven. 41472 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:05,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:35:05,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-04-13 03:35:05,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:35:05,431 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-13 03:35:05,431 INFO L182 omatonBuilderFactory]: Interpolants [152066#(<= main_~i~0 93), 152067#(<= main_~i~0 94), 152064#(<= main_~i~0 91), 152065#(<= main_~i~0 92), 152070#(<= main_~i~0 97), 152071#(<= main_~i~0 98), 152068#(<= main_~i~0 95), 152069#(<= main_~i~0 96), 152074#(<= main_~i~0 101), 152075#(<= main_~i~0 102), 152072#(<= main_~i~0 99), 152073#(<= main_~i~0 100), 152078#(<= main_~i~0 105), 152079#(<= main_~i~0 106), 152076#(<= main_~i~0 103), 152077#(<= main_~i~0 104), 152082#(<= main_~i~0 109), 152083#(<= main_~i~0 110), 152080#(<= main_~i~0 107), 152081#(<= main_~i~0 108), 152086#(<= main_~i~0 113), 152087#(<= main_~i~0 114), 152084#(<= main_~i~0 111), 152085#(<= main_~i~0 112), 152090#(<= main_~i~0 117), 152091#(<= main_~i~0 118), 152088#(<= main_~i~0 115), 152089#(<= main_~i~0 116), 152094#(<= main_~i~0 121), 152095#(<= main_~i~0 122), 152092#(<= main_~i~0 119), 152093#(<= main_~i~0 120), 152098#(<= main_~i~0 125), 152099#(<= main_~i~0 126), 152096#(<= main_~i~0 123), 152097#(<= main_~i~0 124), 152102#(<= main_~i~0 129), 152103#(<= main_~i~0 130), 152100#(<= main_~i~0 127), 152101#(<= main_~i~0 128), 152106#(<= main_~i~0 133), 152107#(<= main_~i~0 134), 152104#(<= main_~i~0 131), 152105#(<= main_~i~0 132), 152110#(<= main_~i~0 137), 152111#(<= main_~i~0 138), 152108#(<= main_~i~0 135), 152109#(<= main_~i~0 136), 152114#(<= main_~i~0 141), 152115#(<= main_~i~0 142), 152112#(<= main_~i~0 139), 152113#(<= main_~i~0 140), 152116#(<= main_~i~0 143), 152117#(<= main_~i~0 144), 151971#true, 151974#(<= main_~i~0 1), 151975#(<= main_~i~0 2), 151972#false, 151973#(<= main_~i~0 0), 151978#(<= main_~i~0 5), 151979#(<= main_~i~0 6), 151976#(<= main_~i~0 3), 151977#(<= main_~i~0 4), 151982#(<= main_~i~0 9), 151983#(<= main_~i~0 10), 151980#(<= main_~i~0 7), 151981#(<= main_~i~0 8), 151986#(<= main_~i~0 13), 151987#(<= main_~i~0 14), 151984#(<= main_~i~0 11), 151985#(<= main_~i~0 12), 151990#(<= main_~i~0 17), 151991#(<= main_~i~0 18), 151988#(<= main_~i~0 15), 151989#(<= main_~i~0 16), 151994#(<= main_~i~0 21), 151995#(<= main_~i~0 22), 151992#(<= main_~i~0 19), 151993#(<= main_~i~0 20), 151998#(<= main_~i~0 25), 151999#(<= main_~i~0 26), 151996#(<= main_~i~0 23), 151997#(<= main_~i~0 24), 152002#(<= main_~i~0 29), 152003#(<= main_~i~0 30), 152000#(<= main_~i~0 27), 152001#(<= main_~i~0 28), 152006#(<= main_~i~0 33), 152007#(<= main_~i~0 34), 152004#(<= main_~i~0 31), 152005#(<= main_~i~0 32), 152010#(<= main_~i~0 37), 152011#(<= main_~i~0 38), 152008#(<= main_~i~0 35), 152009#(<= main_~i~0 36), 152014#(<= main_~i~0 41), 152015#(<= main_~i~0 42), 152012#(<= main_~i~0 39), 152013#(<= main_~i~0 40), 152018#(<= main_~i~0 45), 152019#(<= main_~i~0 46), 152016#(<= main_~i~0 43), 152017#(<= main_~i~0 44), 152022#(<= main_~i~0 49), 152023#(<= main_~i~0 50), 152020#(<= main_~i~0 47), 152021#(<= main_~i~0 48), 152026#(<= main_~i~0 53), 152027#(<= main_~i~0 54), 152024#(<= main_~i~0 51), 152025#(<= main_~i~0 52), 152030#(<= main_~i~0 57), 152031#(<= main_~i~0 58), 152028#(<= main_~i~0 55), 152029#(<= main_~i~0 56), 152034#(<= main_~i~0 61), 152035#(<= main_~i~0 62), 152032#(<= main_~i~0 59), 152033#(<= main_~i~0 60), 152038#(<= main_~i~0 65), 152039#(<= main_~i~0 66), 152036#(<= main_~i~0 63), 152037#(<= main_~i~0 64), 152042#(<= main_~i~0 69), 152043#(<= main_~i~0 70), 152040#(<= main_~i~0 67), 152041#(<= main_~i~0 68), 152046#(<= main_~i~0 73), 152047#(<= main_~i~0 74), 152044#(<= main_~i~0 71), 152045#(<= main_~i~0 72), 152050#(<= main_~i~0 77), 152051#(<= main_~i~0 78), 152048#(<= main_~i~0 75), 152049#(<= main_~i~0 76), 152054#(<= main_~i~0 81), 152055#(<= main_~i~0 82), 152052#(<= main_~i~0 79), 152053#(<= main_~i~0 80), 152058#(<= main_~i~0 85), 152059#(<= main_~i~0 86), 152056#(<= main_~i~0 83), 152057#(<= main_~i~0 84), 152062#(<= main_~i~0 89), 152063#(<= main_~i~0 90), 152060#(<= main_~i~0 87), 152061#(<= main_~i~0 88)] [2018-04-13 03:35:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41481 backedges. 0 proven. 41472 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:05,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-13 03:35:05,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-13 03:35:05,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 03:35:05,434 INFO L87 Difference]: Start difference. First operand 597 states and 598 transitions. Second operand 147 states. [2018-04-13 03:35:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:35:12,416 INFO L93 Difference]: Finished difference Result 1322 states and 1465 transitions. [2018-04-13 03:35:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-04-13 03:35:12,416 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 596 [2018-04-13 03:35:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:35:12,417 INFO L225 Difference]: With dead ends: 1322 [2018-04-13 03:35:12,417 INFO L226 Difference]: Without dead ends: 1322 [2018-04-13 03:35:12,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 03:35:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-04-13 03:35:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 601. [2018-04-13 03:35:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-04-13 03:35:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-04-13 03:35:12,420 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 596 [2018-04-13 03:35:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:35:12,420 INFO L459 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-04-13 03:35:12,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-13 03:35:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-04-13 03:35:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-04-13 03:35:12,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:35:12,422 INFO L355 BasicCegarLoop]: trace histogram [146, 145, 145, 145, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:35:12,422 INFO L408 AbstractCegarLoop]: === Iteration 146 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:35:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1023818883, now seen corresponding path program 144 times [2018-04-13 03:35:12,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:35:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:35:12,437 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:35:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 42059 backedges. 0 proven. 42050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:16,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:35:16,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-04-13 03:35:16,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:35:16,359 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-13 03:35:16,359 INFO L182 omatonBuilderFactory]: Interpolants [154114#(<= main_~i~0 71), 154115#(<= main_~i~0 72), 154112#(<= main_~i~0 69), 154113#(<= main_~i~0 70), 154118#(<= main_~i~0 75), 154119#(<= main_~i~0 76), 154116#(<= main_~i~0 73), 154117#(<= main_~i~0 74), 154122#(<= main_~i~0 79), 154123#(<= main_~i~0 80), 154120#(<= main_~i~0 77), 154121#(<= main_~i~0 78), 154126#(<= main_~i~0 83), 154127#(<= main_~i~0 84), 154124#(<= main_~i~0 81), 154125#(<= main_~i~0 82), 154130#(<= main_~i~0 87), 154131#(<= main_~i~0 88), 154128#(<= main_~i~0 85), 154129#(<= main_~i~0 86), 154134#(<= main_~i~0 91), 154135#(<= main_~i~0 92), 154132#(<= main_~i~0 89), 154133#(<= main_~i~0 90), 154138#(<= main_~i~0 95), 154139#(<= main_~i~0 96), 154136#(<= main_~i~0 93), 154137#(<= main_~i~0 94), 154142#(<= main_~i~0 99), 154143#(<= main_~i~0 100), 154140#(<= main_~i~0 97), 154141#(<= main_~i~0 98), 154146#(<= main_~i~0 103), 154147#(<= main_~i~0 104), 154144#(<= main_~i~0 101), 154145#(<= main_~i~0 102), 154150#(<= main_~i~0 107), 154151#(<= main_~i~0 108), 154148#(<= main_~i~0 105), 154149#(<= main_~i~0 106), 154154#(<= main_~i~0 111), 154155#(<= main_~i~0 112), 154152#(<= main_~i~0 109), 154153#(<= main_~i~0 110), 154158#(<= main_~i~0 115), 154159#(<= main_~i~0 116), 154156#(<= main_~i~0 113), 154157#(<= main_~i~0 114), 154162#(<= main_~i~0 119), 154163#(<= main_~i~0 120), 154160#(<= main_~i~0 117), 154161#(<= main_~i~0 118), 154166#(<= main_~i~0 123), 154167#(<= main_~i~0 124), 154164#(<= main_~i~0 121), 154165#(<= main_~i~0 122), 154170#(<= main_~i~0 127), 154171#(<= main_~i~0 128), 154168#(<= main_~i~0 125), 154169#(<= main_~i~0 126), 154174#(<= main_~i~0 131), 154175#(<= main_~i~0 132), 154172#(<= main_~i~0 129), 154173#(<= main_~i~0 130), 154178#(<= main_~i~0 135), 154179#(<= main_~i~0 136), 154176#(<= main_~i~0 133), 154177#(<= main_~i~0 134), 154182#(<= main_~i~0 139), 154183#(<= main_~i~0 140), 154180#(<= main_~i~0 137), 154181#(<= main_~i~0 138), 154186#(<= main_~i~0 143), 154187#(<= main_~i~0 144), 154184#(<= main_~i~0 141), 154185#(<= main_~i~0 142), 154188#(<= main_~i~0 145), 154042#false, 154043#(<= main_~i~0 0), 154041#true, 154046#(<= main_~i~0 3), 154047#(<= main_~i~0 4), 154044#(<= main_~i~0 1), 154045#(<= main_~i~0 2), 154050#(<= main_~i~0 7), 154051#(<= main_~i~0 8), 154048#(<= main_~i~0 5), 154049#(<= main_~i~0 6), 154054#(<= main_~i~0 11), 154055#(<= main_~i~0 12), 154052#(<= main_~i~0 9), 154053#(<= main_~i~0 10), 154058#(<= main_~i~0 15), 154059#(<= main_~i~0 16), 154056#(<= main_~i~0 13), 154057#(<= main_~i~0 14), 154062#(<= main_~i~0 19), 154063#(<= main_~i~0 20), 154060#(<= main_~i~0 17), 154061#(<= main_~i~0 18), 154066#(<= main_~i~0 23), 154067#(<= main_~i~0 24), 154064#(<= main_~i~0 21), 154065#(<= main_~i~0 22), 154070#(<= main_~i~0 27), 154071#(<= main_~i~0 28), 154068#(<= main_~i~0 25), 154069#(<= main_~i~0 26), 154074#(<= main_~i~0 31), 154075#(<= main_~i~0 32), 154072#(<= main_~i~0 29), 154073#(<= main_~i~0 30), 154078#(<= main_~i~0 35), 154079#(<= main_~i~0 36), 154076#(<= main_~i~0 33), 154077#(<= main_~i~0 34), 154082#(<= main_~i~0 39), 154083#(<= main_~i~0 40), 154080#(<= main_~i~0 37), 154081#(<= main_~i~0 38), 154086#(<= main_~i~0 43), 154087#(<= main_~i~0 44), 154084#(<= main_~i~0 41), 154085#(<= main_~i~0 42), 154090#(<= main_~i~0 47), 154091#(<= main_~i~0 48), 154088#(<= main_~i~0 45), 154089#(<= main_~i~0 46), 154094#(<= main_~i~0 51), 154095#(<= main_~i~0 52), 154092#(<= main_~i~0 49), 154093#(<= main_~i~0 50), 154098#(<= main_~i~0 55), 154099#(<= main_~i~0 56), 154096#(<= main_~i~0 53), 154097#(<= main_~i~0 54), 154102#(<= main_~i~0 59), 154103#(<= main_~i~0 60), 154100#(<= main_~i~0 57), 154101#(<= main_~i~0 58), 154106#(<= main_~i~0 63), 154107#(<= main_~i~0 64), 154104#(<= main_~i~0 61), 154105#(<= main_~i~0 62), 154110#(<= main_~i~0 67), 154111#(<= main_~i~0 68), 154108#(<= main_~i~0 65), 154109#(<= main_~i~0 66)] [2018-04-13 03:35:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42059 backedges. 0 proven. 42050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:16,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-04-13 03:35:16,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-04-13 03:35:16,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-04-13 03:35:16,361 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 148 states. [2018-04-13 03:35:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:35:23,062 INFO L93 Difference]: Finished difference Result 1331 states and 1475 transitions. [2018-04-13 03:35:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-04-13 03:35:23,062 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 600 [2018-04-13 03:35:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:35:23,063 INFO L225 Difference]: With dead ends: 1331 [2018-04-13 03:35:23,063 INFO L226 Difference]: Without dead ends: 1331 [2018-04-13 03:35:23,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-04-13 03:35:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2018-04-13 03:35:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 605. [2018-04-13 03:35:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-13 03:35:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 606 transitions. [2018-04-13 03:35:23,066 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 606 transitions. Word has length 600 [2018-04-13 03:35:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:35:23,067 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 606 transitions. [2018-04-13 03:35:23,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-04-13 03:35:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 606 transitions. [2018-04-13 03:35:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-04-13 03:35:23,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:35:23,068 INFO L355 BasicCegarLoop]: trace histogram [147, 146, 146, 146, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:35:23,068 INFO L408 AbstractCegarLoop]: === Iteration 147 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:35:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1954823804, now seen corresponding path program 145 times [2018-04-13 03:35:23,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:35:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:35:23,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:35:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 42641 backedges. 0 proven. 42632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:27,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:35:27,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-04-13 03:35:27,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:35:27,165 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-13 03:35:27,165 INFO L182 omatonBuilderFactory]: Interpolants [156162#(<= main_~i~0 35), 156163#(<= main_~i~0 36), 156160#(<= main_~i~0 33), 156161#(<= main_~i~0 34), 156166#(<= main_~i~0 39), 156167#(<= main_~i~0 40), 156164#(<= main_~i~0 37), 156165#(<= main_~i~0 38), 156170#(<= main_~i~0 43), 156171#(<= main_~i~0 44), 156168#(<= main_~i~0 41), 156169#(<= main_~i~0 42), 156174#(<= main_~i~0 47), 156175#(<= main_~i~0 48), 156172#(<= main_~i~0 45), 156173#(<= main_~i~0 46), 156178#(<= main_~i~0 51), 156179#(<= main_~i~0 52), 156176#(<= main_~i~0 49), 156177#(<= main_~i~0 50), 156182#(<= main_~i~0 55), 156183#(<= main_~i~0 56), 156180#(<= main_~i~0 53), 156181#(<= main_~i~0 54), 156186#(<= main_~i~0 59), 156187#(<= main_~i~0 60), 156184#(<= main_~i~0 57), 156185#(<= main_~i~0 58), 156190#(<= main_~i~0 63), 156191#(<= main_~i~0 64), 156188#(<= main_~i~0 61), 156189#(<= main_~i~0 62), 156194#(<= main_~i~0 67), 156195#(<= main_~i~0 68), 156192#(<= main_~i~0 65), 156193#(<= main_~i~0 66), 156198#(<= main_~i~0 71), 156199#(<= main_~i~0 72), 156196#(<= main_~i~0 69), 156197#(<= main_~i~0 70), 156202#(<= main_~i~0 75), 156203#(<= main_~i~0 76), 156200#(<= main_~i~0 73), 156201#(<= main_~i~0 74), 156206#(<= main_~i~0 79), 156207#(<= main_~i~0 80), 156204#(<= main_~i~0 77), 156205#(<= main_~i~0 78), 156210#(<= main_~i~0 83), 156211#(<= main_~i~0 84), 156208#(<= main_~i~0 81), 156209#(<= main_~i~0 82), 156214#(<= main_~i~0 87), 156215#(<= main_~i~0 88), 156212#(<= main_~i~0 85), 156213#(<= main_~i~0 86), 156218#(<= main_~i~0 91), 156219#(<= main_~i~0 92), 156216#(<= main_~i~0 89), 156217#(<= main_~i~0 90), 156222#(<= main_~i~0 95), 156223#(<= main_~i~0 96), 156220#(<= main_~i~0 93), 156221#(<= main_~i~0 94), 156226#(<= main_~i~0 99), 156227#(<= main_~i~0 100), 156224#(<= main_~i~0 97), 156225#(<= main_~i~0 98), 156230#(<= main_~i~0 103), 156231#(<= main_~i~0 104), 156228#(<= main_~i~0 101), 156229#(<= main_~i~0 102), 156234#(<= main_~i~0 107), 156235#(<= main_~i~0 108), 156232#(<= main_~i~0 105), 156233#(<= main_~i~0 106), 156238#(<= main_~i~0 111), 156239#(<= main_~i~0 112), 156236#(<= main_~i~0 109), 156237#(<= main_~i~0 110), 156242#(<= main_~i~0 115), 156243#(<= main_~i~0 116), 156240#(<= main_~i~0 113), 156241#(<= main_~i~0 114), 156246#(<= main_~i~0 119), 156247#(<= main_~i~0 120), 156244#(<= main_~i~0 117), 156245#(<= main_~i~0 118), 156250#(<= main_~i~0 123), 156251#(<= main_~i~0 124), 156248#(<= main_~i~0 121), 156249#(<= main_~i~0 122), 156254#(<= main_~i~0 127), 156255#(<= main_~i~0 128), 156252#(<= main_~i~0 125), 156253#(<= main_~i~0 126), 156258#(<= main_~i~0 131), 156259#(<= main_~i~0 132), 156256#(<= main_~i~0 129), 156257#(<= main_~i~0 130), 156262#(<= main_~i~0 135), 156263#(<= main_~i~0 136), 156260#(<= main_~i~0 133), 156261#(<= main_~i~0 134), 156266#(<= main_~i~0 139), 156267#(<= main_~i~0 140), 156264#(<= main_~i~0 137), 156265#(<= main_~i~0 138), 156270#(<= main_~i~0 143), 156271#(<= main_~i~0 144), 156268#(<= main_~i~0 141), 156269#(<= main_~i~0 142), 156272#(<= main_~i~0 145), 156273#(<= main_~i~0 146), 156126#false, 156127#(<= main_~i~0 0), 156125#true, 156130#(<= main_~i~0 3), 156131#(<= main_~i~0 4), 156128#(<= main_~i~0 1), 156129#(<= main_~i~0 2), 156134#(<= main_~i~0 7), 156135#(<= main_~i~0 8), 156132#(<= main_~i~0 5), 156133#(<= main_~i~0 6), 156138#(<= main_~i~0 11), 156139#(<= main_~i~0 12), 156136#(<= main_~i~0 9), 156137#(<= main_~i~0 10), 156142#(<= main_~i~0 15), 156143#(<= main_~i~0 16), 156140#(<= main_~i~0 13), 156141#(<= main_~i~0 14), 156146#(<= main_~i~0 19), 156147#(<= main_~i~0 20), 156144#(<= main_~i~0 17), 156145#(<= main_~i~0 18), 156150#(<= main_~i~0 23), 156151#(<= main_~i~0 24), 156148#(<= main_~i~0 21), 156149#(<= main_~i~0 22), 156154#(<= main_~i~0 27), 156155#(<= main_~i~0 28), 156152#(<= main_~i~0 25), 156153#(<= main_~i~0 26), 156158#(<= main_~i~0 31), 156159#(<= main_~i~0 32), 156156#(<= main_~i~0 29), 156157#(<= main_~i~0 30)] [2018-04-13 03:35:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42641 backedges. 0 proven. 42632 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:27,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-04-13 03:35:27,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-04-13 03:35:27,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 03:35:27,167 INFO L87 Difference]: Start difference. First operand 605 states and 606 transitions. Second operand 149 states. [2018-04-13 03:35:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:35:35,236 INFO L93 Difference]: Finished difference Result 1340 states and 1485 transitions. [2018-04-13 03:35:35,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-04-13 03:35:35,237 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 604 [2018-04-13 03:35:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:35:35,238 INFO L225 Difference]: With dead ends: 1340 [2018-04-13 03:35:35,238 INFO L226 Difference]: Without dead ends: 1340 [2018-04-13 03:35:35,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 03:35:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2018-04-13 03:35:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 609. [2018-04-13 03:35:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-13 03:35:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 610 transitions. [2018-04-13 03:35:35,241 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 610 transitions. Word has length 604 [2018-04-13 03:35:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:35:35,241 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 610 transitions. [2018-04-13 03:35:35,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-04-13 03:35:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 610 transitions. [2018-04-13 03:35:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2018-04-13 03:35:35,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:35:35,243 INFO L355 BasicCegarLoop]: trace histogram [148, 147, 147, 147, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:35:35,243 INFO L408 AbstractCegarLoop]: === Iteration 148 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:35:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash -657548299, now seen corresponding path program 146 times [2018-04-13 03:35:35,243 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:35:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:35:35,258 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:35:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 43227 backedges. 0 proven. 43218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:39,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:35:39,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-04-13 03:35:39,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:35:39,321 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-13 03:35:39,322 INFO L182 omatonBuilderFactory]: Interpolants [158223#true, 158226#(<= main_~i~0 1), 158227#(<= main_~i~0 2), 158224#false, 158225#(<= main_~i~0 0), 158230#(<= main_~i~0 5), 158231#(<= main_~i~0 6), 158228#(<= main_~i~0 3), 158229#(<= main_~i~0 4), 158234#(<= main_~i~0 9), 158235#(<= main_~i~0 10), 158232#(<= main_~i~0 7), 158233#(<= main_~i~0 8), 158238#(<= main_~i~0 13), 158239#(<= main_~i~0 14), 158236#(<= main_~i~0 11), 158237#(<= main_~i~0 12), 158242#(<= main_~i~0 17), 158243#(<= main_~i~0 18), 158240#(<= main_~i~0 15), 158241#(<= main_~i~0 16), 158246#(<= main_~i~0 21), 158247#(<= main_~i~0 22), 158244#(<= main_~i~0 19), 158245#(<= main_~i~0 20), 158250#(<= main_~i~0 25), 158251#(<= main_~i~0 26), 158248#(<= main_~i~0 23), 158249#(<= main_~i~0 24), 158254#(<= main_~i~0 29), 158255#(<= main_~i~0 30), 158252#(<= main_~i~0 27), 158253#(<= main_~i~0 28), 158258#(<= main_~i~0 33), 158259#(<= main_~i~0 34), 158256#(<= main_~i~0 31), 158257#(<= main_~i~0 32), 158262#(<= main_~i~0 37), 158263#(<= main_~i~0 38), 158260#(<= main_~i~0 35), 158261#(<= main_~i~0 36), 158266#(<= main_~i~0 41), 158267#(<= main_~i~0 42), 158264#(<= main_~i~0 39), 158265#(<= main_~i~0 40), 158270#(<= main_~i~0 45), 158271#(<= main_~i~0 46), 158268#(<= main_~i~0 43), 158269#(<= main_~i~0 44), 158274#(<= main_~i~0 49), 158275#(<= main_~i~0 50), 158272#(<= main_~i~0 47), 158273#(<= main_~i~0 48), 158278#(<= main_~i~0 53), 158279#(<= main_~i~0 54), 158276#(<= main_~i~0 51), 158277#(<= main_~i~0 52), 158282#(<= main_~i~0 57), 158283#(<= main_~i~0 58), 158280#(<= main_~i~0 55), 158281#(<= main_~i~0 56), 158286#(<= main_~i~0 61), 158287#(<= main_~i~0 62), 158284#(<= main_~i~0 59), 158285#(<= main_~i~0 60), 158290#(<= main_~i~0 65), 158291#(<= main_~i~0 66), 158288#(<= main_~i~0 63), 158289#(<= main_~i~0 64), 158294#(<= main_~i~0 69), 158295#(<= main_~i~0 70), 158292#(<= main_~i~0 67), 158293#(<= main_~i~0 68), 158298#(<= main_~i~0 73), 158299#(<= main_~i~0 74), 158296#(<= main_~i~0 71), 158297#(<= main_~i~0 72), 158302#(<= main_~i~0 77), 158303#(<= main_~i~0 78), 158300#(<= main_~i~0 75), 158301#(<= main_~i~0 76), 158306#(<= main_~i~0 81), 158307#(<= main_~i~0 82), 158304#(<= main_~i~0 79), 158305#(<= main_~i~0 80), 158310#(<= main_~i~0 85), 158311#(<= main_~i~0 86), 158308#(<= main_~i~0 83), 158309#(<= main_~i~0 84), 158314#(<= main_~i~0 89), 158315#(<= main_~i~0 90), 158312#(<= main_~i~0 87), 158313#(<= main_~i~0 88), 158318#(<= main_~i~0 93), 158319#(<= main_~i~0 94), 158316#(<= main_~i~0 91), 158317#(<= main_~i~0 92), 158322#(<= main_~i~0 97), 158323#(<= main_~i~0 98), 158320#(<= main_~i~0 95), 158321#(<= main_~i~0 96), 158326#(<= main_~i~0 101), 158327#(<= main_~i~0 102), 158324#(<= main_~i~0 99), 158325#(<= main_~i~0 100), 158330#(<= main_~i~0 105), 158331#(<= main_~i~0 106), 158328#(<= main_~i~0 103), 158329#(<= main_~i~0 104), 158334#(<= main_~i~0 109), 158335#(<= main_~i~0 110), 158332#(<= main_~i~0 107), 158333#(<= main_~i~0 108), 158338#(<= main_~i~0 113), 158339#(<= main_~i~0 114), 158336#(<= main_~i~0 111), 158337#(<= main_~i~0 112), 158342#(<= main_~i~0 117), 158343#(<= main_~i~0 118), 158340#(<= main_~i~0 115), 158341#(<= main_~i~0 116), 158346#(<= main_~i~0 121), 158347#(<= main_~i~0 122), 158344#(<= main_~i~0 119), 158345#(<= main_~i~0 120), 158350#(<= main_~i~0 125), 158351#(<= main_~i~0 126), 158348#(<= main_~i~0 123), 158349#(<= main_~i~0 124), 158354#(<= main_~i~0 129), 158355#(<= main_~i~0 130), 158352#(<= main_~i~0 127), 158353#(<= main_~i~0 128), 158358#(<= main_~i~0 133), 158359#(<= main_~i~0 134), 158356#(<= main_~i~0 131), 158357#(<= main_~i~0 132), 158362#(<= main_~i~0 137), 158363#(<= main_~i~0 138), 158360#(<= main_~i~0 135), 158361#(<= main_~i~0 136), 158366#(<= main_~i~0 141), 158367#(<= main_~i~0 142), 158364#(<= main_~i~0 139), 158365#(<= main_~i~0 140), 158370#(<= main_~i~0 145), 158371#(<= main_~i~0 146), 158368#(<= main_~i~0 143), 158369#(<= main_~i~0 144), 158372#(<= main_~i~0 147)] [2018-04-13 03:35:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 43227 backedges. 0 proven. 43218 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:39,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-13 03:35:39,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-13 03:35:39,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 03:35:39,324 INFO L87 Difference]: Start difference. First operand 609 states and 610 transitions. Second operand 150 states. [2018-04-13 03:35:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:35:49,640 INFO L93 Difference]: Finished difference Result 1349 states and 1495 transitions. [2018-04-13 03:35:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-04-13 03:35:49,640 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 608 [2018-04-13 03:35:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:35:49,641 INFO L225 Difference]: With dead ends: 1349 [2018-04-13 03:35:49,641 INFO L226 Difference]: Without dead ends: 1349 [2018-04-13 03:35:49,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 03:35:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-04-13 03:35:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 613. [2018-04-13 03:35:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-04-13 03:35:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 614 transitions. [2018-04-13 03:35:49,644 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 614 transitions. Word has length 608 [2018-04-13 03:35:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:35:49,644 INFO L459 AbstractCegarLoop]: Abstraction has 613 states and 614 transitions. [2018-04-13 03:35:49,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-13 03:35:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 614 transitions. [2018-04-13 03:35:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-04-13 03:35:49,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:35:49,645 INFO L355 BasicCegarLoop]: trace histogram [149, 148, 148, 148, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:35:49,645 INFO L408 AbstractCegarLoop]: === Iteration 149 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:35:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 759928046, now seen corresponding path program 147 times [2018-04-13 03:35:49,646 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:35:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:35:49,661 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:35:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 43817 backedges. 0 proven. 43808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:53,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:35:53,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-04-13 03:35:53,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:35:53,787 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-13 03:35:53,787 INFO L182 omatonBuilderFactory]: Interpolants [160335#true, 160338#(<= main_~i~0 1), 160339#(<= main_~i~0 2), 160336#false, 160337#(<= main_~i~0 0), 160342#(<= main_~i~0 5), 160343#(<= main_~i~0 6), 160340#(<= main_~i~0 3), 160341#(<= main_~i~0 4), 160346#(<= main_~i~0 9), 160347#(<= main_~i~0 10), 160344#(<= main_~i~0 7), 160345#(<= main_~i~0 8), 160350#(<= main_~i~0 13), 160351#(<= main_~i~0 14), 160348#(<= main_~i~0 11), 160349#(<= main_~i~0 12), 160354#(<= main_~i~0 17), 160355#(<= main_~i~0 18), 160352#(<= main_~i~0 15), 160353#(<= main_~i~0 16), 160358#(<= main_~i~0 21), 160359#(<= main_~i~0 22), 160356#(<= main_~i~0 19), 160357#(<= main_~i~0 20), 160362#(<= main_~i~0 25), 160363#(<= main_~i~0 26), 160360#(<= main_~i~0 23), 160361#(<= main_~i~0 24), 160366#(<= main_~i~0 29), 160367#(<= main_~i~0 30), 160364#(<= main_~i~0 27), 160365#(<= main_~i~0 28), 160370#(<= main_~i~0 33), 160371#(<= main_~i~0 34), 160368#(<= main_~i~0 31), 160369#(<= main_~i~0 32), 160374#(<= main_~i~0 37), 160375#(<= main_~i~0 38), 160372#(<= main_~i~0 35), 160373#(<= main_~i~0 36), 160378#(<= main_~i~0 41), 160379#(<= main_~i~0 42), 160376#(<= main_~i~0 39), 160377#(<= main_~i~0 40), 160382#(<= main_~i~0 45), 160383#(<= main_~i~0 46), 160380#(<= main_~i~0 43), 160381#(<= main_~i~0 44), 160386#(<= main_~i~0 49), 160387#(<= main_~i~0 50), 160384#(<= main_~i~0 47), 160385#(<= main_~i~0 48), 160390#(<= main_~i~0 53), 160391#(<= main_~i~0 54), 160388#(<= main_~i~0 51), 160389#(<= main_~i~0 52), 160394#(<= main_~i~0 57), 160395#(<= main_~i~0 58), 160392#(<= main_~i~0 55), 160393#(<= main_~i~0 56), 160398#(<= main_~i~0 61), 160399#(<= main_~i~0 62), 160396#(<= main_~i~0 59), 160397#(<= main_~i~0 60), 160402#(<= main_~i~0 65), 160403#(<= main_~i~0 66), 160400#(<= main_~i~0 63), 160401#(<= main_~i~0 64), 160406#(<= main_~i~0 69), 160407#(<= main_~i~0 70), 160404#(<= main_~i~0 67), 160405#(<= main_~i~0 68), 160410#(<= main_~i~0 73), 160411#(<= main_~i~0 74), 160408#(<= main_~i~0 71), 160409#(<= main_~i~0 72), 160414#(<= main_~i~0 77), 160415#(<= main_~i~0 78), 160412#(<= main_~i~0 75), 160413#(<= main_~i~0 76), 160418#(<= main_~i~0 81), 160419#(<= main_~i~0 82), 160416#(<= main_~i~0 79), 160417#(<= main_~i~0 80), 160422#(<= main_~i~0 85), 160423#(<= main_~i~0 86), 160420#(<= main_~i~0 83), 160421#(<= main_~i~0 84), 160426#(<= main_~i~0 89), 160427#(<= main_~i~0 90), 160424#(<= main_~i~0 87), 160425#(<= main_~i~0 88), 160430#(<= main_~i~0 93), 160431#(<= main_~i~0 94), 160428#(<= main_~i~0 91), 160429#(<= main_~i~0 92), 160434#(<= main_~i~0 97), 160435#(<= main_~i~0 98), 160432#(<= main_~i~0 95), 160433#(<= main_~i~0 96), 160438#(<= main_~i~0 101), 160439#(<= main_~i~0 102), 160436#(<= main_~i~0 99), 160437#(<= main_~i~0 100), 160442#(<= main_~i~0 105), 160443#(<= main_~i~0 106), 160440#(<= main_~i~0 103), 160441#(<= main_~i~0 104), 160446#(<= main_~i~0 109), 160447#(<= main_~i~0 110), 160444#(<= main_~i~0 107), 160445#(<= main_~i~0 108), 160450#(<= main_~i~0 113), 160451#(<= main_~i~0 114), 160448#(<= main_~i~0 111), 160449#(<= main_~i~0 112), 160454#(<= main_~i~0 117), 160455#(<= main_~i~0 118), 160452#(<= main_~i~0 115), 160453#(<= main_~i~0 116), 160458#(<= main_~i~0 121), 160459#(<= main_~i~0 122), 160456#(<= main_~i~0 119), 160457#(<= main_~i~0 120), 160462#(<= main_~i~0 125), 160463#(<= main_~i~0 126), 160460#(<= main_~i~0 123), 160461#(<= main_~i~0 124), 160466#(<= main_~i~0 129), 160467#(<= main_~i~0 130), 160464#(<= main_~i~0 127), 160465#(<= main_~i~0 128), 160470#(<= main_~i~0 133), 160471#(<= main_~i~0 134), 160468#(<= main_~i~0 131), 160469#(<= main_~i~0 132), 160474#(<= main_~i~0 137), 160475#(<= main_~i~0 138), 160472#(<= main_~i~0 135), 160473#(<= main_~i~0 136), 160478#(<= main_~i~0 141), 160479#(<= main_~i~0 142), 160476#(<= main_~i~0 139), 160477#(<= main_~i~0 140), 160482#(<= main_~i~0 145), 160483#(<= main_~i~0 146), 160480#(<= main_~i~0 143), 160481#(<= main_~i~0 144), 160484#(<= main_~i~0 147), 160485#(<= main_~i~0 148)] [2018-04-13 03:35:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43817 backedges. 0 proven. 43808 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:35:53,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-04-13 03:35:53,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-04-13 03:35:53,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-04-13 03:35:53,789 INFO L87 Difference]: Start difference. First operand 613 states and 614 transitions. Second operand 151 states. [2018-04-13 03:36:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:36:03,251 INFO L93 Difference]: Finished difference Result 1358 states and 1505 transitions. [2018-04-13 03:36:03,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-04-13 03:36:03,251 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 612 [2018-04-13 03:36:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:36:03,252 INFO L225 Difference]: With dead ends: 1358 [2018-04-13 03:36:03,252 INFO L226 Difference]: Without dead ends: 1358 [2018-04-13 03:36:03,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-04-13 03:36:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2018-04-13 03:36:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 617. [2018-04-13 03:36:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-13 03:36:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 618 transitions. [2018-04-13 03:36:03,255 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 618 transitions. Word has length 612 [2018-04-13 03:36:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:36:03,255 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 618 transitions. [2018-04-13 03:36:03,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-04-13 03:36:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 618 transitions. [2018-04-13 03:36:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-04-13 03:36:03,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:36:03,257 INFO L355 BasicCegarLoop]: trace histogram [150, 149, 149, 149, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:36:03,257 INFO L408 AbstractCegarLoop]: === Iteration 150 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:36:03,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1740543641, now seen corresponding path program 148 times [2018-04-13 03:36:03,257 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:36:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:36:03,273 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:36:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44411 backedges. 0 proven. 44402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:07,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:36:07,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-04-13 03:36:07,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:36:07,477 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-13 03:36:07,477 INFO L182 omatonBuilderFactory]: Interpolants [162562#(<= main_~i~0 99), 162563#(<= main_~i~0 100), 162560#(<= main_~i~0 97), 162561#(<= main_~i~0 98), 162566#(<= main_~i~0 103), 162567#(<= main_~i~0 104), 162564#(<= main_~i~0 101), 162565#(<= main_~i~0 102), 162570#(<= main_~i~0 107), 162571#(<= main_~i~0 108), 162568#(<= main_~i~0 105), 162569#(<= main_~i~0 106), 162574#(<= main_~i~0 111), 162575#(<= main_~i~0 112), 162572#(<= main_~i~0 109), 162573#(<= main_~i~0 110), 162578#(<= main_~i~0 115), 162579#(<= main_~i~0 116), 162576#(<= main_~i~0 113), 162577#(<= main_~i~0 114), 162582#(<= main_~i~0 119), 162583#(<= main_~i~0 120), 162580#(<= main_~i~0 117), 162581#(<= main_~i~0 118), 162586#(<= main_~i~0 123), 162587#(<= main_~i~0 124), 162584#(<= main_~i~0 121), 162585#(<= main_~i~0 122), 162590#(<= main_~i~0 127), 162591#(<= main_~i~0 128), 162588#(<= main_~i~0 125), 162589#(<= main_~i~0 126), 162594#(<= main_~i~0 131), 162595#(<= main_~i~0 132), 162592#(<= main_~i~0 129), 162593#(<= main_~i~0 130), 162598#(<= main_~i~0 135), 162599#(<= main_~i~0 136), 162596#(<= main_~i~0 133), 162597#(<= main_~i~0 134), 162602#(<= main_~i~0 139), 162603#(<= main_~i~0 140), 162600#(<= main_~i~0 137), 162601#(<= main_~i~0 138), 162606#(<= main_~i~0 143), 162607#(<= main_~i~0 144), 162604#(<= main_~i~0 141), 162605#(<= main_~i~0 142), 162610#(<= main_~i~0 147), 162611#(<= main_~i~0 148), 162608#(<= main_~i~0 145), 162609#(<= main_~i~0 146), 162612#(<= main_~i~0 149), 162462#false, 162463#(<= main_~i~0 0), 162461#true, 162466#(<= main_~i~0 3), 162467#(<= main_~i~0 4), 162464#(<= main_~i~0 1), 162465#(<= main_~i~0 2), 162470#(<= main_~i~0 7), 162471#(<= main_~i~0 8), 162468#(<= main_~i~0 5), 162469#(<= main_~i~0 6), 162474#(<= main_~i~0 11), 162475#(<= main_~i~0 12), 162472#(<= main_~i~0 9), 162473#(<= main_~i~0 10), 162478#(<= main_~i~0 15), 162479#(<= main_~i~0 16), 162476#(<= main_~i~0 13), 162477#(<= main_~i~0 14), 162482#(<= main_~i~0 19), 162483#(<= main_~i~0 20), 162480#(<= main_~i~0 17), 162481#(<= main_~i~0 18), 162486#(<= main_~i~0 23), 162487#(<= main_~i~0 24), 162484#(<= main_~i~0 21), 162485#(<= main_~i~0 22), 162490#(<= main_~i~0 27), 162491#(<= main_~i~0 28), 162488#(<= main_~i~0 25), 162489#(<= main_~i~0 26), 162494#(<= main_~i~0 31), 162495#(<= main_~i~0 32), 162492#(<= main_~i~0 29), 162493#(<= main_~i~0 30), 162498#(<= main_~i~0 35), 162499#(<= main_~i~0 36), 162496#(<= main_~i~0 33), 162497#(<= main_~i~0 34), 162502#(<= main_~i~0 39), 162503#(<= main_~i~0 40), 162500#(<= main_~i~0 37), 162501#(<= main_~i~0 38), 162506#(<= main_~i~0 43), 162507#(<= main_~i~0 44), 162504#(<= main_~i~0 41), 162505#(<= main_~i~0 42), 162510#(<= main_~i~0 47), 162511#(<= main_~i~0 48), 162508#(<= main_~i~0 45), 162509#(<= main_~i~0 46), 162514#(<= main_~i~0 51), 162515#(<= main_~i~0 52), 162512#(<= main_~i~0 49), 162513#(<= main_~i~0 50), 162518#(<= main_~i~0 55), 162519#(<= main_~i~0 56), 162516#(<= main_~i~0 53), 162517#(<= main_~i~0 54), 162522#(<= main_~i~0 59), 162523#(<= main_~i~0 60), 162520#(<= main_~i~0 57), 162521#(<= main_~i~0 58), 162526#(<= main_~i~0 63), 162527#(<= main_~i~0 64), 162524#(<= main_~i~0 61), 162525#(<= main_~i~0 62), 162530#(<= main_~i~0 67), 162531#(<= main_~i~0 68), 162528#(<= main_~i~0 65), 162529#(<= main_~i~0 66), 162534#(<= main_~i~0 71), 162535#(<= main_~i~0 72), 162532#(<= main_~i~0 69), 162533#(<= main_~i~0 70), 162538#(<= main_~i~0 75), 162539#(<= main_~i~0 76), 162536#(<= main_~i~0 73), 162537#(<= main_~i~0 74), 162542#(<= main_~i~0 79), 162543#(<= main_~i~0 80), 162540#(<= main_~i~0 77), 162541#(<= main_~i~0 78), 162546#(<= main_~i~0 83), 162547#(<= main_~i~0 84), 162544#(<= main_~i~0 81), 162545#(<= main_~i~0 82), 162550#(<= main_~i~0 87), 162551#(<= main_~i~0 88), 162548#(<= main_~i~0 85), 162549#(<= main_~i~0 86), 162554#(<= main_~i~0 91), 162555#(<= main_~i~0 92), 162552#(<= main_~i~0 89), 162553#(<= main_~i~0 90), 162558#(<= main_~i~0 95), 162559#(<= main_~i~0 96), 162556#(<= main_~i~0 93), 162557#(<= main_~i~0 94)] [2018-04-13 03:36:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 44411 backedges. 0 proven. 44402 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:07,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-04-13 03:36:07,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-04-13 03:36:07,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 03:36:07,479 INFO L87 Difference]: Start difference. First operand 617 states and 618 transitions. Second operand 152 states. [2018-04-13 03:36:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:36:15,045 INFO L93 Difference]: Finished difference Result 1367 states and 1515 transitions. [2018-04-13 03:36:15,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-04-13 03:36:15,045 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 616 [2018-04-13 03:36:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:36:15,046 INFO L225 Difference]: With dead ends: 1367 [2018-04-13 03:36:15,046 INFO L226 Difference]: Without dead ends: 1367 [2018-04-13 03:36:15,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 03:36:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-04-13 03:36:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 621. [2018-04-13 03:36:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-04-13 03:36:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 622 transitions. [2018-04-13 03:36:15,049 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 622 transitions. Word has length 616 [2018-04-13 03:36:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:36:15,049 INFO L459 AbstractCegarLoop]: Abstraction has 621 states and 622 transitions. [2018-04-13 03:36:15,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-04-13 03:36:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 622 transitions. [2018-04-13 03:36:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-04-13 03:36:15,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:36:15,051 INFO L355 BasicCegarLoop]: trace histogram [151, 150, 150, 150, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:36:15,051 INFO L408 AbstractCegarLoop]: === Iteration 151 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:36:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash 852908384, now seen corresponding path program 149 times [2018-04-13 03:36:15,052 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:36:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:36:15,067 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:36:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 45009 backedges. 0 proven. 45000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:19,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:36:19,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-04-13 03:36:19,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:36:19,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-13 03:36:19,337 INFO L182 omatonBuilderFactory]: Interpolants [164610#(<= main_~i~0 7), 164611#(<= main_~i~0 8), 164608#(<= main_~i~0 5), 164609#(<= main_~i~0 6), 164614#(<= main_~i~0 11), 164615#(<= main_~i~0 12), 164612#(<= main_~i~0 9), 164613#(<= main_~i~0 10), 164618#(<= main_~i~0 15), 164619#(<= main_~i~0 16), 164616#(<= main_~i~0 13), 164617#(<= main_~i~0 14), 164622#(<= main_~i~0 19), 164623#(<= main_~i~0 20), 164620#(<= main_~i~0 17), 164621#(<= main_~i~0 18), 164626#(<= main_~i~0 23), 164627#(<= main_~i~0 24), 164624#(<= main_~i~0 21), 164625#(<= main_~i~0 22), 164630#(<= main_~i~0 27), 164631#(<= main_~i~0 28), 164628#(<= main_~i~0 25), 164629#(<= main_~i~0 26), 164634#(<= main_~i~0 31), 164635#(<= main_~i~0 32), 164632#(<= main_~i~0 29), 164633#(<= main_~i~0 30), 164638#(<= main_~i~0 35), 164639#(<= main_~i~0 36), 164636#(<= main_~i~0 33), 164637#(<= main_~i~0 34), 164642#(<= main_~i~0 39), 164643#(<= main_~i~0 40), 164640#(<= main_~i~0 37), 164641#(<= main_~i~0 38), 164646#(<= main_~i~0 43), 164647#(<= main_~i~0 44), 164644#(<= main_~i~0 41), 164645#(<= main_~i~0 42), 164650#(<= main_~i~0 47), 164651#(<= main_~i~0 48), 164648#(<= main_~i~0 45), 164649#(<= main_~i~0 46), 164654#(<= main_~i~0 51), 164655#(<= main_~i~0 52), 164652#(<= main_~i~0 49), 164653#(<= main_~i~0 50), 164658#(<= main_~i~0 55), 164659#(<= main_~i~0 56), 164656#(<= main_~i~0 53), 164657#(<= main_~i~0 54), 164662#(<= main_~i~0 59), 164663#(<= main_~i~0 60), 164660#(<= main_~i~0 57), 164661#(<= main_~i~0 58), 164666#(<= main_~i~0 63), 164667#(<= main_~i~0 64), 164664#(<= main_~i~0 61), 164665#(<= main_~i~0 62), 164670#(<= main_~i~0 67), 164671#(<= main_~i~0 68), 164668#(<= main_~i~0 65), 164669#(<= main_~i~0 66), 164674#(<= main_~i~0 71), 164675#(<= main_~i~0 72), 164672#(<= main_~i~0 69), 164673#(<= main_~i~0 70), 164678#(<= main_~i~0 75), 164679#(<= main_~i~0 76), 164676#(<= main_~i~0 73), 164677#(<= main_~i~0 74), 164682#(<= main_~i~0 79), 164683#(<= main_~i~0 80), 164680#(<= main_~i~0 77), 164681#(<= main_~i~0 78), 164686#(<= main_~i~0 83), 164687#(<= main_~i~0 84), 164684#(<= main_~i~0 81), 164685#(<= main_~i~0 82), 164690#(<= main_~i~0 87), 164691#(<= main_~i~0 88), 164688#(<= main_~i~0 85), 164689#(<= main_~i~0 86), 164694#(<= main_~i~0 91), 164695#(<= main_~i~0 92), 164692#(<= main_~i~0 89), 164693#(<= main_~i~0 90), 164698#(<= main_~i~0 95), 164699#(<= main_~i~0 96), 164696#(<= main_~i~0 93), 164697#(<= main_~i~0 94), 164702#(<= main_~i~0 99), 164703#(<= main_~i~0 100), 164700#(<= main_~i~0 97), 164701#(<= main_~i~0 98), 164706#(<= main_~i~0 103), 164707#(<= main_~i~0 104), 164704#(<= main_~i~0 101), 164705#(<= main_~i~0 102), 164710#(<= main_~i~0 107), 164711#(<= main_~i~0 108), 164708#(<= main_~i~0 105), 164709#(<= main_~i~0 106), 164714#(<= main_~i~0 111), 164715#(<= main_~i~0 112), 164712#(<= main_~i~0 109), 164713#(<= main_~i~0 110), 164718#(<= main_~i~0 115), 164719#(<= main_~i~0 116), 164716#(<= main_~i~0 113), 164717#(<= main_~i~0 114), 164722#(<= main_~i~0 119), 164723#(<= main_~i~0 120), 164720#(<= main_~i~0 117), 164721#(<= main_~i~0 118), 164726#(<= main_~i~0 123), 164727#(<= main_~i~0 124), 164724#(<= main_~i~0 121), 164725#(<= main_~i~0 122), 164730#(<= main_~i~0 127), 164731#(<= main_~i~0 128), 164728#(<= main_~i~0 125), 164729#(<= main_~i~0 126), 164734#(<= main_~i~0 131), 164735#(<= main_~i~0 132), 164732#(<= main_~i~0 129), 164733#(<= main_~i~0 130), 164738#(<= main_~i~0 135), 164739#(<= main_~i~0 136), 164736#(<= main_~i~0 133), 164737#(<= main_~i~0 134), 164742#(<= main_~i~0 139), 164743#(<= main_~i~0 140), 164740#(<= main_~i~0 137), 164741#(<= main_~i~0 138), 164746#(<= main_~i~0 143), 164747#(<= main_~i~0 144), 164744#(<= main_~i~0 141), 164745#(<= main_~i~0 142), 164750#(<= main_~i~0 147), 164751#(<= main_~i~0 148), 164748#(<= main_~i~0 145), 164749#(<= main_~i~0 146), 164752#(<= main_~i~0 149), 164753#(<= main_~i~0 150), 164602#false, 164603#(<= main_~i~0 0), 164601#true, 164606#(<= main_~i~0 3), 164607#(<= main_~i~0 4), 164604#(<= main_~i~0 1), 164605#(<= main_~i~0 2)] [2018-04-13 03:36:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45009 backedges. 0 proven. 45000 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:19,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-04-13 03:36:19,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-04-13 03:36:19,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 03:36:19,340 INFO L87 Difference]: Start difference. First operand 621 states and 622 transitions. Second operand 153 states. [2018-04-13 03:36:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:36:29,980 INFO L93 Difference]: Finished difference Result 1376 states and 1525 transitions. [2018-04-13 03:36:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-04-13 03:36:29,980 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 620 [2018-04-13 03:36:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:36:29,981 INFO L225 Difference]: With dead ends: 1376 [2018-04-13 03:36:29,981 INFO L226 Difference]: Without dead ends: 1376 [2018-04-13 03:36:29,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 03:36:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-04-13 03:36:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 625. [2018-04-13 03:36:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-04-13 03:36:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2018-04-13 03:36:29,984 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 620 [2018-04-13 03:36:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:36:29,984 INFO L459 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2018-04-13 03:36:29,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-04-13 03:36:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2018-04-13 03:36:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-04-13 03:36:29,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:36:29,986 INFO L355 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:36:29,986 INFO L408 AbstractCegarLoop]: === Iteration 152 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:36:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1726962471, now seen corresponding path program 150 times [2018-04-13 03:36:29,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:36:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:36:30,002 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:36:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45611 backedges. 0 proven. 45602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:34,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:36:34,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-04-13 03:36:34,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:36:34,329 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-13 03:36:34,329 INFO L182 omatonBuilderFactory]: Interpolants [166755#true, 166758#(<= main_~i~0 1), 166759#(<= main_~i~0 2), 166756#false, 166757#(<= main_~i~0 0), 166762#(<= main_~i~0 5), 166763#(<= main_~i~0 6), 166760#(<= main_~i~0 3), 166761#(<= main_~i~0 4), 166766#(<= main_~i~0 9), 166767#(<= main_~i~0 10), 166764#(<= main_~i~0 7), 166765#(<= main_~i~0 8), 166770#(<= main_~i~0 13), 166771#(<= main_~i~0 14), 166768#(<= main_~i~0 11), 166769#(<= main_~i~0 12), 166774#(<= main_~i~0 17), 166775#(<= main_~i~0 18), 166772#(<= main_~i~0 15), 166773#(<= main_~i~0 16), 166778#(<= main_~i~0 21), 166779#(<= main_~i~0 22), 166776#(<= main_~i~0 19), 166777#(<= main_~i~0 20), 166782#(<= main_~i~0 25), 166783#(<= main_~i~0 26), 166780#(<= main_~i~0 23), 166781#(<= main_~i~0 24), 166786#(<= main_~i~0 29), 166787#(<= main_~i~0 30), 166784#(<= main_~i~0 27), 166785#(<= main_~i~0 28), 166790#(<= main_~i~0 33), 166791#(<= main_~i~0 34), 166788#(<= main_~i~0 31), 166789#(<= main_~i~0 32), 166794#(<= main_~i~0 37), 166795#(<= main_~i~0 38), 166792#(<= main_~i~0 35), 166793#(<= main_~i~0 36), 166798#(<= main_~i~0 41), 166799#(<= main_~i~0 42), 166796#(<= main_~i~0 39), 166797#(<= main_~i~0 40), 166802#(<= main_~i~0 45), 166803#(<= main_~i~0 46), 166800#(<= main_~i~0 43), 166801#(<= main_~i~0 44), 166806#(<= main_~i~0 49), 166807#(<= main_~i~0 50), 166804#(<= main_~i~0 47), 166805#(<= main_~i~0 48), 166810#(<= main_~i~0 53), 166811#(<= main_~i~0 54), 166808#(<= main_~i~0 51), 166809#(<= main_~i~0 52), 166814#(<= main_~i~0 57), 166815#(<= main_~i~0 58), 166812#(<= main_~i~0 55), 166813#(<= main_~i~0 56), 166818#(<= main_~i~0 61), 166819#(<= main_~i~0 62), 166816#(<= main_~i~0 59), 166817#(<= main_~i~0 60), 166822#(<= main_~i~0 65), 166823#(<= main_~i~0 66), 166820#(<= main_~i~0 63), 166821#(<= main_~i~0 64), 166826#(<= main_~i~0 69), 166827#(<= main_~i~0 70), 166824#(<= main_~i~0 67), 166825#(<= main_~i~0 68), 166830#(<= main_~i~0 73), 166831#(<= main_~i~0 74), 166828#(<= main_~i~0 71), 166829#(<= main_~i~0 72), 166834#(<= main_~i~0 77), 166835#(<= main_~i~0 78), 166832#(<= main_~i~0 75), 166833#(<= main_~i~0 76), 166838#(<= main_~i~0 81), 166839#(<= main_~i~0 82), 166836#(<= main_~i~0 79), 166837#(<= main_~i~0 80), 166842#(<= main_~i~0 85), 166843#(<= main_~i~0 86), 166840#(<= main_~i~0 83), 166841#(<= main_~i~0 84), 166846#(<= main_~i~0 89), 166847#(<= main_~i~0 90), 166844#(<= main_~i~0 87), 166845#(<= main_~i~0 88), 166850#(<= main_~i~0 93), 166851#(<= main_~i~0 94), 166848#(<= main_~i~0 91), 166849#(<= main_~i~0 92), 166854#(<= main_~i~0 97), 166855#(<= main_~i~0 98), 166852#(<= main_~i~0 95), 166853#(<= main_~i~0 96), 166858#(<= main_~i~0 101), 166859#(<= main_~i~0 102), 166856#(<= main_~i~0 99), 166857#(<= main_~i~0 100), 166862#(<= main_~i~0 105), 166863#(<= main_~i~0 106), 166860#(<= main_~i~0 103), 166861#(<= main_~i~0 104), 166866#(<= main_~i~0 109), 166867#(<= main_~i~0 110), 166864#(<= main_~i~0 107), 166865#(<= main_~i~0 108), 166870#(<= main_~i~0 113), 166871#(<= main_~i~0 114), 166868#(<= main_~i~0 111), 166869#(<= main_~i~0 112), 166874#(<= main_~i~0 117), 166875#(<= main_~i~0 118), 166872#(<= main_~i~0 115), 166873#(<= main_~i~0 116), 166878#(<= main_~i~0 121), 166879#(<= main_~i~0 122), 166876#(<= main_~i~0 119), 166877#(<= main_~i~0 120), 166882#(<= main_~i~0 125), 166883#(<= main_~i~0 126), 166880#(<= main_~i~0 123), 166881#(<= main_~i~0 124), 166886#(<= main_~i~0 129), 166887#(<= main_~i~0 130), 166884#(<= main_~i~0 127), 166885#(<= main_~i~0 128), 166890#(<= main_~i~0 133), 166891#(<= main_~i~0 134), 166888#(<= main_~i~0 131), 166889#(<= main_~i~0 132), 166894#(<= main_~i~0 137), 166895#(<= main_~i~0 138), 166892#(<= main_~i~0 135), 166893#(<= main_~i~0 136), 166898#(<= main_~i~0 141), 166899#(<= main_~i~0 142), 166896#(<= main_~i~0 139), 166897#(<= main_~i~0 140), 166902#(<= main_~i~0 145), 166903#(<= main_~i~0 146), 166900#(<= main_~i~0 143), 166901#(<= main_~i~0 144), 166906#(<= main_~i~0 149), 166907#(<= main_~i~0 150), 166904#(<= main_~i~0 147), 166905#(<= main_~i~0 148), 166908#(<= main_~i~0 151)] [2018-04-13 03:36:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45611 backedges. 0 proven. 45602 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:34,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-04-13 03:36:34,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-04-13 03:36:34,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-04-13 03:36:34,331 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand 154 states. [2018-04-13 03:36:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:36:44,990 INFO L93 Difference]: Finished difference Result 1385 states and 1535 transitions. [2018-04-13 03:36:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-04-13 03:36:44,990 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 624 [2018-04-13 03:36:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:36:44,991 INFO L225 Difference]: With dead ends: 1385 [2018-04-13 03:36:44,991 INFO L226 Difference]: Without dead ends: 1385 [2018-04-13 03:36:44,991 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-04-13 03:36:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-04-13 03:36:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 629. [2018-04-13 03:36:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-04-13 03:36:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-04-13 03:36:44,994 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 624 [2018-04-13 03:36:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:36:44,994 INFO L459 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-04-13 03:36:44,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-04-13 03:36:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-04-13 03:36:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-04-13 03:36:44,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:36:44,996 INFO L355 BasicCegarLoop]: trace histogram [153, 152, 152, 152, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:36:44,996 INFO L408 AbstractCegarLoop]: === Iteration 153 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:36:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2044103634, now seen corresponding path program 151 times [2018-04-13 03:36:44,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:36:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:36:45,012 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:36:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 46217 backedges. 0 proven. 46208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:49,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:36:49,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-04-13 03:36:49,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:36:49,366 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-13 03:36:49,367 INFO L182 omatonBuilderFactory]: Interpolants [168962#(<= main_~i~0 37), 168963#(<= main_~i~0 38), 168960#(<= main_~i~0 35), 168961#(<= main_~i~0 36), 168966#(<= main_~i~0 41), 168967#(<= main_~i~0 42), 168964#(<= main_~i~0 39), 168965#(<= main_~i~0 40), 168970#(<= main_~i~0 45), 168971#(<= main_~i~0 46), 168968#(<= main_~i~0 43), 168969#(<= main_~i~0 44), 168974#(<= main_~i~0 49), 168975#(<= main_~i~0 50), 168972#(<= main_~i~0 47), 168973#(<= main_~i~0 48), 168978#(<= main_~i~0 53), 168979#(<= main_~i~0 54), 168976#(<= main_~i~0 51), 168977#(<= main_~i~0 52), 168982#(<= main_~i~0 57), 168983#(<= main_~i~0 58), 168980#(<= main_~i~0 55), 168981#(<= main_~i~0 56), 168986#(<= main_~i~0 61), 168987#(<= main_~i~0 62), 168984#(<= main_~i~0 59), 168985#(<= main_~i~0 60), 168990#(<= main_~i~0 65), 168991#(<= main_~i~0 66), 168988#(<= main_~i~0 63), 168989#(<= main_~i~0 64), 168994#(<= main_~i~0 69), 168995#(<= main_~i~0 70), 168992#(<= main_~i~0 67), 168993#(<= main_~i~0 68), 168998#(<= main_~i~0 73), 168999#(<= main_~i~0 74), 168996#(<= main_~i~0 71), 168997#(<= main_~i~0 72), 169002#(<= main_~i~0 77), 169003#(<= main_~i~0 78), 169000#(<= main_~i~0 75), 169001#(<= main_~i~0 76), 169006#(<= main_~i~0 81), 169007#(<= main_~i~0 82), 169004#(<= main_~i~0 79), 169005#(<= main_~i~0 80), 169010#(<= main_~i~0 85), 169011#(<= main_~i~0 86), 169008#(<= main_~i~0 83), 169009#(<= main_~i~0 84), 169014#(<= main_~i~0 89), 169015#(<= main_~i~0 90), 169012#(<= main_~i~0 87), 169013#(<= main_~i~0 88), 169018#(<= main_~i~0 93), 169019#(<= main_~i~0 94), 169016#(<= main_~i~0 91), 169017#(<= main_~i~0 92), 169022#(<= main_~i~0 97), 169023#(<= main_~i~0 98), 169020#(<= main_~i~0 95), 169021#(<= main_~i~0 96), 169026#(<= main_~i~0 101), 169027#(<= main_~i~0 102), 169024#(<= main_~i~0 99), 169025#(<= main_~i~0 100), 169030#(<= main_~i~0 105), 169031#(<= main_~i~0 106), 169028#(<= main_~i~0 103), 169029#(<= main_~i~0 104), 169034#(<= main_~i~0 109), 169035#(<= main_~i~0 110), 169032#(<= main_~i~0 107), 169033#(<= main_~i~0 108), 169038#(<= main_~i~0 113), 169039#(<= main_~i~0 114), 169036#(<= main_~i~0 111), 169037#(<= main_~i~0 112), 169042#(<= main_~i~0 117), 169043#(<= main_~i~0 118), 169040#(<= main_~i~0 115), 169041#(<= main_~i~0 116), 169046#(<= main_~i~0 121), 169047#(<= main_~i~0 122), 169044#(<= main_~i~0 119), 169045#(<= main_~i~0 120), 169050#(<= main_~i~0 125), 169051#(<= main_~i~0 126), 169048#(<= main_~i~0 123), 169049#(<= main_~i~0 124), 169054#(<= main_~i~0 129), 169055#(<= main_~i~0 130), 169052#(<= main_~i~0 127), 169053#(<= main_~i~0 128), 169058#(<= main_~i~0 133), 169059#(<= main_~i~0 134), 169056#(<= main_~i~0 131), 169057#(<= main_~i~0 132), 169062#(<= main_~i~0 137), 169063#(<= main_~i~0 138), 169060#(<= main_~i~0 135), 169061#(<= main_~i~0 136), 169066#(<= main_~i~0 141), 169067#(<= main_~i~0 142), 169064#(<= main_~i~0 139), 169065#(<= main_~i~0 140), 169070#(<= main_~i~0 145), 169071#(<= main_~i~0 146), 169068#(<= main_~i~0 143), 169069#(<= main_~i~0 144), 169074#(<= main_~i~0 149), 169075#(<= main_~i~0 150), 169072#(<= main_~i~0 147), 169073#(<= main_~i~0 148), 169076#(<= main_~i~0 151), 169077#(<= main_~i~0 152), 168923#true, 168926#(<= main_~i~0 1), 168927#(<= main_~i~0 2), 168924#false, 168925#(<= main_~i~0 0), 168930#(<= main_~i~0 5), 168931#(<= main_~i~0 6), 168928#(<= main_~i~0 3), 168929#(<= main_~i~0 4), 168934#(<= main_~i~0 9), 168935#(<= main_~i~0 10), 168932#(<= main_~i~0 7), 168933#(<= main_~i~0 8), 168938#(<= main_~i~0 13), 168939#(<= main_~i~0 14), 168936#(<= main_~i~0 11), 168937#(<= main_~i~0 12), 168942#(<= main_~i~0 17), 168943#(<= main_~i~0 18), 168940#(<= main_~i~0 15), 168941#(<= main_~i~0 16), 168946#(<= main_~i~0 21), 168947#(<= main_~i~0 22), 168944#(<= main_~i~0 19), 168945#(<= main_~i~0 20), 168950#(<= main_~i~0 25), 168951#(<= main_~i~0 26), 168948#(<= main_~i~0 23), 168949#(<= main_~i~0 24), 168954#(<= main_~i~0 29), 168955#(<= main_~i~0 30), 168952#(<= main_~i~0 27), 168953#(<= main_~i~0 28), 168958#(<= main_~i~0 33), 168959#(<= main_~i~0 34), 168956#(<= main_~i~0 31), 168957#(<= main_~i~0 32)] [2018-04-13 03:36:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 46217 backedges. 0 proven. 46208 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:36:49,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-04-13 03:36:49,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-04-13 03:36:49,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 03:36:49,369 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 155 states. [2018-04-13 03:36:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:36:58,386 INFO L93 Difference]: Finished difference Result 1394 states and 1545 transitions. [2018-04-13 03:36:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-04-13 03:36:58,386 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 628 [2018-04-13 03:36:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:36:58,387 INFO L225 Difference]: With dead ends: 1394 [2018-04-13 03:36:58,387 INFO L226 Difference]: Without dead ends: 1394 [2018-04-13 03:36:58,388 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 03:36:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-04-13 03:36:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 633. [2018-04-13 03:36:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-13 03:36:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 634 transitions. [2018-04-13 03:36:58,392 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 634 transitions. Word has length 628 [2018-04-13 03:36:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:36:58,393 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 634 transitions. [2018-04-13 03:36:58,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-04-13 03:36:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 634 transitions. [2018-04-13 03:36:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-04-13 03:36:58,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:36:58,396 INFO L355 BasicCegarLoop]: trace histogram [154, 153, 153, 153, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:36:58,396 INFO L408 AbstractCegarLoop]: === Iteration 154 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:36:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 653151819, now seen corresponding path program 152 times [2018-04-13 03:36:58,396 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:36:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:36:58,418 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:37:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 46827 backedges. 0 proven. 46818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:03,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:37:03,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-04-13 03:37:03,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:37:03,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-13 03:37:03,054 INFO L182 omatonBuilderFactory]: Interpolants [171106#false, 171107#(<= main_~i~0 0), 171105#true, 171110#(<= main_~i~0 3), 171111#(<= main_~i~0 4), 171108#(<= main_~i~0 1), 171109#(<= main_~i~0 2), 171114#(<= main_~i~0 7), 171115#(<= main_~i~0 8), 171112#(<= main_~i~0 5), 171113#(<= main_~i~0 6), 171118#(<= main_~i~0 11), 171119#(<= main_~i~0 12), 171116#(<= main_~i~0 9), 171117#(<= main_~i~0 10), 171122#(<= main_~i~0 15), 171123#(<= main_~i~0 16), 171120#(<= main_~i~0 13), 171121#(<= main_~i~0 14), 171126#(<= main_~i~0 19), 171127#(<= main_~i~0 20), 171124#(<= main_~i~0 17), 171125#(<= main_~i~0 18), 171130#(<= main_~i~0 23), 171131#(<= main_~i~0 24), 171128#(<= main_~i~0 21), 171129#(<= main_~i~0 22), 171134#(<= main_~i~0 27), 171135#(<= main_~i~0 28), 171132#(<= main_~i~0 25), 171133#(<= main_~i~0 26), 171138#(<= main_~i~0 31), 171139#(<= main_~i~0 32), 171136#(<= main_~i~0 29), 171137#(<= main_~i~0 30), 171142#(<= main_~i~0 35), 171143#(<= main_~i~0 36), 171140#(<= main_~i~0 33), 171141#(<= main_~i~0 34), 171146#(<= main_~i~0 39), 171147#(<= main_~i~0 40), 171144#(<= main_~i~0 37), 171145#(<= main_~i~0 38), 171150#(<= main_~i~0 43), 171151#(<= main_~i~0 44), 171148#(<= main_~i~0 41), 171149#(<= main_~i~0 42), 171154#(<= main_~i~0 47), 171155#(<= main_~i~0 48), 171152#(<= main_~i~0 45), 171153#(<= main_~i~0 46), 171158#(<= main_~i~0 51), 171159#(<= main_~i~0 52), 171156#(<= main_~i~0 49), 171157#(<= main_~i~0 50), 171162#(<= main_~i~0 55), 171163#(<= main_~i~0 56), 171160#(<= main_~i~0 53), 171161#(<= main_~i~0 54), 171166#(<= main_~i~0 59), 171167#(<= main_~i~0 60), 171164#(<= main_~i~0 57), 171165#(<= main_~i~0 58), 171170#(<= main_~i~0 63), 171171#(<= main_~i~0 64), 171168#(<= main_~i~0 61), 171169#(<= main_~i~0 62), 171174#(<= main_~i~0 67), 171175#(<= main_~i~0 68), 171172#(<= main_~i~0 65), 171173#(<= main_~i~0 66), 171178#(<= main_~i~0 71), 171179#(<= main_~i~0 72), 171176#(<= main_~i~0 69), 171177#(<= main_~i~0 70), 171182#(<= main_~i~0 75), 171183#(<= main_~i~0 76), 171180#(<= main_~i~0 73), 171181#(<= main_~i~0 74), 171186#(<= main_~i~0 79), 171187#(<= main_~i~0 80), 171184#(<= main_~i~0 77), 171185#(<= main_~i~0 78), 171190#(<= main_~i~0 83), 171191#(<= main_~i~0 84), 171188#(<= main_~i~0 81), 171189#(<= main_~i~0 82), 171194#(<= main_~i~0 87), 171195#(<= main_~i~0 88), 171192#(<= main_~i~0 85), 171193#(<= main_~i~0 86), 171198#(<= main_~i~0 91), 171199#(<= main_~i~0 92), 171196#(<= main_~i~0 89), 171197#(<= main_~i~0 90), 171202#(<= main_~i~0 95), 171203#(<= main_~i~0 96), 171200#(<= main_~i~0 93), 171201#(<= main_~i~0 94), 171206#(<= main_~i~0 99), 171207#(<= main_~i~0 100), 171204#(<= main_~i~0 97), 171205#(<= main_~i~0 98), 171210#(<= main_~i~0 103), 171211#(<= main_~i~0 104), 171208#(<= main_~i~0 101), 171209#(<= main_~i~0 102), 171214#(<= main_~i~0 107), 171215#(<= main_~i~0 108), 171212#(<= main_~i~0 105), 171213#(<= main_~i~0 106), 171218#(<= main_~i~0 111), 171219#(<= main_~i~0 112), 171216#(<= main_~i~0 109), 171217#(<= main_~i~0 110), 171222#(<= main_~i~0 115), 171223#(<= main_~i~0 116), 171220#(<= main_~i~0 113), 171221#(<= main_~i~0 114), 171226#(<= main_~i~0 119), 171227#(<= main_~i~0 120), 171224#(<= main_~i~0 117), 171225#(<= main_~i~0 118), 171230#(<= main_~i~0 123), 171231#(<= main_~i~0 124), 171228#(<= main_~i~0 121), 171229#(<= main_~i~0 122), 171234#(<= main_~i~0 127), 171235#(<= main_~i~0 128), 171232#(<= main_~i~0 125), 171233#(<= main_~i~0 126), 171238#(<= main_~i~0 131), 171239#(<= main_~i~0 132), 171236#(<= main_~i~0 129), 171237#(<= main_~i~0 130), 171242#(<= main_~i~0 135), 171243#(<= main_~i~0 136), 171240#(<= main_~i~0 133), 171241#(<= main_~i~0 134), 171246#(<= main_~i~0 139), 171247#(<= main_~i~0 140), 171244#(<= main_~i~0 137), 171245#(<= main_~i~0 138), 171250#(<= main_~i~0 143), 171251#(<= main_~i~0 144), 171248#(<= main_~i~0 141), 171249#(<= main_~i~0 142), 171254#(<= main_~i~0 147), 171255#(<= main_~i~0 148), 171252#(<= main_~i~0 145), 171253#(<= main_~i~0 146), 171258#(<= main_~i~0 151), 171259#(<= main_~i~0 152), 171256#(<= main_~i~0 149), 171257#(<= main_~i~0 150), 171260#(<= main_~i~0 153)] [2018-04-13 03:37:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46827 backedges. 0 proven. 46818 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:03,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-04-13 03:37:03,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-04-13 03:37:03,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 03:37:03,056 INFO L87 Difference]: Start difference. First operand 633 states and 634 transitions. Second operand 156 states. [2018-04-13 03:37:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:37:13,977 INFO L93 Difference]: Finished difference Result 1403 states and 1555 transitions. [2018-04-13 03:37:13,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-04-13 03:37:13,977 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 632 [2018-04-13 03:37:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:37:13,978 INFO L225 Difference]: With dead ends: 1403 [2018-04-13 03:37:13,978 INFO L226 Difference]: Without dead ends: 1403 [2018-04-13 03:37:13,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 03:37:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-04-13 03:37:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 637. [2018-04-13 03:37:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-04-13 03:37:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-04-13 03:37:13,981 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 632 [2018-04-13 03:37:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:37:13,981 INFO L459 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-04-13 03:37:13,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-04-13 03:37:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-04-13 03:37:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-04-13 03:37:13,983 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:37:13,983 INFO L355 BasicCegarLoop]: trace histogram [155, 154, 154, 154, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:37:13,983 INFO L408 AbstractCegarLoop]: === Iteration 155 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:37:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 620637252, now seen corresponding path program 153 times [2018-04-13 03:37:13,983 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:37:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:37:13,999 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:37:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 47441 backedges. 0 proven. 47432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:18,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:37:18,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-04-13 03:37:18,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:37:18,492 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-13 03:37:18,493 INFO L182 omatonBuilderFactory]: Interpolants [173314#(<= main_~i~0 11), 173315#(<= main_~i~0 12), 173312#(<= main_~i~0 9), 173313#(<= main_~i~0 10), 173318#(<= main_~i~0 15), 173319#(<= main_~i~0 16), 173316#(<= main_~i~0 13), 173317#(<= main_~i~0 14), 173322#(<= main_~i~0 19), 173323#(<= main_~i~0 20), 173320#(<= main_~i~0 17), 173321#(<= main_~i~0 18), 173326#(<= main_~i~0 23), 173327#(<= main_~i~0 24), 173324#(<= main_~i~0 21), 173325#(<= main_~i~0 22), 173330#(<= main_~i~0 27), 173331#(<= main_~i~0 28), 173328#(<= main_~i~0 25), 173329#(<= main_~i~0 26), 173334#(<= main_~i~0 31), 173335#(<= main_~i~0 32), 173332#(<= main_~i~0 29), 173333#(<= main_~i~0 30), 173338#(<= main_~i~0 35), 173339#(<= main_~i~0 36), 173336#(<= main_~i~0 33), 173337#(<= main_~i~0 34), 173342#(<= main_~i~0 39), 173343#(<= main_~i~0 40), 173340#(<= main_~i~0 37), 173341#(<= main_~i~0 38), 173346#(<= main_~i~0 43), 173347#(<= main_~i~0 44), 173344#(<= main_~i~0 41), 173345#(<= main_~i~0 42), 173350#(<= main_~i~0 47), 173351#(<= main_~i~0 48), 173348#(<= main_~i~0 45), 173349#(<= main_~i~0 46), 173354#(<= main_~i~0 51), 173355#(<= main_~i~0 52), 173352#(<= main_~i~0 49), 173353#(<= main_~i~0 50), 173358#(<= main_~i~0 55), 173359#(<= main_~i~0 56), 173356#(<= main_~i~0 53), 173357#(<= main_~i~0 54), 173362#(<= main_~i~0 59), 173363#(<= main_~i~0 60), 173360#(<= main_~i~0 57), 173361#(<= main_~i~0 58), 173366#(<= main_~i~0 63), 173367#(<= main_~i~0 64), 173364#(<= main_~i~0 61), 173365#(<= main_~i~0 62), 173370#(<= main_~i~0 67), 173371#(<= main_~i~0 68), 173368#(<= main_~i~0 65), 173369#(<= main_~i~0 66), 173374#(<= main_~i~0 71), 173375#(<= main_~i~0 72), 173372#(<= main_~i~0 69), 173373#(<= main_~i~0 70), 173378#(<= main_~i~0 75), 173379#(<= main_~i~0 76), 173376#(<= main_~i~0 73), 173377#(<= main_~i~0 74), 173382#(<= main_~i~0 79), 173383#(<= main_~i~0 80), 173380#(<= main_~i~0 77), 173381#(<= main_~i~0 78), 173386#(<= main_~i~0 83), 173387#(<= main_~i~0 84), 173384#(<= main_~i~0 81), 173385#(<= main_~i~0 82), 173390#(<= main_~i~0 87), 173391#(<= main_~i~0 88), 173388#(<= main_~i~0 85), 173389#(<= main_~i~0 86), 173394#(<= main_~i~0 91), 173395#(<= main_~i~0 92), 173392#(<= main_~i~0 89), 173393#(<= main_~i~0 90), 173398#(<= main_~i~0 95), 173399#(<= main_~i~0 96), 173396#(<= main_~i~0 93), 173397#(<= main_~i~0 94), 173402#(<= main_~i~0 99), 173403#(<= main_~i~0 100), 173400#(<= main_~i~0 97), 173401#(<= main_~i~0 98), 173406#(<= main_~i~0 103), 173407#(<= main_~i~0 104), 173404#(<= main_~i~0 101), 173405#(<= main_~i~0 102), 173410#(<= main_~i~0 107), 173411#(<= main_~i~0 108), 173408#(<= main_~i~0 105), 173409#(<= main_~i~0 106), 173414#(<= main_~i~0 111), 173415#(<= main_~i~0 112), 173412#(<= main_~i~0 109), 173413#(<= main_~i~0 110), 173418#(<= main_~i~0 115), 173419#(<= main_~i~0 116), 173416#(<= main_~i~0 113), 173417#(<= main_~i~0 114), 173422#(<= main_~i~0 119), 173423#(<= main_~i~0 120), 173420#(<= main_~i~0 117), 173421#(<= main_~i~0 118), 173426#(<= main_~i~0 123), 173427#(<= main_~i~0 124), 173424#(<= main_~i~0 121), 173425#(<= main_~i~0 122), 173430#(<= main_~i~0 127), 173431#(<= main_~i~0 128), 173428#(<= main_~i~0 125), 173429#(<= main_~i~0 126), 173434#(<= main_~i~0 131), 173435#(<= main_~i~0 132), 173432#(<= main_~i~0 129), 173433#(<= main_~i~0 130), 173438#(<= main_~i~0 135), 173439#(<= main_~i~0 136), 173436#(<= main_~i~0 133), 173437#(<= main_~i~0 134), 173442#(<= main_~i~0 139), 173443#(<= main_~i~0 140), 173440#(<= main_~i~0 137), 173441#(<= main_~i~0 138), 173446#(<= main_~i~0 143), 173447#(<= main_~i~0 144), 173444#(<= main_~i~0 141), 173445#(<= main_~i~0 142), 173450#(<= main_~i~0 147), 173451#(<= main_~i~0 148), 173448#(<= main_~i~0 145), 173449#(<= main_~i~0 146), 173454#(<= main_~i~0 151), 173455#(<= main_~i~0 152), 173452#(<= main_~i~0 149), 173453#(<= main_~i~0 150), 173456#(<= main_~i~0 153), 173457#(<= main_~i~0 154), 173302#false, 173303#(<= main_~i~0 0), 173301#true, 173306#(<= main_~i~0 3), 173307#(<= main_~i~0 4), 173304#(<= main_~i~0 1), 173305#(<= main_~i~0 2), 173310#(<= main_~i~0 7), 173311#(<= main_~i~0 8), 173308#(<= main_~i~0 5), 173309#(<= main_~i~0 6)] [2018-04-13 03:37:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 47441 backedges. 0 proven. 47432 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-04-13 03:37:18,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-04-13 03:37:18,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 03:37:18,495 INFO L87 Difference]: Start difference. First operand 637 states and 638 transitions. Second operand 157 states. [2018-04-13 03:37:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:37:29,681 INFO L93 Difference]: Finished difference Result 1412 states and 1565 transitions. [2018-04-13 03:37:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-04-13 03:37:29,681 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 636 [2018-04-13 03:37:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:37:29,682 INFO L225 Difference]: With dead ends: 1412 [2018-04-13 03:37:29,682 INFO L226 Difference]: Without dead ends: 1412 [2018-04-13 03:37:29,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 03:37:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-04-13 03:37:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 641. [2018-04-13 03:37:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-04-13 03:37:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 642 transitions. [2018-04-13 03:37:29,685 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 642 transitions. Word has length 636 [2018-04-13 03:37:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:37:29,685 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 642 transitions. [2018-04-13 03:37:29,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-04-13 03:37:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 642 transitions. [2018-04-13 03:37:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-04-13 03:37:29,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:37:29,687 INFO L355 BasicCegarLoop]: trace histogram [156, 155, 155, 155, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:37:29,687 INFO L408 AbstractCegarLoop]: === Iteration 156 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:37:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1148426819, now seen corresponding path program 154 times [2018-04-13 03:37:29,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:37:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:37:29,703 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:37:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 48059 backedges. 0 proven. 48050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:34,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:37:34,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-04-13 03:37:34,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:37:34,274 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-13 03:37:34,274 INFO L182 omatonBuilderFactory]: Interpolants [175618#(<= main_~i~0 105), 175619#(<= main_~i~0 106), 175616#(<= main_~i~0 103), 175617#(<= main_~i~0 104), 175622#(<= main_~i~0 109), 175623#(<= main_~i~0 110), 175620#(<= main_~i~0 107), 175621#(<= main_~i~0 108), 175626#(<= main_~i~0 113), 175627#(<= main_~i~0 114), 175624#(<= main_~i~0 111), 175625#(<= main_~i~0 112), 175630#(<= main_~i~0 117), 175631#(<= main_~i~0 118), 175628#(<= main_~i~0 115), 175629#(<= main_~i~0 116), 175634#(<= main_~i~0 121), 175635#(<= main_~i~0 122), 175632#(<= main_~i~0 119), 175633#(<= main_~i~0 120), 175638#(<= main_~i~0 125), 175639#(<= main_~i~0 126), 175636#(<= main_~i~0 123), 175637#(<= main_~i~0 124), 175642#(<= main_~i~0 129), 175643#(<= main_~i~0 130), 175640#(<= main_~i~0 127), 175641#(<= main_~i~0 128), 175646#(<= main_~i~0 133), 175647#(<= main_~i~0 134), 175644#(<= main_~i~0 131), 175645#(<= main_~i~0 132), 175650#(<= main_~i~0 137), 175651#(<= main_~i~0 138), 175648#(<= main_~i~0 135), 175649#(<= main_~i~0 136), 175654#(<= main_~i~0 141), 175655#(<= main_~i~0 142), 175652#(<= main_~i~0 139), 175653#(<= main_~i~0 140), 175658#(<= main_~i~0 145), 175659#(<= main_~i~0 146), 175656#(<= main_~i~0 143), 175657#(<= main_~i~0 144), 175662#(<= main_~i~0 149), 175663#(<= main_~i~0 150), 175660#(<= main_~i~0 147), 175661#(<= main_~i~0 148), 175666#(<= main_~i~0 153), 175667#(<= main_~i~0 154), 175664#(<= main_~i~0 151), 175665#(<= main_~i~0 152), 175668#(<= main_~i~0 155), 175511#true, 175514#(<= main_~i~0 1), 175515#(<= main_~i~0 2), 175512#false, 175513#(<= main_~i~0 0), 175518#(<= main_~i~0 5), 175519#(<= main_~i~0 6), 175516#(<= main_~i~0 3), 175517#(<= main_~i~0 4), 175522#(<= main_~i~0 9), 175523#(<= main_~i~0 10), 175520#(<= main_~i~0 7), 175521#(<= main_~i~0 8), 175526#(<= main_~i~0 13), 175527#(<= main_~i~0 14), 175524#(<= main_~i~0 11), 175525#(<= main_~i~0 12), 175530#(<= main_~i~0 17), 175531#(<= main_~i~0 18), 175528#(<= main_~i~0 15), 175529#(<= main_~i~0 16), 175534#(<= main_~i~0 21), 175535#(<= main_~i~0 22), 175532#(<= main_~i~0 19), 175533#(<= main_~i~0 20), 175538#(<= main_~i~0 25), 175539#(<= main_~i~0 26), 175536#(<= main_~i~0 23), 175537#(<= main_~i~0 24), 175542#(<= main_~i~0 29), 175543#(<= main_~i~0 30), 175540#(<= main_~i~0 27), 175541#(<= main_~i~0 28), 175546#(<= main_~i~0 33), 175547#(<= main_~i~0 34), 175544#(<= main_~i~0 31), 175545#(<= main_~i~0 32), 175550#(<= main_~i~0 37), 175551#(<= main_~i~0 38), 175548#(<= main_~i~0 35), 175549#(<= main_~i~0 36), 175554#(<= main_~i~0 41), 175555#(<= main_~i~0 42), 175552#(<= main_~i~0 39), 175553#(<= main_~i~0 40), 175558#(<= main_~i~0 45), 175559#(<= main_~i~0 46), 175556#(<= main_~i~0 43), 175557#(<= main_~i~0 44), 175562#(<= main_~i~0 49), 175563#(<= main_~i~0 50), 175560#(<= main_~i~0 47), 175561#(<= main_~i~0 48), 175566#(<= main_~i~0 53), 175567#(<= main_~i~0 54), 175564#(<= main_~i~0 51), 175565#(<= main_~i~0 52), 175570#(<= main_~i~0 57), 175571#(<= main_~i~0 58), 175568#(<= main_~i~0 55), 175569#(<= main_~i~0 56), 175574#(<= main_~i~0 61), 175575#(<= main_~i~0 62), 175572#(<= main_~i~0 59), 175573#(<= main_~i~0 60), 175578#(<= main_~i~0 65), 175579#(<= main_~i~0 66), 175576#(<= main_~i~0 63), 175577#(<= main_~i~0 64), 175582#(<= main_~i~0 69), 175583#(<= main_~i~0 70), 175580#(<= main_~i~0 67), 175581#(<= main_~i~0 68), 175586#(<= main_~i~0 73), 175587#(<= main_~i~0 74), 175584#(<= main_~i~0 71), 175585#(<= main_~i~0 72), 175590#(<= main_~i~0 77), 175591#(<= main_~i~0 78), 175588#(<= main_~i~0 75), 175589#(<= main_~i~0 76), 175594#(<= main_~i~0 81), 175595#(<= main_~i~0 82), 175592#(<= main_~i~0 79), 175593#(<= main_~i~0 80), 175598#(<= main_~i~0 85), 175599#(<= main_~i~0 86), 175596#(<= main_~i~0 83), 175597#(<= main_~i~0 84), 175602#(<= main_~i~0 89), 175603#(<= main_~i~0 90), 175600#(<= main_~i~0 87), 175601#(<= main_~i~0 88), 175606#(<= main_~i~0 93), 175607#(<= main_~i~0 94), 175604#(<= main_~i~0 91), 175605#(<= main_~i~0 92), 175610#(<= main_~i~0 97), 175611#(<= main_~i~0 98), 175608#(<= main_~i~0 95), 175609#(<= main_~i~0 96), 175614#(<= main_~i~0 101), 175615#(<= main_~i~0 102), 175612#(<= main_~i~0 99), 175613#(<= main_~i~0 100)] [2018-04-13 03:37:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 48059 backedges. 0 proven. 48050 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-04-13 03:37:34,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-04-13 03:37:34,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-04-13 03:37:34,277 INFO L87 Difference]: Start difference. First operand 641 states and 642 transitions. Second operand 158 states. [2018-04-13 03:37:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:37:43,333 INFO L93 Difference]: Finished difference Result 1421 states and 1575 transitions. [2018-04-13 03:37:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-04-13 03:37:43,333 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 640 [2018-04-13 03:37:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:37:43,334 INFO L225 Difference]: With dead ends: 1421 [2018-04-13 03:37:43,334 INFO L226 Difference]: Without dead ends: 1421 [2018-04-13 03:37:43,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-04-13 03:37:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-04-13 03:37:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 645. [2018-04-13 03:37:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-04-13 03:37:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 646 transitions. [2018-04-13 03:37:43,338 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 646 transitions. Word has length 640 [2018-04-13 03:37:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:37:43,338 INFO L459 AbstractCegarLoop]: Abstraction has 645 states and 646 transitions. [2018-04-13 03:37:43,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-04-13 03:37:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 646 transitions. [2018-04-13 03:37:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2018-04-13 03:37:43,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:37:43,340 INFO L355 BasicCegarLoop]: trace histogram [157, 156, 156, 156, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:37:43,340 INFO L408 AbstractCegarLoop]: === Iteration 157 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:37:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2063648074, now seen corresponding path program 155 times [2018-04-13 03:37:43,340 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:37:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:37:43,356 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:37:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 48681 backedges. 0 proven. 48672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:47,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:37:47,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-04-13 03:37:47,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:37:47,961 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-13 03:37:47,961 INFO L182 omatonBuilderFactory]: Interpolants [177735#true, 177738#(<= main_~i~0 1), 177739#(<= main_~i~0 2), 177736#false, 177737#(<= main_~i~0 0), 177742#(<= main_~i~0 5), 177743#(<= main_~i~0 6), 177740#(<= main_~i~0 3), 177741#(<= main_~i~0 4), 177746#(<= main_~i~0 9), 177747#(<= main_~i~0 10), 177744#(<= main_~i~0 7), 177745#(<= main_~i~0 8), 177750#(<= main_~i~0 13), 177751#(<= main_~i~0 14), 177748#(<= main_~i~0 11), 177749#(<= main_~i~0 12), 177754#(<= main_~i~0 17), 177755#(<= main_~i~0 18), 177752#(<= main_~i~0 15), 177753#(<= main_~i~0 16), 177758#(<= main_~i~0 21), 177759#(<= main_~i~0 22), 177756#(<= main_~i~0 19), 177757#(<= main_~i~0 20), 177762#(<= main_~i~0 25), 177763#(<= main_~i~0 26), 177760#(<= main_~i~0 23), 177761#(<= main_~i~0 24), 177766#(<= main_~i~0 29), 177767#(<= main_~i~0 30), 177764#(<= main_~i~0 27), 177765#(<= main_~i~0 28), 177770#(<= main_~i~0 33), 177771#(<= main_~i~0 34), 177768#(<= main_~i~0 31), 177769#(<= main_~i~0 32), 177774#(<= main_~i~0 37), 177775#(<= main_~i~0 38), 177772#(<= main_~i~0 35), 177773#(<= main_~i~0 36), 177778#(<= main_~i~0 41), 177779#(<= main_~i~0 42), 177776#(<= main_~i~0 39), 177777#(<= main_~i~0 40), 177782#(<= main_~i~0 45), 177783#(<= main_~i~0 46), 177780#(<= main_~i~0 43), 177781#(<= main_~i~0 44), 177786#(<= main_~i~0 49), 177787#(<= main_~i~0 50), 177784#(<= main_~i~0 47), 177785#(<= main_~i~0 48), 177790#(<= main_~i~0 53), 177791#(<= main_~i~0 54), 177788#(<= main_~i~0 51), 177789#(<= main_~i~0 52), 177794#(<= main_~i~0 57), 177795#(<= main_~i~0 58), 177792#(<= main_~i~0 55), 177793#(<= main_~i~0 56), 177798#(<= main_~i~0 61), 177799#(<= main_~i~0 62), 177796#(<= main_~i~0 59), 177797#(<= main_~i~0 60), 177802#(<= main_~i~0 65), 177803#(<= main_~i~0 66), 177800#(<= main_~i~0 63), 177801#(<= main_~i~0 64), 177806#(<= main_~i~0 69), 177807#(<= main_~i~0 70), 177804#(<= main_~i~0 67), 177805#(<= main_~i~0 68), 177810#(<= main_~i~0 73), 177811#(<= main_~i~0 74), 177808#(<= main_~i~0 71), 177809#(<= main_~i~0 72), 177814#(<= main_~i~0 77), 177815#(<= main_~i~0 78), 177812#(<= main_~i~0 75), 177813#(<= main_~i~0 76), 177818#(<= main_~i~0 81), 177819#(<= main_~i~0 82), 177816#(<= main_~i~0 79), 177817#(<= main_~i~0 80), 177822#(<= main_~i~0 85), 177823#(<= main_~i~0 86), 177820#(<= main_~i~0 83), 177821#(<= main_~i~0 84), 177826#(<= main_~i~0 89), 177827#(<= main_~i~0 90), 177824#(<= main_~i~0 87), 177825#(<= main_~i~0 88), 177830#(<= main_~i~0 93), 177831#(<= main_~i~0 94), 177828#(<= main_~i~0 91), 177829#(<= main_~i~0 92), 177834#(<= main_~i~0 97), 177835#(<= main_~i~0 98), 177832#(<= main_~i~0 95), 177833#(<= main_~i~0 96), 177838#(<= main_~i~0 101), 177839#(<= main_~i~0 102), 177836#(<= main_~i~0 99), 177837#(<= main_~i~0 100), 177842#(<= main_~i~0 105), 177843#(<= main_~i~0 106), 177840#(<= main_~i~0 103), 177841#(<= main_~i~0 104), 177846#(<= main_~i~0 109), 177847#(<= main_~i~0 110), 177844#(<= main_~i~0 107), 177845#(<= main_~i~0 108), 177850#(<= main_~i~0 113), 177851#(<= main_~i~0 114), 177848#(<= main_~i~0 111), 177849#(<= main_~i~0 112), 177854#(<= main_~i~0 117), 177855#(<= main_~i~0 118), 177852#(<= main_~i~0 115), 177853#(<= main_~i~0 116), 177858#(<= main_~i~0 121), 177859#(<= main_~i~0 122), 177856#(<= main_~i~0 119), 177857#(<= main_~i~0 120), 177862#(<= main_~i~0 125), 177863#(<= main_~i~0 126), 177860#(<= main_~i~0 123), 177861#(<= main_~i~0 124), 177866#(<= main_~i~0 129), 177867#(<= main_~i~0 130), 177864#(<= main_~i~0 127), 177865#(<= main_~i~0 128), 177870#(<= main_~i~0 133), 177871#(<= main_~i~0 134), 177868#(<= main_~i~0 131), 177869#(<= main_~i~0 132), 177874#(<= main_~i~0 137), 177875#(<= main_~i~0 138), 177872#(<= main_~i~0 135), 177873#(<= main_~i~0 136), 177878#(<= main_~i~0 141), 177879#(<= main_~i~0 142), 177876#(<= main_~i~0 139), 177877#(<= main_~i~0 140), 177882#(<= main_~i~0 145), 177883#(<= main_~i~0 146), 177880#(<= main_~i~0 143), 177881#(<= main_~i~0 144), 177886#(<= main_~i~0 149), 177887#(<= main_~i~0 150), 177884#(<= main_~i~0 147), 177885#(<= main_~i~0 148), 177890#(<= main_~i~0 153), 177891#(<= main_~i~0 154), 177888#(<= main_~i~0 151), 177889#(<= main_~i~0 152), 177892#(<= main_~i~0 155), 177893#(<= main_~i~0 156)] [2018-04-13 03:37:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 48681 backedges. 0 proven. 48672 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:37:47,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-04-13 03:37:47,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-04-13 03:37:47,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-04-13 03:37:47,963 INFO L87 Difference]: Start difference. First operand 645 states and 646 transitions. Second operand 159 states. [2018-04-13 03:37:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:37:59,536 INFO L93 Difference]: Finished difference Result 1430 states and 1585 transitions. [2018-04-13 03:37:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-04-13 03:37:59,537 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 644 [2018-04-13 03:37:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:37:59,537 INFO L225 Difference]: With dead ends: 1430 [2018-04-13 03:37:59,537 INFO L226 Difference]: Without dead ends: 1430 [2018-04-13 03:37:59,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-04-13 03:37:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-04-13 03:37:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 649. [2018-04-13 03:37:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-04-13 03:37:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 650 transitions. [2018-04-13 03:37:59,541 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 650 transitions. Word has length 644 [2018-04-13 03:37:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:37:59,541 INFO L459 AbstractCegarLoop]: Abstraction has 649 states and 650 transitions. [2018-04-13 03:37:59,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-04-13 03:37:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 650 transitions. [2018-04-13 03:37:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-04-13 03:37:59,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:37:59,543 INFO L355 BasicCegarLoop]: trace histogram [158, 157, 157, 157, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:37:59,543 INFO L408 AbstractCegarLoop]: === Iteration 158 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:37:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash -23270609, now seen corresponding path program 156 times [2018-04-13 03:37:59,543 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:37:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:37:59,559 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:38:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 49307 backedges. 0 proven. 49298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:04,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:38:04,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-04-13 03:38:04,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:38:04,441 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-13 03:38:04,441 INFO L182 omatonBuilderFactory]: Interpolants [179974#false, 179975#(<= main_~i~0 0), 179973#true, 179978#(<= main_~i~0 3), 179979#(<= main_~i~0 4), 179976#(<= main_~i~0 1), 179977#(<= main_~i~0 2), 179982#(<= main_~i~0 7), 179983#(<= main_~i~0 8), 179980#(<= main_~i~0 5), 179981#(<= main_~i~0 6), 179986#(<= main_~i~0 11), 179987#(<= main_~i~0 12), 179984#(<= main_~i~0 9), 179985#(<= main_~i~0 10), 179990#(<= main_~i~0 15), 179991#(<= main_~i~0 16), 179988#(<= main_~i~0 13), 179989#(<= main_~i~0 14), 179994#(<= main_~i~0 19), 179995#(<= main_~i~0 20), 179992#(<= main_~i~0 17), 179993#(<= main_~i~0 18), 179998#(<= main_~i~0 23), 179999#(<= main_~i~0 24), 179996#(<= main_~i~0 21), 179997#(<= main_~i~0 22), 180002#(<= main_~i~0 27), 180003#(<= main_~i~0 28), 180000#(<= main_~i~0 25), 180001#(<= main_~i~0 26), 180006#(<= main_~i~0 31), 180007#(<= main_~i~0 32), 180004#(<= main_~i~0 29), 180005#(<= main_~i~0 30), 180010#(<= main_~i~0 35), 180011#(<= main_~i~0 36), 180008#(<= main_~i~0 33), 180009#(<= main_~i~0 34), 180014#(<= main_~i~0 39), 180015#(<= main_~i~0 40), 180012#(<= main_~i~0 37), 180013#(<= main_~i~0 38), 180018#(<= main_~i~0 43), 180019#(<= main_~i~0 44), 180016#(<= main_~i~0 41), 180017#(<= main_~i~0 42), 180022#(<= main_~i~0 47), 180023#(<= main_~i~0 48), 180020#(<= main_~i~0 45), 180021#(<= main_~i~0 46), 180026#(<= main_~i~0 51), 180027#(<= main_~i~0 52), 180024#(<= main_~i~0 49), 180025#(<= main_~i~0 50), 180030#(<= main_~i~0 55), 180031#(<= main_~i~0 56), 180028#(<= main_~i~0 53), 180029#(<= main_~i~0 54), 180034#(<= main_~i~0 59), 180035#(<= main_~i~0 60), 180032#(<= main_~i~0 57), 180033#(<= main_~i~0 58), 180038#(<= main_~i~0 63), 180039#(<= main_~i~0 64), 180036#(<= main_~i~0 61), 180037#(<= main_~i~0 62), 180042#(<= main_~i~0 67), 180043#(<= main_~i~0 68), 180040#(<= main_~i~0 65), 180041#(<= main_~i~0 66), 180046#(<= main_~i~0 71), 180047#(<= main_~i~0 72), 180044#(<= main_~i~0 69), 180045#(<= main_~i~0 70), 180050#(<= main_~i~0 75), 180051#(<= main_~i~0 76), 180048#(<= main_~i~0 73), 180049#(<= main_~i~0 74), 180054#(<= main_~i~0 79), 180055#(<= main_~i~0 80), 180052#(<= main_~i~0 77), 180053#(<= main_~i~0 78), 180058#(<= main_~i~0 83), 180059#(<= main_~i~0 84), 180056#(<= main_~i~0 81), 180057#(<= main_~i~0 82), 180062#(<= main_~i~0 87), 180063#(<= main_~i~0 88), 180060#(<= main_~i~0 85), 180061#(<= main_~i~0 86), 180066#(<= main_~i~0 91), 180067#(<= main_~i~0 92), 180064#(<= main_~i~0 89), 180065#(<= main_~i~0 90), 180070#(<= main_~i~0 95), 180071#(<= main_~i~0 96), 180068#(<= main_~i~0 93), 180069#(<= main_~i~0 94), 180074#(<= main_~i~0 99), 180075#(<= main_~i~0 100), 180072#(<= main_~i~0 97), 180073#(<= main_~i~0 98), 180078#(<= main_~i~0 103), 180079#(<= main_~i~0 104), 180076#(<= main_~i~0 101), 180077#(<= main_~i~0 102), 180082#(<= main_~i~0 107), 180083#(<= main_~i~0 108), 180080#(<= main_~i~0 105), 180081#(<= main_~i~0 106), 180086#(<= main_~i~0 111), 180087#(<= main_~i~0 112), 180084#(<= main_~i~0 109), 180085#(<= main_~i~0 110), 180090#(<= main_~i~0 115), 180091#(<= main_~i~0 116), 180088#(<= main_~i~0 113), 180089#(<= main_~i~0 114), 180094#(<= main_~i~0 119), 180095#(<= main_~i~0 120), 180092#(<= main_~i~0 117), 180093#(<= main_~i~0 118), 180098#(<= main_~i~0 123), 180099#(<= main_~i~0 124), 180096#(<= main_~i~0 121), 180097#(<= main_~i~0 122), 180102#(<= main_~i~0 127), 180103#(<= main_~i~0 128), 180100#(<= main_~i~0 125), 180101#(<= main_~i~0 126), 180106#(<= main_~i~0 131), 180107#(<= main_~i~0 132), 180104#(<= main_~i~0 129), 180105#(<= main_~i~0 130), 180110#(<= main_~i~0 135), 180111#(<= main_~i~0 136), 180108#(<= main_~i~0 133), 180109#(<= main_~i~0 134), 180114#(<= main_~i~0 139), 180115#(<= main_~i~0 140), 180112#(<= main_~i~0 137), 180113#(<= main_~i~0 138), 180118#(<= main_~i~0 143), 180119#(<= main_~i~0 144), 180116#(<= main_~i~0 141), 180117#(<= main_~i~0 142), 180122#(<= main_~i~0 147), 180123#(<= main_~i~0 148), 180120#(<= main_~i~0 145), 180121#(<= main_~i~0 146), 180126#(<= main_~i~0 151), 180127#(<= main_~i~0 152), 180124#(<= main_~i~0 149), 180125#(<= main_~i~0 150), 180130#(<= main_~i~0 155), 180131#(<= main_~i~0 156), 180128#(<= main_~i~0 153), 180129#(<= main_~i~0 154), 180132#(<= main_~i~0 157)] [2018-04-13 03:38:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49307 backedges. 0 proven. 49298 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:04,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-04-13 03:38:04,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-04-13 03:38:04,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 03:38:04,444 INFO L87 Difference]: Start difference. First operand 649 states and 650 transitions. Second operand 160 states. [2018-04-13 03:38:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:38:17,884 INFO L93 Difference]: Finished difference Result 1439 states and 1595 transitions. [2018-04-13 03:38:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-04-13 03:38:17,884 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 648 [2018-04-13 03:38:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:38:17,885 INFO L225 Difference]: With dead ends: 1439 [2018-04-13 03:38:17,885 INFO L226 Difference]: Without dead ends: 1439 [2018-04-13 03:38:17,886 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 03:38:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2018-04-13 03:38:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 653. [2018-04-13 03:38:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-04-13 03:38:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 654 transitions. [2018-04-13 03:38:17,888 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 654 transitions. Word has length 648 [2018-04-13 03:38:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:38:17,888 INFO L459 AbstractCegarLoop]: Abstraction has 653 states and 654 transitions. [2018-04-13 03:38:17,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-04-13 03:38:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 654 transitions. [2018-04-13 03:38:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-04-13 03:38:17,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:38:17,890 INFO L355 BasicCegarLoop]: trace histogram [159, 158, 158, 158, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:38:17,890 INFO L408 AbstractCegarLoop]: === Iteration 159 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:38:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash 411809576, now seen corresponding path program 157 times [2018-04-13 03:38:17,891 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:38:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:38:17,907 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:38:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49937 backedges. 0 proven. 49928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:22,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:38:22,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-04-13 03:38:22,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:38:22,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-13 03:38:22,639 INFO L182 omatonBuilderFactory]: Interpolants [182274#(<= main_~i~0 47), 182275#(<= main_~i~0 48), 182272#(<= main_~i~0 45), 182273#(<= main_~i~0 46), 182278#(<= main_~i~0 51), 182279#(<= main_~i~0 52), 182276#(<= main_~i~0 49), 182277#(<= main_~i~0 50), 182282#(<= main_~i~0 55), 182283#(<= main_~i~0 56), 182280#(<= main_~i~0 53), 182281#(<= main_~i~0 54), 182286#(<= main_~i~0 59), 182287#(<= main_~i~0 60), 182284#(<= main_~i~0 57), 182285#(<= main_~i~0 58), 182290#(<= main_~i~0 63), 182291#(<= main_~i~0 64), 182288#(<= main_~i~0 61), 182289#(<= main_~i~0 62), 182294#(<= main_~i~0 67), 182295#(<= main_~i~0 68), 182292#(<= main_~i~0 65), 182293#(<= main_~i~0 66), 182298#(<= main_~i~0 71), 182299#(<= main_~i~0 72), 182296#(<= main_~i~0 69), 182297#(<= main_~i~0 70), 182302#(<= main_~i~0 75), 182303#(<= main_~i~0 76), 182300#(<= main_~i~0 73), 182301#(<= main_~i~0 74), 182306#(<= main_~i~0 79), 182307#(<= main_~i~0 80), 182304#(<= main_~i~0 77), 182305#(<= main_~i~0 78), 182310#(<= main_~i~0 83), 182311#(<= main_~i~0 84), 182308#(<= main_~i~0 81), 182309#(<= main_~i~0 82), 182314#(<= main_~i~0 87), 182315#(<= main_~i~0 88), 182312#(<= main_~i~0 85), 182313#(<= main_~i~0 86), 182318#(<= main_~i~0 91), 182319#(<= main_~i~0 92), 182316#(<= main_~i~0 89), 182317#(<= main_~i~0 90), 182322#(<= main_~i~0 95), 182323#(<= main_~i~0 96), 182320#(<= main_~i~0 93), 182321#(<= main_~i~0 94), 182326#(<= main_~i~0 99), 182327#(<= main_~i~0 100), 182324#(<= main_~i~0 97), 182325#(<= main_~i~0 98), 182330#(<= main_~i~0 103), 182331#(<= main_~i~0 104), 182328#(<= main_~i~0 101), 182329#(<= main_~i~0 102), 182334#(<= main_~i~0 107), 182335#(<= main_~i~0 108), 182332#(<= main_~i~0 105), 182333#(<= main_~i~0 106), 182338#(<= main_~i~0 111), 182339#(<= main_~i~0 112), 182336#(<= main_~i~0 109), 182337#(<= main_~i~0 110), 182342#(<= main_~i~0 115), 182343#(<= main_~i~0 116), 182340#(<= main_~i~0 113), 182341#(<= main_~i~0 114), 182346#(<= main_~i~0 119), 182347#(<= main_~i~0 120), 182344#(<= main_~i~0 117), 182345#(<= main_~i~0 118), 182350#(<= main_~i~0 123), 182351#(<= main_~i~0 124), 182348#(<= main_~i~0 121), 182349#(<= main_~i~0 122), 182354#(<= main_~i~0 127), 182355#(<= main_~i~0 128), 182352#(<= main_~i~0 125), 182353#(<= main_~i~0 126), 182358#(<= main_~i~0 131), 182359#(<= main_~i~0 132), 182356#(<= main_~i~0 129), 182357#(<= main_~i~0 130), 182362#(<= main_~i~0 135), 182363#(<= main_~i~0 136), 182360#(<= main_~i~0 133), 182361#(<= main_~i~0 134), 182366#(<= main_~i~0 139), 182367#(<= main_~i~0 140), 182364#(<= main_~i~0 137), 182365#(<= main_~i~0 138), 182370#(<= main_~i~0 143), 182371#(<= main_~i~0 144), 182368#(<= main_~i~0 141), 182369#(<= main_~i~0 142), 182374#(<= main_~i~0 147), 182375#(<= main_~i~0 148), 182372#(<= main_~i~0 145), 182373#(<= main_~i~0 146), 182378#(<= main_~i~0 151), 182379#(<= main_~i~0 152), 182376#(<= main_~i~0 149), 182377#(<= main_~i~0 150), 182382#(<= main_~i~0 155), 182383#(<= main_~i~0 156), 182380#(<= main_~i~0 153), 182381#(<= main_~i~0 154), 182384#(<= main_~i~0 157), 182385#(<= main_~i~0 158), 182226#false, 182227#(<= main_~i~0 0), 182225#true, 182230#(<= main_~i~0 3), 182231#(<= main_~i~0 4), 182228#(<= main_~i~0 1), 182229#(<= main_~i~0 2), 182234#(<= main_~i~0 7), 182235#(<= main_~i~0 8), 182232#(<= main_~i~0 5), 182233#(<= main_~i~0 6), 182238#(<= main_~i~0 11), 182239#(<= main_~i~0 12), 182236#(<= main_~i~0 9), 182237#(<= main_~i~0 10), 182242#(<= main_~i~0 15), 182243#(<= main_~i~0 16), 182240#(<= main_~i~0 13), 182241#(<= main_~i~0 14), 182246#(<= main_~i~0 19), 182247#(<= main_~i~0 20), 182244#(<= main_~i~0 17), 182245#(<= main_~i~0 18), 182250#(<= main_~i~0 23), 182251#(<= main_~i~0 24), 182248#(<= main_~i~0 21), 182249#(<= main_~i~0 22), 182254#(<= main_~i~0 27), 182255#(<= main_~i~0 28), 182252#(<= main_~i~0 25), 182253#(<= main_~i~0 26), 182258#(<= main_~i~0 31), 182259#(<= main_~i~0 32), 182256#(<= main_~i~0 29), 182257#(<= main_~i~0 30), 182262#(<= main_~i~0 35), 182263#(<= main_~i~0 36), 182260#(<= main_~i~0 33), 182261#(<= main_~i~0 34), 182266#(<= main_~i~0 39), 182267#(<= main_~i~0 40), 182264#(<= main_~i~0 37), 182265#(<= main_~i~0 38), 182270#(<= main_~i~0 43), 182271#(<= main_~i~0 44), 182268#(<= main_~i~0 41), 182269#(<= main_~i~0 42)] [2018-04-13 03:38:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 49937 backedges. 0 proven. 49928 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:22,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-04-13 03:38:22,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-04-13 03:38:22,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-04-13 03:38:22,642 INFO L87 Difference]: Start difference. First operand 653 states and 654 transitions. Second operand 161 states. [2018-04-13 03:38:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:38:32,172 INFO L93 Difference]: Finished difference Result 1448 states and 1605 transitions. [2018-04-13 03:38:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-04-13 03:38:32,172 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 652 [2018-04-13 03:38:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:38:32,173 INFO L225 Difference]: With dead ends: 1448 [2018-04-13 03:38:32,173 INFO L226 Difference]: Without dead ends: 1448 [2018-04-13 03:38:32,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-04-13 03:38:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-04-13 03:38:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 657. [2018-04-13 03:38:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-04-13 03:38:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 658 transitions. [2018-04-13 03:38:32,176 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 658 transitions. Word has length 652 [2018-04-13 03:38:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:38:32,176 INFO L459 AbstractCegarLoop]: Abstraction has 657 states and 658 transitions. [2018-04-13 03:38:32,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-04-13 03:38:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 658 transitions. [2018-04-13 03:38:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-04-13 03:38:32,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:38:32,178 INFO L355 BasicCegarLoop]: trace histogram [160, 159, 159, 159, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:38:32,178 INFO L408 AbstractCegarLoop]: === Iteration 160 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:38:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -976101727, now seen corresponding path program 158 times [2018-04-13 03:38:32,179 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:38:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:38:32,195 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:38:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 50571 backedges. 0 proven. 50562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:36,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:38:36,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-04-13 03:38:36,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:38:36,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-13 03:38:36,912 INFO L182 omatonBuilderFactory]: Interpolants [184578#(<= main_~i~0 85), 184579#(<= main_~i~0 86), 184576#(<= main_~i~0 83), 184577#(<= main_~i~0 84), 184582#(<= main_~i~0 89), 184583#(<= main_~i~0 90), 184580#(<= main_~i~0 87), 184581#(<= main_~i~0 88), 184586#(<= main_~i~0 93), 184587#(<= main_~i~0 94), 184584#(<= main_~i~0 91), 184585#(<= main_~i~0 92), 184590#(<= main_~i~0 97), 184591#(<= main_~i~0 98), 184588#(<= main_~i~0 95), 184589#(<= main_~i~0 96), 184594#(<= main_~i~0 101), 184595#(<= main_~i~0 102), 184592#(<= main_~i~0 99), 184593#(<= main_~i~0 100), 184598#(<= main_~i~0 105), 184599#(<= main_~i~0 106), 184596#(<= main_~i~0 103), 184597#(<= main_~i~0 104), 184602#(<= main_~i~0 109), 184603#(<= main_~i~0 110), 184600#(<= main_~i~0 107), 184601#(<= main_~i~0 108), 184606#(<= main_~i~0 113), 184607#(<= main_~i~0 114), 184604#(<= main_~i~0 111), 184605#(<= main_~i~0 112), 184610#(<= main_~i~0 117), 184611#(<= main_~i~0 118), 184608#(<= main_~i~0 115), 184609#(<= main_~i~0 116), 184614#(<= main_~i~0 121), 184615#(<= main_~i~0 122), 184612#(<= main_~i~0 119), 184613#(<= main_~i~0 120), 184618#(<= main_~i~0 125), 184619#(<= main_~i~0 126), 184616#(<= main_~i~0 123), 184617#(<= main_~i~0 124), 184622#(<= main_~i~0 129), 184623#(<= main_~i~0 130), 184620#(<= main_~i~0 127), 184621#(<= main_~i~0 128), 184626#(<= main_~i~0 133), 184627#(<= main_~i~0 134), 184624#(<= main_~i~0 131), 184625#(<= main_~i~0 132), 184630#(<= main_~i~0 137), 184631#(<= main_~i~0 138), 184628#(<= main_~i~0 135), 184629#(<= main_~i~0 136), 184634#(<= main_~i~0 141), 184635#(<= main_~i~0 142), 184632#(<= main_~i~0 139), 184633#(<= main_~i~0 140), 184638#(<= main_~i~0 145), 184639#(<= main_~i~0 146), 184636#(<= main_~i~0 143), 184637#(<= main_~i~0 144), 184642#(<= main_~i~0 149), 184643#(<= main_~i~0 150), 184640#(<= main_~i~0 147), 184641#(<= main_~i~0 148), 184646#(<= main_~i~0 153), 184647#(<= main_~i~0 154), 184644#(<= main_~i~0 151), 184645#(<= main_~i~0 152), 184650#(<= main_~i~0 157), 184651#(<= main_~i~0 158), 184648#(<= main_~i~0 155), 184649#(<= main_~i~0 156), 184652#(<= main_~i~0 159), 184491#true, 184494#(<= main_~i~0 1), 184495#(<= main_~i~0 2), 184492#false, 184493#(<= main_~i~0 0), 184498#(<= main_~i~0 5), 184499#(<= main_~i~0 6), 184496#(<= main_~i~0 3), 184497#(<= main_~i~0 4), 184502#(<= main_~i~0 9), 184503#(<= main_~i~0 10), 184500#(<= main_~i~0 7), 184501#(<= main_~i~0 8), 184506#(<= main_~i~0 13), 184507#(<= main_~i~0 14), 184504#(<= main_~i~0 11), 184505#(<= main_~i~0 12), 184510#(<= main_~i~0 17), 184511#(<= main_~i~0 18), 184508#(<= main_~i~0 15), 184509#(<= main_~i~0 16), 184514#(<= main_~i~0 21), 184515#(<= main_~i~0 22), 184512#(<= main_~i~0 19), 184513#(<= main_~i~0 20), 184518#(<= main_~i~0 25), 184519#(<= main_~i~0 26), 184516#(<= main_~i~0 23), 184517#(<= main_~i~0 24), 184522#(<= main_~i~0 29), 184523#(<= main_~i~0 30), 184520#(<= main_~i~0 27), 184521#(<= main_~i~0 28), 184526#(<= main_~i~0 33), 184527#(<= main_~i~0 34), 184524#(<= main_~i~0 31), 184525#(<= main_~i~0 32), 184530#(<= main_~i~0 37), 184531#(<= main_~i~0 38), 184528#(<= main_~i~0 35), 184529#(<= main_~i~0 36), 184534#(<= main_~i~0 41), 184535#(<= main_~i~0 42), 184532#(<= main_~i~0 39), 184533#(<= main_~i~0 40), 184538#(<= main_~i~0 45), 184539#(<= main_~i~0 46), 184536#(<= main_~i~0 43), 184537#(<= main_~i~0 44), 184542#(<= main_~i~0 49), 184543#(<= main_~i~0 50), 184540#(<= main_~i~0 47), 184541#(<= main_~i~0 48), 184546#(<= main_~i~0 53), 184547#(<= main_~i~0 54), 184544#(<= main_~i~0 51), 184545#(<= main_~i~0 52), 184550#(<= main_~i~0 57), 184551#(<= main_~i~0 58), 184548#(<= main_~i~0 55), 184549#(<= main_~i~0 56), 184554#(<= main_~i~0 61), 184555#(<= main_~i~0 62), 184552#(<= main_~i~0 59), 184553#(<= main_~i~0 60), 184558#(<= main_~i~0 65), 184559#(<= main_~i~0 66), 184556#(<= main_~i~0 63), 184557#(<= main_~i~0 64), 184562#(<= main_~i~0 69), 184563#(<= main_~i~0 70), 184560#(<= main_~i~0 67), 184561#(<= main_~i~0 68), 184566#(<= main_~i~0 73), 184567#(<= main_~i~0 74), 184564#(<= main_~i~0 71), 184565#(<= main_~i~0 72), 184570#(<= main_~i~0 77), 184571#(<= main_~i~0 78), 184568#(<= main_~i~0 75), 184569#(<= main_~i~0 76), 184574#(<= main_~i~0 81), 184575#(<= main_~i~0 82), 184572#(<= main_~i~0 79), 184573#(<= main_~i~0 80)] [2018-04-13 03:38:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 50571 backedges. 0 proven. 50562 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:36,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-04-13 03:38:36,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-04-13 03:38:36,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 03:38:36,914 INFO L87 Difference]: Start difference. First operand 657 states and 658 transitions. Second operand 162 states. [2018-04-13 03:38:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:38:45,901 INFO L93 Difference]: Finished difference Result 1457 states and 1615 transitions. [2018-04-13 03:38:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-04-13 03:38:45,902 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 656 [2018-04-13 03:38:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:38:45,902 INFO L225 Difference]: With dead ends: 1457 [2018-04-13 03:38:45,902 INFO L226 Difference]: Without dead ends: 1457 [2018-04-13 03:38:45,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 03:38:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-04-13 03:38:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 661. [2018-04-13 03:38:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-04-13 03:38:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 662 transitions. [2018-04-13 03:38:45,906 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 662 transitions. Word has length 656 [2018-04-13 03:38:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:38:45,906 INFO L459 AbstractCegarLoop]: Abstraction has 661 states and 662 transitions. [2018-04-13 03:38:45,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-04-13 03:38:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 662 transitions. [2018-04-13 03:38:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2018-04-13 03:38:45,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:38:45,908 INFO L355 BasicCegarLoop]: trace histogram [161, 160, 160, 160, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:38:45,908 INFO L408 AbstractCegarLoop]: === Iteration 161 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:38:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1940545126, now seen corresponding path program 159 times [2018-04-13 03:38:45,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:38:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:38:45,924 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:38:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 51209 backedges. 0 proven. 51200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:50,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:38:50,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-04-13 03:38:50,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:38:50,797 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-13 03:38:50,797 INFO L182 omatonBuilderFactory]: Interpolants [186882#(<= main_~i~0 109), 186883#(<= main_~i~0 110), 186880#(<= main_~i~0 107), 186881#(<= main_~i~0 108), 186886#(<= main_~i~0 113), 186887#(<= main_~i~0 114), 186884#(<= main_~i~0 111), 186885#(<= main_~i~0 112), 186890#(<= main_~i~0 117), 186891#(<= main_~i~0 118), 186888#(<= main_~i~0 115), 186889#(<= main_~i~0 116), 186894#(<= main_~i~0 121), 186895#(<= main_~i~0 122), 186892#(<= main_~i~0 119), 186893#(<= main_~i~0 120), 186898#(<= main_~i~0 125), 186899#(<= main_~i~0 126), 186896#(<= main_~i~0 123), 186897#(<= main_~i~0 124), 186902#(<= main_~i~0 129), 186903#(<= main_~i~0 130), 186900#(<= main_~i~0 127), 186901#(<= main_~i~0 128), 186906#(<= main_~i~0 133), 186907#(<= main_~i~0 134), 186904#(<= main_~i~0 131), 186905#(<= main_~i~0 132), 186910#(<= main_~i~0 137), 186911#(<= main_~i~0 138), 186908#(<= main_~i~0 135), 186909#(<= main_~i~0 136), 186914#(<= main_~i~0 141), 186915#(<= main_~i~0 142), 186912#(<= main_~i~0 139), 186913#(<= main_~i~0 140), 186918#(<= main_~i~0 145), 186919#(<= main_~i~0 146), 186916#(<= main_~i~0 143), 186917#(<= main_~i~0 144), 186922#(<= main_~i~0 149), 186923#(<= main_~i~0 150), 186920#(<= main_~i~0 147), 186921#(<= main_~i~0 148), 186926#(<= main_~i~0 153), 186927#(<= main_~i~0 154), 186924#(<= main_~i~0 151), 186925#(<= main_~i~0 152), 186930#(<= main_~i~0 157), 186931#(<= main_~i~0 158), 186928#(<= main_~i~0 155), 186929#(<= main_~i~0 156), 186932#(<= main_~i~0 159), 186933#(<= main_~i~0 160), 186771#true, 186774#(<= main_~i~0 1), 186775#(<= main_~i~0 2), 186772#false, 186773#(<= main_~i~0 0), 186778#(<= main_~i~0 5), 186779#(<= main_~i~0 6), 186776#(<= main_~i~0 3), 186777#(<= main_~i~0 4), 186782#(<= main_~i~0 9), 186783#(<= main_~i~0 10), 186780#(<= main_~i~0 7), 186781#(<= main_~i~0 8), 186786#(<= main_~i~0 13), 186787#(<= main_~i~0 14), 186784#(<= main_~i~0 11), 186785#(<= main_~i~0 12), 186790#(<= main_~i~0 17), 186791#(<= main_~i~0 18), 186788#(<= main_~i~0 15), 186789#(<= main_~i~0 16), 186794#(<= main_~i~0 21), 186795#(<= main_~i~0 22), 186792#(<= main_~i~0 19), 186793#(<= main_~i~0 20), 186798#(<= main_~i~0 25), 186799#(<= main_~i~0 26), 186796#(<= main_~i~0 23), 186797#(<= main_~i~0 24), 186802#(<= main_~i~0 29), 186803#(<= main_~i~0 30), 186800#(<= main_~i~0 27), 186801#(<= main_~i~0 28), 186806#(<= main_~i~0 33), 186807#(<= main_~i~0 34), 186804#(<= main_~i~0 31), 186805#(<= main_~i~0 32), 186810#(<= main_~i~0 37), 186811#(<= main_~i~0 38), 186808#(<= main_~i~0 35), 186809#(<= main_~i~0 36), 186814#(<= main_~i~0 41), 186815#(<= main_~i~0 42), 186812#(<= main_~i~0 39), 186813#(<= main_~i~0 40), 186818#(<= main_~i~0 45), 186819#(<= main_~i~0 46), 186816#(<= main_~i~0 43), 186817#(<= main_~i~0 44), 186822#(<= main_~i~0 49), 186823#(<= main_~i~0 50), 186820#(<= main_~i~0 47), 186821#(<= main_~i~0 48), 186826#(<= main_~i~0 53), 186827#(<= main_~i~0 54), 186824#(<= main_~i~0 51), 186825#(<= main_~i~0 52), 186830#(<= main_~i~0 57), 186831#(<= main_~i~0 58), 186828#(<= main_~i~0 55), 186829#(<= main_~i~0 56), 186834#(<= main_~i~0 61), 186835#(<= main_~i~0 62), 186832#(<= main_~i~0 59), 186833#(<= main_~i~0 60), 186838#(<= main_~i~0 65), 186839#(<= main_~i~0 66), 186836#(<= main_~i~0 63), 186837#(<= main_~i~0 64), 186842#(<= main_~i~0 69), 186843#(<= main_~i~0 70), 186840#(<= main_~i~0 67), 186841#(<= main_~i~0 68), 186846#(<= main_~i~0 73), 186847#(<= main_~i~0 74), 186844#(<= main_~i~0 71), 186845#(<= main_~i~0 72), 186850#(<= main_~i~0 77), 186851#(<= main_~i~0 78), 186848#(<= main_~i~0 75), 186849#(<= main_~i~0 76), 186854#(<= main_~i~0 81), 186855#(<= main_~i~0 82), 186852#(<= main_~i~0 79), 186853#(<= main_~i~0 80), 186858#(<= main_~i~0 85), 186859#(<= main_~i~0 86), 186856#(<= main_~i~0 83), 186857#(<= main_~i~0 84), 186862#(<= main_~i~0 89), 186863#(<= main_~i~0 90), 186860#(<= main_~i~0 87), 186861#(<= main_~i~0 88), 186866#(<= main_~i~0 93), 186867#(<= main_~i~0 94), 186864#(<= main_~i~0 91), 186865#(<= main_~i~0 92), 186870#(<= main_~i~0 97), 186871#(<= main_~i~0 98), 186868#(<= main_~i~0 95), 186869#(<= main_~i~0 96), 186874#(<= main_~i~0 101), 186875#(<= main_~i~0 102), 186872#(<= main_~i~0 99), 186873#(<= main_~i~0 100), 186878#(<= main_~i~0 105), 186879#(<= main_~i~0 106), 186876#(<= main_~i~0 103), 186877#(<= main_~i~0 104)] [2018-04-13 03:38:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 51209 backedges. 0 proven. 51200 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:38:50,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-04-13 03:38:50,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-04-13 03:38:50,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-04-13 03:38:50,800 INFO L87 Difference]: Start difference. First operand 661 states and 662 transitions. Second operand 163 states. [2018-04-13 03:39:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:39:01,631 INFO L93 Difference]: Finished difference Result 1466 states and 1625 transitions. [2018-04-13 03:39:01,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-04-13 03:39:01,632 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 660 [2018-04-13 03:39:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:39:01,632 INFO L225 Difference]: With dead ends: 1466 [2018-04-13 03:39:01,632 INFO L226 Difference]: Without dead ends: 1466 [2018-04-13 03:39:01,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-04-13 03:39:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-13 03:39:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 665. [2018-04-13 03:39:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-04-13 03:39:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 666 transitions. [2018-04-13 03:39:01,636 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 666 transitions. Word has length 660 [2018-04-13 03:39:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:39:01,636 INFO L459 AbstractCegarLoop]: Abstraction has 665 states and 666 transitions. [2018-04-13 03:39:01,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-04-13 03:39:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 666 transitions. [2018-04-13 03:39:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-04-13 03:39:01,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:39:01,638 INFO L355 BasicCegarLoop]: trace histogram [162, 161, 161, 161, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:39:01,638 INFO L408 AbstractCegarLoop]: === Iteration 162 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:39:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 350044179, now seen corresponding path program 160 times [2018-04-13 03:39:01,639 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:39:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:39:01,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:39:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 51851 backedges. 0 proven. 51842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:06,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:39:06,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-04-13 03:39:06,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:39:06,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-13 03:39:06,618 INFO L182 omatonBuilderFactory]: Interpolants [189186#(<= main_~i~0 119), 189187#(<= main_~i~0 120), 189184#(<= main_~i~0 117), 189185#(<= main_~i~0 118), 189190#(<= main_~i~0 123), 189191#(<= main_~i~0 124), 189188#(<= main_~i~0 121), 189189#(<= main_~i~0 122), 189194#(<= main_~i~0 127), 189195#(<= main_~i~0 128), 189192#(<= main_~i~0 125), 189193#(<= main_~i~0 126), 189198#(<= main_~i~0 131), 189199#(<= main_~i~0 132), 189196#(<= main_~i~0 129), 189197#(<= main_~i~0 130), 189202#(<= main_~i~0 135), 189203#(<= main_~i~0 136), 189200#(<= main_~i~0 133), 189201#(<= main_~i~0 134), 189206#(<= main_~i~0 139), 189207#(<= main_~i~0 140), 189204#(<= main_~i~0 137), 189205#(<= main_~i~0 138), 189210#(<= main_~i~0 143), 189211#(<= main_~i~0 144), 189208#(<= main_~i~0 141), 189209#(<= main_~i~0 142), 189214#(<= main_~i~0 147), 189215#(<= main_~i~0 148), 189212#(<= main_~i~0 145), 189213#(<= main_~i~0 146), 189218#(<= main_~i~0 151), 189219#(<= main_~i~0 152), 189216#(<= main_~i~0 149), 189217#(<= main_~i~0 150), 189222#(<= main_~i~0 155), 189223#(<= main_~i~0 156), 189220#(<= main_~i~0 153), 189221#(<= main_~i~0 154), 189226#(<= main_~i~0 159), 189227#(<= main_~i~0 160), 189224#(<= main_~i~0 157), 189225#(<= main_~i~0 158), 189228#(<= main_~i~0 161), 189066#false, 189067#(<= main_~i~0 0), 189065#true, 189070#(<= main_~i~0 3), 189071#(<= main_~i~0 4), 189068#(<= main_~i~0 1), 189069#(<= main_~i~0 2), 189074#(<= main_~i~0 7), 189075#(<= main_~i~0 8), 189072#(<= main_~i~0 5), 189073#(<= main_~i~0 6), 189078#(<= main_~i~0 11), 189079#(<= main_~i~0 12), 189076#(<= main_~i~0 9), 189077#(<= main_~i~0 10), 189082#(<= main_~i~0 15), 189083#(<= main_~i~0 16), 189080#(<= main_~i~0 13), 189081#(<= main_~i~0 14), 189086#(<= main_~i~0 19), 189087#(<= main_~i~0 20), 189084#(<= main_~i~0 17), 189085#(<= main_~i~0 18), 189090#(<= main_~i~0 23), 189091#(<= main_~i~0 24), 189088#(<= main_~i~0 21), 189089#(<= main_~i~0 22), 189094#(<= main_~i~0 27), 189095#(<= main_~i~0 28), 189092#(<= main_~i~0 25), 189093#(<= main_~i~0 26), 189098#(<= main_~i~0 31), 189099#(<= main_~i~0 32), 189096#(<= main_~i~0 29), 189097#(<= main_~i~0 30), 189102#(<= main_~i~0 35), 189103#(<= main_~i~0 36), 189100#(<= main_~i~0 33), 189101#(<= main_~i~0 34), 189106#(<= main_~i~0 39), 189107#(<= main_~i~0 40), 189104#(<= main_~i~0 37), 189105#(<= main_~i~0 38), 189110#(<= main_~i~0 43), 189111#(<= main_~i~0 44), 189108#(<= main_~i~0 41), 189109#(<= main_~i~0 42), 189114#(<= main_~i~0 47), 189115#(<= main_~i~0 48), 189112#(<= main_~i~0 45), 189113#(<= main_~i~0 46), 189118#(<= main_~i~0 51), 189119#(<= main_~i~0 52), 189116#(<= main_~i~0 49), 189117#(<= main_~i~0 50), 189122#(<= main_~i~0 55), 189123#(<= main_~i~0 56), 189120#(<= main_~i~0 53), 189121#(<= main_~i~0 54), 189126#(<= main_~i~0 59), 189127#(<= main_~i~0 60), 189124#(<= main_~i~0 57), 189125#(<= main_~i~0 58), 189130#(<= main_~i~0 63), 189131#(<= main_~i~0 64), 189128#(<= main_~i~0 61), 189129#(<= main_~i~0 62), 189134#(<= main_~i~0 67), 189135#(<= main_~i~0 68), 189132#(<= main_~i~0 65), 189133#(<= main_~i~0 66), 189138#(<= main_~i~0 71), 189139#(<= main_~i~0 72), 189136#(<= main_~i~0 69), 189137#(<= main_~i~0 70), 189142#(<= main_~i~0 75), 189143#(<= main_~i~0 76), 189140#(<= main_~i~0 73), 189141#(<= main_~i~0 74), 189146#(<= main_~i~0 79), 189147#(<= main_~i~0 80), 189144#(<= main_~i~0 77), 189145#(<= main_~i~0 78), 189150#(<= main_~i~0 83), 189151#(<= main_~i~0 84), 189148#(<= main_~i~0 81), 189149#(<= main_~i~0 82), 189154#(<= main_~i~0 87), 189155#(<= main_~i~0 88), 189152#(<= main_~i~0 85), 189153#(<= main_~i~0 86), 189158#(<= main_~i~0 91), 189159#(<= main_~i~0 92), 189156#(<= main_~i~0 89), 189157#(<= main_~i~0 90), 189162#(<= main_~i~0 95), 189163#(<= main_~i~0 96), 189160#(<= main_~i~0 93), 189161#(<= main_~i~0 94), 189166#(<= main_~i~0 99), 189167#(<= main_~i~0 100), 189164#(<= main_~i~0 97), 189165#(<= main_~i~0 98), 189170#(<= main_~i~0 103), 189171#(<= main_~i~0 104), 189168#(<= main_~i~0 101), 189169#(<= main_~i~0 102), 189174#(<= main_~i~0 107), 189175#(<= main_~i~0 108), 189172#(<= main_~i~0 105), 189173#(<= main_~i~0 106), 189178#(<= main_~i~0 111), 189179#(<= main_~i~0 112), 189176#(<= main_~i~0 109), 189177#(<= main_~i~0 110), 189182#(<= main_~i~0 115), 189183#(<= main_~i~0 116), 189180#(<= main_~i~0 113), 189181#(<= main_~i~0 114)] [2018-04-13 03:39:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 51851 backedges. 0 proven. 51842 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:06,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-04-13 03:39:06,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-04-13 03:39:06,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-04-13 03:39:06,621 INFO L87 Difference]: Start difference. First operand 665 states and 666 transitions. Second operand 164 states. [2018-04-13 03:39:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:39:17,984 INFO L93 Difference]: Finished difference Result 1475 states and 1635 transitions. [2018-04-13 03:39:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-04-13 03:39:17,984 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 664 [2018-04-13 03:39:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:39:17,985 INFO L225 Difference]: With dead ends: 1475 [2018-04-13 03:39:17,985 INFO L226 Difference]: Without dead ends: 1475 [2018-04-13 03:39:17,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-04-13 03:39:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2018-04-13 03:39:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 669. [2018-04-13 03:39:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-04-13 03:39:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 670 transitions. [2018-04-13 03:39:17,989 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 670 transitions. Word has length 664 [2018-04-13 03:39:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:39:17,989 INFO L459 AbstractCegarLoop]: Abstraction has 669 states and 670 transitions. [2018-04-13 03:39:17,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-04-13 03:39:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 670 transitions. [2018-04-13 03:39:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-04-13 03:39:17,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:39:17,991 INFO L355 BasicCegarLoop]: trace histogram [163, 162, 162, 162, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:39:17,991 INFO L408 AbstractCegarLoop]: === Iteration 163 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:39:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1156646388, now seen corresponding path program 161 times [2018-04-13 03:39:17,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:39:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:39:18,008 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:39:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 52497 backedges. 0 proven. 52488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:23,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:39:23,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-04-13 03:39:23,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:39:23,072 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-13 03:39:23,072 INFO L182 omatonBuilderFactory]: Interpolants [191490#(<= main_~i~0 115), 191491#(<= main_~i~0 116), 191488#(<= main_~i~0 113), 191489#(<= main_~i~0 114), 191494#(<= main_~i~0 119), 191495#(<= main_~i~0 120), 191492#(<= main_~i~0 117), 191493#(<= main_~i~0 118), 191498#(<= main_~i~0 123), 191499#(<= main_~i~0 124), 191496#(<= main_~i~0 121), 191497#(<= main_~i~0 122), 191502#(<= main_~i~0 127), 191503#(<= main_~i~0 128), 191500#(<= main_~i~0 125), 191501#(<= main_~i~0 126), 191506#(<= main_~i~0 131), 191507#(<= main_~i~0 132), 191504#(<= main_~i~0 129), 191505#(<= main_~i~0 130), 191510#(<= main_~i~0 135), 191511#(<= main_~i~0 136), 191508#(<= main_~i~0 133), 191509#(<= main_~i~0 134), 191514#(<= main_~i~0 139), 191515#(<= main_~i~0 140), 191512#(<= main_~i~0 137), 191513#(<= main_~i~0 138), 191518#(<= main_~i~0 143), 191519#(<= main_~i~0 144), 191516#(<= main_~i~0 141), 191517#(<= main_~i~0 142), 191522#(<= main_~i~0 147), 191523#(<= main_~i~0 148), 191520#(<= main_~i~0 145), 191521#(<= main_~i~0 146), 191526#(<= main_~i~0 151), 191527#(<= main_~i~0 152), 191524#(<= main_~i~0 149), 191525#(<= main_~i~0 150), 191530#(<= main_~i~0 155), 191531#(<= main_~i~0 156), 191528#(<= main_~i~0 153), 191529#(<= main_~i~0 154), 191534#(<= main_~i~0 159), 191535#(<= main_~i~0 160), 191532#(<= main_~i~0 157), 191533#(<= main_~i~0 158), 191536#(<= main_~i~0 161), 191537#(<= main_~i~0 162), 191374#false, 191375#(<= main_~i~0 0), 191373#true, 191378#(<= main_~i~0 3), 191379#(<= main_~i~0 4), 191376#(<= main_~i~0 1), 191377#(<= main_~i~0 2), 191382#(<= main_~i~0 7), 191383#(<= main_~i~0 8), 191380#(<= main_~i~0 5), 191381#(<= main_~i~0 6), 191386#(<= main_~i~0 11), 191387#(<= main_~i~0 12), 191384#(<= main_~i~0 9), 191385#(<= main_~i~0 10), 191390#(<= main_~i~0 15), 191391#(<= main_~i~0 16), 191388#(<= main_~i~0 13), 191389#(<= main_~i~0 14), 191394#(<= main_~i~0 19), 191395#(<= main_~i~0 20), 191392#(<= main_~i~0 17), 191393#(<= main_~i~0 18), 191398#(<= main_~i~0 23), 191399#(<= main_~i~0 24), 191396#(<= main_~i~0 21), 191397#(<= main_~i~0 22), 191402#(<= main_~i~0 27), 191403#(<= main_~i~0 28), 191400#(<= main_~i~0 25), 191401#(<= main_~i~0 26), 191406#(<= main_~i~0 31), 191407#(<= main_~i~0 32), 191404#(<= main_~i~0 29), 191405#(<= main_~i~0 30), 191410#(<= main_~i~0 35), 191411#(<= main_~i~0 36), 191408#(<= main_~i~0 33), 191409#(<= main_~i~0 34), 191414#(<= main_~i~0 39), 191415#(<= main_~i~0 40), 191412#(<= main_~i~0 37), 191413#(<= main_~i~0 38), 191418#(<= main_~i~0 43), 191419#(<= main_~i~0 44), 191416#(<= main_~i~0 41), 191417#(<= main_~i~0 42), 191422#(<= main_~i~0 47), 191423#(<= main_~i~0 48), 191420#(<= main_~i~0 45), 191421#(<= main_~i~0 46), 191426#(<= main_~i~0 51), 191427#(<= main_~i~0 52), 191424#(<= main_~i~0 49), 191425#(<= main_~i~0 50), 191430#(<= main_~i~0 55), 191431#(<= main_~i~0 56), 191428#(<= main_~i~0 53), 191429#(<= main_~i~0 54), 191434#(<= main_~i~0 59), 191435#(<= main_~i~0 60), 191432#(<= main_~i~0 57), 191433#(<= main_~i~0 58), 191438#(<= main_~i~0 63), 191439#(<= main_~i~0 64), 191436#(<= main_~i~0 61), 191437#(<= main_~i~0 62), 191442#(<= main_~i~0 67), 191443#(<= main_~i~0 68), 191440#(<= main_~i~0 65), 191441#(<= main_~i~0 66), 191446#(<= main_~i~0 71), 191447#(<= main_~i~0 72), 191444#(<= main_~i~0 69), 191445#(<= main_~i~0 70), 191450#(<= main_~i~0 75), 191451#(<= main_~i~0 76), 191448#(<= main_~i~0 73), 191449#(<= main_~i~0 74), 191454#(<= main_~i~0 79), 191455#(<= main_~i~0 80), 191452#(<= main_~i~0 77), 191453#(<= main_~i~0 78), 191458#(<= main_~i~0 83), 191459#(<= main_~i~0 84), 191456#(<= main_~i~0 81), 191457#(<= main_~i~0 82), 191462#(<= main_~i~0 87), 191463#(<= main_~i~0 88), 191460#(<= main_~i~0 85), 191461#(<= main_~i~0 86), 191466#(<= main_~i~0 91), 191467#(<= main_~i~0 92), 191464#(<= main_~i~0 89), 191465#(<= main_~i~0 90), 191470#(<= main_~i~0 95), 191471#(<= main_~i~0 96), 191468#(<= main_~i~0 93), 191469#(<= main_~i~0 94), 191474#(<= main_~i~0 99), 191475#(<= main_~i~0 100), 191472#(<= main_~i~0 97), 191473#(<= main_~i~0 98), 191478#(<= main_~i~0 103), 191479#(<= main_~i~0 104), 191476#(<= main_~i~0 101), 191477#(<= main_~i~0 102), 191482#(<= main_~i~0 107), 191483#(<= main_~i~0 108), 191480#(<= main_~i~0 105), 191481#(<= main_~i~0 106), 191486#(<= main_~i~0 111), 191487#(<= main_~i~0 112), 191484#(<= main_~i~0 109), 191485#(<= main_~i~0 110)] [2018-04-13 03:39:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 52497 backedges. 0 proven. 52488 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:23,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-04-13 03:39:23,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-04-13 03:39:23,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-04-13 03:39:23,075 INFO L87 Difference]: Start difference. First operand 669 states and 670 transitions. Second operand 165 states. [2018-04-13 03:39:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:39:34,125 INFO L93 Difference]: Finished difference Result 1484 states and 1645 transitions. [2018-04-13 03:39:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-04-13 03:39:34,125 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 668 [2018-04-13 03:39:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:39:34,127 INFO L225 Difference]: With dead ends: 1484 [2018-04-13 03:39:34,127 INFO L226 Difference]: Without dead ends: 1484 [2018-04-13 03:39:34,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-04-13 03:39:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-04-13 03:39:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 673. [2018-04-13 03:39:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-04-13 03:39:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 674 transitions. [2018-04-13 03:39:34,131 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 674 transitions. Word has length 668 [2018-04-13 03:39:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:39:34,131 INFO L459 AbstractCegarLoop]: Abstraction has 673 states and 674 transitions. [2018-04-13 03:39:34,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-04-13 03:39:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 674 transitions. [2018-04-13 03:39:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-04-13 03:39:34,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:39:34,133 INFO L355 BasicCegarLoop]: trace histogram [164, 163, 163, 163, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:39:34,133 INFO L408 AbstractCegarLoop]: === Iteration 164 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:39:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 493948805, now seen corresponding path program 162 times [2018-04-13 03:39:34,133 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:39:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:39:34,149 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:39:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 53147 backedges. 0 proven. 53138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:39,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 03:39:39,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-04-13 03:39:39,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-13 03:39:39,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-13 03:39:39,163 INFO L182 omatonBuilderFactory]: Interpolants [193794#(<= main_~i~0 97), 193795#(<= main_~i~0 98), 193792#(<= main_~i~0 95), 193793#(<= main_~i~0 96), 193798#(<= main_~i~0 101), 193799#(<= main_~i~0 102), 193796#(<= main_~i~0 99), 193797#(<= main_~i~0 100), 193802#(<= main_~i~0 105), 193803#(<= main_~i~0 106), 193800#(<= main_~i~0 103), 193801#(<= main_~i~0 104), 193806#(<= main_~i~0 109), 193807#(<= main_~i~0 110), 193804#(<= main_~i~0 107), 193805#(<= main_~i~0 108), 193810#(<= main_~i~0 113), 193811#(<= main_~i~0 114), 193808#(<= main_~i~0 111), 193809#(<= main_~i~0 112), 193814#(<= main_~i~0 117), 193815#(<= main_~i~0 118), 193812#(<= main_~i~0 115), 193813#(<= main_~i~0 116), 193818#(<= main_~i~0 121), 193819#(<= main_~i~0 122), 193816#(<= main_~i~0 119), 193817#(<= main_~i~0 120), 193822#(<= main_~i~0 125), 193823#(<= main_~i~0 126), 193820#(<= main_~i~0 123), 193821#(<= main_~i~0 124), 193826#(<= main_~i~0 129), 193827#(<= main_~i~0 130), 193824#(<= main_~i~0 127), 193825#(<= main_~i~0 128), 193830#(<= main_~i~0 133), 193831#(<= main_~i~0 134), 193828#(<= main_~i~0 131), 193829#(<= main_~i~0 132), 193834#(<= main_~i~0 137), 193835#(<= main_~i~0 138), 193832#(<= main_~i~0 135), 193833#(<= main_~i~0 136), 193838#(<= main_~i~0 141), 193839#(<= main_~i~0 142), 193836#(<= main_~i~0 139), 193837#(<= main_~i~0 140), 193842#(<= main_~i~0 145), 193843#(<= main_~i~0 146), 193840#(<= main_~i~0 143), 193841#(<= main_~i~0 144), 193846#(<= main_~i~0 149), 193847#(<= main_~i~0 150), 193844#(<= main_~i~0 147), 193845#(<= main_~i~0 148), 193850#(<= main_~i~0 153), 193851#(<= main_~i~0 154), 193848#(<= main_~i~0 151), 193849#(<= main_~i~0 152), 193854#(<= main_~i~0 157), 193855#(<= main_~i~0 158), 193852#(<= main_~i~0 155), 193853#(<= main_~i~0 156), 193858#(<= main_~i~0 161), 193859#(<= main_~i~0 162), 193856#(<= main_~i~0 159), 193857#(<= main_~i~0 160), 193860#(<= main_~i~0 163), 193695#true, 193698#(<= main_~i~0 1), 193699#(<= main_~i~0 2), 193696#false, 193697#(<= main_~i~0 0), 193702#(<= main_~i~0 5), 193703#(<= main_~i~0 6), 193700#(<= main_~i~0 3), 193701#(<= main_~i~0 4), 193706#(<= main_~i~0 9), 193707#(<= main_~i~0 10), 193704#(<= main_~i~0 7), 193705#(<= main_~i~0 8), 193710#(<= main_~i~0 13), 193711#(<= main_~i~0 14), 193708#(<= main_~i~0 11), 193709#(<= main_~i~0 12), 193714#(<= main_~i~0 17), 193715#(<= main_~i~0 18), 193712#(<= main_~i~0 15), 193713#(<= main_~i~0 16), 193718#(<= main_~i~0 21), 193719#(<= main_~i~0 22), 193716#(<= main_~i~0 19), 193717#(<= main_~i~0 20), 193722#(<= main_~i~0 25), 193723#(<= main_~i~0 26), 193720#(<= main_~i~0 23), 193721#(<= main_~i~0 24), 193726#(<= main_~i~0 29), 193727#(<= main_~i~0 30), 193724#(<= main_~i~0 27), 193725#(<= main_~i~0 28), 193730#(<= main_~i~0 33), 193731#(<= main_~i~0 34), 193728#(<= main_~i~0 31), 193729#(<= main_~i~0 32), 193734#(<= main_~i~0 37), 193735#(<= main_~i~0 38), 193732#(<= main_~i~0 35), 193733#(<= main_~i~0 36), 193738#(<= main_~i~0 41), 193739#(<= main_~i~0 42), 193736#(<= main_~i~0 39), 193737#(<= main_~i~0 40), 193742#(<= main_~i~0 45), 193743#(<= main_~i~0 46), 193740#(<= main_~i~0 43), 193741#(<= main_~i~0 44), 193746#(<= main_~i~0 49), 193747#(<= main_~i~0 50), 193744#(<= main_~i~0 47), 193745#(<= main_~i~0 48), 193750#(<= main_~i~0 53), 193751#(<= main_~i~0 54), 193748#(<= main_~i~0 51), 193749#(<= main_~i~0 52), 193754#(<= main_~i~0 57), 193755#(<= main_~i~0 58), 193752#(<= main_~i~0 55), 193753#(<= main_~i~0 56), 193758#(<= main_~i~0 61), 193759#(<= main_~i~0 62), 193756#(<= main_~i~0 59), 193757#(<= main_~i~0 60), 193762#(<= main_~i~0 65), 193763#(<= main_~i~0 66), 193760#(<= main_~i~0 63), 193761#(<= main_~i~0 64), 193766#(<= main_~i~0 69), 193767#(<= main_~i~0 70), 193764#(<= main_~i~0 67), 193765#(<= main_~i~0 68), 193770#(<= main_~i~0 73), 193771#(<= main_~i~0 74), 193768#(<= main_~i~0 71), 193769#(<= main_~i~0 72), 193774#(<= main_~i~0 77), 193775#(<= main_~i~0 78), 193772#(<= main_~i~0 75), 193773#(<= main_~i~0 76), 193778#(<= main_~i~0 81), 193779#(<= main_~i~0 82), 193776#(<= main_~i~0 79), 193777#(<= main_~i~0 80), 193782#(<= main_~i~0 85), 193783#(<= main_~i~0 86), 193780#(<= main_~i~0 83), 193781#(<= main_~i~0 84), 193786#(<= main_~i~0 89), 193787#(<= main_~i~0 90), 193784#(<= main_~i~0 87), 193785#(<= main_~i~0 88), 193790#(<= main_~i~0 93), 193791#(<= main_~i~0 94), 193788#(<= main_~i~0 91), 193789#(<= main_~i~0 92)] [2018-04-13 03:39:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 53147 backedges. 0 proven. 53138 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 03:39:39,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-04-13 03:39:39,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-04-13 03:39:39,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-04-13 03:39:39,165 INFO L87 Difference]: Start difference. First operand 673 states and 674 transitions. Second operand 166 states. [2018-04-13 03:39:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:39:49,484 INFO L93 Difference]: Finished difference Result 1493 states and 1655 transitions. [2018-04-13 03:39:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-04-13 03:39:49,484 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 672 [2018-04-13 03:39:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:39:49,485 INFO L225 Difference]: With dead ends: 1493 [2018-04-13 03:39:49,485 INFO L226 Difference]: Without dead ends: 1493 [2018-04-13 03:39:49,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-04-13 03:39:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-04-13 03:39:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 677. [2018-04-13 03:39:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-04-13 03:39:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 678 transitions. [2018-04-13 03:39:49,488 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 678 transitions. Word has length 672 [2018-04-13 03:39:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:39:49,488 INFO L459 AbstractCegarLoop]: Abstraction has 677 states and 678 transitions. [2018-04-13 03:39:49,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-04-13 03:39:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 678 transitions. [2018-04-13 03:39:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-04-13 03:39:49,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:39:49,490 INFO L355 BasicCegarLoop]: trace histogram [165, 164, 164, 164, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:39:49,490 INFO L408 AbstractCegarLoop]: === Iteration 165 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 03:39:49,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1385578370, now seen corresponding path program 163 times [2018-04-13 03:39:49,491 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-13 03:39:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:39:49,507 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-13 03:39:51,387 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 03:39:51,390 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 03:39:51,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 03:39:51 BoogieIcfgContainer [2018-04-13 03:39:51,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 03:39:51,390 INFO L168 Benchmark]: Toolchain (without parser) took 798550.43 ms. Allocated memory was 404.2 MB in the beginning and 1.0 GB in the end (delta: 631.8 MB). Free memory was 345.5 MB in the beginning and 417.4 MB in the end (delta: -71.8 MB). Peak memory consumption was 559.9 MB. Max. memory is 5.3 GB. [2018-04-13 03:39:51,391 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 03:39:51,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.71 ms. Allocated memory is still 404.2 MB. Free memory was 345.5 MB in the beginning and 336.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. [2018-04-13 03:39:51,391 INFO L168 Benchmark]: Boogie Preprocessor took 17.57 ms. Allocated memory is still 404.2 MB. Free memory was 336.1 MB in the beginning and 334.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 03:39:51,391 INFO L168 Benchmark]: RCFGBuilder took 189.80 ms. Allocated memory was 404.2 MB in the beginning and 613.9 MB in the end (delta: 209.7 MB). Free memory was 334.8 MB in the beginning and 580.7 MB in the end (delta: -246.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. [2018-04-13 03:39:51,391 INFO L168 Benchmark]: TraceAbstraction took 798201.95 ms. Allocated memory was 613.9 MB in the beginning and 1.0 GB in the end (delta: 422.1 MB). Free memory was 580.7 MB in the beginning and 417.4 MB in the end (delta: 163.4 MB). Peak memory consumption was 585.4 MB. Max. memory is 5.3 GB. [2018-04-13 03:39:51,392 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.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 138.71 ms. Allocated memory is still 404.2 MB. Free memory was 345.5 MB in the beginning and 336.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.57 ms. Allocated memory is still 404.2 MB. Free memory was 336.1 MB in the beginning and 334.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.80 ms. Allocated memory was 404.2 MB in the beginning and 613.9 MB in the end (delta: 209.7 MB). Free memory was 334.8 MB in the beginning and 580.7 MB in the end (delta: -246.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 798201.95 ms. Allocated memory was 613.9 MB in the beginning and 1.0 GB in the end (delta: 422.1 MB). Free memory was 580.7 MB in the beginning and 417.4 MB in the end (delta: 163.4 MB). Peak memory consumption was 585.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 677 with TraceHistMax 165, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 677 with TraceHistMax 165, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 102 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 798.1s OverallTime, 165 OverallIterations, 165 TraceHistogramMax, 493.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1489 SDtfs, 129035 SDslu, 53989 SDs, 0 SdLazy, 109488 SolverSat, 46700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13858 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 13532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 283.3s Time, 0.1s BasicInterpolantAutomatonTime, BiggestAbstraction: size=677occurred in iteration=164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1468/2915254 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 164 MinimizatonAttempts, 66988 StatesRemovedByMinimization, 163 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 289.4s InterpolantComputationTime, 56724 NumberOfCodeBlocks, 56724 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 56560 ConstructedInterpolants, 0 QuantifiedInterpolants, 74279038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 164 InterpolantComputations, 2 PerfectInterpolantSequences, 1468/2915254 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/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_03-39-51-398.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_03-39-51-398.csv Completed graceful shutdown