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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:36:25,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:36:25,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:36:25,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:36:25,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:36:25,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:36:25,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:36:25,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:36:25,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:36:25,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:36:25,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:36:25,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:36:25,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:36:25,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:36:25,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:36:25,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:36:25,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:36:25,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:36:25,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:36:25,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:36:25,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:36:25,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:36:25,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:36:25,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:36:25,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:36:25,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:36:25,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:36:25,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:36:25,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:36:25,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:36:25,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:36:25,404 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-10 14:36:25,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:36:25,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:36:25,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:36:25,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:36:25,418 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:36:25,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:36:25,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:36:25,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:36:25,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:36:25,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:36:25,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:36:25,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:36:25,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:36:25,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 14:36:25,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:36:25,449 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:36:25,451 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:36:25,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:36:25,452 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:36:25,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-04-10 14:36:25,488 ERROR L339 mateJobChangeAdapter]: Error during toolchain job processing: java.io.FileNotFoundException: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/.metadata/.plugins/org.eclipse.core.resources/.projects/FLAGecab30477/.markers.snap (No such file or directory) at java.io.FileOutputStream.open0(Native Method) at java.io.FileOutputStream.open(FileOutputStream.java:270) at java.io.FileOutputStream.(FileOutputStream.java:213) at java.io.FileOutputStream.(FileOutputStream.java:133) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:45) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:41) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1769) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1853) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1222) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1163) at org.eclipse.core.internal.resources.DelayedSnapshotJob.run(DelayedSnapshotJob.java:52) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 14:36:25,729 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG59e0f4b03 [2018-04-10 14:36:25,827 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:36:25,827 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:36:25,827 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-10 14:36:25,828 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:36:25,828 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:36:25,828 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:36:25,828 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 14:36:25,828 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-10 14:36:25,828 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:36:25,829 INFO L233 ultiparseSymbolTable]: [2018-04-10 14:36:25,841 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG59e0f4b03 [2018-04-10 14:36:25,844 ERROR L339 mateJobChangeAdapter]: Error during toolchain job processing: java.io.FileNotFoundException: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/.metadata/.plugins/org.eclipse.core.resources/.projects/FLAGecab30477/.markers.snap (No such file or directory) at java.io.FileOutputStream.open0(Native Method) at java.io.FileOutputStream.open(FileOutputStream.java:270) at java.io.FileOutputStream.(FileOutputStream.java:213) at java.io.FileOutputStream.(FileOutputStream.java:133) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:45) at org.eclipse.core.internal.localstore.SafeChunkyOutputStream.(SafeChunkyOutputStream.java:41) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1769) at org.eclipse.core.internal.resources.SaveManager.visitAndSnap(SaveManager.java:1853) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1222) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1163) at org.eclipse.core.internal.resources.DelayedSnapshotJob.run(DelayedSnapshotJob.java:52) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 14:36:25,845 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:36:25,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:36:25,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:36:25,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:36:25,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:36:25,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:36:25" (1/1) ... [2018-04-10 14:36:25,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743bc610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:25, skipping insertion in model container [2018-04-10 14:36:25,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:36:25" (1/1) ... [2018-04-10 14:36:25,866 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:36:25,878 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:36:26,000 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:36:26,014 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:36:26,018 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-10 14:36:26,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26 WrapperNode [2018-04-10 14:36:26,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:36:26,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:36:26,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:36:26,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:36:26,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (1/1) ... [2018-04-10 14:36:26,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:36:26,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:36:26,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:36:26,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:36:26,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (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-10 14:36:26,091 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:36:26,092 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:36:26,092 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 14:36:26,092 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:36:26,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:36:26,092 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-10 14:36:26,092 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:36:26,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:36:26,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:36:26,241 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:36:26,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:36:26 BoogieIcfgContainer [2018-04-10 14:36:26,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:36:26,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:36:26,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:36:26,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:36:26,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:36:25" (1/3) ... [2018-04-10 14:36:26,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338d668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:36:26, skipping insertion in model container [2018-04-10 14:36:26,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:36:26" (2/3) ... [2018-04-10 14:36:26,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338d668a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:36:26, skipping insertion in model container [2018-04-10 14:36:26,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:36:26" (3/3) ... [2018-04-10 14:36:26,246 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-10 14:36:26,251 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:36:26,256 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-10 14:36:26,278 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:36:26,278 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:36:26,278 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:36:26,279 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 14:36:26,279 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 14:36:26,279 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:36:26,279 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:36:26,279 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:36:26,279 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:36:26,279 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:36:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-10 14:36:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 14:36:26,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,296 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,296 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -42208474, now seen corresponding path program 1 times [2018-04-10 14:36:26,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:36:26,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 14:36:26,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,408 INFO L182 omatonBuilderFactory]: Interpolants [35#true, 36#false, 37#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-10 14:36:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 14:36:26,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 14:36:26,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:36:26,420 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-10 14:36:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:26,470 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-10 14:36:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 14:36:26,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 14:36:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:26,478 INFO L225 Difference]: With dead ends: 49 [2018-04-10 14:36:26,478 INFO L226 Difference]: Without dead ends: 40 [2018-04-10 14:36:26,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 14:36:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-10 14:36:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-04-10 14:36:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 14:36:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-04-10 14:36:26,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-04-10 14:36:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:26,507 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-04-10 14:36:26,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 14:36:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-04-10 14:36:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 14:36:26,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,508 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,508 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash 619915766, now seen corresponding path program 1 times [2018-04-10 14:36:26,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:36:26,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:36:26,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,553 INFO L182 omatonBuilderFactory]: Interpolants [118#true, 119#false, 120#(<= main_~i~0 0), 121#(and (= main_~x~0 0) (<= main_~i~0 0))] [2018-04-10 14:36:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:36:26,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:36:26,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:36:26,555 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-04-10 14:36:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:26,591 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-04-10 14:36:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:36:26,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 14:36:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:26,592 INFO L225 Difference]: With dead ends: 34 [2018-04-10 14:36:26,592 INFO L226 Difference]: Without dead ends: 31 [2018-04-10 14:36:26,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:36:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-10 14:36:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-10 14:36:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 14:36:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-10 14:36:26,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-04-10 14:36:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:26,598 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-10 14:36:26,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:36:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-10 14:36:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 14:36:26,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,598 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,599 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash 621575575, now seen corresponding path program 1 times [2018-04-10 14:36:26,600 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:26,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-10 14:36:26,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,640 INFO L182 omatonBuilderFactory]: Interpolants [187#true, 188#false, 189#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 190#(and (<= 1 main_~i~0) (<= main_~i~0 1))] [2018-04-10 14:36:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:36:26,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:36:26,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:36:26,641 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 4 states. [2018-04-10 14:36:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:26,698 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-04-10 14:36:26,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:36:26,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 14:36:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:26,700 INFO L225 Difference]: With dead ends: 45 [2018-04-10 14:36:26,700 INFO L226 Difference]: Without dead ends: 45 [2018-04-10 14:36:26,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:36:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-10 14:36:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-04-10 14:36:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-10 14:36:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-10 14:36:26,704 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-04-10 14:36:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:26,704 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-10 14:36:26,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:36:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-10 14:36:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:36:26,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,705 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,705 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1962704421, now seen corresponding path program 1 times [2018-04-10 14:36:26,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:26,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 14:36:26,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,757 INFO L182 omatonBuilderFactory]: Interpolants [272#true, 273#false, 274#(<= main_~i~0 0), 275#(<= main_~i~0 1), 276#(and (= main_~x~0 0) (<= main_~i~0 1)), 277#(= main_~x~0 0)] [2018-04-10 14:36:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:36:26,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:36:26,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:36:26,758 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-10 14:36:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:26,806 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-10 14:36:26,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:36:26,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 14:36:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:26,807 INFO L225 Difference]: With dead ends: 57 [2018-04-10 14:36:26,807 INFO L226 Difference]: Without dead ends: 57 [2018-04-10 14:36:26,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:36:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-10 14:36:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-04-10 14:36:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-10 14:36:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-04-10 14:36:26,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-04-10 14:36:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:26,810 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-04-10 14:36:26,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:36:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-04-10 14:36:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 14:36:26,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,811 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,811 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1964364230, now seen corresponding path program 2 times [2018-04-10 14:36:26,812 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:26,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 14:36:26,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,857 INFO L182 omatonBuilderFactory]: Interpolants [375#true, 376#false, 377#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 378#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 379#(and (<= 2 main_~i~0) (<= main_~i~0 2))] [2018-04-10 14:36:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:36:26,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:36:26,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:36:26,858 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2018-04-10 14:36:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:26,916 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-10 14:36:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:36:26,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 14:36:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:26,918 INFO L225 Difference]: With dead ends: 71 [2018-04-10 14:36:26,918 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 14:36:26,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:36:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 14:36:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-10 14:36:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-10 14:36:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-04-10 14:36:26,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-04-10 14:36:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:26,924 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-04-10 14:36:26,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:36:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-04-10 14:36:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:36:26,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:26,924 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:26,925 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1777648375, now seen corresponding path program 3 times [2018-04-10 14:36:26,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:26,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:26,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:36:26,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,971 INFO L182 omatonBuilderFactory]: Interpolants [496#true, 497#false, 498#(<= main_~i~0 0), 499#(<= main_~i~0 1), 500#(<= main_~i~0 2), 501#(and (<= 0 main_~i~0) (<= main_~i~0 2)), 502#(and (<= main_~i~0 3) (<= 1 main_~i~0))] [2018-04-10 14:36:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:26,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:36:26,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:36:26,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:36:26,972 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-04-10 14:36:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,057 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-10 14:36:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:36:27,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-10 14:36:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,059 INFO L225 Difference]: With dead ends: 89 [2018-04-10 14:36:27,059 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 14:36:27,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:36:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 14:36:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-04-10 14:36:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 14:36:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 14:36:27,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-04-10 14:36:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,062 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 14:36:27,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:36:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 14:36:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:36:27,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,063 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,063 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash -788155134, now seen corresponding path program 1 times [2018-04-10 14:36:27,063 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:36:27,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,095 INFO L182 omatonBuilderFactory]: Interpolants [648#true, 649#false, 650#(<= main_~i~0 0), 651#(<= main_~i~0 1), 652#(<= main_~i~0 (+ main_~x~0 1)), 653#(<= main_~i~0 main_~x~0)] [2018-04-10 14:36:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:36:27,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:36:27,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:36:27,096 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-04-10 14:36:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,149 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-10 14:36:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:36:27,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-10 14:36:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,150 INFO L225 Difference]: With dead ends: 59 [2018-04-10 14:36:27,150 INFO L226 Difference]: Without dead ends: 50 [2018-04-10 14:36:27,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:36:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-10 14:36:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-10 14:36:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 14:36:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-04-10 14:36:27,154 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-04-10 14:36:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,154 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-04-10 14:36:27,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:36:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-04-10 14:36:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:36:27,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,155 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,155 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1667360870, now seen corresponding path program 4 times [2018-04-10 14:36:27,156 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 14:36:27,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,224 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 770#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 771#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 772#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 773#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 767#true] [2018-04-10 14:36:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:36:27,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:36:27,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:36:27,225 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-04-10 14:36:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,390 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-04-10 14:36:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:36:27,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-10 14:36:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,391 INFO L225 Difference]: With dead ends: 94 [2018-04-10 14:36:27,391 INFO L226 Difference]: Without dead ends: 94 [2018-04-10 14:36:27,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:36:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-10 14:36:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-04-10 14:36:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-10 14:36:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-10 14:36:27,395 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-04-10 14:36:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,395 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-10 14:36:27,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:36:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-10 14:36:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 14:36:27,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,396 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,397 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1804493581, now seen corresponding path program 2 times [2018-04-10 14:36:27,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 14:36:27,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 14:36:27,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,456 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (<= 1 main_~x~0) (<= main_~x~0 99998)), 923#true, 924#false, 925#(<= main_~i~0 99999), 926#(and (<= main_~i~0 99999) (<= 0 main_~x~0)), 927#(and (<= 1 main_~x~0) (<= main_~i~0 99999))] [2018-04-10 14:36:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-10 14:36:27,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:36:27,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:36:27,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:36:27,456 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-10 14:36:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,486 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-10 14:36:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:36:27,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 14:36:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,487 INFO L225 Difference]: With dead ends: 55 [2018-04-10 14:36:27,487 INFO L226 Difference]: Without dead ends: 38 [2018-04-10 14:36:27,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:36:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-10 14:36:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-10 14:36:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-10 14:36:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-04-10 14:36:27,490 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-04-10 14:36:27,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,490 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-04-10 14:36:27,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:36:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-04-10 14:36:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 14:36:27,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,491 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,492 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 651022423, now seen corresponding path program 5 times [2018-04-10 14:36:27,492 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 14:36:27,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,545 INFO L182 omatonBuilderFactory]: Interpolants [1024#true, 1025#false, 1026#(<= main_~i~0 0), 1027#(<= main_~i~0 1), 1028#(<= main_~i~0 2), 1029#(<= main_~i~0 3), 1030#(<= main_~i~0 4), 1031#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1032#(and (<= 1 main_~i~0) (<= main_~i~0 5))] [2018-04-10 14:36:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:36:27,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:36:27,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:36:27,545 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 9 states. [2018-04-10 14:36:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,616 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-10 14:36:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:36:27,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-10 14:36:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,617 INFO L225 Difference]: With dead ends: 43 [2018-04-10 14:36:27,617 INFO L226 Difference]: Without dead ends: 43 [2018-04-10 14:36:27,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:36:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-10 14:36:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-10 14:36:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-10 14:36:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-04-10 14:36:27,620 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-04-10 14:36:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,621 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-04-10 14:36:27,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:36:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-04-10 14:36:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 14:36:27,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,622 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,622 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1728432378, now seen corresponding path program 6 times [2018-04-10 14:36:27,623 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 14:36:27,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,719 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (<= 0 main_~i~0) (<= main_~i~0 4)), 1137#(and (<= 1 main_~i~0) (<= main_~i~0 5)), 1138#(and (<= 2 main_~i~0) (<= main_~i~0 6)), 1129#true, 1130#false, 1131#(<= main_~i~0 0), 1132#(<= main_~i~0 1), 1133#(<= main_~i~0 2), 1134#(<= main_~i~0 3), 1135#(<= main_~i~0 4)] [2018-04-10 14:36:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:36:27,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:36:27,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:36:27,720 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 10 states. [2018-04-10 14:36:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:27,818 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-10 14:36:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:36:27,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-04-10 14:36:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:27,819 INFO L225 Difference]: With dead ends: 48 [2018-04-10 14:36:27,819 INFO L226 Difference]: Without dead ends: 48 [2018-04-10 14:36:27,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:36:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-10 14:36:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-10 14:36:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-10 14:36:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-10 14:36:27,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-04-10 14:36:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:27,822 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-10 14:36:27,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:36:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-10 14:36:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 14:36:27,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:27,822 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:27,822 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -616716873, now seen corresponding path program 7 times [2018-04-10 14:36:27,823 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:27,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:27,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:36:27,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,909 INFO L182 omatonBuilderFactory]: Interpolants [1248#false, 1249#(<= main_~i~0 0), 1250#(<= main_~i~0 1), 1251#(<= main_~i~0 2), 1252#(<= main_~i~0 3), 1253#(<= main_~i~0 4), 1254#(<= main_~i~0 5), 1255#(<= main_~i~0 6), 1256#(and (<= 0 main_~i~0) (<= main_~i~0 6)), 1257#(and (<= 1 main_~i~0) (<= main_~i~0 7)), 1247#true] [2018-04-10 14:36:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:27,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:36:27,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:36:27,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:36:27,910 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-04-10 14:36:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:28,034 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-10 14:36:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 14:36:28,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 14:36:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:28,035 INFO L225 Difference]: With dead ends: 53 [2018-04-10 14:36:28,036 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 14:36:28,036 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:36:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 14:36:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-10 14:36:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-10 14:36:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-04-10 14:36:28,040 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-04-10 14:36:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:28,040 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-04-10 14:36:28,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:36:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-04-10 14:36:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:36:28,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:28,042 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:28,042 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1845018022, now seen corresponding path program 8 times [2018-04-10 14:36:28,043 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:28,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:28,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 14:36:28,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,127 INFO L182 omatonBuilderFactory]: Interpolants [1378#true, 1379#false, 1380#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 1381#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 1382#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 1383#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 1384#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 1385#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 1386#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 1387#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 1388#(and (<= 8 main_~i~0) (<= main_~i~0 8))] [2018-04-10 14:36:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:36:28,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:36:28,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:36:28,127 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-04-10 14:36:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:28,236 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-04-10 14:36:28,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:36:28,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-10 14:36:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:28,244 INFO L225 Difference]: With dead ends: 58 [2018-04-10 14:36:28,244 INFO L226 Difference]: Without dead ends: 58 [2018-04-10 14:36:28,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:36:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-10 14:36:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-10 14:36:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-10 14:36:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-04-10 14:36:28,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-04-10 14:36:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:28,246 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-04-10 14:36:28,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:36:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-04-10 14:36:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:36:28,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:28,247 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:28,248 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 795493143, now seen corresponding path program 9 times [2018-04-10 14:36:28,249 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:28,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:28,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 14:36:28,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,352 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(<= main_~i~0 0), 1508#(<= main_~i~0 1), 1509#(<= main_~i~0 2), 1510#(<= main_~i~0 3), 1511#(<= main_~i~0 4), 1512#(<= main_~i~0 5), 1513#(<= main_~i~0 6), 1514#(<= main_~i~0 7), 1515#(<= main_~i~0 8), 1516#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1517#(and (<= 1 main_~i~0) (<= main_~i~0 9))] [2018-04-10 14:36:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 14:36:28,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 14:36:28,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-10 14:36:28,352 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2018-04-10 14:36:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:28,452 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-04-10 14:36:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 14:36:28,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-10 14:36:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:28,454 INFO L225 Difference]: With dead ends: 63 [2018-04-10 14:36:28,454 INFO L226 Difference]: Without dead ends: 63 [2018-04-10 14:36:28,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:36:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-10 14:36:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-10 14:36:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-10 14:36:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-04-10 14:36:28,457 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-04-10 14:36:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:28,457 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-04-10 14:36:28,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 14:36:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-04-10 14:36:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 14:36:28,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:28,458 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:28,458 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1643609158, now seen corresponding path program 10 times [2018-04-10 14:36:28,459 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:28,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:28,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 14:36:28,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,562 INFO L182 omatonBuilderFactory]: Interpolants [1664#(<= main_~i~0 0), 1665#(<= main_~i~0 1), 1666#(<= main_~i~0 2), 1667#(<= main_~i~0 3), 1668#(<= main_~i~0 4), 1669#(<= main_~i~0 5), 1670#(<= main_~i~0 6), 1671#(<= main_~i~0 7), 1672#(<= main_~i~0 8), 1673#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 1674#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 1675#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 1662#true, 1663#false] [2018-04-10 14:36:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 14:36:28,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 14:36:28,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:36:28,563 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-04-10 14:36:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:28,738 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-04-10 14:36:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 14:36:28,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-10 14:36:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:28,738 INFO L225 Difference]: With dead ends: 68 [2018-04-10 14:36:28,738 INFO L226 Difference]: Without dead ends: 68 [2018-04-10 14:36:28,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:36:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-10 14:36:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-10 14:36:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 14:36:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-04-10 14:36:28,742 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-04-10 14:36:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:28,742 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-04-10 14:36:28,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 14:36:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-04-10 14:36:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:36:28,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:28,743 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:28,743 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1408870519, now seen corresponding path program 11 times [2018-04-10 14:36:28,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:28,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:28,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 14:36:28,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:28,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-10 14:36:28,859 INFO L182 omatonBuilderFactory]: Interpolants [1832#true, 1833#false, 1834#(<= main_~i~0 0), 1835#(<= main_~i~0 1), 1836#(<= main_~i~0 2), 1837#(<= main_~i~0 3), 1838#(<= main_~i~0 4), 1839#(<= main_~i~0 5), 1840#(<= main_~i~0 6), 1841#(<= main_~i~0 7), 1842#(<= main_~i~0 8), 1843#(<= main_~i~0 9), 1844#(<= main_~i~0 10), 1845#(and (<= 0 main_~i~0) (<= main_~i~0 10)), 1846#(and (<= 1 main_~i~0) (<= main_~i~0 11))] [2018-04-10 14:36:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:28,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:36:28,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:36:28,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:36:28,860 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 15 states. [2018-04-10 14:36:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:28,991 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-04-10 14:36:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:36:28,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-04-10 14:36:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:28,992 INFO L225 Difference]: With dead ends: 73 [2018-04-10 14:36:28,992 INFO L226 Difference]: Without dead ends: 73 [2018-04-10 14:36:28,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:36:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-10 14:36:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-10 14:36:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-10 14:36:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-04-10 14:36:28,996 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-04-10 14:36:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:28,996 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-04-10 14:36:28,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:36:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-04-10 14:36:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 14:36:28,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:28,997 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:28,997 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1139772698, now seen corresponding path program 12 times [2018-04-10 14:36:28,998 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:29,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:29,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 14:36:29,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,119 INFO L182 omatonBuilderFactory]: Interpolants [2016#false, 2017#(<= main_~i~0 0), 2018#(<= main_~i~0 1), 2019#(<= main_~i~0 2), 2020#(<= main_~i~0 3), 2021#(<= main_~i~0 4), 2022#(<= main_~i~0 5), 2023#(<= main_~i~0 6), 2024#(<= main_~i~0 7), 2025#(<= main_~i~0 8), 2026#(and (<= 0 main_~i~0) (<= main_~i~0 8)), 2027#(and (<= 1 main_~i~0) (<= main_~i~0 9)), 2028#(and (<= 2 main_~i~0) (<= main_~i~0 10)), 2029#(and (<= main_~i~0 11) (<= 3 main_~i~0)), 2030#(and (<= 4 main_~i~0) (<= main_~i~0 12)), 2015#true] [2018-04-10 14:36:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:36:29,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:36:29,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:36:29,120 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 16 states. [2018-04-10 14:36:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:29,278 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-04-10 14:36:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:36:29,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2018-04-10 14:36:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:29,278 INFO L225 Difference]: With dead ends: 78 [2018-04-10 14:36:29,278 INFO L226 Difference]: Without dead ends: 78 [2018-04-10 14:36:29,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:36:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-10 14:36:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-10 14:36:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-10 14:36:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-04-10 14:36:29,280 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-04-10 14:36:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:29,281 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-04-10 14:36:29,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:36:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-04-10 14:36:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 14:36:29,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:29,281 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:29,281 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1645336023, now seen corresponding path program 13 times [2018-04-10 14:36:29,282 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:29,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:29,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 14:36:29,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,413 INFO L182 omatonBuilderFactory]: Interpolants [2211#true, 2212#false, 2213#(<= main_~i~0 0), 2214#(<= main_~i~0 1), 2215#(<= main_~i~0 2), 2216#(<= main_~i~0 3), 2217#(<= main_~i~0 4), 2218#(<= main_~i~0 5), 2219#(<= main_~i~0 6), 2220#(<= main_~i~0 7), 2221#(<= main_~i~0 8), 2222#(<= main_~i~0 9), 2223#(<= main_~i~0 10), 2224#(<= main_~i~0 11), 2225#(<= main_~i~0 12), 2226#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2227#(and (<= 1 main_~i~0) (<= main_~i~0 13))] [2018-04-10 14:36:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:36:29,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:36:29,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:36:29,414 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-04-10 14:36:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:29,635 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-04-10 14:36:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:36:29,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-10 14:36:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:29,636 INFO L225 Difference]: With dead ends: 83 [2018-04-10 14:36:29,636 INFO L226 Difference]: Without dead ends: 83 [2018-04-10 14:36:29,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:36:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-10 14:36:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-10 14:36:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-10 14:36:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-04-10 14:36:29,639 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-04-10 14:36:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:29,639 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-04-10 14:36:29,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:36:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-04-10 14:36:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 14:36:29,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:29,640 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:29,640 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 719167878, now seen corresponding path program 14 times [2018-04-10 14:36:29,641 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:29,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:29,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 14:36:29,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,807 INFO L182 omatonBuilderFactory]: Interpolants [2432#(<= main_~i~0 10), 2433#(<= main_~i~0 11), 2434#(<= main_~i~0 12), 2435#(and (<= 0 main_~i~0) (<= main_~i~0 12)), 2436#(and (<= 1 main_~i~0) (<= main_~i~0 13)), 2437#(and (<= 2 main_~i~0) (<= main_~i~0 14)), 2420#true, 2421#false, 2422#(<= main_~i~0 0), 2423#(<= main_~i~0 1), 2424#(<= main_~i~0 2), 2425#(<= main_~i~0 3), 2426#(<= main_~i~0 4), 2427#(<= main_~i~0 5), 2428#(<= main_~i~0 6), 2429#(<= main_~i~0 7), 2430#(<= main_~i~0 8), 2431#(<= main_~i~0 9)] [2018-04-10 14:36:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:29,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 14:36:29,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 14:36:29,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:36:29,808 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-04-10 14:36:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:30,029 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-04-10 14:36:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:36:30,030 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-10 14:36:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:30,030 INFO L225 Difference]: With dead ends: 88 [2018-04-10 14:36:30,030 INFO L226 Difference]: Without dead ends: 88 [2018-04-10 14:36:30,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:36:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-10 14:36:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-10 14:36:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 14:36:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-04-10 14:36:30,033 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-04-10 14:36:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:30,033 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-04-10 14:36:30,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 14:36:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-04-10 14:36:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 14:36:30,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:30,034 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:30,034 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1151808713, now seen corresponding path program 15 times [2018-04-10 14:36:30,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:30,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:30,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:36:30,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,197 INFO L182 omatonBuilderFactory]: Interpolants [2656#(<= main_~i~0 12), 2657#(<= main_~i~0 13), 2658#(<= main_~i~0 14), 2659#(and (<= 0 main_~i~0) (<= main_~i~0 14)), 2660#(and (<= 1 main_~i~0) (<= main_~i~0 15)), 2642#true, 2643#false, 2644#(<= main_~i~0 0), 2645#(<= main_~i~0 1), 2646#(<= main_~i~0 2), 2647#(<= main_~i~0 3), 2648#(<= main_~i~0 4), 2649#(<= main_~i~0 5), 2650#(<= main_~i~0 6), 2651#(<= main_~i~0 7), 2652#(<= main_~i~0 8), 2653#(<= main_~i~0 9), 2654#(<= main_~i~0 10), 2655#(<= main_~i~0 11)] [2018-04-10 14:36:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:36:30,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:36:30,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:36:30,198 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 19 states. [2018-04-10 14:36:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:30,385 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-04-10 14:36:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:36:30,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-04-10 14:36:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:30,386 INFO L225 Difference]: With dead ends: 93 [2018-04-10 14:36:30,386 INFO L226 Difference]: Without dead ends: 93 [2018-04-10 14:36:30,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:36:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-10 14:36:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-04-10 14:36:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-10 14:36:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-04-10 14:36:30,388 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-04-10 14:36:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:30,388 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-04-10 14:36:30,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:36:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-04-10 14:36:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 14:36:30,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:30,388 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:30,388 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1685653542, now seen corresponding path program 16 times [2018-04-10 14:36:30,389 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:30,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:30,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 14:36:30,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,563 INFO L182 omatonBuilderFactory]: Interpolants [2880#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 2881#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 2882#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 2883#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 2884#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 2885#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 2886#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 2887#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 2888#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 2889#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 2890#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 2891#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 2892#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 2893#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 2894#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 2895#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 2877#true, 2878#false, 2879#(and (<= 0 main_~i~0) (<= main_~i~0 0))] [2018-04-10 14:36:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:30,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:36:30,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:36:30,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:36:30,564 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-04-10 14:36:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:30,910 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-04-10 14:36:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:36:30,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-10 14:36:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:30,911 INFO L225 Difference]: With dead ends: 98 [2018-04-10 14:36:30,911 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 14:36:30,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:36:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 14:36:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-10 14:36:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 14:36:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-04-10 14:36:30,913 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-04-10 14:36:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:30,913 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-04-10 14:36:30,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:36:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-04-10 14:36:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-10 14:36:30,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:30,914 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:30,914 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1777633431, now seen corresponding path program 17 times [2018-04-10 14:36:30,914 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:30,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:31,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 14:36:31,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,057 INFO L182 omatonBuilderFactory]: Interpolants [3104#(<= main_~i~0 10), 3105#(<= main_~i~0 11), 3106#(<= main_~i~0 12), 3107#(<= main_~i~0 13), 3108#(<= main_~i~0 14), 3109#(<= main_~i~0 15), 3110#(<= main_~i~0 16), 3111#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3112#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3092#true, 3093#false, 3094#(<= main_~i~0 0), 3095#(<= main_~i~0 1), 3096#(<= main_~i~0 2), 3097#(<= main_~i~0 3), 3098#(<= main_~i~0 4), 3099#(<= main_~i~0 5), 3100#(<= main_~i~0 6), 3101#(<= main_~i~0 7), 3102#(<= main_~i~0 8), 3103#(<= main_~i~0 9)] [2018-04-10 14:36:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:36:31,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:36:31,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:36:31,058 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 21 states. [2018-04-10 14:36:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:31,250 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-04-10 14:36:31,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:36:31,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-04-10 14:36:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:31,251 INFO L225 Difference]: With dead ends: 103 [2018-04-10 14:36:31,251 INFO L226 Difference]: Without dead ends: 103 [2018-04-10 14:36:31,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=516, Invalid=890, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:36:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-10 14:36:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-10 14:36:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-10 14:36:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-04-10 14:36:31,253 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-04-10 14:36:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:31,253 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-04-10 14:36:31,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:36:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-04-10 14:36:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 14:36:31,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:31,254 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:31,254 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -964909370, now seen corresponding path program 18 times [2018-04-10 14:36:31,255 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:31,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:31,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 14:36:31,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,411 INFO L182 omatonBuilderFactory]: Interpolants [3360#(<= main_~i~0 5), 3361#(<= main_~i~0 6), 3362#(<= main_~i~0 7), 3363#(<= main_~i~0 8), 3364#(<= main_~i~0 9), 3365#(<= main_~i~0 10), 3366#(<= main_~i~0 11), 3367#(<= main_~i~0 12), 3368#(<= main_~i~0 13), 3369#(<= main_~i~0 14), 3370#(<= main_~i~0 15), 3371#(<= main_~i~0 16), 3372#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3373#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3374#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 3353#true, 3354#false, 3355#(<= main_~i~0 0), 3356#(<= main_~i~0 1), 3357#(<= main_~i~0 2), 3358#(<= main_~i~0 3), 3359#(<= main_~i~0 4)] [2018-04-10 14:36:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:36:31,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:36:31,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:36:31,412 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 22 states. [2018-04-10 14:36:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:31,659 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-04-10 14:36:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 14:36:31,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-04-10 14:36:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:31,660 INFO L225 Difference]: With dead ends: 108 [2018-04-10 14:36:31,660 INFO L226 Difference]: Without dead ends: 108 [2018-04-10 14:36:31,660 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=537, Invalid=1023, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:36:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-10 14:36:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-10 14:36:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-10 14:36:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-04-10 14:36:31,663 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-04-10 14:36:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:31,663 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-04-10 14:36:31,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:36:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-04-10 14:36:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-10 14:36:31,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:31,664 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:31,664 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2138370569, now seen corresponding path program 19 times [2018-04-10 14:36:31,665 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:31,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:31,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 14:36:31,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,854 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (<= 0 main_~i~0) (<= main_~i~0 18)), 3649#(and (<= 1 main_~i~0) (<= main_~i~0 19)), 3627#true, 3628#false, 3629#(<= main_~i~0 0), 3630#(<= main_~i~0 1), 3631#(<= main_~i~0 2), 3632#(<= main_~i~0 3), 3633#(<= main_~i~0 4), 3634#(<= main_~i~0 5), 3635#(<= main_~i~0 6), 3636#(<= main_~i~0 7), 3637#(<= main_~i~0 8), 3638#(<= main_~i~0 9), 3639#(<= main_~i~0 10), 3640#(<= main_~i~0 11), 3641#(<= main_~i~0 12), 3642#(<= main_~i~0 13), 3643#(<= main_~i~0 14), 3644#(<= main_~i~0 15), 3645#(<= main_~i~0 16), 3646#(<= main_~i~0 17), 3647#(<= main_~i~0 18)] [2018-04-10 14:36:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:31,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:36:31,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:36:31,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:36:31,855 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-04-10 14:36:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:32,092 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-04-10 14:36:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:36:32,093 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-10 14:36:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:32,093 INFO L225 Difference]: With dead ends: 113 [2018-04-10 14:36:32,093 INFO L226 Difference]: Without dead ends: 113 [2018-04-10 14:36:32,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:36:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-10 14:36:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-04-10 14:36:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 14:36:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-04-10 14:36:32,095 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-04-10 14:36:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:32,096 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-04-10 14:36:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:36:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-04-10 14:36:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-10 14:36:32,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:32,096 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:32,096 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash -167608986, now seen corresponding path program 20 times [2018-04-10 14:36:32,097 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:32,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:32,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 14:36:32,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,300 INFO L182 omatonBuilderFactory]: Interpolants [3936#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 3937#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 3914#true, 3915#false, 3916#(<= main_~i~0 0), 3917#(<= main_~i~0 1), 3918#(<= main_~i~0 2), 3919#(<= main_~i~0 3), 3920#(<= main_~i~0 4), 3921#(<= main_~i~0 5), 3922#(<= main_~i~0 6), 3923#(<= main_~i~0 7), 3924#(<= main_~i~0 8), 3925#(<= main_~i~0 9), 3926#(<= main_~i~0 10), 3927#(<= main_~i~0 11), 3928#(<= main_~i~0 12), 3929#(<= main_~i~0 13), 3930#(<= main_~i~0 14), 3931#(<= main_~i~0 15), 3932#(<= main_~i~0 16), 3933#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 3934#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 3935#(and (<= 2 main_~i~0) (<= main_~i~0 18))] [2018-04-10 14:36:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 14:36:32,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 14:36:32,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:36:32,301 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-04-10 14:36:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:32,672 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-04-10 14:36:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:36:32,672 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-10 14:36:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:32,673 INFO L225 Difference]: With dead ends: 118 [2018-04-10 14:36:32,673 INFO L226 Difference]: Without dead ends: 118 [2018-04-10 14:36:32,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:36:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-10 14:36:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-04-10 14:36:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:36:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-04-10 14:36:32,675 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-04-10 14:36:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:32,675 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-04-10 14:36:32,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 14:36:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-04-10 14:36:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-10 14:36:32,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:32,676 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:32,676 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2051169111, now seen corresponding path program 21 times [2018-04-10 14:36:32,676 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:32,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:32,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 14:36:32,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,851 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= main_~i~0 8), 4225#(<= main_~i~0 9), 4226#(<= main_~i~0 10), 4227#(<= main_~i~0 11), 4228#(<= main_~i~0 12), 4229#(<= main_~i~0 13), 4230#(<= main_~i~0 14), 4231#(<= main_~i~0 15), 4232#(<= main_~i~0 16), 4233#(<= main_~i~0 17), 4234#(<= main_~i~0 18), 4235#(<= main_~i~0 19), 4236#(<= main_~i~0 20), 4237#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4238#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4214#true, 4215#false, 4216#(<= main_~i~0 0), 4217#(<= main_~i~0 1), 4218#(<= main_~i~0 2), 4219#(<= main_~i~0 3), 4220#(<= main_~i~0 4), 4221#(<= main_~i~0 5), 4222#(<= main_~i~0 6), 4223#(<= main_~i~0 7)] [2018-04-10 14:36:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:32,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:36:32,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:36:32,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:36:32,852 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-04-10 14:36:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:33,157 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-04-10 14:36:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:36:33,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-10 14:36:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:33,158 INFO L225 Difference]: With dead ends: 123 [2018-04-10 14:36:33,158 INFO L226 Difference]: Without dead ends: 123 [2018-04-10 14:36:33,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:36:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-10 14:36:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-10 14:36:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 14:36:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-04-10 14:36:33,160 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-04-10 14:36:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:33,160 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-04-10 14:36:33,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:36:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-04-10 14:36:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 14:36:33,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:33,161 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:33,161 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2141490182, now seen corresponding path program 22 times [2018-04-10 14:36:33,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:33,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:33,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 14:36:33,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,373 INFO L182 omatonBuilderFactory]: Interpolants [4544#(<= main_~i~0 15), 4545#(<= main_~i~0 16), 4546#(<= main_~i~0 17), 4547#(<= main_~i~0 18), 4548#(<= main_~i~0 19), 4549#(<= main_~i~0 20), 4550#(and (<= 0 main_~i~0) (<= main_~i~0 20)), 4551#(and (<= 1 main_~i~0) (<= main_~i~0 21)), 4552#(and (<= 2 main_~i~0) (<= main_~i~0 22)), 4527#true, 4528#false, 4529#(<= main_~i~0 0), 4530#(<= main_~i~0 1), 4531#(<= main_~i~0 2), 4532#(<= main_~i~0 3), 4533#(<= main_~i~0 4), 4534#(<= main_~i~0 5), 4535#(<= main_~i~0 6), 4536#(<= main_~i~0 7), 4537#(<= main_~i~0 8), 4538#(<= main_~i~0 9), 4539#(<= main_~i~0 10), 4540#(<= main_~i~0 11), 4541#(<= main_~i~0 12), 4542#(<= main_~i~0 13), 4543#(<= main_~i~0 14)] [2018-04-10 14:36:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:36:33,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:36:33,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:36:33,374 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-04-10 14:36:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:33,701 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-04-10 14:36:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:36:33,701 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-10 14:36:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:33,702 INFO L225 Difference]: With dead ends: 128 [2018-04-10 14:36:33,702 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 14:36:33,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:36:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 14:36:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-10 14:36:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 14:36:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-04-10 14:36:33,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-04-10 14:36:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:33,705 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-04-10 14:36:33,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:36:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-04-10 14:36:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 14:36:33,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:33,706 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:33,706 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1698664265, now seen corresponding path program 23 times [2018-04-10 14:36:33,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:33,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:33,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 14:36:33,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,948 INFO L182 omatonBuilderFactory]: Interpolants [4864#(<= main_~i~0 9), 4865#(<= main_~i~0 10), 4866#(<= main_~i~0 11), 4867#(<= main_~i~0 12), 4868#(<= main_~i~0 13), 4869#(<= main_~i~0 14), 4870#(<= main_~i~0 15), 4871#(<= main_~i~0 16), 4872#(<= main_~i~0 17), 4873#(<= main_~i~0 18), 4874#(<= main_~i~0 19), 4875#(<= main_~i~0 20), 4876#(<= main_~i~0 21), 4877#(<= main_~i~0 22), 4878#(and (<= 0 main_~i~0) (<= main_~i~0 22)), 4879#(and (<= 1 main_~i~0) (<= main_~i~0 23)), 4853#true, 4854#false, 4855#(<= main_~i~0 0), 4856#(<= main_~i~0 1), 4857#(<= main_~i~0 2), 4858#(<= main_~i~0 3), 4859#(<= main_~i~0 4), 4860#(<= main_~i~0 5), 4861#(<= main_~i~0 6), 4862#(<= main_~i~0 7), 4863#(<= main_~i~0 8)] [2018-04-10 14:36:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:33,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 14:36:33,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 14:36:33,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-04-10 14:36:33,949 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 27 states. [2018-04-10 14:36:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:34,294 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-04-10 14:36:34,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:36:34,294 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-04-10 14:36:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:34,294 INFO L225 Difference]: With dead ends: 133 [2018-04-10 14:36:34,295 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 14:36:34,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=1547, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:36:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 14:36:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-04-10 14:36:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 14:36:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-04-10 14:36:34,297 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-04-10 14:36:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:34,297 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-04-10 14:36:34,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 14:36:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-04-10 14:36:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-10 14:36:34,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:34,297 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:34,297 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2004669094, now seen corresponding path program 24 times [2018-04-10 14:36:34,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:34,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:34,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:34,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 14:36:34,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:34,563 INFO L182 omatonBuilderFactory]: Interpolants [5192#true, 5193#false, 5194#(<= main_~i~0 0), 5195#(<= main_~i~0 1), 5196#(<= main_~i~0 2), 5197#(<= main_~i~0 3), 5198#(<= main_~i~0 4), 5199#(<= main_~i~0 5), 5200#(<= main_~i~0 6), 5201#(<= main_~i~0 7), 5202#(<= main_~i~0 8), 5203#(<= main_~i~0 9), 5204#(<= main_~i~0 10), 5205#(<= main_~i~0 11), 5206#(<= main_~i~0 12), 5207#(<= main_~i~0 13), 5208#(<= main_~i~0 14), 5209#(<= main_~i~0 15), 5210#(<= main_~i~0 16), 5211#(and (<= 0 main_~i~0) (<= main_~i~0 16)), 5212#(and (<= main_~i~0 17) (<= 1 main_~i~0)), 5213#(and (<= 2 main_~i~0) (<= main_~i~0 18)), 5214#(and (<= main_~i~0 19) (<= 3 main_~i~0)), 5215#(and (<= 4 main_~i~0) (<= main_~i~0 20)), 5216#(and (<= 5 main_~i~0) (<= main_~i~0 21)), 5217#(and (<= 6 main_~i~0) (<= main_~i~0 22)), 5218#(and (<= 7 main_~i~0) (<= main_~i~0 23)), 5219#(and (<= 8 main_~i~0) (<= main_~i~0 24))] [2018-04-10 14:36:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:34,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:36:34,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:36:34,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:36:34,564 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 28 states. [2018-04-10 14:36:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:35,116 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-04-10 14:36:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:36:35,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 127 [2018-04-10 14:36:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:35,117 INFO L225 Difference]: With dead ends: 138 [2018-04-10 14:36:35,117 INFO L226 Difference]: Without dead ends: 138 [2018-04-10 14:36:35,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=663, Invalid=1989, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:36:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-10 14:36:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-04-10 14:36:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 14:36:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-04-10 14:36:35,119 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-04-10 14:36:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:35,120 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-04-10 14:36:35,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:36:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-04-10 14:36:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 14:36:35,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:35,120 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:35,120 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460887, now seen corresponding path program 25 times [2018-04-10 14:36:35,121 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:35,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:35,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 14:36:35,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,393 INFO L182 omatonBuilderFactory]: Interpolants [5568#(<= main_~i~0 22), 5569#(<= main_~i~0 23), 5570#(<= main_~i~0 24), 5571#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5572#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5544#true, 5545#false, 5546#(<= main_~i~0 0), 5547#(<= main_~i~0 1), 5548#(<= main_~i~0 2), 5549#(<= main_~i~0 3), 5550#(<= main_~i~0 4), 5551#(<= main_~i~0 5), 5552#(<= main_~i~0 6), 5553#(<= main_~i~0 7), 5554#(<= main_~i~0 8), 5555#(<= main_~i~0 9), 5556#(<= main_~i~0 10), 5557#(<= main_~i~0 11), 5558#(<= main_~i~0 12), 5559#(<= main_~i~0 13), 5560#(<= main_~i~0 14), 5561#(<= main_~i~0 15), 5562#(<= main_~i~0 16), 5563#(<= main_~i~0 17), 5564#(<= main_~i~0 18), 5565#(<= main_~i~0 19), 5566#(<= main_~i~0 20), 5567#(<= main_~i~0 21)] [2018-04-10 14:36:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 14:36:35,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 14:36:35,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:36:35,395 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-04-10 14:36:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:35,772 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-04-10 14:36:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:36:35,772 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-10 14:36:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:35,772 INFO L225 Difference]: With dead ends: 143 [2018-04-10 14:36:35,772 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 14:36:35,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 14:36:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 14:36:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-10 14:36:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-10 14:36:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-04-10 14:36:35,775 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-04-10 14:36:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:35,775 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-04-10 14:36:35,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 14:36:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-04-10 14:36:35,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 14:36:35,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:35,776 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:35,776 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash 421876038, now seen corresponding path program 26 times [2018-04-10 14:36:35,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:35,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:35,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 14:36:35,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,997 INFO L182 omatonBuilderFactory]: Interpolants [5909#true, 5910#false, 5911#(<= main_~i~0 0), 5912#(<= main_~i~0 1), 5913#(<= main_~i~0 2), 5914#(<= main_~i~0 3), 5915#(<= main_~i~0 4), 5916#(<= main_~i~0 5), 5917#(<= main_~i~0 6), 5918#(<= main_~i~0 7), 5919#(<= main_~i~0 8), 5920#(<= main_~i~0 9), 5921#(<= main_~i~0 10), 5922#(<= main_~i~0 11), 5923#(<= main_~i~0 12), 5924#(<= main_~i~0 13), 5925#(<= main_~i~0 14), 5926#(<= main_~i~0 15), 5927#(<= main_~i~0 16), 5928#(<= main_~i~0 17), 5929#(<= main_~i~0 18), 5930#(<= main_~i~0 19), 5931#(<= main_~i~0 20), 5932#(<= main_~i~0 21), 5933#(<= main_~i~0 22), 5934#(<= main_~i~0 23), 5935#(<= main_~i~0 24), 5936#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 5937#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 5938#(and (<= 2 main_~i~0) (<= main_~i~0 26))] [2018-04-10 14:36:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:35,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:36:35,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:36:35,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:36:35,998 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-04-10 14:36:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:36,422 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-04-10 14:36:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:36:36,422 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-10 14:36:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:36,423 INFO L225 Difference]: With dead ends: 148 [2018-04-10 14:36:36,423 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 14:36:36,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 14:36:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 14:36:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-04-10 14:36:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 14:36:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-04-10 14:36:36,426 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-04-10 14:36:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:36,426 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-04-10 14:36:36,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:36:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-04-10 14:36:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-10 14:36:36,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:36,427 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:36,427 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:36,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1993804937, now seen corresponding path program 27 times [2018-04-10 14:36:36,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:36,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:36,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:36,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 14:36:36,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:36,732 INFO L182 omatonBuilderFactory]: Interpolants [6287#true, 6288#false, 6289#(<= main_~i~0 0), 6290#(<= main_~i~0 1), 6291#(<= main_~i~0 2), 6292#(<= main_~i~0 3), 6293#(<= main_~i~0 4), 6294#(<= main_~i~0 5), 6295#(<= main_~i~0 6), 6296#(<= main_~i~0 7), 6297#(<= main_~i~0 8), 6298#(<= main_~i~0 9), 6299#(<= main_~i~0 10), 6300#(<= main_~i~0 11), 6301#(<= main_~i~0 12), 6302#(<= main_~i~0 13), 6303#(<= main_~i~0 14), 6304#(<= main_~i~0 15), 6305#(<= main_~i~0 16), 6306#(<= main_~i~0 17), 6307#(<= main_~i~0 18), 6308#(<= main_~i~0 19), 6309#(<= main_~i~0 20), 6310#(<= main_~i~0 21), 6311#(<= main_~i~0 22), 6312#(<= main_~i~0 23), 6313#(<= main_~i~0 24), 6314#(<= main_~i~0 25), 6315#(<= main_~i~0 26), 6316#(and (<= 0 main_~i~0) (<= main_~i~0 26)), 6317#(and (<= 1 main_~i~0) (<= main_~i~0 27))] [2018-04-10 14:36:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:36,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:36:36,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:36:36,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:36:36,734 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-04-10 14:36:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:37,097 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-04-10 14:36:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:36:37,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-10 14:36:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:37,097 INFO L225 Difference]: With dead ends: 153 [2018-04-10 14:36:37,098 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 14:36:37,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 14:36:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 14:36:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-10 14:36:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 14:36:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-04-10 14:36:37,100 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-04-10 14:36:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:37,101 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-04-10 14:36:37,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:36:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-04-10 14:36:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 14:36:37,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:37,102 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:37,102 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1740113894, now seen corresponding path program 28 times [2018-04-10 14:36:37,103 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:37,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:37,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:37,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 14:36:37,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:37,453 INFO L182 omatonBuilderFactory]: Interpolants [6678#true, 6679#false, 6680#(<= main_~i~0 0), 6681#(<= main_~i~0 1), 6682#(<= main_~i~0 2), 6683#(<= main_~i~0 3), 6684#(<= main_~i~0 4), 6685#(<= main_~i~0 5), 6686#(<= main_~i~0 6), 6687#(<= main_~i~0 7), 6688#(<= main_~i~0 8), 6689#(<= main_~i~0 9), 6690#(<= main_~i~0 10), 6691#(<= main_~i~0 11), 6692#(<= main_~i~0 12), 6693#(<= main_~i~0 13), 6694#(<= main_~i~0 14), 6695#(<= main_~i~0 15), 6696#(<= main_~i~0 16), 6697#(<= main_~i~0 17), 6698#(<= main_~i~0 18), 6699#(<= main_~i~0 19), 6700#(<= main_~i~0 20), 6701#(<= main_~i~0 21), 6702#(<= main_~i~0 22), 6703#(<= main_~i~0 23), 6704#(<= main_~i~0 24), 6705#(and (<= 0 main_~i~0) (<= main_~i~0 24)), 6706#(and (<= main_~i~0 25) (<= 1 main_~i~0)), 6707#(and (<= 2 main_~i~0) (<= main_~i~0 26)), 6708#(and (<= main_~i~0 27) (<= 3 main_~i~0)), 6709#(and (<= 4 main_~i~0) (<= main_~i~0 28))] [2018-04-10 14:36:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:37,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:36:37,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:36:37,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:36:37,455 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 32 states. [2018-04-10 14:36:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:38,093 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-04-10 14:36:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:36:38,094 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2018-04-10 14:36:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:38,095 INFO L225 Difference]: With dead ends: 158 [2018-04-10 14:36:38,095 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 14:36:38,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1143, Invalid=2397, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:36:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 14:36:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-10 14:36:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 14:36:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-04-10 14:36:38,099 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-04-10 14:36:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:38,099 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-04-10 14:36:38,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:36:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-04-10 14:36:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-10 14:36:38,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:38,100 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:38,100 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 685727959, now seen corresponding path program 29 times [2018-04-10 14:36:38,101 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:38,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:38,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:38,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 14:36:38,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:38,491 INFO L182 omatonBuilderFactory]: Interpolants [7104#(<= main_~i~0 20), 7105#(<= main_~i~0 21), 7106#(<= main_~i~0 22), 7107#(<= main_~i~0 23), 7108#(<= main_~i~0 24), 7109#(<= main_~i~0 25), 7110#(<= main_~i~0 26), 7111#(<= main_~i~0 27), 7112#(<= main_~i~0 28), 7113#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7114#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7082#true, 7083#false, 7084#(<= main_~i~0 0), 7085#(<= main_~i~0 1), 7086#(<= main_~i~0 2), 7087#(<= main_~i~0 3), 7088#(<= main_~i~0 4), 7089#(<= main_~i~0 5), 7090#(<= main_~i~0 6), 7091#(<= main_~i~0 7), 7092#(<= main_~i~0 8), 7093#(<= main_~i~0 9), 7094#(<= main_~i~0 10), 7095#(<= main_~i~0 11), 7096#(<= main_~i~0 12), 7097#(<= main_~i~0 13), 7098#(<= main_~i~0 14), 7099#(<= main_~i~0 15), 7100#(<= main_~i~0 16), 7101#(<= main_~i~0 17), 7102#(<= main_~i~0 18), 7103#(<= main_~i~0 19)] [2018-04-10 14:36:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:38,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:36:38,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:36:38,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:36:38,493 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 33 states. [2018-04-10 14:36:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:38,919 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-04-10 14:36:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:36:38,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-04-10 14:36:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:38,920 INFO L225 Difference]: With dead ends: 163 [2018-04-10 14:36:38,920 INFO L226 Difference]: Without dead ends: 163 [2018-04-10 14:36:38,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1398, Invalid=2384, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:36:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-10 14:36:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-10 14:36:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 14:36:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-04-10 14:36:38,923 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-04-10 14:36:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:38,924 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-04-10 14:36:38,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:36:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-04-10 14:36:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-10 14:36:38,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:38,925 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:38,925 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -842074490, now seen corresponding path program 30 times [2018-04-10 14:36:38,925 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:38,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:39,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:39,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 14:36:39,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:39,302 INFO L182 omatonBuilderFactory]: Interpolants [7499#true, 7500#false, 7501#(<= main_~i~0 0), 7502#(<= main_~i~0 1), 7503#(<= main_~i~0 2), 7504#(<= main_~i~0 3), 7505#(<= main_~i~0 4), 7506#(<= main_~i~0 5), 7507#(<= main_~i~0 6), 7508#(<= main_~i~0 7), 7509#(<= main_~i~0 8), 7510#(<= main_~i~0 9), 7511#(<= main_~i~0 10), 7512#(<= main_~i~0 11), 7513#(<= main_~i~0 12), 7514#(<= main_~i~0 13), 7515#(<= main_~i~0 14), 7516#(<= main_~i~0 15), 7517#(<= main_~i~0 16), 7518#(<= main_~i~0 17), 7519#(<= main_~i~0 18), 7520#(<= main_~i~0 19), 7521#(<= main_~i~0 20), 7522#(<= main_~i~0 21), 7523#(<= main_~i~0 22), 7524#(<= main_~i~0 23), 7525#(<= main_~i~0 24), 7526#(<= main_~i~0 25), 7527#(<= main_~i~0 26), 7528#(<= main_~i~0 27), 7529#(<= main_~i~0 28), 7530#(and (<= 0 main_~i~0) (<= main_~i~0 28)), 7531#(and (<= 1 main_~i~0) (<= main_~i~0 29)), 7532#(and (<= 2 main_~i~0) (<= main_~i~0 30))] [2018-04-10 14:36:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:39,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:36:39,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:36:39,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:36:39,303 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 34 states. [2018-04-10 14:36:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:39,802 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-04-10 14:36:39,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:36:39,803 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 157 [2018-04-10 14:36:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:39,803 INFO L225 Difference]: With dead ends: 168 [2018-04-10 14:36:39,804 INFO L226 Difference]: Without dead ends: 168 [2018-04-10 14:36:39,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=2601, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 14:36:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-10 14:36:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-10 14:36:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:36:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-04-10 14:36:39,807 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-04-10 14:36:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:39,807 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-04-10 14:36:39,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:36:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-04-10 14:36:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 14:36:39,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:39,808 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:39,808 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760951, now seen corresponding path program 31 times [2018-04-10 14:36:39,808 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:39,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:40,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:40,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 14:36:40,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:40,235 INFO L182 omatonBuilderFactory]: Interpolants [7936#(<= main_~i~0 5), 7937#(<= main_~i~0 6), 7938#(<= main_~i~0 7), 7939#(<= main_~i~0 8), 7940#(<= main_~i~0 9), 7941#(<= main_~i~0 10), 7942#(<= main_~i~0 11), 7943#(<= main_~i~0 12), 7944#(<= main_~i~0 13), 7945#(<= main_~i~0 14), 7946#(<= main_~i~0 15), 7947#(<= main_~i~0 16), 7948#(<= main_~i~0 17), 7949#(<= main_~i~0 18), 7950#(<= main_~i~0 19), 7951#(<= main_~i~0 20), 7952#(<= main_~i~0 21), 7953#(<= main_~i~0 22), 7954#(<= main_~i~0 23), 7955#(<= main_~i~0 24), 7956#(<= main_~i~0 25), 7957#(<= main_~i~0 26), 7958#(<= main_~i~0 27), 7959#(<= main_~i~0 28), 7960#(<= main_~i~0 29), 7961#(<= main_~i~0 30), 7962#(and (<= 0 main_~i~0) (<= main_~i~0 30)), 7963#(and (<= 1 main_~i~0) (<= main_~i~0 31)), 7929#true, 7930#false, 7931#(<= main_~i~0 0), 7932#(<= main_~i~0 1), 7933#(<= main_~i~0 2), 7934#(<= main_~i~0 3), 7935#(<= main_~i~0 4)] [2018-04-10 14:36:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:40,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:36:40,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:36:40,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:36:40,236 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-04-10 14:36:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:40,733 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-04-10 14:36:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:36:40,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-10 14:36:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:40,734 INFO L225 Difference]: With dead ends: 173 [2018-04-10 14:36:40,734 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 14:36:40,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 14:36:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 14:36:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-10 14:36:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-10 14:36:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-04-10 14:36:40,738 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-04-10 14:36:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:40,738 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-04-10 14:36:40,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:36:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-04-10 14:36:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 14:36:40,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:40,739 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:40,739 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1115415258, now seen corresponding path program 32 times [2018-04-10 14:36:40,740 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:40,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:41,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:41,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 14:36:41,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:41,381 INFO L182 omatonBuilderFactory]: Interpolants [8384#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 8385#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 8386#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 8387#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 8388#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 8389#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 8390#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 8391#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 8392#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 8393#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 8394#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 8395#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 8396#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 8397#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 8398#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 8399#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 8400#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 8401#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 8402#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 8403#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 8404#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 8405#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 8406#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 8372#true, 8373#false, 8374#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 8375#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 8376#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 8377#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 8378#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 8379#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 8380#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 8381#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 8382#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 8383#(and (<= main_~i~0 9) (<= 9 main_~i~0))] [2018-04-10 14:36:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:41,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:36:41,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:36:41,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:36:41,382 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-04-10 14:36:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:42,654 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-04-10 14:36:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 14:36:42,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-10 14:36:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:42,655 INFO L225 Difference]: With dead ends: 178 [2018-04-10 14:36:42,655 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 14:36:42,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:36:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 14:36:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-04-10 14:36:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-10 14:36:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-04-10 14:36:42,656 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-04-10 14:36:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:42,657 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-04-10 14:36:42,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:36:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-04-10 14:36:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 14:36:42,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:42,657 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:42,657 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -712076393, now seen corresponding path program 33 times [2018-04-10 14:36:42,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:42,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:43,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:43,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 14:36:43,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:43,272 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= main_~i~0 3), 8769#(<= main_~i~0 4), 8770#(<= main_~i~0 5), 8771#(<= main_~i~0 6), 8772#(<= main_~i~0 7), 8773#(<= main_~i~0 8), 8774#(<= main_~i~0 9), 8775#(<= main_~i~0 10), 8776#(<= main_~i~0 11), 8777#(<= main_~i~0 12), 8778#(<= main_~i~0 13), 8779#(<= main_~i~0 14), 8780#(<= main_~i~0 15), 8781#(<= main_~i~0 16), 8782#(<= main_~i~0 17), 8783#(<= main_~i~0 18), 8784#(<= main_~i~0 19), 8785#(<= main_~i~0 20), 8786#(<= main_~i~0 21), 8787#(<= main_~i~0 22), 8788#(<= main_~i~0 23), 8789#(<= main_~i~0 24), 8790#(<= main_~i~0 25), 8791#(<= main_~i~0 26), 8792#(<= main_~i~0 27), 8793#(<= main_~i~0 28), 8794#(<= main_~i~0 29), 8795#(<= main_~i~0 30), 8796#(<= main_~i~0 31), 8797#(<= main_~i~0 32), 8798#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 8799#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 8763#true, 8764#false, 8765#(<= main_~i~0 0), 8766#(<= main_~i~0 1), 8767#(<= main_~i~0 2)] [2018-04-10 14:36:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:43,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 14:36:43,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 14:36:43,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 14:36:43,274 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-04-10 14:36:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:43,772 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-04-10 14:36:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:36:43,772 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-10 14:36:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:43,773 INFO L225 Difference]: With dead ends: 183 [2018-04-10 14:36:43,773 INFO L226 Difference]: Without dead ends: 183 [2018-04-10 14:36:43,773 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 14:36:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-10 14:36:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-10 14:36:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-10 14:36:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-04-10 14:36:43,775 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-04-10 14:36:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:43,775 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-04-10 14:36:43,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 14:36:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-04-10 14:36:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 14:36:43,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:43,776 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:43,776 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1349614534, now seen corresponding path program 34 times [2018-04-10 14:36:43,776 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:43,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:44,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:44,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 14:36:44,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:44,178 INFO L182 omatonBuilderFactory]: Interpolants [9232#true, 9233#false, 9234#(<= main_~i~0 0), 9235#(<= main_~i~0 1), 9236#(<= main_~i~0 2), 9237#(<= main_~i~0 3), 9238#(<= main_~i~0 4), 9239#(<= main_~i~0 5), 9240#(<= main_~i~0 6), 9241#(<= main_~i~0 7), 9242#(<= main_~i~0 8), 9243#(<= main_~i~0 9), 9244#(<= main_~i~0 10), 9245#(<= main_~i~0 11), 9246#(<= main_~i~0 12), 9247#(<= main_~i~0 13), 9248#(<= main_~i~0 14), 9249#(<= main_~i~0 15), 9250#(<= main_~i~0 16), 9251#(<= main_~i~0 17), 9252#(<= main_~i~0 18), 9253#(<= main_~i~0 19), 9254#(<= main_~i~0 20), 9255#(<= main_~i~0 21), 9256#(<= main_~i~0 22), 9257#(<= main_~i~0 23), 9258#(<= main_~i~0 24), 9259#(<= main_~i~0 25), 9260#(<= main_~i~0 26), 9261#(<= main_~i~0 27), 9262#(<= main_~i~0 28), 9263#(<= main_~i~0 29), 9264#(<= main_~i~0 30), 9265#(<= main_~i~0 31), 9266#(<= main_~i~0 32), 9267#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 9268#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 9269#(and (<= 2 main_~i~0) (<= main_~i~0 34))] [2018-04-10 14:36:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:44,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:36:44,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:36:44,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:36:44,179 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-04-10 14:36:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:44,811 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-04-10 14:36:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 14:36:44,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-10 14:36:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:44,812 INFO L225 Difference]: With dead ends: 188 [2018-04-10 14:36:44,812 INFO L226 Difference]: Without dead ends: 188 [2018-04-10 14:36:44,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 14:36:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-10 14:36:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-04-10 14:36:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 14:36:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-04-10 14:36:44,815 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-04-10 14:36:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:44,815 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-04-10 14:36:44,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:36:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-04-10 14:36:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-10 14:36:44,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:44,815 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:44,815 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2024580873, now seen corresponding path program 35 times [2018-04-10 14:36:44,816 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:44,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:45,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:45,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 14:36:45,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:45,247 INFO L182 omatonBuilderFactory]: Interpolants [9728#(<= main_~i~0 12), 9729#(<= main_~i~0 13), 9730#(<= main_~i~0 14), 9731#(<= main_~i~0 15), 9732#(<= main_~i~0 16), 9733#(<= main_~i~0 17), 9734#(<= main_~i~0 18), 9735#(<= main_~i~0 19), 9736#(<= main_~i~0 20), 9737#(<= main_~i~0 21), 9738#(<= main_~i~0 22), 9739#(<= main_~i~0 23), 9740#(<= main_~i~0 24), 9741#(<= main_~i~0 25), 9742#(<= main_~i~0 26), 9743#(<= main_~i~0 27), 9744#(<= main_~i~0 28), 9745#(<= main_~i~0 29), 9746#(<= main_~i~0 30), 9747#(<= main_~i~0 31), 9748#(<= main_~i~0 32), 9749#(<= main_~i~0 33), 9750#(<= main_~i~0 34), 9751#(and (<= 0 main_~i~0) (<= main_~i~0 34)), 9752#(and (<= 1 main_~i~0) (<= main_~i~0 35)), 9714#true, 9715#false, 9716#(<= main_~i~0 0), 9717#(<= main_~i~0 1), 9718#(<= main_~i~0 2), 9719#(<= main_~i~0 3), 9720#(<= main_~i~0 4), 9721#(<= main_~i~0 5), 9722#(<= main_~i~0 6), 9723#(<= main_~i~0 7), 9724#(<= main_~i~0 8), 9725#(<= main_~i~0 9), 9726#(<= main_~i~0 10), 9727#(<= main_~i~0 11)] [2018-04-10 14:36:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:45,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:36:45,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:36:45,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:36:45,248 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 39 states. [2018-04-10 14:36:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:45,817 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-04-10 14:36:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:36:45,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-04-10 14:36:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:45,819 INFO L225 Difference]: With dead ends: 193 [2018-04-10 14:36:45,819 INFO L226 Difference]: Without dead ends: 193 [2018-04-10 14:36:45,820 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2001, Invalid=3401, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:36:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-10 14:36:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-04-10 14:36:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 14:36:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-04-10 14:36:45,822 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-04-10 14:36:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:45,824 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-04-10 14:36:45,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:36:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-04-10 14:36:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-10 14:36:45,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:45,825 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:45,825 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -407825818, now seen corresponding path program 36 times [2018-04-10 14:36:45,825 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:45,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:46,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:46,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-10 14:36:46,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:46,257 INFO L182 omatonBuilderFactory]: Interpolants [10240#(<= main_~i~0 29), 10241#(<= main_~i~0 30), 10242#(<= main_~i~0 31), 10243#(<= main_~i~0 32), 10244#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 10245#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 10246#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 10247#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 10248#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 10209#true, 10210#false, 10211#(<= main_~i~0 0), 10212#(<= main_~i~0 1), 10213#(<= main_~i~0 2), 10214#(<= main_~i~0 3), 10215#(<= main_~i~0 4), 10216#(<= main_~i~0 5), 10217#(<= main_~i~0 6), 10218#(<= main_~i~0 7), 10219#(<= main_~i~0 8), 10220#(<= main_~i~0 9), 10221#(<= main_~i~0 10), 10222#(<= main_~i~0 11), 10223#(<= main_~i~0 12), 10224#(<= main_~i~0 13), 10225#(<= main_~i~0 14), 10226#(<= main_~i~0 15), 10227#(<= main_~i~0 16), 10228#(<= main_~i~0 17), 10229#(<= main_~i~0 18), 10230#(<= main_~i~0 19), 10231#(<= main_~i~0 20), 10232#(<= main_~i~0 21), 10233#(<= main_~i~0 22), 10234#(<= main_~i~0 23), 10235#(<= main_~i~0 24), 10236#(<= main_~i~0 25), 10237#(<= main_~i~0 26), 10238#(<= main_~i~0 27), 10239#(<= main_~i~0 28)] [2018-04-10 14:36:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:46,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:36:46,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:36:46,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=954, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:36:46,258 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 40 states. [2018-04-10 14:36:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:46,968 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-04-10 14:36:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 14:36:46,969 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 187 [2018-04-10 14:36:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:46,969 INFO L225 Difference]: With dead ends: 198 [2018-04-10 14:36:46,969 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 14:36:46,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1899, Invalid=3801, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 14:36:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 14:36:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-04-10 14:36:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 14:36:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-04-10 14:36:46,972 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-04-10 14:36:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:46,972 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-04-10 14:36:46,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:36:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-04-10 14:36:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-10 14:36:46,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:46,972 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:46,972 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1486297513, now seen corresponding path program 37 times [2018-04-10 14:36:46,973 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:46,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:47,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:47,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 14:36:47,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:47,442 INFO L182 omatonBuilderFactory]: Interpolants [10752#(<= main_~i~0 33), 10753#(<= main_~i~0 34), 10754#(<= main_~i~0 35), 10755#(<= main_~i~0 36), 10756#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 10757#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 10717#true, 10718#false, 10719#(<= main_~i~0 0), 10720#(<= main_~i~0 1), 10721#(<= main_~i~0 2), 10722#(<= main_~i~0 3), 10723#(<= main_~i~0 4), 10724#(<= main_~i~0 5), 10725#(<= main_~i~0 6), 10726#(<= main_~i~0 7), 10727#(<= main_~i~0 8), 10728#(<= main_~i~0 9), 10729#(<= main_~i~0 10), 10730#(<= main_~i~0 11), 10731#(<= main_~i~0 12), 10732#(<= main_~i~0 13), 10733#(<= main_~i~0 14), 10734#(<= main_~i~0 15), 10735#(<= main_~i~0 16), 10736#(<= main_~i~0 17), 10737#(<= main_~i~0 18), 10738#(<= main_~i~0 19), 10739#(<= main_~i~0 20), 10740#(<= main_~i~0 21), 10741#(<= main_~i~0 22), 10742#(<= main_~i~0 23), 10743#(<= main_~i~0 24), 10744#(<= main_~i~0 25), 10745#(<= main_~i~0 26), 10746#(<= main_~i~0 27), 10747#(<= main_~i~0 28), 10748#(<= main_~i~0 29), 10749#(<= main_~i~0 30), 10750#(<= main_~i~0 31), 10751#(<= main_~i~0 32)] [2018-04-10 14:36:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:47,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 14:36:47,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 14:36:47,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 14:36:47,443 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-04-10 14:36:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:47,993 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-04-10 14:36:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:36:47,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-10 14:36:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:47,994 INFO L225 Difference]: With dead ends: 203 [2018-04-10 14:36:47,994 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 14:36:47,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 14:36:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 14:36:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-04-10 14:36:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-10 14:36:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-04-10 14:36:47,996 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-04-10 14:36:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:47,996 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-04-10 14:36:47,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 14:36:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-04-10 14:36:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 14:36:47,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:47,997 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:47,997 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -874716922, now seen corresponding path program 38 times [2018-04-10 14:36:47,997 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:48,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:48,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:48,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-10 14:36:48,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:48,538 INFO L182 omatonBuilderFactory]: Interpolants [11264#(<= main_~i~0 24), 11265#(<= main_~i~0 25), 11266#(<= main_~i~0 26), 11267#(<= main_~i~0 27), 11268#(<= main_~i~0 28), 11269#(<= main_~i~0 29), 11270#(<= main_~i~0 30), 11271#(<= main_~i~0 31), 11272#(<= main_~i~0 32), 11273#(<= main_~i~0 33), 11274#(<= main_~i~0 34), 11275#(<= main_~i~0 35), 11276#(<= main_~i~0 36), 11277#(and (<= 0 main_~i~0) (<= main_~i~0 36)), 11278#(and (<= 1 main_~i~0) (<= main_~i~0 37)), 11279#(and (<= 2 main_~i~0) (<= main_~i~0 38)), 11238#true, 11239#false, 11240#(<= main_~i~0 0), 11241#(<= main_~i~0 1), 11242#(<= main_~i~0 2), 11243#(<= main_~i~0 3), 11244#(<= main_~i~0 4), 11245#(<= main_~i~0 5), 11246#(<= main_~i~0 6), 11247#(<= main_~i~0 7), 11248#(<= main_~i~0 8), 11249#(<= main_~i~0 9), 11250#(<= main_~i~0 10), 11251#(<= main_~i~0 11), 11252#(<= main_~i~0 12), 11253#(<= main_~i~0 13), 11254#(<= main_~i~0 14), 11255#(<= main_~i~0 15), 11256#(<= main_~i~0 16), 11257#(<= main_~i~0 17), 11258#(<= main_~i~0 18), 11259#(<= main_~i~0 19), 11260#(<= main_~i~0 20), 11261#(<= main_~i~0 21), 11262#(<= main_~i~0 22), 11263#(<= main_~i~0 23)] [2018-04-10 14:36:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:48,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 14:36:48,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 14:36:48,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 14:36:48,539 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-04-10 14:36:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:49,228 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-04-10 14:36:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 14:36:49,229 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-10 14:36:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:49,229 INFO L225 Difference]: With dead ends: 208 [2018-04-10 14:36:49,229 INFO L226 Difference]: Without dead ends: 208 [2018-04-10 14:36:49,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 14:36:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-10 14:36:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-04-10 14:36:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-10 14:36:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-04-10 14:36:49,235 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-04-10 14:36:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:49,235 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-04-10 14:36:49,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 14:36:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-04-10 14:36:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 14:36:49,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:49,236 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:49,236 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093175, now seen corresponding path program 39 times [2018-04-10 14:36:49,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:49,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:49,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:49,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 14:36:49,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:49,690 INFO L182 omatonBuilderFactory]: Interpolants [11776#(<= main_~i~0 2), 11777#(<= main_~i~0 3), 11778#(<= main_~i~0 4), 11779#(<= main_~i~0 5), 11780#(<= main_~i~0 6), 11781#(<= main_~i~0 7), 11782#(<= main_~i~0 8), 11783#(<= main_~i~0 9), 11784#(<= main_~i~0 10), 11785#(<= main_~i~0 11), 11786#(<= main_~i~0 12), 11787#(<= main_~i~0 13), 11788#(<= main_~i~0 14), 11789#(<= main_~i~0 15), 11790#(<= main_~i~0 16), 11791#(<= main_~i~0 17), 11792#(<= main_~i~0 18), 11793#(<= main_~i~0 19), 11794#(<= main_~i~0 20), 11795#(<= main_~i~0 21), 11796#(<= main_~i~0 22), 11797#(<= main_~i~0 23), 11798#(<= main_~i~0 24), 11799#(<= main_~i~0 25), 11800#(<= main_~i~0 26), 11801#(<= main_~i~0 27), 11802#(<= main_~i~0 28), 11803#(<= main_~i~0 29), 11804#(<= main_~i~0 30), 11805#(<= main_~i~0 31), 11806#(<= main_~i~0 32), 11807#(<= main_~i~0 33), 11808#(<= main_~i~0 34), 11809#(<= main_~i~0 35), 11810#(<= main_~i~0 36), 11811#(<= main_~i~0 37), 11812#(<= main_~i~0 38), 11813#(and (<= 0 main_~i~0) (<= main_~i~0 38)), 11814#(and (<= 1 main_~i~0) (<= main_~i~0 39)), 11772#true, 11773#false, 11774#(<= main_~i~0 0), 11775#(<= main_~i~0 1)] [2018-04-10 14:36:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:49,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 14:36:49,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 14:36:49,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:36:49,691 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-04-10 14:36:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:50,335 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-04-10 14:36:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 14:36:50,335 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-10 14:36:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:50,336 INFO L225 Difference]: With dead ends: 213 [2018-04-10 14:36:50,336 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 14:36:50,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 14:36:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 14:36:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-10 14:36:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 14:36:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-04-10 14:36:50,338 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-04-10 14:36:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:50,338 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-04-10 14:36:50,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 14:36:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-04-10 14:36:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 14:36:50,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:50,339 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:50,339 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -854661210, now seen corresponding path program 40 times [2018-04-10 14:36:50,339 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:50,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:50,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:50,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-10 14:36:50,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:50,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-10 14:36:50,813 INFO L182 omatonBuilderFactory]: Interpolants [12352#(<= main_~i~0 31), 12353#(<= main_~i~0 32), 12354#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 12355#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 12356#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 12357#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 12358#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 12359#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 12360#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 12361#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 12362#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 12319#true, 12320#false, 12321#(<= main_~i~0 0), 12322#(<= main_~i~0 1), 12323#(<= main_~i~0 2), 12324#(<= main_~i~0 3), 12325#(<= main_~i~0 4), 12326#(<= main_~i~0 5), 12327#(<= main_~i~0 6), 12328#(<= main_~i~0 7), 12329#(<= main_~i~0 8), 12330#(<= main_~i~0 9), 12331#(<= main_~i~0 10), 12332#(<= main_~i~0 11), 12333#(<= main_~i~0 12), 12334#(<= main_~i~0 13), 12335#(<= main_~i~0 14), 12336#(<= main_~i~0 15), 12337#(<= main_~i~0 16), 12338#(<= main_~i~0 17), 12339#(<= main_~i~0 18), 12340#(<= main_~i~0 19), 12341#(<= main_~i~0 20), 12342#(<= main_~i~0 21), 12343#(<= main_~i~0 22), 12344#(<= main_~i~0 23), 12345#(<= main_~i~0 24), 12346#(<= main_~i~0 25), 12347#(<= main_~i~0 26), 12348#(<= main_~i~0 27), 12349#(<= main_~i~0 28), 12350#(<= main_~i~0 29), 12351#(<= main_~i~0 30)] [2018-04-10 14:36:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:50,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 14:36:50,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 14:36:50,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:36:50,814 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-04-10 14:36:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:51,880 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-04-10 14:36:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 14:36:51,880 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-10 14:36:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:51,881 INFO L225 Difference]: With dead ends: 218 [2018-04-10 14:36:51,881 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 14:36:51,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 14:36:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 14:36:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-04-10 14:36:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-10 14:36:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-04-10 14:36:51,883 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-04-10 14:36:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:51,883 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-04-10 14:36:51,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 14:36:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-04-10 14:36:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 14:36:51,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:51,884 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:51,884 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:51,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2040420631, now seen corresponding path program 41 times [2018-04-10 14:36:51,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:51,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:52,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:52,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 14:36:52,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:52,372 INFO L182 omatonBuilderFactory]: Interpolants [12879#true, 12880#false, 12881#(<= main_~i~0 0), 12882#(<= main_~i~0 1), 12883#(<= main_~i~0 2), 12884#(<= main_~i~0 3), 12885#(<= main_~i~0 4), 12886#(<= main_~i~0 5), 12887#(<= main_~i~0 6), 12888#(<= main_~i~0 7), 12889#(<= main_~i~0 8), 12890#(<= main_~i~0 9), 12891#(<= main_~i~0 10), 12892#(<= main_~i~0 11), 12893#(<= main_~i~0 12), 12894#(<= main_~i~0 13), 12895#(<= main_~i~0 14), 12896#(<= main_~i~0 15), 12897#(<= main_~i~0 16), 12898#(<= main_~i~0 17), 12899#(<= main_~i~0 18), 12900#(<= main_~i~0 19), 12901#(<= main_~i~0 20), 12902#(<= main_~i~0 21), 12903#(<= main_~i~0 22), 12904#(<= main_~i~0 23), 12905#(<= main_~i~0 24), 12906#(<= main_~i~0 25), 12907#(<= main_~i~0 26), 12908#(<= main_~i~0 27), 12909#(<= main_~i~0 28), 12910#(<= main_~i~0 29), 12911#(<= main_~i~0 30), 12912#(<= main_~i~0 31), 12913#(<= main_~i~0 32), 12914#(<= main_~i~0 33), 12915#(<= main_~i~0 34), 12916#(<= main_~i~0 35), 12917#(<= main_~i~0 36), 12918#(<= main_~i~0 37), 12919#(<= main_~i~0 38), 12920#(<= main_~i~0 39), 12921#(<= main_~i~0 40), 12922#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 12923#(and (<= 1 main_~i~0) (<= main_~i~0 41))] [2018-04-10 14:36:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:52,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 14:36:52,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 14:36:52,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:36:52,373 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 45 states. [2018-04-10 14:36:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:53,040 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-04-10 14:36:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 14:36:53,040 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-04-10 14:36:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:53,041 INFO L225 Difference]: With dead ends: 223 [2018-04-10 14:36:53,041 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 14:36:53,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2712, Invalid=4598, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 14:36:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 14:36:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-10 14:36:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-10 14:36:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-04-10 14:36:53,045 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-04-10 14:36:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:53,045 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-04-10 14:36:53,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 14:36:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-04-10 14:36:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 14:36:53,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:53,046 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:53,046 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -488561082, now seen corresponding path program 42 times [2018-04-10 14:36:53,047 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:53,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:53,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:53,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-10 14:36:53,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:53,592 INFO L182 omatonBuilderFactory]: Interpolants [13452#true, 13453#false, 13454#(<= main_~i~0 0), 13455#(<= main_~i~0 1), 13456#(<= main_~i~0 2), 13457#(<= main_~i~0 3), 13458#(<= main_~i~0 4), 13459#(<= main_~i~0 5), 13460#(<= main_~i~0 6), 13461#(<= main_~i~0 7), 13462#(<= main_~i~0 8), 13463#(<= main_~i~0 9), 13464#(<= main_~i~0 10), 13465#(<= main_~i~0 11), 13466#(<= main_~i~0 12), 13467#(<= main_~i~0 13), 13468#(<= main_~i~0 14), 13469#(<= main_~i~0 15), 13470#(<= main_~i~0 16), 13471#(<= main_~i~0 17), 13472#(<= main_~i~0 18), 13473#(<= main_~i~0 19), 13474#(<= main_~i~0 20), 13475#(<= main_~i~0 21), 13476#(<= main_~i~0 22), 13477#(<= main_~i~0 23), 13478#(<= main_~i~0 24), 13479#(<= main_~i~0 25), 13480#(<= main_~i~0 26), 13481#(<= main_~i~0 27), 13482#(<= main_~i~0 28), 13483#(<= main_~i~0 29), 13484#(<= main_~i~0 30), 13485#(<= main_~i~0 31), 13486#(<= main_~i~0 32), 13487#(<= main_~i~0 33), 13488#(<= main_~i~0 34), 13489#(<= main_~i~0 35), 13490#(<= main_~i~0 36), 13491#(<= main_~i~0 37), 13492#(<= main_~i~0 38), 13493#(<= main_~i~0 39), 13494#(<= main_~i~0 40), 13495#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 13496#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 13497#(and (<= 2 main_~i~0) (<= main_~i~0 42))] [2018-04-10 14:36:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:53,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:36:53,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:36:53,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:36:53,592 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 46 states. [2018-04-10 14:36:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:54,367 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-04-10 14:36:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 14:36:54,367 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 217 [2018-04-10 14:36:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:54,368 INFO L225 Difference]: With dead ends: 228 [2018-04-10 14:36:54,368 INFO L226 Difference]: Without dead ends: 228 [2018-04-10 14:36:54,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2757, Invalid=4899, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 14:36:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-10 14:36:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-04-10 14:36:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-10 14:36:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-04-10 14:36:54,370 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-04-10 14:36:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:54,371 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-04-10 14:36:54,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:36:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-04-10 14:36:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-10 14:36:54,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:54,371 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:54,371 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 344604279, now seen corresponding path program 43 times [2018-04-10 14:36:54,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:54,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:54,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:54,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 14:36:54,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:54,985 INFO L182 omatonBuilderFactory]: Interpolants [14080#(<= main_~i~0 40), 14081#(<= main_~i~0 41), 14082#(<= main_~i~0 42), 14083#(and (<= 0 main_~i~0) (<= main_~i~0 42)), 14084#(and (<= 1 main_~i~0) (<= main_~i~0 43)), 14038#true, 14039#false, 14040#(<= main_~i~0 0), 14041#(<= main_~i~0 1), 14042#(<= main_~i~0 2), 14043#(<= main_~i~0 3), 14044#(<= main_~i~0 4), 14045#(<= main_~i~0 5), 14046#(<= main_~i~0 6), 14047#(<= main_~i~0 7), 14048#(<= main_~i~0 8), 14049#(<= main_~i~0 9), 14050#(<= main_~i~0 10), 14051#(<= main_~i~0 11), 14052#(<= main_~i~0 12), 14053#(<= main_~i~0 13), 14054#(<= main_~i~0 14), 14055#(<= main_~i~0 15), 14056#(<= main_~i~0 16), 14057#(<= main_~i~0 17), 14058#(<= main_~i~0 18), 14059#(<= main_~i~0 19), 14060#(<= main_~i~0 20), 14061#(<= main_~i~0 21), 14062#(<= main_~i~0 22), 14063#(<= main_~i~0 23), 14064#(<= main_~i~0 24), 14065#(<= main_~i~0 25), 14066#(<= main_~i~0 26), 14067#(<= main_~i~0 27), 14068#(<= main_~i~0 28), 14069#(<= main_~i~0 29), 14070#(<= main_~i~0 30), 14071#(<= main_~i~0 31), 14072#(<= main_~i~0 32), 14073#(<= main_~i~0 33), 14074#(<= main_~i~0 34), 14075#(<= main_~i~0 35), 14076#(<= main_~i~0 36), 14077#(<= main_~i~0 37), 14078#(<= main_~i~0 38), 14079#(<= main_~i~0 39)] [2018-04-10 14:36:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:54,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 14:36:54,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 14:36:54,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:36:54,986 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-04-10 14:36:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:55,689 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-04-10 14:36:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 14:36:55,689 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-10 14:36:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:55,690 INFO L225 Difference]: With dead ends: 233 [2018-04-10 14:36:55,690 INFO L226 Difference]: Without dead ends: 233 [2018-04-10 14:36:55,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 14:36:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-10 14:36:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-04-10 14:36:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 14:36:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-04-10 14:36:55,693 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-04-10 14:36:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:55,693 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-04-10 14:36:55,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 14:36:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-04-10 14:36:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 14:36:55,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:55,694 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:55,694 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -865231642, now seen corresponding path program 44 times [2018-04-10 14:36:55,695 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:55,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:56,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:56,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:56,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 14:36:56,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:56,307 INFO L182 omatonBuilderFactory]: Interpolants [14656#(<= main_~i~0 17), 14657#(<= main_~i~0 18), 14658#(<= main_~i~0 19), 14659#(<= main_~i~0 20), 14660#(<= main_~i~0 21), 14661#(<= main_~i~0 22), 14662#(<= main_~i~0 23), 14663#(<= main_~i~0 24), 14664#(<= main_~i~0 25), 14665#(<= main_~i~0 26), 14666#(<= main_~i~0 27), 14667#(<= main_~i~0 28), 14668#(<= main_~i~0 29), 14669#(<= main_~i~0 30), 14670#(<= main_~i~0 31), 14671#(<= main_~i~0 32), 14672#(<= main_~i~0 33), 14673#(<= main_~i~0 34), 14674#(<= main_~i~0 35), 14675#(<= main_~i~0 36), 14676#(<= main_~i~0 37), 14677#(<= main_~i~0 38), 14678#(<= main_~i~0 39), 14679#(<= main_~i~0 40), 14680#(and (<= 0 main_~i~0) (<= main_~i~0 40)), 14681#(and (<= 1 main_~i~0) (<= main_~i~0 41)), 14682#(and (<= 2 main_~i~0) (<= main_~i~0 42)), 14683#(and (<= main_~i~0 43) (<= 3 main_~i~0)), 14684#(and (<= main_~i~0 44) (<= 4 main_~i~0)), 14637#true, 14638#false, 14639#(<= main_~i~0 0), 14640#(<= main_~i~0 1), 14641#(<= main_~i~0 2), 14642#(<= main_~i~0 3), 14643#(<= main_~i~0 4), 14644#(<= main_~i~0 5), 14645#(<= main_~i~0 6), 14646#(<= main_~i~0 7), 14647#(<= main_~i~0 8), 14648#(<= main_~i~0 9), 14649#(<= main_~i~0 10), 14650#(<= main_~i~0 11), 14651#(<= main_~i~0 12), 14652#(<= main_~i~0 13), 14653#(<= main_~i~0 14), 14654#(<= main_~i~0 15), 14655#(<= main_~i~0 16)] [2018-04-10 14:36:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:56,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 14:36:56,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 14:36:56,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=1342, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:36:56,308 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 48 states. [2018-04-10 14:36:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:57,231 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-04-10 14:36:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 14:36:57,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 227 [2018-04-10 14:36:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:57,232 INFO L225 Difference]: With dead ends: 238 [2018-04-10 14:36:57,232 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 14:36:57,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2847, Invalid=5525, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 14:36:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 14:36:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-04-10 14:36:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-10 14:36:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-04-10 14:36:57,235 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-04-10 14:36:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:57,235 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-04-10 14:36:57,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 14:36:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-04-10 14:36:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 14:36:57,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:57,236 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:57,237 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1352733737, now seen corresponding path program 45 times [2018-04-10 14:36:57,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:57,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:57,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:57,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 14:36:57,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:57,867 INFO L182 omatonBuilderFactory]: Interpolants [15249#true, 15250#false, 15251#(<= main_~i~0 0), 15252#(<= main_~i~0 1), 15253#(<= main_~i~0 2), 15254#(<= main_~i~0 3), 15255#(<= main_~i~0 4), 15256#(<= main_~i~0 5), 15257#(<= main_~i~0 6), 15258#(<= main_~i~0 7), 15259#(<= main_~i~0 8), 15260#(<= main_~i~0 9), 15261#(<= main_~i~0 10), 15262#(<= main_~i~0 11), 15263#(<= main_~i~0 12), 15264#(<= main_~i~0 13), 15265#(<= main_~i~0 14), 15266#(<= main_~i~0 15), 15267#(<= main_~i~0 16), 15268#(<= main_~i~0 17), 15269#(<= main_~i~0 18), 15270#(<= main_~i~0 19), 15271#(<= main_~i~0 20), 15272#(<= main_~i~0 21), 15273#(<= main_~i~0 22), 15274#(<= main_~i~0 23), 15275#(<= main_~i~0 24), 15276#(<= main_~i~0 25), 15277#(<= main_~i~0 26), 15278#(<= main_~i~0 27), 15279#(<= main_~i~0 28), 15280#(<= main_~i~0 29), 15281#(<= main_~i~0 30), 15282#(<= main_~i~0 31), 15283#(<= main_~i~0 32), 15284#(<= main_~i~0 33), 15285#(<= main_~i~0 34), 15286#(<= main_~i~0 35), 15287#(<= main_~i~0 36), 15288#(<= main_~i~0 37), 15289#(<= main_~i~0 38), 15290#(<= main_~i~0 39), 15291#(<= main_~i~0 40), 15292#(<= main_~i~0 41), 15293#(<= main_~i~0 42), 15294#(<= main_~i~0 43), 15295#(<= main_~i~0 44), 15296#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15297#(and (<= 1 main_~i~0) (<= main_~i~0 45))] [2018-04-10 14:36:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:57,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 14:36:57,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 14:36:57,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 14:36:57,869 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-04-10 14:36:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:36:58,689 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-04-10 14:36:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 14:36:58,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-10 14:36:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:36:58,690 INFO L225 Difference]: With dead ends: 243 [2018-04-10 14:36:58,690 INFO L226 Difference]: Without dead ends: 243 [2018-04-10 14:36:58,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 14:36:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-10 14:36:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-04-10 14:36:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 14:36:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-04-10 14:36:58,694 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-04-10 14:36:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:36:58,694 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-04-10 14:36:58,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 14:36:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-04-10 14:36:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-10 14:36:58,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:36:58,695 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-10 14:36:58,696 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:36:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1337046138, now seen corresponding path program 46 times [2018-04-10 14:36:58,696 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:36:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:36:58,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:36:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:59,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:36:59,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-10 14:36:59,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:36:59,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-10 14:36:59,321 INFO L182 omatonBuilderFactory]: Interpolants [15874#true, 15875#false, 15876#(<= main_~i~0 0), 15877#(<= main_~i~0 1), 15878#(<= main_~i~0 2), 15879#(<= main_~i~0 3), 15880#(<= main_~i~0 4), 15881#(<= main_~i~0 5), 15882#(<= main_~i~0 6), 15883#(<= main_~i~0 7), 15884#(<= main_~i~0 8), 15885#(<= main_~i~0 9), 15886#(<= main_~i~0 10), 15887#(<= main_~i~0 11), 15888#(<= main_~i~0 12), 15889#(<= main_~i~0 13), 15890#(<= main_~i~0 14), 15891#(<= main_~i~0 15), 15892#(<= main_~i~0 16), 15893#(<= main_~i~0 17), 15894#(<= main_~i~0 18), 15895#(<= main_~i~0 19), 15896#(<= main_~i~0 20), 15897#(<= main_~i~0 21), 15898#(<= main_~i~0 22), 15899#(<= main_~i~0 23), 15900#(<= main_~i~0 24), 15901#(<= main_~i~0 25), 15902#(<= main_~i~0 26), 15903#(<= main_~i~0 27), 15904#(<= main_~i~0 28), 15905#(<= main_~i~0 29), 15906#(<= main_~i~0 30), 15907#(<= main_~i~0 31), 15908#(<= main_~i~0 32), 15909#(<= main_~i~0 33), 15910#(<= main_~i~0 34), 15911#(<= main_~i~0 35), 15912#(<= main_~i~0 36), 15913#(<= main_~i~0 37), 15914#(<= main_~i~0 38), 15915#(<= main_~i~0 39), 15916#(<= main_~i~0 40), 15917#(<= main_~i~0 41), 15918#(<= main_~i~0 42), 15919#(<= main_~i~0 43), 15920#(<= main_~i~0 44), 15921#(and (<= 0 main_~i~0) (<= main_~i~0 44)), 15922#(and (<= 1 main_~i~0) (<= main_~i~0 45)), 15923#(and (<= 2 main_~i~0) (<= main_~i~0 46))] [2018-04-10 14:36:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:36:59,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:36:59,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:36:59,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:36:59,322 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-04-10 14:37:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:00,227 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-04-10 14:37:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 14:37:00,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-10 14:37:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:00,228 INFO L225 Difference]: With dead ends: 248 [2018-04-10 14:37:00,228 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 14:37:00,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 14:37:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 14:37:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-04-10 14:37:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 14:37:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-04-10 14:37:00,231 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-04-10 14:37:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:00,231 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-04-10 14:37:00,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:37:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-04-10 14:37:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-10 14:37:00,232 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:00,233 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:00,233 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash 868376887, now seen corresponding path program 47 times [2018-04-10 14:37:00,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:00,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:00,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:00,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 14:37:00,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:00,883 INFO L182 omatonBuilderFactory]: Interpolants [16512#true, 16513#false, 16514#(<= main_~i~0 0), 16515#(<= main_~i~0 1), 16516#(<= main_~i~0 2), 16517#(<= main_~i~0 3), 16518#(<= main_~i~0 4), 16519#(<= main_~i~0 5), 16520#(<= main_~i~0 6), 16521#(<= main_~i~0 7), 16522#(<= main_~i~0 8), 16523#(<= main_~i~0 9), 16524#(<= main_~i~0 10), 16525#(<= main_~i~0 11), 16526#(<= main_~i~0 12), 16527#(<= main_~i~0 13), 16528#(<= main_~i~0 14), 16529#(<= main_~i~0 15), 16530#(<= main_~i~0 16), 16531#(<= main_~i~0 17), 16532#(<= main_~i~0 18), 16533#(<= main_~i~0 19), 16534#(<= main_~i~0 20), 16535#(<= main_~i~0 21), 16536#(<= main_~i~0 22), 16537#(<= main_~i~0 23), 16538#(<= main_~i~0 24), 16539#(<= main_~i~0 25), 16540#(<= main_~i~0 26), 16541#(<= main_~i~0 27), 16542#(<= main_~i~0 28), 16543#(<= main_~i~0 29), 16544#(<= main_~i~0 30), 16545#(<= main_~i~0 31), 16546#(<= main_~i~0 32), 16547#(<= main_~i~0 33), 16548#(<= main_~i~0 34), 16549#(<= main_~i~0 35), 16550#(<= main_~i~0 36), 16551#(<= main_~i~0 37), 16552#(<= main_~i~0 38), 16553#(<= main_~i~0 39), 16554#(<= main_~i~0 40), 16555#(<= main_~i~0 41), 16556#(<= main_~i~0 42), 16557#(<= main_~i~0 43), 16558#(<= main_~i~0 44), 16559#(<= main_~i~0 45), 16560#(<= main_~i~0 46), 16561#(and (<= 0 main_~i~0) (<= main_~i~0 46)), 16562#(and (<= 1 main_~i~0) (<= main_~i~0 47))] [2018-04-10 14:37:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:00,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 14:37:00,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 14:37:00,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:37:00,884 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 51 states. [2018-04-10 14:37:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:02,004 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-04-10 14:37:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 14:37:02,005 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-04-10 14:37:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:02,005 INFO L225 Difference]: With dead ends: 253 [2018-04-10 14:37:02,005 INFO L226 Difference]: Without dead ends: 253 [2018-04-10 14:37:02,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3531, Invalid=5975, Unknown=0, NotChecked=0, Total=9506 [2018-04-10 14:37:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-10 14:37:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-04-10 14:37:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-10 14:37:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-04-10 14:37:02,009 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-04-10 14:37:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:02,009 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-04-10 14:37:02,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 14:37:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-04-10 14:37:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 14:37:02,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:02,011 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:02,011 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1130548698, now seen corresponding path program 48 times [2018-04-10 14:37:02,011 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:02,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:02,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:02,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 14:37:02,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:02,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-10 14:37:02,736 INFO L182 omatonBuilderFactory]: Interpolants [17163#true, 17164#false, 17165#(<= main_~i~0 0), 17166#(<= main_~i~0 1), 17167#(<= main_~i~0 2), 17168#(<= main_~i~0 3), 17169#(<= main_~i~0 4), 17170#(<= main_~i~0 5), 17171#(<= main_~i~0 6), 17172#(<= main_~i~0 7), 17173#(<= main_~i~0 8), 17174#(<= main_~i~0 9), 17175#(<= main_~i~0 10), 17176#(<= main_~i~0 11), 17177#(<= main_~i~0 12), 17178#(<= main_~i~0 13), 17179#(<= main_~i~0 14), 17180#(<= main_~i~0 15), 17181#(<= main_~i~0 16), 17182#(<= main_~i~0 17), 17183#(<= main_~i~0 18), 17184#(<= main_~i~0 19), 17185#(<= main_~i~0 20), 17186#(<= main_~i~0 21), 17187#(<= main_~i~0 22), 17188#(<= main_~i~0 23), 17189#(<= main_~i~0 24), 17190#(<= main_~i~0 25), 17191#(<= main_~i~0 26), 17192#(<= main_~i~0 27), 17193#(<= main_~i~0 28), 17194#(<= main_~i~0 29), 17195#(<= main_~i~0 30), 17196#(<= main_~i~0 31), 17197#(<= main_~i~0 32), 17198#(and (<= 0 main_~i~0) (<= main_~i~0 32)), 17199#(and (<= 1 main_~i~0) (<= main_~i~0 33)), 17200#(and (<= 2 main_~i~0) (<= main_~i~0 34)), 17201#(and (<= 3 main_~i~0) (<= main_~i~0 35)), 17202#(and (<= main_~i~0 36) (<= 4 main_~i~0)), 17203#(and (<= main_~i~0 37) (<= 5 main_~i~0)), 17204#(and (<= 6 main_~i~0) (<= main_~i~0 38)), 17205#(and (<= 7 main_~i~0) (<= main_~i~0 39)), 17206#(and (<= main_~i~0 40) (<= 8 main_~i~0)), 17207#(and (<= 9 main_~i~0) (<= main_~i~0 41)), 17208#(and (<= main_~i~0 42) (<= 10 main_~i~0)), 17209#(and (<= main_~i~0 43) (<= 11 main_~i~0)), 17210#(and (<= main_~i~0 44) (<= 12 main_~i~0)), 17211#(and (<= main_~i~0 45) (<= 13 main_~i~0)), 17212#(and (<= 14 main_~i~0) (<= main_~i~0 46)), 17213#(and (<= main_~i~0 47) (<= 15 main_~i~0)), 17214#(and (<= main_~i~0 48) (<= 16 main_~i~0))] [2018-04-10 14:37:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:02,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 14:37:02,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 14:37:02,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:37:02,737 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 52 states. [2018-04-10 14:37:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:04,652 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-04-10 14:37:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 14:37:04,652 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 247 [2018-04-10 14:37:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:04,652 INFO L225 Difference]: With dead ends: 258 [2018-04-10 14:37:04,652 INFO L226 Difference]: Without dead ends: 258 [2018-04-10 14:37:04,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2343, Invalid=7557, Unknown=0, NotChecked=0, Total=9900 [2018-04-10 14:37:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-10 14:37:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-10 14:37:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-10 14:37:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-04-10 14:37:04,655 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-04-10 14:37:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:04,655 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-04-10 14:37:04,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 14:37:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-04-10 14:37:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-10 14:37:04,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:04,656 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:04,656 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:04,656 INFO L82 PathProgramCache]: Analyzing trace with hash 869965463, now seen corresponding path program 49 times [2018-04-10 14:37:04,656 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:04,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:05,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:05,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 14:37:05,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:05,430 INFO L182 omatonBuilderFactory]: Interpolants [17827#true, 17828#false, 17829#(<= main_~i~0 0), 17830#(<= main_~i~0 1), 17831#(<= main_~i~0 2), 17832#(<= main_~i~0 3), 17833#(<= main_~i~0 4), 17834#(<= main_~i~0 5), 17835#(<= main_~i~0 6), 17836#(<= main_~i~0 7), 17837#(<= main_~i~0 8), 17838#(<= main_~i~0 9), 17839#(<= main_~i~0 10), 17840#(<= main_~i~0 11), 17841#(<= main_~i~0 12), 17842#(<= main_~i~0 13), 17843#(<= main_~i~0 14), 17844#(<= main_~i~0 15), 17845#(<= main_~i~0 16), 17846#(<= main_~i~0 17), 17847#(<= main_~i~0 18), 17848#(<= main_~i~0 19), 17849#(<= main_~i~0 20), 17850#(<= main_~i~0 21), 17851#(<= main_~i~0 22), 17852#(<= main_~i~0 23), 17853#(<= main_~i~0 24), 17854#(<= main_~i~0 25), 17855#(<= main_~i~0 26), 17856#(<= main_~i~0 27), 17857#(<= main_~i~0 28), 17858#(<= main_~i~0 29), 17859#(<= main_~i~0 30), 17860#(<= main_~i~0 31), 17861#(<= main_~i~0 32), 17862#(<= main_~i~0 33), 17863#(<= main_~i~0 34), 17864#(<= main_~i~0 35), 17865#(<= main_~i~0 36), 17866#(<= main_~i~0 37), 17867#(<= main_~i~0 38), 17868#(<= main_~i~0 39), 17869#(<= main_~i~0 40), 17870#(<= main_~i~0 41), 17871#(<= main_~i~0 42), 17872#(<= main_~i~0 43), 17873#(<= main_~i~0 44), 17874#(<= main_~i~0 45), 17875#(<= main_~i~0 46), 17876#(<= main_~i~0 47), 17877#(<= main_~i~0 48), 17878#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 17879#(and (<= main_~i~0 49) (<= 1 main_~i~0))] [2018-04-10 14:37:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 14:37:05,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 14:37:05,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 14:37:05,431 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-04-10 14:37:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:06,388 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-04-10 14:37:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 14:37:06,390 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-10 14:37:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:06,390 INFO L225 Difference]: With dead ends: 263 [2018-04-10 14:37:06,391 INFO L226 Difference]: Without dead ends: 263 [2018-04-10 14:37:06,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 14:37:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-10 14:37:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-10 14:37:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 14:37:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-04-10 14:37:06,395 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-04-10 14:37:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:06,395 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-04-10 14:37:06,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 14:37:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-04-10 14:37:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-10 14:37:06,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:06,396 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:06,398 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash -957067066, now seen corresponding path program 50 times [2018-04-10 14:37:06,399 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:06,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:07,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:07,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-10 14:37:07,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:07,186 INFO L182 omatonBuilderFactory]: Interpolants [18504#true, 18505#false, 18506#(<= main_~i~0 0), 18507#(<= main_~i~0 1), 18508#(<= main_~i~0 2), 18509#(<= main_~i~0 3), 18510#(<= main_~i~0 4), 18511#(<= main_~i~0 5), 18512#(<= main_~i~0 6), 18513#(<= main_~i~0 7), 18514#(<= main_~i~0 8), 18515#(<= main_~i~0 9), 18516#(<= main_~i~0 10), 18517#(<= main_~i~0 11), 18518#(<= main_~i~0 12), 18519#(<= main_~i~0 13), 18520#(<= main_~i~0 14), 18521#(<= main_~i~0 15), 18522#(<= main_~i~0 16), 18523#(<= main_~i~0 17), 18524#(<= main_~i~0 18), 18525#(<= main_~i~0 19), 18526#(<= main_~i~0 20), 18527#(<= main_~i~0 21), 18528#(<= main_~i~0 22), 18529#(<= main_~i~0 23), 18530#(<= main_~i~0 24), 18531#(<= main_~i~0 25), 18532#(<= main_~i~0 26), 18533#(<= main_~i~0 27), 18534#(<= main_~i~0 28), 18535#(<= main_~i~0 29), 18536#(<= main_~i~0 30), 18537#(<= main_~i~0 31), 18538#(<= main_~i~0 32), 18539#(<= main_~i~0 33), 18540#(<= main_~i~0 34), 18541#(<= main_~i~0 35), 18542#(<= main_~i~0 36), 18543#(<= main_~i~0 37), 18544#(<= main_~i~0 38), 18545#(<= main_~i~0 39), 18546#(<= main_~i~0 40), 18547#(<= main_~i~0 41), 18548#(<= main_~i~0 42), 18549#(<= main_~i~0 43), 18550#(<= main_~i~0 44), 18551#(<= main_~i~0 45), 18552#(<= main_~i~0 46), 18553#(<= main_~i~0 47), 18554#(<= main_~i~0 48), 18555#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 18556#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 18557#(and (<= 2 main_~i~0) (<= main_~i~0 50))] [2018-04-10 14:37:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:07,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 14:37:07,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 14:37:07,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 14:37:07,187 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 54 states. [2018-04-10 14:37:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:08,180 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-04-10 14:37:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 14:37:08,180 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 257 [2018-04-10 14:37:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:08,181 INFO L225 Difference]: With dead ends: 268 [2018-04-10 14:37:08,181 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 14:37:08,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3881, Invalid=6831, Unknown=0, NotChecked=0, Total=10712 [2018-04-10 14:37:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 14:37:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-10 14:37:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-10 14:37:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-04-10 14:37:08,183 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-04-10 14:37:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:08,184 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-04-10 14:37:08,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 14:37:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-04-10 14:37:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-10 14:37:08,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:08,184 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:08,184 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1246602231, now seen corresponding path program 51 times [2018-04-10 14:37:08,185 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:08,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:08,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:08,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-10 14:37:08,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:08,966 INFO L182 omatonBuilderFactory]: Interpolants [19200#(<= main_~i~0 4), 19201#(<= main_~i~0 5), 19202#(<= main_~i~0 6), 19203#(<= main_~i~0 7), 19204#(<= main_~i~0 8), 19205#(<= main_~i~0 9), 19206#(<= main_~i~0 10), 19207#(<= main_~i~0 11), 19208#(<= main_~i~0 12), 19209#(<= main_~i~0 13), 19210#(<= main_~i~0 14), 19211#(<= main_~i~0 15), 19212#(<= main_~i~0 16), 19213#(<= main_~i~0 17), 19214#(<= main_~i~0 18), 19215#(<= main_~i~0 19), 19216#(<= main_~i~0 20), 19217#(<= main_~i~0 21), 19218#(<= main_~i~0 22), 19219#(<= main_~i~0 23), 19220#(<= main_~i~0 24), 19221#(<= main_~i~0 25), 19222#(<= main_~i~0 26), 19223#(<= main_~i~0 27), 19224#(<= main_~i~0 28), 19225#(<= main_~i~0 29), 19226#(<= main_~i~0 30), 19227#(<= main_~i~0 31), 19228#(<= main_~i~0 32), 19229#(<= main_~i~0 33), 19230#(<= main_~i~0 34), 19231#(<= main_~i~0 35), 19232#(<= main_~i~0 36), 19233#(<= main_~i~0 37), 19234#(<= main_~i~0 38), 19235#(<= main_~i~0 39), 19236#(<= main_~i~0 40), 19237#(<= main_~i~0 41), 19238#(<= main_~i~0 42), 19239#(<= main_~i~0 43), 19240#(<= main_~i~0 44), 19241#(<= main_~i~0 45), 19242#(<= main_~i~0 46), 19243#(<= main_~i~0 47), 19244#(<= main_~i~0 48), 19245#(<= main_~i~0 49), 19246#(<= main_~i~0 50), 19247#(and (<= 0 main_~i~0) (<= main_~i~0 50)), 19248#(and (<= 1 main_~i~0) (<= main_~i~0 51)), 19194#true, 19195#false, 19196#(<= main_~i~0 0), 19197#(<= main_~i~0 1), 19198#(<= main_~i~0 2), 19199#(<= main_~i~0 3)] [2018-04-10 14:37:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:08,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 14:37:08,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 14:37:08,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 14:37:08,967 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-04-10 14:37:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:09,909 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-04-10 14:37:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 14:37:09,910 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-10 14:37:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:09,910 INFO L225 Difference]: With dead ends: 273 [2018-04-10 14:37:09,911 INFO L226 Difference]: Without dead ends: 273 [2018-04-10 14:37:09,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 14:37:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-10 14:37:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-10 14:37:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 14:37:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-04-10 14:37:09,913 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-04-10 14:37:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:09,914 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-04-10 14:37:09,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 14:37:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-04-10 14:37:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-10 14:37:09,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:09,915 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:09,915 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash -328358042, now seen corresponding path program 52 times [2018-04-10 14:37:09,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:09,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:10,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:10,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-10 14:37:10,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:10,751 INFO L182 omatonBuilderFactory]: Interpolants [19897#true, 19898#false, 19899#(<= main_~i~0 0), 19900#(<= main_~i~0 1), 19901#(<= main_~i~0 2), 19902#(<= main_~i~0 3), 19903#(<= main_~i~0 4), 19904#(<= main_~i~0 5), 19905#(<= main_~i~0 6), 19906#(<= main_~i~0 7), 19907#(<= main_~i~0 8), 19908#(<= main_~i~0 9), 19909#(<= main_~i~0 10), 19910#(<= main_~i~0 11), 19911#(<= main_~i~0 12), 19912#(<= main_~i~0 13), 19913#(<= main_~i~0 14), 19914#(<= main_~i~0 15), 19915#(<= main_~i~0 16), 19916#(<= main_~i~0 17), 19917#(<= main_~i~0 18), 19918#(<= main_~i~0 19), 19919#(<= main_~i~0 20), 19920#(<= main_~i~0 21), 19921#(<= main_~i~0 22), 19922#(<= main_~i~0 23), 19923#(<= main_~i~0 24), 19924#(<= main_~i~0 25), 19925#(<= main_~i~0 26), 19926#(<= main_~i~0 27), 19927#(<= main_~i~0 28), 19928#(<= main_~i~0 29), 19929#(<= main_~i~0 30), 19930#(<= main_~i~0 31), 19931#(<= main_~i~0 32), 19932#(<= main_~i~0 33), 19933#(<= main_~i~0 34), 19934#(<= main_~i~0 35), 19935#(<= main_~i~0 36), 19936#(<= main_~i~0 37), 19937#(<= main_~i~0 38), 19938#(<= main_~i~0 39), 19939#(<= main_~i~0 40), 19940#(<= main_~i~0 41), 19941#(<= main_~i~0 42), 19942#(<= main_~i~0 43), 19943#(<= main_~i~0 44), 19944#(<= main_~i~0 45), 19945#(<= main_~i~0 46), 19946#(<= main_~i~0 47), 19947#(<= main_~i~0 48), 19948#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 19949#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 19950#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 19951#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 19952#(and (<= 4 main_~i~0) (<= main_~i~0 52))] [2018-04-10 14:37:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:10,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 14:37:10,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 14:37:10,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=1794, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 14:37:10,752 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 56 states. [2018-04-10 14:37:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:11,968 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-04-10 14:37:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 14:37:11,968 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2018-04-10 14:37:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:11,969 INFO L225 Difference]: With dead ends: 278 [2018-04-10 14:37:11,969 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 14:37:11,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3987, Invalid=7569, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 14:37:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 14:37:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-04-10 14:37:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 14:37:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-04-10 14:37:11,972 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-04-10 14:37:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:11,972 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-04-10 14:37:11,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 14:37:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-04-10 14:37:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 14:37:11,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:11,973 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:11,973 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2051109207, now seen corresponding path program 53 times [2018-04-10 14:37:11,973 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:11,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:12,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:12,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-10 14:37:12,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:12,860 INFO L182 omatonBuilderFactory]: Interpolants [20613#true, 20614#false, 20615#(<= main_~i~0 0), 20616#(<= main_~i~0 1), 20617#(<= main_~i~0 2), 20618#(<= main_~i~0 3), 20619#(<= main_~i~0 4), 20620#(<= main_~i~0 5), 20621#(<= main_~i~0 6), 20622#(<= main_~i~0 7), 20623#(<= main_~i~0 8), 20624#(<= main_~i~0 9), 20625#(<= main_~i~0 10), 20626#(<= main_~i~0 11), 20627#(<= main_~i~0 12), 20628#(<= main_~i~0 13), 20629#(<= main_~i~0 14), 20630#(<= main_~i~0 15), 20631#(<= main_~i~0 16), 20632#(<= main_~i~0 17), 20633#(<= main_~i~0 18), 20634#(<= main_~i~0 19), 20635#(<= main_~i~0 20), 20636#(<= main_~i~0 21), 20637#(<= main_~i~0 22), 20638#(<= main_~i~0 23), 20639#(<= main_~i~0 24), 20640#(<= main_~i~0 25), 20641#(<= main_~i~0 26), 20642#(<= main_~i~0 27), 20643#(<= main_~i~0 28), 20644#(<= main_~i~0 29), 20645#(<= main_~i~0 30), 20646#(<= main_~i~0 31), 20647#(<= main_~i~0 32), 20648#(<= main_~i~0 33), 20649#(<= main_~i~0 34), 20650#(<= main_~i~0 35), 20651#(<= main_~i~0 36), 20652#(<= main_~i~0 37), 20653#(<= main_~i~0 38), 20654#(<= main_~i~0 39), 20655#(<= main_~i~0 40), 20656#(<= main_~i~0 41), 20657#(<= main_~i~0 42), 20658#(<= main_~i~0 43), 20659#(<= main_~i~0 44), 20660#(<= main_~i~0 45), 20661#(<= main_~i~0 46), 20662#(<= main_~i~0 47), 20663#(<= main_~i~0 48), 20664#(<= main_~i~0 49), 20665#(<= main_~i~0 50), 20666#(<= main_~i~0 51), 20667#(<= main_~i~0 52), 20668#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 20669#(and (<= 1 main_~i~0) (<= main_~i~0 53))] [2018-04-10 14:37:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:12,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 14:37:12,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 14:37:12,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 14:37:12,861 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 57 states. [2018-04-10 14:37:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:13,875 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-04-10 14:37:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 14:37:13,875 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-04-10 14:37:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:13,876 INFO L225 Difference]: With dead ends: 283 [2018-04-10 14:37:13,876 INFO L226 Difference]: Without dead ends: 283 [2018-04-10 14:37:13,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4458, Invalid=7532, Unknown=0, NotChecked=0, Total=11990 [2018-04-10 14:37:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-10 14:37:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-04-10 14:37:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-10 14:37:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-04-10 14:37:13,879 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-04-10 14:37:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:13,879 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-04-10 14:37:13,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 14:37:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-04-10 14:37:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-10 14:37:13,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:13,880 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:13,880 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash 832779782, now seen corresponding path program 54 times [2018-04-10 14:37:13,881 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:13,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:14,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:14,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-10 14:37:14,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:14,850 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= main_~i~0 32), 21377#(<= main_~i~0 33), 21378#(<= main_~i~0 34), 21379#(<= main_~i~0 35), 21380#(<= main_~i~0 36), 21381#(<= main_~i~0 37), 21382#(<= main_~i~0 38), 21383#(<= main_~i~0 39), 21384#(<= main_~i~0 40), 21385#(<= main_~i~0 41), 21386#(<= main_~i~0 42), 21387#(<= main_~i~0 43), 21388#(<= main_~i~0 44), 21389#(<= main_~i~0 45), 21390#(<= main_~i~0 46), 21391#(<= main_~i~0 47), 21392#(<= main_~i~0 48), 21393#(<= main_~i~0 49), 21394#(<= main_~i~0 50), 21395#(<= main_~i~0 51), 21396#(<= main_~i~0 52), 21397#(and (<= 0 main_~i~0) (<= main_~i~0 52)), 21398#(and (<= 1 main_~i~0) (<= main_~i~0 53)), 21399#(and (<= 2 main_~i~0) (<= main_~i~0 54)), 21342#true, 21343#false, 21344#(<= main_~i~0 0), 21345#(<= main_~i~0 1), 21346#(<= main_~i~0 2), 21347#(<= main_~i~0 3), 21348#(<= main_~i~0 4), 21349#(<= main_~i~0 5), 21350#(<= main_~i~0 6), 21351#(<= main_~i~0 7), 21352#(<= main_~i~0 8), 21353#(<= main_~i~0 9), 21354#(<= main_~i~0 10), 21355#(<= main_~i~0 11), 21356#(<= main_~i~0 12), 21357#(<= main_~i~0 13), 21358#(<= main_~i~0 14), 21359#(<= main_~i~0 15), 21360#(<= main_~i~0 16), 21361#(<= main_~i~0 17), 21362#(<= main_~i~0 18), 21363#(<= main_~i~0 19), 21364#(<= main_~i~0 20), 21365#(<= main_~i~0 21), 21366#(<= main_~i~0 22), 21367#(<= main_~i~0 23), 21368#(<= main_~i~0 24), 21369#(<= main_~i~0 25), 21370#(<= main_~i~0 26), 21371#(<= main_~i~0 27), 21372#(<= main_~i~0 28), 21373#(<= main_~i~0 29), 21374#(<= main_~i~0 30), 21375#(<= main_~i~0 31)] [2018-04-10 14:37:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:14,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 14:37:14,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 14:37:14,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 14:37:14,851 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 58 states. [2018-04-10 14:37:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:15,986 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-04-10 14:37:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 14:37:15,986 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-04-10 14:37:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:15,987 INFO L225 Difference]: With dead ends: 288 [2018-04-10 14:37:15,987 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 14:37:15,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4515, Invalid=7917, Unknown=0, NotChecked=0, Total=12432 [2018-04-10 14:37:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 14:37:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-04-10 14:37:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-10 14:37:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-04-10 14:37:15,989 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-04-10 14:37:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:15,989 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-04-10 14:37:15,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 14:37:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-04-10 14:37:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-10 14:37:15,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:15,990 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:15,990 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1889794377, now seen corresponding path program 55 times [2018-04-10 14:37:15,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:15,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:16,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:16,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-10 14:37:16,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:16,884 INFO L182 omatonBuilderFactory]: Interpolants [22084#true, 22085#false, 22086#(<= main_~i~0 0), 22087#(<= main_~i~0 1), 22088#(<= main_~i~0 2), 22089#(<= main_~i~0 3), 22090#(<= main_~i~0 4), 22091#(<= main_~i~0 5), 22092#(<= main_~i~0 6), 22093#(<= main_~i~0 7), 22094#(<= main_~i~0 8), 22095#(<= main_~i~0 9), 22096#(<= main_~i~0 10), 22097#(<= main_~i~0 11), 22098#(<= main_~i~0 12), 22099#(<= main_~i~0 13), 22100#(<= main_~i~0 14), 22101#(<= main_~i~0 15), 22102#(<= main_~i~0 16), 22103#(<= main_~i~0 17), 22104#(<= main_~i~0 18), 22105#(<= main_~i~0 19), 22106#(<= main_~i~0 20), 22107#(<= main_~i~0 21), 22108#(<= main_~i~0 22), 22109#(<= main_~i~0 23), 22110#(<= main_~i~0 24), 22111#(<= main_~i~0 25), 22112#(<= main_~i~0 26), 22113#(<= main_~i~0 27), 22114#(<= main_~i~0 28), 22115#(<= main_~i~0 29), 22116#(<= main_~i~0 30), 22117#(<= main_~i~0 31), 22118#(<= main_~i~0 32), 22119#(<= main_~i~0 33), 22120#(<= main_~i~0 34), 22121#(<= main_~i~0 35), 22122#(<= main_~i~0 36), 22123#(<= main_~i~0 37), 22124#(<= main_~i~0 38), 22125#(<= main_~i~0 39), 22126#(<= main_~i~0 40), 22127#(<= main_~i~0 41), 22128#(<= main_~i~0 42), 22129#(<= main_~i~0 43), 22130#(<= main_~i~0 44), 22131#(<= main_~i~0 45), 22132#(<= main_~i~0 46), 22133#(<= main_~i~0 47), 22134#(<= main_~i~0 48), 22135#(<= main_~i~0 49), 22136#(<= main_~i~0 50), 22137#(<= main_~i~0 51), 22138#(<= main_~i~0 52), 22139#(<= main_~i~0 53), 22140#(<= main_~i~0 54), 22141#(and (<= 0 main_~i~0) (<= main_~i~0 54)), 22142#(and (<= main_~i~0 55) (<= 1 main_~i~0))] [2018-04-10 14:37:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:16,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 14:37:16,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 14:37:16,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 14:37:16,885 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-04-10 14:37:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:18,014 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-04-10 14:37:18,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 14:37:18,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-10 14:37:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:18,015 INFO L225 Difference]: With dead ends: 293 [2018-04-10 14:37:18,016 INFO L226 Difference]: Without dead ends: 293 [2018-04-10 14:37:18,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-10 14:37:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-10 14:37:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-10 14:37:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-10 14:37:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-04-10 14:37:18,018 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-04-10 14:37:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:18,019 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-04-10 14:37:18,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 14:37:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-04-10 14:37:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 14:37:18,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:18,020 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:18,020 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 581893286, now seen corresponding path program 56 times [2018-04-10 14:37:18,021 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:18,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:18,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:18,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-10 14:37:18,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:18,958 INFO L182 omatonBuilderFactory]: Interpolants [22839#true, 22840#false, 22841#(<= main_~i~0 0), 22842#(<= main_~i~0 1), 22843#(<= main_~i~0 2), 22844#(<= main_~i~0 3), 22845#(<= main_~i~0 4), 22846#(<= main_~i~0 5), 22847#(<= main_~i~0 6), 22848#(<= main_~i~0 7), 22849#(<= main_~i~0 8), 22850#(<= main_~i~0 9), 22851#(<= main_~i~0 10), 22852#(<= main_~i~0 11), 22853#(<= main_~i~0 12), 22854#(<= main_~i~0 13), 22855#(<= main_~i~0 14), 22856#(<= main_~i~0 15), 22857#(<= main_~i~0 16), 22858#(<= main_~i~0 17), 22859#(<= main_~i~0 18), 22860#(<= main_~i~0 19), 22861#(<= main_~i~0 20), 22862#(<= main_~i~0 21), 22863#(<= main_~i~0 22), 22864#(<= main_~i~0 23), 22865#(<= main_~i~0 24), 22866#(<= main_~i~0 25), 22867#(<= main_~i~0 26), 22868#(<= main_~i~0 27), 22869#(<= main_~i~0 28), 22870#(<= main_~i~0 29), 22871#(<= main_~i~0 30), 22872#(<= main_~i~0 31), 22873#(<= main_~i~0 32), 22874#(<= main_~i~0 33), 22875#(<= main_~i~0 34), 22876#(<= main_~i~0 35), 22877#(<= main_~i~0 36), 22878#(<= main_~i~0 37), 22879#(<= main_~i~0 38), 22880#(<= main_~i~0 39), 22881#(<= main_~i~0 40), 22882#(<= main_~i~0 41), 22883#(<= main_~i~0 42), 22884#(<= main_~i~0 43), 22885#(<= main_~i~0 44), 22886#(<= main_~i~0 45), 22887#(<= main_~i~0 46), 22888#(<= main_~i~0 47), 22889#(<= main_~i~0 48), 22890#(and (<= 0 main_~i~0) (<= main_~i~0 48)), 22891#(and (<= main_~i~0 49) (<= 1 main_~i~0)), 22892#(and (<= 2 main_~i~0) (<= main_~i~0 50)), 22893#(and (<= main_~i~0 51) (<= 3 main_~i~0)), 22894#(and (<= 4 main_~i~0) (<= main_~i~0 52)), 22895#(and (<= 5 main_~i~0) (<= main_~i~0 53)), 22896#(and (<= main_~i~0 54) (<= 6 main_~i~0)), 22897#(and (<= main_~i~0 55) (<= 7 main_~i~0)), 22898#(and (<= main_~i~0 56) (<= 8 main_~i~0))] [2018-04-10 14:37:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:18,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 14:37:18,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 14:37:18,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:37:18,959 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-04-10 14:37:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:20,758 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-04-10 14:37:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 14:37:20,758 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-10 14:37:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:20,759 INFO L225 Difference]: With dead ends: 298 [2018-04-10 14:37:20,759 INFO L226 Difference]: Without dead ends: 298 [2018-04-10 14:37:20,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-10 14:37:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-10 14:37:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-04-10 14:37:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-10 14:37:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-04-10 14:37:20,761 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-04-10 14:37:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:20,762 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-04-10 14:37:20,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 14:37:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-04-10 14:37:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 14:37:20,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:20,762 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:20,763 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2109957143, now seen corresponding path program 57 times [2018-04-10 14:37:20,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:20,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:21,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:21,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-10 14:37:21,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:21,708 INFO L182 omatonBuilderFactory]: Interpolants [23607#true, 23608#false, 23609#(<= main_~i~0 0), 23610#(<= main_~i~0 1), 23611#(<= main_~i~0 2), 23612#(<= main_~i~0 3), 23613#(<= main_~i~0 4), 23614#(<= main_~i~0 5), 23615#(<= main_~i~0 6), 23616#(<= main_~i~0 7), 23617#(<= main_~i~0 8), 23618#(<= main_~i~0 9), 23619#(<= main_~i~0 10), 23620#(<= main_~i~0 11), 23621#(<= main_~i~0 12), 23622#(<= main_~i~0 13), 23623#(<= main_~i~0 14), 23624#(<= main_~i~0 15), 23625#(<= main_~i~0 16), 23626#(<= main_~i~0 17), 23627#(<= main_~i~0 18), 23628#(<= main_~i~0 19), 23629#(<= main_~i~0 20), 23630#(<= main_~i~0 21), 23631#(<= main_~i~0 22), 23632#(<= main_~i~0 23), 23633#(<= main_~i~0 24), 23634#(<= main_~i~0 25), 23635#(<= main_~i~0 26), 23636#(<= main_~i~0 27), 23637#(<= main_~i~0 28), 23638#(<= main_~i~0 29), 23639#(<= main_~i~0 30), 23640#(<= main_~i~0 31), 23641#(<= main_~i~0 32), 23642#(<= main_~i~0 33), 23643#(<= main_~i~0 34), 23644#(<= main_~i~0 35), 23645#(<= main_~i~0 36), 23646#(<= main_~i~0 37), 23647#(<= main_~i~0 38), 23648#(<= main_~i~0 39), 23649#(<= main_~i~0 40), 23650#(<= main_~i~0 41), 23651#(<= main_~i~0 42), 23652#(<= main_~i~0 43), 23653#(<= main_~i~0 44), 23654#(<= main_~i~0 45), 23655#(<= main_~i~0 46), 23656#(<= main_~i~0 47), 23657#(<= main_~i~0 48), 23658#(<= main_~i~0 49), 23659#(<= main_~i~0 50), 23660#(<= main_~i~0 51), 23661#(<= main_~i~0 52), 23662#(<= main_~i~0 53), 23663#(<= main_~i~0 54), 23664#(<= main_~i~0 55), 23665#(<= main_~i~0 56), 23666#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 23667#(and (<= 1 main_~i~0) (<= main_~i~0 57))] [2018-04-10 14:37:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:21,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 14:37:21,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 14:37:21,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 14:37:21,709 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 61 states. [2018-04-10 14:37:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:22,851 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-04-10 14:37:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 14:37:22,851 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-04-10 14:37:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:22,852 INFO L225 Difference]: With dead ends: 303 [2018-04-10 14:37:22,852 INFO L226 Difference]: Without dead ends: 303 [2018-04-10 14:37:22,853 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5136, Invalid=8670, Unknown=0, NotChecked=0, Total=13806 [2018-04-10 14:37:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-10 14:37:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-04-10 14:37:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-10 14:37:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-04-10 14:37:22,854 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-04-10 14:37:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:22,855 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-04-10 14:37:22,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 14:37:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-04-10 14:37:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 14:37:22,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:22,855 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:22,855 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1932196678, now seen corresponding path program 58 times [2018-04-10 14:37:22,856 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:22,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:23,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:23,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-10 14:37:23,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:23,891 INFO L182 omatonBuilderFactory]: Interpolants [24448#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 24449#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 24388#true, 24389#false, 24390#(<= main_~i~0 0), 24391#(<= main_~i~0 1), 24392#(<= main_~i~0 2), 24393#(<= main_~i~0 3), 24394#(<= main_~i~0 4), 24395#(<= main_~i~0 5), 24396#(<= main_~i~0 6), 24397#(<= main_~i~0 7), 24398#(<= main_~i~0 8), 24399#(<= main_~i~0 9), 24400#(<= main_~i~0 10), 24401#(<= main_~i~0 11), 24402#(<= main_~i~0 12), 24403#(<= main_~i~0 13), 24404#(<= main_~i~0 14), 24405#(<= main_~i~0 15), 24406#(<= main_~i~0 16), 24407#(<= main_~i~0 17), 24408#(<= main_~i~0 18), 24409#(<= main_~i~0 19), 24410#(<= main_~i~0 20), 24411#(<= main_~i~0 21), 24412#(<= main_~i~0 22), 24413#(<= main_~i~0 23), 24414#(<= main_~i~0 24), 24415#(<= main_~i~0 25), 24416#(<= main_~i~0 26), 24417#(<= main_~i~0 27), 24418#(<= main_~i~0 28), 24419#(<= main_~i~0 29), 24420#(<= main_~i~0 30), 24421#(<= main_~i~0 31), 24422#(<= main_~i~0 32), 24423#(<= main_~i~0 33), 24424#(<= main_~i~0 34), 24425#(<= main_~i~0 35), 24426#(<= main_~i~0 36), 24427#(<= main_~i~0 37), 24428#(<= main_~i~0 38), 24429#(<= main_~i~0 39), 24430#(<= main_~i~0 40), 24431#(<= main_~i~0 41), 24432#(<= main_~i~0 42), 24433#(<= main_~i~0 43), 24434#(<= main_~i~0 44), 24435#(<= main_~i~0 45), 24436#(<= main_~i~0 46), 24437#(<= main_~i~0 47), 24438#(<= main_~i~0 48), 24439#(<= main_~i~0 49), 24440#(<= main_~i~0 50), 24441#(<= main_~i~0 51), 24442#(<= main_~i~0 52), 24443#(<= main_~i~0 53), 24444#(<= main_~i~0 54), 24445#(<= main_~i~0 55), 24446#(<= main_~i~0 56), 24447#(and (<= 0 main_~i~0) (<= main_~i~0 56))] [2018-04-10 14:37:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:23,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 14:37:23,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 14:37:23,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 14:37:23,894 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 62 states. [2018-04-10 14:37:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:25,237 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-04-10 14:37:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 14:37:25,272 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 297 [2018-04-10 14:37:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:25,272 INFO L225 Difference]: With dead ends: 308 [2018-04-10 14:37:25,272 INFO L226 Difference]: Without dead ends: 308 [2018-04-10 14:37:25,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5197, Invalid=9083, Unknown=0, NotChecked=0, Total=14280 [2018-04-10 14:37:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-10 14:37:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-04-10 14:37:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-10 14:37:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-04-10 14:37:25,275 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-04-10 14:37:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:25,275 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-04-10 14:37:25,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 14:37:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-04-10 14:37:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-10 14:37:25,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:25,276 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:25,276 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1038251657, now seen corresponding path program 59 times [2018-04-10 14:37:25,277 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:25,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:26,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:26,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-10 14:37:26,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:26,279 INFO L182 omatonBuilderFactory]: Interpolants [25216#(<= main_~i~0 32), 25217#(<= main_~i~0 33), 25218#(<= main_~i~0 34), 25219#(<= main_~i~0 35), 25220#(<= main_~i~0 36), 25221#(<= main_~i~0 37), 25222#(<= main_~i~0 38), 25223#(<= main_~i~0 39), 25224#(<= main_~i~0 40), 25225#(<= main_~i~0 41), 25226#(<= main_~i~0 42), 25227#(<= main_~i~0 43), 25228#(<= main_~i~0 44), 25229#(<= main_~i~0 45), 25230#(<= main_~i~0 46), 25231#(<= main_~i~0 47), 25232#(<= main_~i~0 48), 25233#(<= main_~i~0 49), 25234#(<= main_~i~0 50), 25235#(<= main_~i~0 51), 25236#(<= main_~i~0 52), 25237#(<= main_~i~0 53), 25238#(<= main_~i~0 54), 25239#(<= main_~i~0 55), 25240#(<= main_~i~0 56), 25241#(<= main_~i~0 57), 25242#(<= main_~i~0 58), 25243#(and (<= 0 main_~i~0) (<= main_~i~0 58)), 25244#(and (<= main_~i~0 59) (<= 1 main_~i~0)), 25182#true, 25183#false, 25184#(<= main_~i~0 0), 25185#(<= main_~i~0 1), 25186#(<= main_~i~0 2), 25187#(<= main_~i~0 3), 25188#(<= main_~i~0 4), 25189#(<= main_~i~0 5), 25190#(<= main_~i~0 6), 25191#(<= main_~i~0 7), 25192#(<= main_~i~0 8), 25193#(<= main_~i~0 9), 25194#(<= main_~i~0 10), 25195#(<= main_~i~0 11), 25196#(<= main_~i~0 12), 25197#(<= main_~i~0 13), 25198#(<= main_~i~0 14), 25199#(<= main_~i~0 15), 25200#(<= main_~i~0 16), 25201#(<= main_~i~0 17), 25202#(<= main_~i~0 18), 25203#(<= main_~i~0 19), 25204#(<= main_~i~0 20), 25205#(<= main_~i~0 21), 25206#(<= main_~i~0 22), 25207#(<= main_~i~0 23), 25208#(<= main_~i~0 24), 25209#(<= main_~i~0 25), 25210#(<= main_~i~0 26), 25211#(<= main_~i~0 27), 25212#(<= main_~i~0 28), 25213#(<= main_~i~0 29), 25214#(<= main_~i~0 30), 25215#(<= main_~i~0 31)] [2018-04-10 14:37:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:26,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 14:37:26,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 14:37:26,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 14:37:26,280 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 63 states. [2018-04-10 14:37:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:27,540 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-04-10 14:37:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 14:37:27,541 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-04-10 14:37:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:27,541 INFO L225 Difference]: With dead ends: 313 [2018-04-10 14:37:27,541 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 14:37:27,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=5493, Invalid=9269, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 14:37:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 14:37:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-04-10 14:37:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-10 14:37:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-04-10 14:37:27,544 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-04-10 14:37:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:27,544 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-04-10 14:37:27,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 14:37:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-04-10 14:37:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-10 14:37:27,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:27,545 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:27,545 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1640943130, now seen corresponding path program 60 times [2018-04-10 14:37:27,546 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:27,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:28,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:28,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-10 14:37:28,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:28,582 INFO L182 omatonBuilderFactory]: Interpolants [25989#true, 25990#false, 25991#(<= main_~i~0 0), 25992#(<= main_~i~0 1), 25993#(<= main_~i~0 2), 25994#(<= main_~i~0 3), 25995#(<= main_~i~0 4), 25996#(<= main_~i~0 5), 25997#(<= main_~i~0 6), 25998#(<= main_~i~0 7), 25999#(<= main_~i~0 8), 26000#(<= main_~i~0 9), 26001#(<= main_~i~0 10), 26002#(<= main_~i~0 11), 26003#(<= main_~i~0 12), 26004#(<= main_~i~0 13), 26005#(<= main_~i~0 14), 26006#(<= main_~i~0 15), 26007#(<= main_~i~0 16), 26008#(<= main_~i~0 17), 26009#(<= main_~i~0 18), 26010#(<= main_~i~0 19), 26011#(<= main_~i~0 20), 26012#(<= main_~i~0 21), 26013#(<= main_~i~0 22), 26014#(<= main_~i~0 23), 26015#(<= main_~i~0 24), 26016#(<= main_~i~0 25), 26017#(<= main_~i~0 26), 26018#(<= main_~i~0 27), 26019#(<= main_~i~0 28), 26020#(<= main_~i~0 29), 26021#(<= main_~i~0 30), 26022#(<= main_~i~0 31), 26023#(<= main_~i~0 32), 26024#(<= main_~i~0 33), 26025#(<= main_~i~0 34), 26026#(<= main_~i~0 35), 26027#(<= main_~i~0 36), 26028#(<= main_~i~0 37), 26029#(<= main_~i~0 38), 26030#(<= main_~i~0 39), 26031#(<= main_~i~0 40), 26032#(<= main_~i~0 41), 26033#(<= main_~i~0 42), 26034#(<= main_~i~0 43), 26035#(<= main_~i~0 44), 26036#(<= main_~i~0 45), 26037#(<= main_~i~0 46), 26038#(<= main_~i~0 47), 26039#(<= main_~i~0 48), 26040#(<= main_~i~0 49), 26041#(<= main_~i~0 50), 26042#(<= main_~i~0 51), 26043#(<= main_~i~0 52), 26044#(<= main_~i~0 53), 26045#(<= main_~i~0 54), 26046#(<= main_~i~0 55), 26047#(<= main_~i~0 56), 26048#(and (<= 0 main_~i~0) (<= main_~i~0 56)), 26049#(and (<= 1 main_~i~0) (<= main_~i~0 57)), 26050#(and (<= 2 main_~i~0) (<= main_~i~0 58)), 26051#(and (<= main_~i~0 59) (<= 3 main_~i~0)), 26052#(and (<= main_~i~0 60) (<= 4 main_~i~0))] [2018-04-10 14:37:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:28,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 14:37:28,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 14:37:28,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=2310, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 14:37:28,584 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 64 states. [2018-04-10 14:37:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:30,245 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-04-10 14:37:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 14:37:30,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 307 [2018-04-10 14:37:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:30,246 INFO L225 Difference]: With dead ends: 318 [2018-04-10 14:37:30,246 INFO L226 Difference]: Without dead ends: 318 [2018-04-10 14:37:30,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5319, Invalid=9933, Unknown=0, NotChecked=0, Total=15252 [2018-04-10 14:37:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-10 14:37:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-10 14:37:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 14:37:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-04-10 14:37:30,249 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-04-10 14:37:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:30,249 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-04-10 14:37:30,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 14:37:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-04-10 14:37:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 14:37:30,250 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:30,250 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:30,250 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1047497001, now seen corresponding path program 61 times [2018-04-10 14:37:30,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:30,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:31,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:31,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-10 14:37:31,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:31,336 INFO L182 omatonBuilderFactory]: Interpolants [26809#true, 26810#false, 26811#(<= main_~i~0 0), 26812#(<= main_~i~0 1), 26813#(<= main_~i~0 2), 26814#(<= main_~i~0 3), 26815#(<= main_~i~0 4), 26816#(<= main_~i~0 5), 26817#(<= main_~i~0 6), 26818#(<= main_~i~0 7), 26819#(<= main_~i~0 8), 26820#(<= main_~i~0 9), 26821#(<= main_~i~0 10), 26822#(<= main_~i~0 11), 26823#(<= main_~i~0 12), 26824#(<= main_~i~0 13), 26825#(<= main_~i~0 14), 26826#(<= main_~i~0 15), 26827#(<= main_~i~0 16), 26828#(<= main_~i~0 17), 26829#(<= main_~i~0 18), 26830#(<= main_~i~0 19), 26831#(<= main_~i~0 20), 26832#(<= main_~i~0 21), 26833#(<= main_~i~0 22), 26834#(<= main_~i~0 23), 26835#(<= main_~i~0 24), 26836#(<= main_~i~0 25), 26837#(<= main_~i~0 26), 26838#(<= main_~i~0 27), 26839#(<= main_~i~0 28), 26840#(<= main_~i~0 29), 26841#(<= main_~i~0 30), 26842#(<= main_~i~0 31), 26843#(<= main_~i~0 32), 26844#(<= main_~i~0 33), 26845#(<= main_~i~0 34), 26846#(<= main_~i~0 35), 26847#(<= main_~i~0 36), 26848#(<= main_~i~0 37), 26849#(<= main_~i~0 38), 26850#(<= main_~i~0 39), 26851#(<= main_~i~0 40), 26852#(<= main_~i~0 41), 26853#(<= main_~i~0 42), 26854#(<= main_~i~0 43), 26855#(<= main_~i~0 44), 26856#(<= main_~i~0 45), 26857#(<= main_~i~0 46), 26858#(<= main_~i~0 47), 26859#(<= main_~i~0 48), 26860#(<= main_~i~0 49), 26861#(<= main_~i~0 50), 26862#(<= main_~i~0 51), 26863#(<= main_~i~0 52), 26864#(<= main_~i~0 53), 26865#(<= main_~i~0 54), 26866#(<= main_~i~0 55), 26867#(<= main_~i~0 56), 26868#(<= main_~i~0 57), 26869#(<= main_~i~0 58), 26870#(<= main_~i~0 59), 26871#(<= main_~i~0 60), 26872#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 26873#(and (<= main_~i~0 61) (<= 1 main_~i~0))] [2018-04-10 14:37:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:31,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 14:37:31,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 14:37:31,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 14:37:31,338 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-04-10 14:37:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:32,631 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-04-10 14:37:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 14:37:32,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-10 14:37:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:32,632 INFO L225 Difference]: With dead ends: 323 [2018-04-10 14:37:32,632 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 14:37:32,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 14:37:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 14:37:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-04-10 14:37:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 14:37:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-04-10 14:37:32,634 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-04-10 14:37:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:32,634 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-04-10 14:37:32,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 14:37:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-04-10 14:37:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-10 14:37:32,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:32,635 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:32,635 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2040815482, now seen corresponding path program 62 times [2018-04-10 14:37:32,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:32,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:33,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:33,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-10 14:37:33,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:33,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-10 14:37:33,736 INFO L182 omatonBuilderFactory]: Interpolants [27648#(<= main_~i~0 4), 27649#(<= main_~i~0 5), 27650#(<= main_~i~0 6), 27651#(<= main_~i~0 7), 27652#(<= main_~i~0 8), 27653#(<= main_~i~0 9), 27654#(<= main_~i~0 10), 27655#(<= main_~i~0 11), 27656#(<= main_~i~0 12), 27657#(<= main_~i~0 13), 27658#(<= main_~i~0 14), 27659#(<= main_~i~0 15), 27660#(<= main_~i~0 16), 27661#(<= main_~i~0 17), 27662#(<= main_~i~0 18), 27663#(<= main_~i~0 19), 27664#(<= main_~i~0 20), 27665#(<= main_~i~0 21), 27666#(<= main_~i~0 22), 27667#(<= main_~i~0 23), 27668#(<= main_~i~0 24), 27669#(<= main_~i~0 25), 27670#(<= main_~i~0 26), 27671#(<= main_~i~0 27), 27672#(<= main_~i~0 28), 27673#(<= main_~i~0 29), 27674#(<= main_~i~0 30), 27675#(<= main_~i~0 31), 27676#(<= main_~i~0 32), 27677#(<= main_~i~0 33), 27678#(<= main_~i~0 34), 27679#(<= main_~i~0 35), 27680#(<= main_~i~0 36), 27681#(<= main_~i~0 37), 27682#(<= main_~i~0 38), 27683#(<= main_~i~0 39), 27684#(<= main_~i~0 40), 27685#(<= main_~i~0 41), 27686#(<= main_~i~0 42), 27687#(<= main_~i~0 43), 27688#(<= main_~i~0 44), 27689#(<= main_~i~0 45), 27690#(<= main_~i~0 46), 27691#(<= main_~i~0 47), 27692#(<= main_~i~0 48), 27693#(<= main_~i~0 49), 27694#(<= main_~i~0 50), 27695#(<= main_~i~0 51), 27696#(<= main_~i~0 52), 27697#(<= main_~i~0 53), 27698#(<= main_~i~0 54), 27699#(<= main_~i~0 55), 27700#(<= main_~i~0 56), 27701#(<= main_~i~0 57), 27702#(<= main_~i~0 58), 27703#(<= main_~i~0 59), 27704#(<= main_~i~0 60), 27705#(and (<= 0 main_~i~0) (<= main_~i~0 60)), 27706#(and (<= main_~i~0 61) (<= 1 main_~i~0)), 27707#(and (<= 2 main_~i~0) (<= main_~i~0 62)), 27642#true, 27643#false, 27644#(<= main_~i~0 0), 27645#(<= main_~i~0 1), 27646#(<= main_~i~0 2), 27647#(<= main_~i~0 3)] [2018-04-10 14:37:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:33,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 14:37:33,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 14:37:33,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 14:37:33,737 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-04-10 14:37:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:35,226 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-04-10 14:37:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 14:37:35,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-10 14:37:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:35,227 INFO L225 Difference]: With dead ends: 328 [2018-04-10 14:37:35,227 INFO L226 Difference]: Without dead ends: 328 [2018-04-10 14:37:35,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-10 14:37:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-10 14:37:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-04-10 14:37:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-10 14:37:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-04-10 14:37:35,229 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-04-10 14:37:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:35,230 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-04-10 14:37:35,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 14:37:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-04-10 14:37:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-10 14:37:35,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:35,231 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:35,231 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 700591159, now seen corresponding path program 63 times [2018-04-10 14:37:35,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:35,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:36,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:36,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-10 14:37:36,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:36,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-10 14:37:36,370 INFO L182 omatonBuilderFactory]: Interpolants [28544#(<= main_~i~0 54), 28545#(<= main_~i~0 55), 28546#(<= main_~i~0 56), 28547#(<= main_~i~0 57), 28548#(<= main_~i~0 58), 28549#(<= main_~i~0 59), 28550#(<= main_~i~0 60), 28551#(<= main_~i~0 61), 28552#(<= main_~i~0 62), 28553#(and (<= 0 main_~i~0) (<= main_~i~0 62)), 28554#(and (<= 1 main_~i~0) (<= main_~i~0 63)), 28488#true, 28489#false, 28490#(<= main_~i~0 0), 28491#(<= main_~i~0 1), 28492#(<= main_~i~0 2), 28493#(<= main_~i~0 3), 28494#(<= main_~i~0 4), 28495#(<= main_~i~0 5), 28496#(<= main_~i~0 6), 28497#(<= main_~i~0 7), 28498#(<= main_~i~0 8), 28499#(<= main_~i~0 9), 28500#(<= main_~i~0 10), 28501#(<= main_~i~0 11), 28502#(<= main_~i~0 12), 28503#(<= main_~i~0 13), 28504#(<= main_~i~0 14), 28505#(<= main_~i~0 15), 28506#(<= main_~i~0 16), 28507#(<= main_~i~0 17), 28508#(<= main_~i~0 18), 28509#(<= main_~i~0 19), 28510#(<= main_~i~0 20), 28511#(<= main_~i~0 21), 28512#(<= main_~i~0 22), 28513#(<= main_~i~0 23), 28514#(<= main_~i~0 24), 28515#(<= main_~i~0 25), 28516#(<= main_~i~0 26), 28517#(<= main_~i~0 27), 28518#(<= main_~i~0 28), 28519#(<= main_~i~0 29), 28520#(<= main_~i~0 30), 28521#(<= main_~i~0 31), 28522#(<= main_~i~0 32), 28523#(<= main_~i~0 33), 28524#(<= main_~i~0 34), 28525#(<= main_~i~0 35), 28526#(<= main_~i~0 36), 28527#(<= main_~i~0 37), 28528#(<= main_~i~0 38), 28529#(<= main_~i~0 39), 28530#(<= main_~i~0 40), 28531#(<= main_~i~0 41), 28532#(<= main_~i~0 42), 28533#(<= main_~i~0 43), 28534#(<= main_~i~0 44), 28535#(<= main_~i~0 45), 28536#(<= main_~i~0 46), 28537#(<= main_~i~0 47), 28538#(<= main_~i~0 48), 28539#(<= main_~i~0 49), 28540#(<= main_~i~0 50), 28541#(<= main_~i~0 51), 28542#(<= main_~i~0 52), 28543#(<= main_~i~0 53)] [2018-04-10 14:37:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:36,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 14:37:36,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 14:37:36,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 14:37:36,371 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 67 states. [2018-04-10 14:37:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:37,683 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-04-10 14:37:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 14:37:37,683 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-04-10 14:37:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:37,684 INFO L225 Difference]: With dead ends: 333 [2018-04-10 14:37:37,684 INFO L226 Difference]: Without dead ends: 333 [2018-04-10 14:37:37,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=6243, Invalid=10527, Unknown=0, NotChecked=0, Total=16770 [2018-04-10 14:37:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-10 14:37:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-10 14:37:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-10 14:37:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-04-10 14:37:37,686 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-04-10 14:37:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:37,686 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-04-10 14:37:37,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 14:37:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-04-10 14:37:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-10 14:37:37,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:37,687 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:37,687 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash 365184806, now seen corresponding path program 64 times [2018-04-10 14:37:37,688 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:37,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:39,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:39,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-10 14:37:39,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:39,218 INFO L182 omatonBuilderFactory]: Interpolants [29347#true, 29348#false, 29349#(and (<= 0 main_~i~0) (<= main_~i~0 0)), 29350#(and (<= 1 main_~i~0) (<= main_~i~0 1)), 29351#(and (<= 2 main_~i~0) (<= main_~i~0 2)), 29352#(and (<= main_~i~0 3) (<= 3 main_~i~0)), 29353#(and (<= 4 main_~i~0) (<= main_~i~0 4)), 29354#(and (<= 5 main_~i~0) (<= main_~i~0 5)), 29355#(and (<= 6 main_~i~0) (<= main_~i~0 6)), 29356#(and (<= 7 main_~i~0) (<= main_~i~0 7)), 29357#(and (<= 8 main_~i~0) (<= main_~i~0 8)), 29358#(and (<= main_~i~0 9) (<= 9 main_~i~0)), 29359#(and (<= main_~i~0 10) (<= 10 main_~i~0)), 29360#(and (<= main_~i~0 11) (<= 11 main_~i~0)), 29361#(and (<= 12 main_~i~0) (<= main_~i~0 12)), 29362#(and (<= main_~i~0 13) (<= 13 main_~i~0)), 29363#(and (<= main_~i~0 14) (<= 14 main_~i~0)), 29364#(and (<= main_~i~0 15) (<= 15 main_~i~0)), 29365#(and (<= main_~i~0 16) (<= 16 main_~i~0)), 29366#(and (<= main_~i~0 17) (<= 17 main_~i~0)), 29367#(and (<= main_~i~0 18) (<= 18 main_~i~0)), 29368#(and (<= 19 main_~i~0) (<= main_~i~0 19)), 29369#(and (<= 20 main_~i~0) (<= main_~i~0 20)), 29370#(and (<= 21 main_~i~0) (<= main_~i~0 21)), 29371#(and (<= 22 main_~i~0) (<= main_~i~0 22)), 29372#(and (<= 23 main_~i~0) (<= main_~i~0 23)), 29373#(and (<= 24 main_~i~0) (<= main_~i~0 24)), 29374#(and (<= main_~i~0 25) (<= 25 main_~i~0)), 29375#(and (<= 26 main_~i~0) (<= main_~i~0 26)), 29376#(and (<= main_~i~0 27) (<= 27 main_~i~0)), 29377#(and (<= main_~i~0 28) (<= 28 main_~i~0)), 29378#(and (<= 29 main_~i~0) (<= main_~i~0 29)), 29379#(and (<= main_~i~0 30) (<= 30 main_~i~0)), 29380#(and (<= 31 main_~i~0) (<= main_~i~0 31)), 29381#(and (<= 32 main_~i~0) (<= main_~i~0 32)), 29382#(and (<= main_~i~0 33) (<= 33 main_~i~0)), 29383#(and (<= 34 main_~i~0) (<= main_~i~0 34)), 29384#(and (<= 35 main_~i~0) (<= main_~i~0 35)), 29385#(and (<= 36 main_~i~0) (<= main_~i~0 36)), 29386#(and (<= 37 main_~i~0) (<= main_~i~0 37)), 29387#(and (<= 38 main_~i~0) (<= main_~i~0 38)), 29388#(and (<= main_~i~0 39) (<= 39 main_~i~0)), 29389#(and (<= main_~i~0 40) (<= 40 main_~i~0)), 29390#(and (<= main_~i~0 41) (<= 41 main_~i~0)), 29391#(and (<= 42 main_~i~0) (<= main_~i~0 42)), 29392#(and (<= main_~i~0 43) (<= 43 main_~i~0)), 29393#(and (<= main_~i~0 44) (<= 44 main_~i~0)), 29394#(and (<= 45 main_~i~0) (<= main_~i~0 45)), 29395#(and (<= 46 main_~i~0) (<= main_~i~0 46)), 29396#(and (<= 47 main_~i~0) (<= main_~i~0 47)), 29397#(and (<= main_~i~0 48) (<= 48 main_~i~0)), 29398#(and (<= main_~i~0 49) (<= 49 main_~i~0)), 29399#(and (<= 50 main_~i~0) (<= main_~i~0 50)), 29400#(and (<= main_~i~0 51) (<= 51 main_~i~0)), 29401#(and (<= 52 main_~i~0) (<= main_~i~0 52)), 29402#(and (<= main_~i~0 53) (<= 53 main_~i~0)), 29403#(and (<= main_~i~0 54) (<= 54 main_~i~0)), 29404#(and (<= main_~i~0 55) (<= 55 main_~i~0)), 29405#(and (<= main_~i~0 56) (<= 56 main_~i~0)), 29406#(and (<= 57 main_~i~0) (<= main_~i~0 57)), 29407#(and (<= main_~i~0 58) (<= 58 main_~i~0)), 29408#(and (<= main_~i~0 59) (<= 59 main_~i~0)), 29409#(and (<= main_~i~0 60) (<= 60 main_~i~0)), 29410#(and (<= 61 main_~i~0) (<= main_~i~0 61)), 29411#(and (<= main_~i~0 62) (<= 62 main_~i~0)), 29412#(and (<= main_~i~0 63) (<= 63 main_~i~0)), 29413#(and (<= main_~i~0 64) (<= 64 main_~i~0))] [2018-04-10 14:37:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:39,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 14:37:39,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 14:37:39,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 14:37:39,219 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-04-10 14:37:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:43,283 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-04-10 14:37:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 14:37:43,283 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-10 14:37:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:43,284 INFO L225 Difference]: With dead ends: 338 [2018-04-10 14:37:43,284 INFO L226 Difference]: Without dead ends: 338 [2018-04-10 14:37:43,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 14:37:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-10 14:37:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-10 14:37:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 14:37:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-04-10 14:37:43,287 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-04-10 14:37:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:43,287 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-04-10 14:37:43,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 14:37:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-04-10 14:37:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 14:37:43,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:43,289 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:43,289 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1356376471, now seen corresponding path program 65 times [2018-04-10 14:37:43,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:43,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:44,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:44,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-10 14:37:44,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:44,502 INFO L182 omatonBuilderFactory]: Interpolants [30090#true, 30091#false, 30092#(<= main_~i~0 0), 30093#(<= main_~i~0 1), 30094#(<= main_~i~0 2), 30095#(<= main_~i~0 3), 30096#(<= main_~i~0 4), 30097#(<= main_~i~0 5), 30098#(<= main_~i~0 6), 30099#(<= main_~i~0 7), 30100#(<= main_~i~0 8), 30101#(<= main_~i~0 9), 30102#(<= main_~i~0 10), 30103#(<= main_~i~0 11), 30104#(<= main_~i~0 12), 30105#(<= main_~i~0 13), 30106#(<= main_~i~0 14), 30107#(<= main_~i~0 15), 30108#(<= main_~i~0 16), 30109#(<= main_~i~0 17), 30110#(<= main_~i~0 18), 30111#(<= main_~i~0 19), 30112#(<= main_~i~0 20), 30113#(<= main_~i~0 21), 30114#(<= main_~i~0 22), 30115#(<= main_~i~0 23), 30116#(<= main_~i~0 24), 30117#(<= main_~i~0 25), 30118#(<= main_~i~0 26), 30119#(<= main_~i~0 27), 30120#(<= main_~i~0 28), 30121#(<= main_~i~0 29), 30122#(<= main_~i~0 30), 30123#(<= main_~i~0 31), 30124#(<= main_~i~0 32), 30125#(<= main_~i~0 33), 30126#(<= main_~i~0 34), 30127#(<= main_~i~0 35), 30128#(<= main_~i~0 36), 30129#(<= main_~i~0 37), 30130#(<= main_~i~0 38), 30131#(<= main_~i~0 39), 30132#(<= main_~i~0 40), 30133#(<= main_~i~0 41), 30134#(<= main_~i~0 42), 30135#(<= main_~i~0 43), 30136#(<= main_~i~0 44), 30137#(<= main_~i~0 45), 30138#(<= main_~i~0 46), 30139#(<= main_~i~0 47), 30140#(<= main_~i~0 48), 30141#(<= main_~i~0 49), 30142#(<= main_~i~0 50), 30143#(<= main_~i~0 51), 30144#(<= main_~i~0 52), 30145#(<= main_~i~0 53), 30146#(<= main_~i~0 54), 30147#(<= main_~i~0 55), 30148#(<= main_~i~0 56), 30149#(<= main_~i~0 57), 30150#(<= main_~i~0 58), 30151#(<= main_~i~0 59), 30152#(<= main_~i~0 60), 30153#(<= main_~i~0 61), 30154#(<= main_~i~0 62), 30155#(<= main_~i~0 63), 30156#(<= main_~i~0 64), 30157#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 30158#(and (<= 1 main_~i~0) (<= main_~i~0 65))] [2018-04-10 14:37:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:44,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 14:37:44,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 14:37:44,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 14:37:44,503 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 69 states. [2018-04-10 14:37:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:45,948 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-04-10 14:37:45,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 14:37:45,948 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-04-10 14:37:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:45,949 INFO L225 Difference]: With dead ends: 343 [2018-04-10 14:37:45,949 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 14:37:45,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6636, Invalid=11186, Unknown=0, NotChecked=0, Total=17822 [2018-04-10 14:37:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 14:37:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-10 14:37:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-10 14:37:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-04-10 14:37:45,952 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-04-10 14:37:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:45,952 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-04-10 14:37:45,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 14:37:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-04-10 14:37:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-10 14:37:45,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:45,953 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:45,953 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -570087994, now seen corresponding path program 66 times [2018-04-10 14:37:45,954 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:45,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:47,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:47,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-10 14:37:47,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:47,248 INFO L182 omatonBuilderFactory]: Interpolants [30976#false, 30977#(<= main_~i~0 0), 30978#(<= main_~i~0 1), 30979#(<= main_~i~0 2), 30980#(<= main_~i~0 3), 30981#(<= main_~i~0 4), 30982#(<= main_~i~0 5), 30983#(<= main_~i~0 6), 30984#(<= main_~i~0 7), 30985#(<= main_~i~0 8), 30986#(<= main_~i~0 9), 30987#(<= main_~i~0 10), 30988#(<= main_~i~0 11), 30989#(<= main_~i~0 12), 30990#(<= main_~i~0 13), 30991#(<= main_~i~0 14), 30992#(<= main_~i~0 15), 30993#(<= main_~i~0 16), 30994#(<= main_~i~0 17), 30995#(<= main_~i~0 18), 30996#(<= main_~i~0 19), 30997#(<= main_~i~0 20), 30998#(<= main_~i~0 21), 30999#(<= main_~i~0 22), 31000#(<= main_~i~0 23), 31001#(<= main_~i~0 24), 31002#(<= main_~i~0 25), 31003#(<= main_~i~0 26), 31004#(<= main_~i~0 27), 31005#(<= main_~i~0 28), 31006#(<= main_~i~0 29), 31007#(<= main_~i~0 30), 31008#(<= main_~i~0 31), 31009#(<= main_~i~0 32), 31010#(<= main_~i~0 33), 31011#(<= main_~i~0 34), 31012#(<= main_~i~0 35), 31013#(<= main_~i~0 36), 31014#(<= main_~i~0 37), 31015#(<= main_~i~0 38), 31016#(<= main_~i~0 39), 31017#(<= main_~i~0 40), 31018#(<= main_~i~0 41), 31019#(<= main_~i~0 42), 31020#(<= main_~i~0 43), 31021#(<= main_~i~0 44), 31022#(<= main_~i~0 45), 31023#(<= main_~i~0 46), 31024#(<= main_~i~0 47), 31025#(<= main_~i~0 48), 31026#(<= main_~i~0 49), 31027#(<= main_~i~0 50), 31028#(<= main_~i~0 51), 31029#(<= main_~i~0 52), 31030#(<= main_~i~0 53), 31031#(<= main_~i~0 54), 31032#(<= main_~i~0 55), 31033#(<= main_~i~0 56), 31034#(<= main_~i~0 57), 31035#(<= main_~i~0 58), 31036#(<= main_~i~0 59), 31037#(<= main_~i~0 60), 31038#(<= main_~i~0 61), 31039#(<= main_~i~0 62), 31040#(<= main_~i~0 63), 31041#(<= main_~i~0 64), 31042#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 31043#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 31044#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 30975#true] [2018-04-10 14:37:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:47,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 14:37:47,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 14:37:47,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2218, Invalid=2612, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 14:37:47,249 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 70 states. [2018-04-10 14:37:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:48,849 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-04-10 14:37:48,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 14:37:48,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-04-10 14:37:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:48,851 INFO L225 Difference]: With dead ends: 348 [2018-04-10 14:37:48,851 INFO L226 Difference]: Without dead ends: 348 [2018-04-10 14:37:48,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6705, Invalid=11655, Unknown=0, NotChecked=0, Total=18360 [2018-04-10 14:37:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-10 14:37:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-04-10 14:37:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-10 14:37:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-04-10 14:37:48,854 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-04-10 14:37:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:48,854 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-04-10 14:37:48,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 14:37:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-04-10 14:37:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-10 14:37:48,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:48,855 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:48,855 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1787171081, now seen corresponding path program 67 times [2018-04-10 14:37:48,855 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:48,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:50,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:50,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-10 14:37:50,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:50,174 INFO L182 omatonBuilderFactory]: Interpolants [31873#true, 31874#false, 31875#(<= main_~i~0 0), 31876#(<= main_~i~0 1), 31877#(<= main_~i~0 2), 31878#(<= main_~i~0 3), 31879#(<= main_~i~0 4), 31880#(<= main_~i~0 5), 31881#(<= main_~i~0 6), 31882#(<= main_~i~0 7), 31883#(<= main_~i~0 8), 31884#(<= main_~i~0 9), 31885#(<= main_~i~0 10), 31886#(<= main_~i~0 11), 31887#(<= main_~i~0 12), 31888#(<= main_~i~0 13), 31889#(<= main_~i~0 14), 31890#(<= main_~i~0 15), 31891#(<= main_~i~0 16), 31892#(<= main_~i~0 17), 31893#(<= main_~i~0 18), 31894#(<= main_~i~0 19), 31895#(<= main_~i~0 20), 31896#(<= main_~i~0 21), 31897#(<= main_~i~0 22), 31898#(<= main_~i~0 23), 31899#(<= main_~i~0 24), 31900#(<= main_~i~0 25), 31901#(<= main_~i~0 26), 31902#(<= main_~i~0 27), 31903#(<= main_~i~0 28), 31904#(<= main_~i~0 29), 31905#(<= main_~i~0 30), 31906#(<= main_~i~0 31), 31907#(<= main_~i~0 32), 31908#(<= main_~i~0 33), 31909#(<= main_~i~0 34), 31910#(<= main_~i~0 35), 31911#(<= main_~i~0 36), 31912#(<= main_~i~0 37), 31913#(<= main_~i~0 38), 31914#(<= main_~i~0 39), 31915#(<= main_~i~0 40), 31916#(<= main_~i~0 41), 31917#(<= main_~i~0 42), 31918#(<= main_~i~0 43), 31919#(<= main_~i~0 44), 31920#(<= main_~i~0 45), 31921#(<= main_~i~0 46), 31922#(<= main_~i~0 47), 31923#(<= main_~i~0 48), 31924#(<= main_~i~0 49), 31925#(<= main_~i~0 50), 31926#(<= main_~i~0 51), 31927#(<= main_~i~0 52), 31928#(<= main_~i~0 53), 31929#(<= main_~i~0 54), 31930#(<= main_~i~0 55), 31931#(<= main_~i~0 56), 31932#(<= main_~i~0 57), 31933#(<= main_~i~0 58), 31934#(<= main_~i~0 59), 31935#(<= main_~i~0 60), 31936#(<= main_~i~0 61), 31937#(<= main_~i~0 62), 31938#(<= main_~i~0 63), 31939#(<= main_~i~0 64), 31940#(<= main_~i~0 65), 31941#(<= main_~i~0 66), 31942#(and (<= main_~i~0 66) (<= 0 main_~i~0)), 31943#(and (<= main_~i~0 67) (<= 1 main_~i~0))] [2018-04-10 14:37:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:50,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 14:37:50,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 14:37:50,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 14:37:50,175 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-04-10 14:37:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:51,681 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-04-10 14:37:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 14:37:51,681 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-10 14:37:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:51,682 INFO L225 Difference]: With dead ends: 353 [2018-04-10 14:37:51,682 INFO L226 Difference]: Without dead ends: 353 [2018-04-10 14:37:51,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-10 14:37:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-10 14:37:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-04-10 14:37:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-10 14:37:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-04-10 14:37:51,685 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-04-10 14:37:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:51,686 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-04-10 14:37:51,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 14:37:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-04-10 14:37:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-10 14:37:51,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:51,687 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:51,687 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1204274074, now seen corresponding path program 68 times [2018-04-10 14:37:51,687 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:51,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:53,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:53,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-10 14:37:53,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:53,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-10 14:37:53,003 INFO L182 omatonBuilderFactory]: Interpolants [32784#true, 32785#false, 32786#(<= main_~i~0 0), 32787#(<= main_~i~0 1), 32788#(<= main_~i~0 2), 32789#(<= main_~i~0 3), 32790#(<= main_~i~0 4), 32791#(<= main_~i~0 5), 32792#(<= main_~i~0 6), 32793#(<= main_~i~0 7), 32794#(<= main_~i~0 8), 32795#(<= main_~i~0 9), 32796#(<= main_~i~0 10), 32797#(<= main_~i~0 11), 32798#(<= main_~i~0 12), 32799#(<= main_~i~0 13), 32800#(<= main_~i~0 14), 32801#(<= main_~i~0 15), 32802#(<= main_~i~0 16), 32803#(<= main_~i~0 17), 32804#(<= main_~i~0 18), 32805#(<= main_~i~0 19), 32806#(<= main_~i~0 20), 32807#(<= main_~i~0 21), 32808#(<= main_~i~0 22), 32809#(<= main_~i~0 23), 32810#(<= main_~i~0 24), 32811#(<= main_~i~0 25), 32812#(<= main_~i~0 26), 32813#(<= main_~i~0 27), 32814#(<= main_~i~0 28), 32815#(<= main_~i~0 29), 32816#(<= main_~i~0 30), 32817#(<= main_~i~0 31), 32818#(<= main_~i~0 32), 32819#(<= main_~i~0 33), 32820#(<= main_~i~0 34), 32821#(<= main_~i~0 35), 32822#(<= main_~i~0 36), 32823#(<= main_~i~0 37), 32824#(<= main_~i~0 38), 32825#(<= main_~i~0 39), 32826#(<= main_~i~0 40), 32827#(<= main_~i~0 41), 32828#(<= main_~i~0 42), 32829#(<= main_~i~0 43), 32830#(<= main_~i~0 44), 32831#(<= main_~i~0 45), 32832#(<= main_~i~0 46), 32833#(<= main_~i~0 47), 32834#(<= main_~i~0 48), 32835#(<= main_~i~0 49), 32836#(<= main_~i~0 50), 32837#(<= main_~i~0 51), 32838#(<= main_~i~0 52), 32839#(<= main_~i~0 53), 32840#(<= main_~i~0 54), 32841#(<= main_~i~0 55), 32842#(<= main_~i~0 56), 32843#(<= main_~i~0 57), 32844#(<= main_~i~0 58), 32845#(<= main_~i~0 59), 32846#(<= main_~i~0 60), 32847#(<= main_~i~0 61), 32848#(<= main_~i~0 62), 32849#(<= main_~i~0 63), 32850#(<= main_~i~0 64), 32851#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 32852#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 32853#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 32854#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 32855#(and (<= 4 main_~i~0) (<= main_~i~0 68))] [2018-04-10 14:37:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:53,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 14:37:53,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 14:37:53,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 14:37:53,004 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-04-10 14:37:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:54,953 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-04-10 14:37:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 14:37:54,953 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-10 14:37:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:54,954 INFO L225 Difference]: With dead ends: 358 [2018-04-10 14:37:54,954 INFO L226 Difference]: Without dead ends: 358 [2018-04-10 14:37:54,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-10 14:37:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-10 14:37:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-04-10 14:37:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-10 14:37:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-04-10 14:37:54,957 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-04-10 14:37:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:54,957 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-04-10 14:37:54,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 14:37:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-04-10 14:37:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-10 14:37:54,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:54,958 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:54,958 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1093927849, now seen corresponding path program 69 times [2018-04-10 14:37:54,959 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:54,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:56,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:56,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-10 14:37:56,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:56,345 INFO L182 omatonBuilderFactory]: Interpolants [33708#true, 33709#false, 33710#(<= main_~i~0 0), 33711#(<= main_~i~0 1), 33712#(<= main_~i~0 2), 33713#(<= main_~i~0 3), 33714#(<= main_~i~0 4), 33715#(<= main_~i~0 5), 33716#(<= main_~i~0 6), 33717#(<= main_~i~0 7), 33718#(<= main_~i~0 8), 33719#(<= main_~i~0 9), 33720#(<= main_~i~0 10), 33721#(<= main_~i~0 11), 33722#(<= main_~i~0 12), 33723#(<= main_~i~0 13), 33724#(<= main_~i~0 14), 33725#(<= main_~i~0 15), 33726#(<= main_~i~0 16), 33727#(<= main_~i~0 17), 33728#(<= main_~i~0 18), 33729#(<= main_~i~0 19), 33730#(<= main_~i~0 20), 33731#(<= main_~i~0 21), 33732#(<= main_~i~0 22), 33733#(<= main_~i~0 23), 33734#(<= main_~i~0 24), 33735#(<= main_~i~0 25), 33736#(<= main_~i~0 26), 33737#(<= main_~i~0 27), 33738#(<= main_~i~0 28), 33739#(<= main_~i~0 29), 33740#(<= main_~i~0 30), 33741#(<= main_~i~0 31), 33742#(<= main_~i~0 32), 33743#(<= main_~i~0 33), 33744#(<= main_~i~0 34), 33745#(<= main_~i~0 35), 33746#(<= main_~i~0 36), 33747#(<= main_~i~0 37), 33748#(<= main_~i~0 38), 33749#(<= main_~i~0 39), 33750#(<= main_~i~0 40), 33751#(<= main_~i~0 41), 33752#(<= main_~i~0 42), 33753#(<= main_~i~0 43), 33754#(<= main_~i~0 44), 33755#(<= main_~i~0 45), 33756#(<= main_~i~0 46), 33757#(<= main_~i~0 47), 33758#(<= main_~i~0 48), 33759#(<= main_~i~0 49), 33760#(<= main_~i~0 50), 33761#(<= main_~i~0 51), 33762#(<= main_~i~0 52), 33763#(<= main_~i~0 53), 33764#(<= main_~i~0 54), 33765#(<= main_~i~0 55), 33766#(<= main_~i~0 56), 33767#(<= main_~i~0 57), 33768#(<= main_~i~0 58), 33769#(<= main_~i~0 59), 33770#(<= main_~i~0 60), 33771#(<= main_~i~0 61), 33772#(<= main_~i~0 62), 33773#(<= main_~i~0 63), 33774#(<= main_~i~0 64), 33775#(<= main_~i~0 65), 33776#(<= main_~i~0 66), 33777#(<= main_~i~0 67), 33778#(<= main_~i~0 68), 33779#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 33780#(and (<= main_~i~0 69) (<= 1 main_~i~0))] [2018-04-10 14:37:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:56,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 14:37:56,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 14:37:56,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 14:37:56,346 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-04-10 14:37:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:37:57,941 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-04-10 14:37:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 14:37:57,942 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-10 14:37:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:37:57,943 INFO L225 Difference]: With dead ends: 363 [2018-04-10 14:37:57,943 INFO L226 Difference]: Without dead ends: 363 [2018-04-10 14:37:57,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-10 14:37:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-10 14:37:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-04-10 14:37:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-10 14:37:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-04-10 14:37:57,946 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-04-10 14:37:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:37:57,946 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-04-10 14:37:57,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 14:37:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-04-10 14:37:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-10 14:37:57,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:37:57,947 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-10 14:37:57,947 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:37:57,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1693944582, now seen corresponding path program 70 times [2018-04-10 14:37:57,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:37:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:37:57,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:37:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:59,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:37:59,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-10 14:37:59,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:37:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:59,380 INFO L182 omatonBuilderFactory]: Interpolants [34688#(<= main_~i~0 41), 34689#(<= main_~i~0 42), 34690#(<= main_~i~0 43), 34691#(<= main_~i~0 44), 34692#(<= main_~i~0 45), 34693#(<= main_~i~0 46), 34694#(<= main_~i~0 47), 34695#(<= main_~i~0 48), 34696#(<= main_~i~0 49), 34697#(<= main_~i~0 50), 34698#(<= main_~i~0 51), 34699#(<= main_~i~0 52), 34700#(<= main_~i~0 53), 34701#(<= main_~i~0 54), 34702#(<= main_~i~0 55), 34703#(<= main_~i~0 56), 34704#(<= main_~i~0 57), 34705#(<= main_~i~0 58), 34706#(<= main_~i~0 59), 34707#(<= main_~i~0 60), 34708#(<= main_~i~0 61), 34709#(<= main_~i~0 62), 34710#(<= main_~i~0 63), 34711#(<= main_~i~0 64), 34712#(<= main_~i~0 65), 34713#(<= main_~i~0 66), 34714#(<= main_~i~0 67), 34715#(<= main_~i~0 68), 34716#(and (<= 0 main_~i~0) (<= main_~i~0 68)), 34717#(and (<= main_~i~0 69) (<= 1 main_~i~0)), 34718#(and (<= 2 main_~i~0) (<= main_~i~0 70)), 34645#true, 34646#false, 34647#(<= main_~i~0 0), 34648#(<= main_~i~0 1), 34649#(<= main_~i~0 2), 34650#(<= main_~i~0 3), 34651#(<= main_~i~0 4), 34652#(<= main_~i~0 5), 34653#(<= main_~i~0 6), 34654#(<= main_~i~0 7), 34655#(<= main_~i~0 8), 34656#(<= main_~i~0 9), 34657#(<= main_~i~0 10), 34658#(<= main_~i~0 11), 34659#(<= main_~i~0 12), 34660#(<= main_~i~0 13), 34661#(<= main_~i~0 14), 34662#(<= main_~i~0 15), 34663#(<= main_~i~0 16), 34664#(<= main_~i~0 17), 34665#(<= main_~i~0 18), 34666#(<= main_~i~0 19), 34667#(<= main_~i~0 20), 34668#(<= main_~i~0 21), 34669#(<= main_~i~0 22), 34670#(<= main_~i~0 23), 34671#(<= main_~i~0 24), 34672#(<= main_~i~0 25), 34673#(<= main_~i~0 26), 34674#(<= main_~i~0 27), 34675#(<= main_~i~0 28), 34676#(<= main_~i~0 29), 34677#(<= main_~i~0 30), 34678#(<= main_~i~0 31), 34679#(<= main_~i~0 32), 34680#(<= main_~i~0 33), 34681#(<= main_~i~0 34), 34682#(<= main_~i~0 35), 34683#(<= main_~i~0 36), 34684#(<= main_~i~0 37), 34685#(<= main_~i~0 38), 34686#(<= main_~i~0 39), 34687#(<= main_~i~0 40)] [2018-04-10 14:37:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:37:59,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 14:37:59,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 14:37:59,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:37:59,381 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-04-10 14:38:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:01,152 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-04-10 14:38:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 14:38:01,152 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-10 14:38:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:01,153 INFO L225 Difference]: With dead ends: 368 [2018-04-10 14:38:01,153 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 14:38:01,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-10 14:38:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 14:38:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-04-10 14:38:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-10 14:38:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-04-10 14:38:01,156 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-04-10 14:38:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:01,156 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-04-10 14:38:01,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 14:38:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-04-10 14:38:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-10 14:38:01,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:01,157 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:01,158 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1551159735, now seen corresponding path program 71 times [2018-04-10 14:38:01,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:01,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:02,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:02,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-10 14:38:02,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:02,916 INFO L182 omatonBuilderFactory]: Interpolants [35595#true, 35596#false, 35597#(<= main_~i~0 0), 35598#(<= main_~i~0 1), 35599#(<= main_~i~0 2), 35600#(<= main_~i~0 3), 35601#(<= main_~i~0 4), 35602#(<= main_~i~0 5), 35603#(<= main_~i~0 6), 35604#(<= main_~i~0 7), 35605#(<= main_~i~0 8), 35606#(<= main_~i~0 9), 35607#(<= main_~i~0 10), 35608#(<= main_~i~0 11), 35609#(<= main_~i~0 12), 35610#(<= main_~i~0 13), 35611#(<= main_~i~0 14), 35612#(<= main_~i~0 15), 35613#(<= main_~i~0 16), 35614#(<= main_~i~0 17), 35615#(<= main_~i~0 18), 35616#(<= main_~i~0 19), 35617#(<= main_~i~0 20), 35618#(<= main_~i~0 21), 35619#(<= main_~i~0 22), 35620#(<= main_~i~0 23), 35621#(<= main_~i~0 24), 35622#(<= main_~i~0 25), 35623#(<= main_~i~0 26), 35624#(<= main_~i~0 27), 35625#(<= main_~i~0 28), 35626#(<= main_~i~0 29), 35627#(<= main_~i~0 30), 35628#(<= main_~i~0 31), 35629#(<= main_~i~0 32), 35630#(<= main_~i~0 33), 35631#(<= main_~i~0 34), 35632#(<= main_~i~0 35), 35633#(<= main_~i~0 36), 35634#(<= main_~i~0 37), 35635#(<= main_~i~0 38), 35636#(<= main_~i~0 39), 35637#(<= main_~i~0 40), 35638#(<= main_~i~0 41), 35639#(<= main_~i~0 42), 35640#(<= main_~i~0 43), 35641#(<= main_~i~0 44), 35642#(<= main_~i~0 45), 35643#(<= main_~i~0 46), 35644#(<= main_~i~0 47), 35645#(<= main_~i~0 48), 35646#(<= main_~i~0 49), 35647#(<= main_~i~0 50), 35648#(<= main_~i~0 51), 35649#(<= main_~i~0 52), 35650#(<= main_~i~0 53), 35651#(<= main_~i~0 54), 35652#(<= main_~i~0 55), 35653#(<= main_~i~0 56), 35654#(<= main_~i~0 57), 35655#(<= main_~i~0 58), 35656#(<= main_~i~0 59), 35657#(<= main_~i~0 60), 35658#(<= main_~i~0 61), 35659#(<= main_~i~0 62), 35660#(<= main_~i~0 63), 35661#(<= main_~i~0 64), 35662#(<= main_~i~0 65), 35663#(<= main_~i~0 66), 35664#(<= main_~i~0 67), 35665#(<= main_~i~0 68), 35666#(<= main_~i~0 69), 35667#(<= main_~i~0 70), 35668#(and (<= 0 main_~i~0) (<= main_~i~0 70)), 35669#(and (<= 1 main_~i~0) (<= main_~i~0 71))] [2018-04-10 14:38:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:02,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 14:38:02,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 14:38:02,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2633, Invalid=2917, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 14:38:02,917 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 75 states. [2018-04-10 14:38:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:04,609 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-04-10 14:38:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 14:38:04,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-04-10 14:38:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:04,610 INFO L225 Difference]: With dead ends: 373 [2018-04-10 14:38:04,610 INFO L226 Difference]: Without dead ends: 373 [2018-04-10 14:38:04,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=7887, Invalid=13283, Unknown=0, NotChecked=0, Total=21170 [2018-04-10 14:38:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-10 14:38:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-04-10 14:38:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-10 14:38:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-04-10 14:38:04,613 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-04-10 14:38:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:04,613 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-04-10 14:38:04,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 14:38:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-04-10 14:38:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-10 14:38:04,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:04,615 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:04,615 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash 744296870, now seen corresponding path program 72 times [2018-04-10 14:38:04,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:04,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:06,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:06,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-10 14:38:06,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:06,095 INFO L182 omatonBuilderFactory]: Interpolants [36608#(<= main_~i~0 48), 36609#(<= main_~i~0 49), 36610#(<= main_~i~0 50), 36611#(<= main_~i~0 51), 36612#(<= main_~i~0 52), 36613#(<= main_~i~0 53), 36614#(<= main_~i~0 54), 36615#(<= main_~i~0 55), 36616#(<= main_~i~0 56), 36617#(<= main_~i~0 57), 36618#(<= main_~i~0 58), 36619#(<= main_~i~0 59), 36620#(<= main_~i~0 60), 36621#(<= main_~i~0 61), 36622#(<= main_~i~0 62), 36623#(<= main_~i~0 63), 36624#(<= main_~i~0 64), 36625#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 36626#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 36627#(and (<= main_~i~0 66) (<= 2 main_~i~0)), 36628#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 36629#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 36630#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 36631#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 36632#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 36633#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 36558#true, 36559#false, 36560#(<= main_~i~0 0), 36561#(<= main_~i~0 1), 36562#(<= main_~i~0 2), 36563#(<= main_~i~0 3), 36564#(<= main_~i~0 4), 36565#(<= main_~i~0 5), 36566#(<= main_~i~0 6), 36567#(<= main_~i~0 7), 36568#(<= main_~i~0 8), 36569#(<= main_~i~0 9), 36570#(<= main_~i~0 10), 36571#(<= main_~i~0 11), 36572#(<= main_~i~0 12), 36573#(<= main_~i~0 13), 36574#(<= main_~i~0 14), 36575#(<= main_~i~0 15), 36576#(<= main_~i~0 16), 36577#(<= main_~i~0 17), 36578#(<= main_~i~0 18), 36579#(<= main_~i~0 19), 36580#(<= main_~i~0 20), 36581#(<= main_~i~0 21), 36582#(<= main_~i~0 22), 36583#(<= main_~i~0 23), 36584#(<= main_~i~0 24), 36585#(<= main_~i~0 25), 36586#(<= main_~i~0 26), 36587#(<= main_~i~0 27), 36588#(<= main_~i~0 28), 36589#(<= main_~i~0 29), 36590#(<= main_~i~0 30), 36591#(<= main_~i~0 31), 36592#(<= main_~i~0 32), 36593#(<= main_~i~0 33), 36594#(<= main_~i~0 34), 36595#(<= main_~i~0 35), 36596#(<= main_~i~0 36), 36597#(<= main_~i~0 37), 36598#(<= main_~i~0 38), 36599#(<= main_~i~0 39), 36600#(<= main_~i~0 40), 36601#(<= main_~i~0 41), 36602#(<= main_~i~0 42), 36603#(<= main_~i~0 43), 36604#(<= main_~i~0 44), 36605#(<= main_~i~0 45), 36606#(<= main_~i~0 46), 36607#(<= main_~i~0 47)] [2018-04-10 14:38:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:06,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 14:38:06,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 14:38:06,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2230, Invalid=3470, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 14:38:06,096 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 76 states. [2018-04-10 14:38:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:08,726 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-04-10 14:38:08,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 14:38:08,727 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 367 [2018-04-10 14:38:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:08,728 INFO L225 Difference]: With dead ends: 378 [2018-04-10 14:38:08,728 INFO L226 Difference]: Without dead ends: 378 [2018-04-10 14:38:08,729 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7119, Invalid=14637, Unknown=0, NotChecked=0, Total=21756 [2018-04-10 14:38:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-10 14:38:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-04-10 14:38:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-10 14:38:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-04-10 14:38:08,731 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-04-10 14:38:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:08,731 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-04-10 14:38:08,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 14:38:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-04-10 14:38:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-10 14:38:08,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:08,732 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:08,732 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash 647655191, now seen corresponding path program 73 times [2018-04-10 14:38:08,733 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:08,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:10,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:10,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-10 14:38:10,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:10,275 INFO L182 omatonBuilderFactory]: Interpolants [37534#true, 37535#false, 37536#(<= main_~i~0 0), 37537#(<= main_~i~0 1), 37538#(<= main_~i~0 2), 37539#(<= main_~i~0 3), 37540#(<= main_~i~0 4), 37541#(<= main_~i~0 5), 37542#(<= main_~i~0 6), 37543#(<= main_~i~0 7), 37544#(<= main_~i~0 8), 37545#(<= main_~i~0 9), 37546#(<= main_~i~0 10), 37547#(<= main_~i~0 11), 37548#(<= main_~i~0 12), 37549#(<= main_~i~0 13), 37550#(<= main_~i~0 14), 37551#(<= main_~i~0 15), 37552#(<= main_~i~0 16), 37553#(<= main_~i~0 17), 37554#(<= main_~i~0 18), 37555#(<= main_~i~0 19), 37556#(<= main_~i~0 20), 37557#(<= main_~i~0 21), 37558#(<= main_~i~0 22), 37559#(<= main_~i~0 23), 37560#(<= main_~i~0 24), 37561#(<= main_~i~0 25), 37562#(<= main_~i~0 26), 37563#(<= main_~i~0 27), 37564#(<= main_~i~0 28), 37565#(<= main_~i~0 29), 37566#(<= main_~i~0 30), 37567#(<= main_~i~0 31), 37568#(<= main_~i~0 32), 37569#(<= main_~i~0 33), 37570#(<= main_~i~0 34), 37571#(<= main_~i~0 35), 37572#(<= main_~i~0 36), 37573#(<= main_~i~0 37), 37574#(<= main_~i~0 38), 37575#(<= main_~i~0 39), 37576#(<= main_~i~0 40), 37577#(<= main_~i~0 41), 37578#(<= main_~i~0 42), 37579#(<= main_~i~0 43), 37580#(<= main_~i~0 44), 37581#(<= main_~i~0 45), 37582#(<= main_~i~0 46), 37583#(<= main_~i~0 47), 37584#(<= main_~i~0 48), 37585#(<= main_~i~0 49), 37586#(<= main_~i~0 50), 37587#(<= main_~i~0 51), 37588#(<= main_~i~0 52), 37589#(<= main_~i~0 53), 37590#(<= main_~i~0 54), 37591#(<= main_~i~0 55), 37592#(<= main_~i~0 56), 37593#(<= main_~i~0 57), 37594#(<= main_~i~0 58), 37595#(<= main_~i~0 59), 37596#(<= main_~i~0 60), 37597#(<= main_~i~0 61), 37598#(<= main_~i~0 62), 37599#(<= main_~i~0 63), 37600#(<= main_~i~0 64), 37601#(<= main_~i~0 65), 37602#(<= main_~i~0 66), 37603#(<= main_~i~0 67), 37604#(<= main_~i~0 68), 37605#(<= main_~i~0 69), 37606#(<= main_~i~0 70), 37607#(<= main_~i~0 71), 37608#(<= main_~i~0 72), 37609#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 37610#(and (<= 1 main_~i~0) (<= main_~i~0 73))] [2018-04-10 14:38:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:10,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 14:38:10,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 14:38:10,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 14:38:10,276 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-04-10 14:38:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:11,976 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-04-10 14:38:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-10 14:38:11,976 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-10 14:38:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:11,977 INFO L225 Difference]: With dead ends: 383 [2018-04-10 14:38:11,978 INFO L226 Difference]: Without dead ends: 383 [2018-04-10 14:38:11,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-10 14:38:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-10 14:38:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-04-10 14:38:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-10 14:38:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-04-10 14:38:11,983 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-04-10 14:38:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:11,983 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-04-10 14:38:11,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 14:38:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-04-10 14:38:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-10 14:38:11,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:11,985 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:11,985 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2114113606, now seen corresponding path program 74 times [2018-04-10 14:38:11,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:11,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:13,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:13,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-10 14:38:13,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:13,575 INFO L182 omatonBuilderFactory]: Interpolants [38528#(<= main_~i~0 3), 38529#(<= main_~i~0 4), 38530#(<= main_~i~0 5), 38531#(<= main_~i~0 6), 38532#(<= main_~i~0 7), 38533#(<= main_~i~0 8), 38534#(<= main_~i~0 9), 38535#(<= main_~i~0 10), 38536#(<= main_~i~0 11), 38537#(<= main_~i~0 12), 38538#(<= main_~i~0 13), 38539#(<= main_~i~0 14), 38540#(<= main_~i~0 15), 38541#(<= main_~i~0 16), 38542#(<= main_~i~0 17), 38543#(<= main_~i~0 18), 38544#(<= main_~i~0 19), 38545#(<= main_~i~0 20), 38546#(<= main_~i~0 21), 38547#(<= main_~i~0 22), 38548#(<= main_~i~0 23), 38549#(<= main_~i~0 24), 38550#(<= main_~i~0 25), 38551#(<= main_~i~0 26), 38552#(<= main_~i~0 27), 38553#(<= main_~i~0 28), 38554#(<= main_~i~0 29), 38555#(<= main_~i~0 30), 38556#(<= main_~i~0 31), 38557#(<= main_~i~0 32), 38558#(<= main_~i~0 33), 38559#(<= main_~i~0 34), 38560#(<= main_~i~0 35), 38561#(<= main_~i~0 36), 38562#(<= main_~i~0 37), 38563#(<= main_~i~0 38), 38564#(<= main_~i~0 39), 38565#(<= main_~i~0 40), 38566#(<= main_~i~0 41), 38567#(<= main_~i~0 42), 38568#(<= main_~i~0 43), 38569#(<= main_~i~0 44), 38570#(<= main_~i~0 45), 38571#(<= main_~i~0 46), 38572#(<= main_~i~0 47), 38573#(<= main_~i~0 48), 38574#(<= main_~i~0 49), 38575#(<= main_~i~0 50), 38576#(<= main_~i~0 51), 38577#(<= main_~i~0 52), 38578#(<= main_~i~0 53), 38579#(<= main_~i~0 54), 38580#(<= main_~i~0 55), 38581#(<= main_~i~0 56), 38582#(<= main_~i~0 57), 38583#(<= main_~i~0 58), 38584#(<= main_~i~0 59), 38585#(<= main_~i~0 60), 38586#(<= main_~i~0 61), 38587#(<= main_~i~0 62), 38588#(<= main_~i~0 63), 38589#(<= main_~i~0 64), 38590#(<= main_~i~0 65), 38591#(<= main_~i~0 66), 38592#(<= main_~i~0 67), 38593#(<= main_~i~0 68), 38594#(<= main_~i~0 69), 38595#(<= main_~i~0 70), 38596#(<= main_~i~0 71), 38597#(<= main_~i~0 72), 38598#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 38599#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 38600#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 38523#true, 38524#false, 38525#(<= main_~i~0 0), 38526#(<= main_~i~0 1), 38527#(<= main_~i~0 2)] [2018-04-10 14:38:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:13,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 14:38:13,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 14:38:13,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 14:38:13,576 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-04-10 14:38:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:15,507 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-04-10 14:38:15,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 14:38:15,507 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-10 14:38:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:15,508 INFO L225 Difference]: With dead ends: 388 [2018-04-10 14:38:15,508 INFO L226 Difference]: Without dead ends: 388 [2018-04-10 14:38:15,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-10 14:38:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-10 14:38:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-04-10 14:38:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-10 14:38:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-04-10 14:38:15,511 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-04-10 14:38:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:15,511 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-04-10 14:38:15,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 14:38:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-04-10 14:38:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-10 14:38:15,512 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:15,512 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:15,512 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1575146615, now seen corresponding path program 75 times [2018-04-10 14:38:15,513 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:15,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:17,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:17,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-10 14:38:17,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:17,196 INFO L182 omatonBuilderFactory]: Interpolants [39552#(<= main_~i~0 25), 39553#(<= main_~i~0 26), 39554#(<= main_~i~0 27), 39555#(<= main_~i~0 28), 39556#(<= main_~i~0 29), 39557#(<= main_~i~0 30), 39558#(<= main_~i~0 31), 39559#(<= main_~i~0 32), 39560#(<= main_~i~0 33), 39561#(<= main_~i~0 34), 39562#(<= main_~i~0 35), 39563#(<= main_~i~0 36), 39564#(<= main_~i~0 37), 39565#(<= main_~i~0 38), 39566#(<= main_~i~0 39), 39567#(<= main_~i~0 40), 39568#(<= main_~i~0 41), 39569#(<= main_~i~0 42), 39570#(<= main_~i~0 43), 39571#(<= main_~i~0 44), 39572#(<= main_~i~0 45), 39573#(<= main_~i~0 46), 39574#(<= main_~i~0 47), 39575#(<= main_~i~0 48), 39576#(<= main_~i~0 49), 39577#(<= main_~i~0 50), 39578#(<= main_~i~0 51), 39579#(<= main_~i~0 52), 39580#(<= main_~i~0 53), 39581#(<= main_~i~0 54), 39582#(<= main_~i~0 55), 39583#(<= main_~i~0 56), 39584#(<= main_~i~0 57), 39585#(<= main_~i~0 58), 39586#(<= main_~i~0 59), 39587#(<= main_~i~0 60), 39588#(<= main_~i~0 61), 39589#(<= main_~i~0 62), 39590#(<= main_~i~0 63), 39591#(<= main_~i~0 64), 39592#(<= main_~i~0 65), 39593#(<= main_~i~0 66), 39594#(<= main_~i~0 67), 39595#(<= main_~i~0 68), 39596#(<= main_~i~0 69), 39597#(<= main_~i~0 70), 39598#(<= main_~i~0 71), 39599#(<= main_~i~0 72), 39600#(<= main_~i~0 73), 39601#(<= main_~i~0 74), 39602#(and (<= 0 main_~i~0) (<= main_~i~0 74)), 39603#(and (<= 1 main_~i~0) (<= main_~i~0 75)), 39525#true, 39526#false, 39527#(<= main_~i~0 0), 39528#(<= main_~i~0 1), 39529#(<= main_~i~0 2), 39530#(<= main_~i~0 3), 39531#(<= main_~i~0 4), 39532#(<= main_~i~0 5), 39533#(<= main_~i~0 6), 39534#(<= main_~i~0 7), 39535#(<= main_~i~0 8), 39536#(<= main_~i~0 9), 39537#(<= main_~i~0 10), 39538#(<= main_~i~0 11), 39539#(<= main_~i~0 12), 39540#(<= main_~i~0 13), 39541#(<= main_~i~0 14), 39542#(<= main_~i~0 15), 39543#(<= main_~i~0 16), 39544#(<= main_~i~0 17), 39545#(<= main_~i~0 18), 39546#(<= main_~i~0 19), 39547#(<= main_~i~0 20), 39548#(<= main_~i~0 21), 39549#(<= main_~i~0 22), 39550#(<= main_~i~0 23), 39551#(<= main_~i~0 24)] [2018-04-10 14:38:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:17,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-10 14:38:17,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-10 14:38:17,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 14:38:17,197 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-04-10 14:38:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:18,985 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-04-10 14:38:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-10 14:38:18,986 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-10 14:38:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:18,986 INFO L225 Difference]: With dead ends: 393 [2018-04-10 14:38:18,987 INFO L226 Difference]: Without dead ends: 393 [2018-04-10 14:38:18,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-10 14:38:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-10 14:38:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-04-10 14:38:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-10 14:38:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-04-10 14:38:18,989 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-04-10 14:38:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:18,989 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-04-10 14:38:18,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-10 14:38:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-04-10 14:38:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-10 14:38:18,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:18,990 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:18,990 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1862088986, now seen corresponding path program 76 times [2018-04-10 14:38:18,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:19,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:20,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:20,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-10 14:38:20,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:20,697 INFO L182 omatonBuilderFactory]: Interpolants [40576#(<= main_~i~0 34), 40577#(<= main_~i~0 35), 40578#(<= main_~i~0 36), 40579#(<= main_~i~0 37), 40580#(<= main_~i~0 38), 40581#(<= main_~i~0 39), 40582#(<= main_~i~0 40), 40583#(<= main_~i~0 41), 40584#(<= main_~i~0 42), 40585#(<= main_~i~0 43), 40586#(<= main_~i~0 44), 40587#(<= main_~i~0 45), 40588#(<= main_~i~0 46), 40589#(<= main_~i~0 47), 40590#(<= main_~i~0 48), 40591#(<= main_~i~0 49), 40592#(<= main_~i~0 50), 40593#(<= main_~i~0 51), 40594#(<= main_~i~0 52), 40595#(<= main_~i~0 53), 40596#(<= main_~i~0 54), 40597#(<= main_~i~0 55), 40598#(<= main_~i~0 56), 40599#(<= main_~i~0 57), 40600#(<= main_~i~0 58), 40601#(<= main_~i~0 59), 40602#(<= main_~i~0 60), 40603#(<= main_~i~0 61), 40604#(<= main_~i~0 62), 40605#(<= main_~i~0 63), 40606#(<= main_~i~0 64), 40607#(<= main_~i~0 65), 40608#(<= main_~i~0 66), 40609#(<= main_~i~0 67), 40610#(<= main_~i~0 68), 40611#(<= main_~i~0 69), 40612#(<= main_~i~0 70), 40613#(<= main_~i~0 71), 40614#(<= main_~i~0 72), 40615#(and (<= 0 main_~i~0) (<= main_~i~0 72)), 40616#(and (<= 1 main_~i~0) (<= main_~i~0 73)), 40617#(and (<= 2 main_~i~0) (<= main_~i~0 74)), 40618#(and (<= main_~i~0 75) (<= 3 main_~i~0)), 40619#(and (<= main_~i~0 76) (<= 4 main_~i~0)), 40540#true, 40541#false, 40542#(<= main_~i~0 0), 40543#(<= main_~i~0 1), 40544#(<= main_~i~0 2), 40545#(<= main_~i~0 3), 40546#(<= main_~i~0 4), 40547#(<= main_~i~0 5), 40548#(<= main_~i~0 6), 40549#(<= main_~i~0 7), 40550#(<= main_~i~0 8), 40551#(<= main_~i~0 9), 40552#(<= main_~i~0 10), 40553#(<= main_~i~0 11), 40554#(<= main_~i~0 12), 40555#(<= main_~i~0 13), 40556#(<= main_~i~0 14), 40557#(<= main_~i~0 15), 40558#(<= main_~i~0 16), 40559#(<= main_~i~0 17), 40560#(<= main_~i~0 18), 40561#(<= main_~i~0 19), 40562#(<= main_~i~0 20), 40563#(<= main_~i~0 21), 40564#(<= main_~i~0 22), 40565#(<= main_~i~0 23), 40566#(<= main_~i~0 24), 40567#(<= main_~i~0 25), 40568#(<= main_~i~0 26), 40569#(<= main_~i~0 27), 40570#(<= main_~i~0 28), 40571#(<= main_~i~0 29), 40572#(<= main_~i~0 30), 40573#(<= main_~i~0 31), 40574#(<= main_~i~0 32), 40575#(<= main_~i~0 33)] [2018-04-10 14:38:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:20,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-10 14:38:20,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-10 14:38:20,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 14:38:20,698 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-04-10 14:38:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:22,967 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-04-10 14:38:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-10 14:38:22,967 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-10 14:38:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:22,968 INFO L225 Difference]: With dead ends: 398 [2018-04-10 14:38:22,968 INFO L226 Difference]: Without dead ends: 398 [2018-04-10 14:38:22,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-10 14:38:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-10 14:38:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-04-10 14:38:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-10 14:38:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-04-10 14:38:22,971 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-04-10 14:38:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:22,971 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-04-10 14:38:22,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-10 14:38:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-04-10 14:38:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-10 14:38:22,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:22,972 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:22,972 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 729022935, now seen corresponding path program 77 times [2018-04-10 14:38:22,973 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:22,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:24,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:24,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-10 14:38:24,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:24,685 INFO L182 omatonBuilderFactory]: Interpolants [41600#(<= main_~i~0 30), 41601#(<= main_~i~0 31), 41602#(<= main_~i~0 32), 41603#(<= main_~i~0 33), 41604#(<= main_~i~0 34), 41605#(<= main_~i~0 35), 41606#(<= main_~i~0 36), 41607#(<= main_~i~0 37), 41608#(<= main_~i~0 38), 41609#(<= main_~i~0 39), 41610#(<= main_~i~0 40), 41611#(<= main_~i~0 41), 41612#(<= main_~i~0 42), 41613#(<= main_~i~0 43), 41614#(<= main_~i~0 44), 41615#(<= main_~i~0 45), 41616#(<= main_~i~0 46), 41617#(<= main_~i~0 47), 41618#(<= main_~i~0 48), 41619#(<= main_~i~0 49), 41620#(<= main_~i~0 50), 41621#(<= main_~i~0 51), 41622#(<= main_~i~0 52), 41623#(<= main_~i~0 53), 41624#(<= main_~i~0 54), 41625#(<= main_~i~0 55), 41626#(<= main_~i~0 56), 41627#(<= main_~i~0 57), 41628#(<= main_~i~0 58), 41629#(<= main_~i~0 59), 41630#(<= main_~i~0 60), 41631#(<= main_~i~0 61), 41632#(<= main_~i~0 62), 41633#(<= main_~i~0 63), 41634#(<= main_~i~0 64), 41635#(<= main_~i~0 65), 41636#(<= main_~i~0 66), 41637#(<= main_~i~0 67), 41638#(<= main_~i~0 68), 41639#(<= main_~i~0 69), 41640#(<= main_~i~0 70), 41641#(<= main_~i~0 71), 41642#(<= main_~i~0 72), 41643#(<= main_~i~0 73), 41644#(<= main_~i~0 74), 41645#(<= main_~i~0 75), 41646#(<= main_~i~0 76), 41647#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 41648#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 41568#true, 41569#false, 41570#(<= main_~i~0 0), 41571#(<= main_~i~0 1), 41572#(<= main_~i~0 2), 41573#(<= main_~i~0 3), 41574#(<= main_~i~0 4), 41575#(<= main_~i~0 5), 41576#(<= main_~i~0 6), 41577#(<= main_~i~0 7), 41578#(<= main_~i~0 8), 41579#(<= main_~i~0 9), 41580#(<= main_~i~0 10), 41581#(<= main_~i~0 11), 41582#(<= main_~i~0 12), 41583#(<= main_~i~0 13), 41584#(<= main_~i~0 14), 41585#(<= main_~i~0 15), 41586#(<= main_~i~0 16), 41587#(<= main_~i~0 17), 41588#(<= main_~i~0 18), 41589#(<= main_~i~0 19), 41590#(<= main_~i~0 20), 41591#(<= main_~i~0 21), 41592#(<= main_~i~0 22), 41593#(<= main_~i~0 23), 41594#(<= main_~i~0 24), 41595#(<= main_~i~0 25), 41596#(<= main_~i~0 26), 41597#(<= main_~i~0 27), 41598#(<= main_~i~0 28), 41599#(<= main_~i~0 29)] [2018-04-10 14:38:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:24,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 14:38:24,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 14:38:24,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3086, Invalid=3394, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 14:38:24,686 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 81 states. [2018-04-10 14:38:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:26,586 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-04-10 14:38:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-10 14:38:26,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-04-10 14:38:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:26,587 INFO L225 Difference]: With dead ends: 403 [2018-04-10 14:38:26,587 INFO L226 Difference]: Without dead ends: 403 [2018-04-10 14:38:26,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=9246, Invalid=15560, Unknown=0, NotChecked=0, Total=24806 [2018-04-10 14:38:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-10 14:38:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-04-10 14:38:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-10 14:38:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-04-10 14:38:26,590 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-04-10 14:38:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:26,590 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-04-10 14:38:26,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 14:38:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-04-10 14:38:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-10 14:38:26,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:26,591 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:26,591 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash 66516358, now seen corresponding path program 78 times [2018-04-10 14:38:26,592 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:26,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:28,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:28,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-10 14:38:28,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:28,328 INFO L182 omatonBuilderFactory]: Interpolants [42624#(<= main_~i~0 13), 42625#(<= main_~i~0 14), 42626#(<= main_~i~0 15), 42627#(<= main_~i~0 16), 42628#(<= main_~i~0 17), 42629#(<= main_~i~0 18), 42630#(<= main_~i~0 19), 42631#(<= main_~i~0 20), 42632#(<= main_~i~0 21), 42633#(<= main_~i~0 22), 42634#(<= main_~i~0 23), 42635#(<= main_~i~0 24), 42636#(<= main_~i~0 25), 42637#(<= main_~i~0 26), 42638#(<= main_~i~0 27), 42639#(<= main_~i~0 28), 42640#(<= main_~i~0 29), 42641#(<= main_~i~0 30), 42642#(<= main_~i~0 31), 42643#(<= main_~i~0 32), 42644#(<= main_~i~0 33), 42645#(<= main_~i~0 34), 42646#(<= main_~i~0 35), 42647#(<= main_~i~0 36), 42648#(<= main_~i~0 37), 42649#(<= main_~i~0 38), 42650#(<= main_~i~0 39), 42651#(<= main_~i~0 40), 42652#(<= main_~i~0 41), 42653#(<= main_~i~0 42), 42654#(<= main_~i~0 43), 42655#(<= main_~i~0 44), 42656#(<= main_~i~0 45), 42657#(<= main_~i~0 46), 42658#(<= main_~i~0 47), 42659#(<= main_~i~0 48), 42660#(<= main_~i~0 49), 42661#(<= main_~i~0 50), 42662#(<= main_~i~0 51), 42663#(<= main_~i~0 52), 42664#(<= main_~i~0 53), 42665#(<= main_~i~0 54), 42666#(<= main_~i~0 55), 42667#(<= main_~i~0 56), 42668#(<= main_~i~0 57), 42669#(<= main_~i~0 58), 42670#(<= main_~i~0 59), 42671#(<= main_~i~0 60), 42672#(<= main_~i~0 61), 42673#(<= main_~i~0 62), 42674#(<= main_~i~0 63), 42675#(<= main_~i~0 64), 42676#(<= main_~i~0 65), 42677#(<= main_~i~0 66), 42678#(<= main_~i~0 67), 42679#(<= main_~i~0 68), 42680#(<= main_~i~0 69), 42681#(<= main_~i~0 70), 42682#(<= main_~i~0 71), 42683#(<= main_~i~0 72), 42684#(<= main_~i~0 73), 42685#(<= main_~i~0 74), 42686#(<= main_~i~0 75), 42687#(<= main_~i~0 76), 42688#(and (<= 0 main_~i~0) (<= main_~i~0 76)), 42689#(and (<= main_~i~0 77) (<= 1 main_~i~0)), 42690#(and (<= 2 main_~i~0) (<= main_~i~0 78)), 42609#true, 42610#false, 42611#(<= main_~i~0 0), 42612#(<= main_~i~0 1), 42613#(<= main_~i~0 2), 42614#(<= main_~i~0 3), 42615#(<= main_~i~0 4), 42616#(<= main_~i~0 5), 42617#(<= main_~i~0 6), 42618#(<= main_~i~0 7), 42619#(<= main_~i~0 8), 42620#(<= main_~i~0 9), 42621#(<= main_~i~0 10), 42622#(<= main_~i~0 11), 42623#(<= main_~i~0 12)] [2018-04-10 14:38:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:28,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-10 14:38:28,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-10 14:38:28,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=3554, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 14:38:28,330 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 82 states. [2018-04-10 14:38:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:30,467 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-04-10 14:38:30,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-10 14:38:30,467 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 397 [2018-04-10 14:38:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:30,468 INFO L225 Difference]: With dead ends: 408 [2018-04-10 14:38:30,468 INFO L226 Difference]: Without dead ends: 408 [2018-04-10 14:38:30,468 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=9327, Invalid=16113, Unknown=0, NotChecked=0, Total=25440 [2018-04-10 14:38:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-10 14:38:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-04-10 14:38:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-10 14:38:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-04-10 14:38:30,470 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 397 [2018-04-10 14:38:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:30,470 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-04-10 14:38:30,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-10 14:38:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-04-10 14:38:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-10 14:38:30,472 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:30,472 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:30,472 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash 15988535, now seen corresponding path program 79 times [2018-04-10 14:38:30,472 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:30,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:32,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:32,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-10 14:38:32,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:32,284 INFO L182 omatonBuilderFactory]: Interpolants [43663#true, 43664#false, 43665#(<= main_~i~0 0), 43666#(<= main_~i~0 1), 43667#(<= main_~i~0 2), 43668#(<= main_~i~0 3), 43669#(<= main_~i~0 4), 43670#(<= main_~i~0 5), 43671#(<= main_~i~0 6), 43672#(<= main_~i~0 7), 43673#(<= main_~i~0 8), 43674#(<= main_~i~0 9), 43675#(<= main_~i~0 10), 43676#(<= main_~i~0 11), 43677#(<= main_~i~0 12), 43678#(<= main_~i~0 13), 43679#(<= main_~i~0 14), 43680#(<= main_~i~0 15), 43681#(<= main_~i~0 16), 43682#(<= main_~i~0 17), 43683#(<= main_~i~0 18), 43684#(<= main_~i~0 19), 43685#(<= main_~i~0 20), 43686#(<= main_~i~0 21), 43687#(<= main_~i~0 22), 43688#(<= main_~i~0 23), 43689#(<= main_~i~0 24), 43690#(<= main_~i~0 25), 43691#(<= main_~i~0 26), 43692#(<= main_~i~0 27), 43693#(<= main_~i~0 28), 43694#(<= main_~i~0 29), 43695#(<= main_~i~0 30), 43696#(<= main_~i~0 31), 43697#(<= main_~i~0 32), 43698#(<= main_~i~0 33), 43699#(<= main_~i~0 34), 43700#(<= main_~i~0 35), 43701#(<= main_~i~0 36), 43702#(<= main_~i~0 37), 43703#(<= main_~i~0 38), 43704#(<= main_~i~0 39), 43705#(<= main_~i~0 40), 43706#(<= main_~i~0 41), 43707#(<= main_~i~0 42), 43708#(<= main_~i~0 43), 43709#(<= main_~i~0 44), 43710#(<= main_~i~0 45), 43711#(<= main_~i~0 46), 43712#(<= main_~i~0 47), 43713#(<= main_~i~0 48), 43714#(<= main_~i~0 49), 43715#(<= main_~i~0 50), 43716#(<= main_~i~0 51), 43717#(<= main_~i~0 52), 43718#(<= main_~i~0 53), 43719#(<= main_~i~0 54), 43720#(<= main_~i~0 55), 43721#(<= main_~i~0 56), 43722#(<= main_~i~0 57), 43723#(<= main_~i~0 58), 43724#(<= main_~i~0 59), 43725#(<= main_~i~0 60), 43726#(<= main_~i~0 61), 43727#(<= main_~i~0 62), 43728#(<= main_~i~0 63), 43729#(<= main_~i~0 64), 43730#(<= main_~i~0 65), 43731#(<= main_~i~0 66), 43732#(<= main_~i~0 67), 43733#(<= main_~i~0 68), 43734#(<= main_~i~0 69), 43735#(<= main_~i~0 70), 43736#(<= main_~i~0 71), 43737#(<= main_~i~0 72), 43738#(<= main_~i~0 73), 43739#(<= main_~i~0 74), 43740#(<= main_~i~0 75), 43741#(<= main_~i~0 76), 43742#(<= main_~i~0 77), 43743#(<= main_~i~0 78), 43744#(and (<= 0 main_~i~0) (<= main_~i~0 78)), 43745#(and (<= 1 main_~i~0) (<= main_~i~0 79))] [2018-04-10 14:38:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15563 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:32,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-10 14:38:32,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-10 14:38:32,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=3561, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 14:38:32,286 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 83 states. [2018-04-10 14:38:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:34,291 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-04-10 14:38:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-10 14:38:34,291 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-04-10 14:38:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:34,292 INFO L225 Difference]: With dead ends: 413 [2018-04-10 14:38:34,293 INFO L226 Difference]: Without dead ends: 413 [2018-04-10 14:38:34,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=9723, Invalid=16359, Unknown=0, NotChecked=0, Total=26082 [2018-04-10 14:38:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-10 14:38:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-10 14:38:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-10 14:38:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-04-10 14:38:34,296 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 402 [2018-04-10 14:38:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:34,296 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-04-10 14:38:34,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-10 14:38:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-04-10 14:38:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-04-10 14:38:34,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:34,298 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:34,298 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2096716838, now seen corresponding path program 80 times [2018-04-10 14:38:34,298 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:34,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:36,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:36,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-04-10 14:38:36,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:36,099 INFO L182 omatonBuilderFactory]: Interpolants [44800#(and (<= main_~i~0 67) (<= 3 main_~i~0)), 44801#(and (<= 4 main_~i~0) (<= main_~i~0 68)), 44802#(and (<= main_~i~0 69) (<= 5 main_~i~0)), 44803#(and (<= main_~i~0 70) (<= 6 main_~i~0)), 44804#(and (<= 7 main_~i~0) (<= main_~i~0 71)), 44805#(and (<= main_~i~0 72) (<= 8 main_~i~0)), 44806#(and (<= main_~i~0 73) (<= 9 main_~i~0)), 44807#(and (<= main_~i~0 74) (<= 10 main_~i~0)), 44808#(and (<= main_~i~0 75) (<= 11 main_~i~0)), 44809#(and (<= main_~i~0 76) (<= 12 main_~i~0)), 44810#(and (<= main_~i~0 77) (<= 13 main_~i~0)), 44811#(and (<= 14 main_~i~0) (<= main_~i~0 78)), 44812#(and (<= main_~i~0 79) (<= 15 main_~i~0)), 44813#(and (<= main_~i~0 80) (<= 16 main_~i~0)), 44730#true, 44731#false, 44732#(<= main_~i~0 0), 44733#(<= main_~i~0 1), 44734#(<= main_~i~0 2), 44735#(<= main_~i~0 3), 44736#(<= main_~i~0 4), 44737#(<= main_~i~0 5), 44738#(<= main_~i~0 6), 44739#(<= main_~i~0 7), 44740#(<= main_~i~0 8), 44741#(<= main_~i~0 9), 44742#(<= main_~i~0 10), 44743#(<= main_~i~0 11), 44744#(<= main_~i~0 12), 44745#(<= main_~i~0 13), 44746#(<= main_~i~0 14), 44747#(<= main_~i~0 15), 44748#(<= main_~i~0 16), 44749#(<= main_~i~0 17), 44750#(<= main_~i~0 18), 44751#(<= main_~i~0 19), 44752#(<= main_~i~0 20), 44753#(<= main_~i~0 21), 44754#(<= main_~i~0 22), 44755#(<= main_~i~0 23), 44756#(<= main_~i~0 24), 44757#(<= main_~i~0 25), 44758#(<= main_~i~0 26), 44759#(<= main_~i~0 27), 44760#(<= main_~i~0 28), 44761#(<= main_~i~0 29), 44762#(<= main_~i~0 30), 44763#(<= main_~i~0 31), 44764#(<= main_~i~0 32), 44765#(<= main_~i~0 33), 44766#(<= main_~i~0 34), 44767#(<= main_~i~0 35), 44768#(<= main_~i~0 36), 44769#(<= main_~i~0 37), 44770#(<= main_~i~0 38), 44771#(<= main_~i~0 39), 44772#(<= main_~i~0 40), 44773#(<= main_~i~0 41), 44774#(<= main_~i~0 42), 44775#(<= main_~i~0 43), 44776#(<= main_~i~0 44), 44777#(<= main_~i~0 45), 44778#(<= main_~i~0 46), 44779#(<= main_~i~0 47), 44780#(<= main_~i~0 48), 44781#(<= main_~i~0 49), 44782#(<= main_~i~0 50), 44783#(<= main_~i~0 51), 44784#(<= main_~i~0 52), 44785#(<= main_~i~0 53), 44786#(<= main_~i~0 54), 44787#(<= main_~i~0 55), 44788#(<= main_~i~0 56), 44789#(<= main_~i~0 57), 44790#(<= main_~i~0 58), 44791#(<= main_~i~0 59), 44792#(<= main_~i~0 60), 44793#(<= main_~i~0 61), 44794#(<= main_~i~0 62), 44795#(<= main_~i~0 63), 44796#(<= main_~i~0 64), 44797#(and (<= 0 main_~i~0) (<= main_~i~0 64)), 44798#(and (<= 1 main_~i~0) (<= main_~i~0 65)), 44799#(and (<= main_~i~0 66) (<= 2 main_~i~0))] [2018-04-10 14:38:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15960 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:36,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-10 14:38:36,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-10 14:38:36,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2246, Invalid=4726, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 14:38:36,101 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 84 states. [2018-04-10 14:38:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:40,513 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-04-10 14:38:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 14:38:40,514 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 407 [2018-04-10 14:38:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:40,515 INFO L225 Difference]: With dead ends: 418 [2018-04-10 14:38:40,515 INFO L226 Difference]: Without dead ends: 418 [2018-04-10 14:38:40,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4279 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7671, Invalid=19061, Unknown=0, NotChecked=0, Total=26732 [2018-04-10 14:38:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-10 14:38:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-04-10 14:38:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-10 14:38:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-04-10 14:38:40,518 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 407 [2018-04-10 14:38:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:40,518 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-04-10 14:38:40,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-10 14:38:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-04-10 14:38:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-10 14:38:40,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:40,520 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:40,520 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -125258601, now seen corresponding path program 81 times [2018-04-10 14:38:40,521 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:40,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:42,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:42,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-10 14:38:42,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:42,420 INFO L182 omatonBuilderFactory]: Interpolants [45824#(<= main_~i~0 12), 45825#(<= main_~i~0 13), 45826#(<= main_~i~0 14), 45827#(<= main_~i~0 15), 45828#(<= main_~i~0 16), 45829#(<= main_~i~0 17), 45830#(<= main_~i~0 18), 45831#(<= main_~i~0 19), 45832#(<= main_~i~0 20), 45833#(<= main_~i~0 21), 45834#(<= main_~i~0 22), 45835#(<= main_~i~0 23), 45836#(<= main_~i~0 24), 45837#(<= main_~i~0 25), 45838#(<= main_~i~0 26), 45839#(<= main_~i~0 27), 45840#(<= main_~i~0 28), 45841#(<= main_~i~0 29), 45842#(<= main_~i~0 30), 45843#(<= main_~i~0 31), 45844#(<= main_~i~0 32), 45845#(<= main_~i~0 33), 45846#(<= main_~i~0 34), 45847#(<= main_~i~0 35), 45848#(<= main_~i~0 36), 45849#(<= main_~i~0 37), 45850#(<= main_~i~0 38), 45851#(<= main_~i~0 39), 45852#(<= main_~i~0 40), 45853#(<= main_~i~0 41), 45854#(<= main_~i~0 42), 45855#(<= main_~i~0 43), 45856#(<= main_~i~0 44), 45857#(<= main_~i~0 45), 45858#(<= main_~i~0 46), 45859#(<= main_~i~0 47), 45860#(<= main_~i~0 48), 45861#(<= main_~i~0 49), 45862#(<= main_~i~0 50), 45863#(<= main_~i~0 51), 45864#(<= main_~i~0 52), 45865#(<= main_~i~0 53), 45866#(<= main_~i~0 54), 45867#(<= main_~i~0 55), 45868#(<= main_~i~0 56), 45869#(<= main_~i~0 57), 45870#(<= main_~i~0 58), 45871#(<= main_~i~0 59), 45872#(<= main_~i~0 60), 45873#(<= main_~i~0 61), 45874#(<= main_~i~0 62), 45875#(<= main_~i~0 63), 45876#(<= main_~i~0 64), 45877#(<= main_~i~0 65), 45878#(<= main_~i~0 66), 45879#(<= main_~i~0 67), 45880#(<= main_~i~0 68), 45881#(<= main_~i~0 69), 45882#(<= main_~i~0 70), 45883#(<= main_~i~0 71), 45884#(<= main_~i~0 72), 45885#(<= main_~i~0 73), 45886#(<= main_~i~0 74), 45887#(<= main_~i~0 75), 45888#(<= main_~i~0 76), 45889#(<= main_~i~0 77), 45890#(<= main_~i~0 78), 45891#(<= main_~i~0 79), 45892#(<= main_~i~0 80), 45893#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 45894#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 45810#true, 45811#false, 45812#(<= main_~i~0 0), 45813#(<= main_~i~0 1), 45814#(<= main_~i~0 2), 45815#(<= main_~i~0 3), 45816#(<= main_~i~0 4), 45817#(<= main_~i~0 5), 45818#(<= main_~i~0 6), 45819#(<= main_~i~0 7), 45820#(<= main_~i~0 8), 45821#(<= main_~i~0 9), 45822#(<= main_~i~0 10), 45823#(<= main_~i~0 11)] [2018-04-10 14:38:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16362 backedges. 0 proven. 16362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:42,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-10 14:38:42,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-10 14:38:42,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3408, Invalid=3732, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 14:38:42,421 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 85 states. [2018-04-10 14:38:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:44,520 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-04-10 14:38:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-10 14:38:44,520 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-04-10 14:38:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:44,521 INFO L225 Difference]: With dead ends: 423 [2018-04-10 14:38:44,521 INFO L226 Difference]: Without dead ends: 423 [2018-04-10 14:38:44,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=10212, Invalid=17178, Unknown=0, NotChecked=0, Total=27390 [2018-04-10 14:38:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-04-10 14:38:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-04-10 14:38:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-10 14:38:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-04-10 14:38:44,526 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 412 [2018-04-10 14:38:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:44,526 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-04-10 14:38:44,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-10 14:38:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-04-10 14:38:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-04-10 14:38:44,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:44,528 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:44,528 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1235483334, now seen corresponding path program 82 times [2018-04-10 14:38:44,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:44,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:46,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:46,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-10 14:38:46,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:46,514 INFO L182 omatonBuilderFactory]: Interpolants [46976#(<= main_~i~0 71), 46977#(<= main_~i~0 72), 46978#(<= main_~i~0 73), 46979#(<= main_~i~0 74), 46980#(<= main_~i~0 75), 46981#(<= main_~i~0 76), 46982#(<= main_~i~0 77), 46983#(<= main_~i~0 78), 46984#(<= main_~i~0 79), 46985#(<= main_~i~0 80), 46986#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 46987#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 46988#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 46903#true, 46904#false, 46905#(<= main_~i~0 0), 46906#(<= main_~i~0 1), 46907#(<= main_~i~0 2), 46908#(<= main_~i~0 3), 46909#(<= main_~i~0 4), 46910#(<= main_~i~0 5), 46911#(<= main_~i~0 6), 46912#(<= main_~i~0 7), 46913#(<= main_~i~0 8), 46914#(<= main_~i~0 9), 46915#(<= main_~i~0 10), 46916#(<= main_~i~0 11), 46917#(<= main_~i~0 12), 46918#(<= main_~i~0 13), 46919#(<= main_~i~0 14), 46920#(<= main_~i~0 15), 46921#(<= main_~i~0 16), 46922#(<= main_~i~0 17), 46923#(<= main_~i~0 18), 46924#(<= main_~i~0 19), 46925#(<= main_~i~0 20), 46926#(<= main_~i~0 21), 46927#(<= main_~i~0 22), 46928#(<= main_~i~0 23), 46929#(<= main_~i~0 24), 46930#(<= main_~i~0 25), 46931#(<= main_~i~0 26), 46932#(<= main_~i~0 27), 46933#(<= main_~i~0 28), 46934#(<= main_~i~0 29), 46935#(<= main_~i~0 30), 46936#(<= main_~i~0 31), 46937#(<= main_~i~0 32), 46938#(<= main_~i~0 33), 46939#(<= main_~i~0 34), 46940#(<= main_~i~0 35), 46941#(<= main_~i~0 36), 46942#(<= main_~i~0 37), 46943#(<= main_~i~0 38), 46944#(<= main_~i~0 39), 46945#(<= main_~i~0 40), 46946#(<= main_~i~0 41), 46947#(<= main_~i~0 42), 46948#(<= main_~i~0 43), 46949#(<= main_~i~0 44), 46950#(<= main_~i~0 45), 46951#(<= main_~i~0 46), 46952#(<= main_~i~0 47), 46953#(<= main_~i~0 48), 46954#(<= main_~i~0 49), 46955#(<= main_~i~0 50), 46956#(<= main_~i~0 51), 46957#(<= main_~i~0 52), 46958#(<= main_~i~0 53), 46959#(<= main_~i~0 54), 46960#(<= main_~i~0 55), 46961#(<= main_~i~0 56), 46962#(<= main_~i~0 57), 46963#(<= main_~i~0 58), 46964#(<= main_~i~0 59), 46965#(<= main_~i~0 60), 46966#(<= main_~i~0 61), 46967#(<= main_~i~0 62), 46968#(<= main_~i~0 63), 46969#(<= main_~i~0 64), 46970#(<= main_~i~0 65), 46971#(<= main_~i~0 66), 46972#(<= main_~i~0 67), 46973#(<= main_~i~0 68), 46974#(<= main_~i~0 69), 46975#(<= main_~i~0 70)] [2018-04-10 14:38:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16769 backedges. 0 proven. 16769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:46,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 14:38:46,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 14:38:46,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3410, Invalid=3900, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 14:38:46,516 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 86 states. [2018-04-10 14:38:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:48,788 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-04-10 14:38:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-10 14:38:48,789 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 417 [2018-04-10 14:38:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:48,790 INFO L225 Difference]: With dead ends: 428 [2018-04-10 14:38:48,790 INFO L226 Difference]: Without dead ends: 428 [2018-04-10 14:38:48,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=10297, Invalid=17759, Unknown=0, NotChecked=0, Total=28056 [2018-04-10 14:38:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-10 14:38:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-04-10 14:38:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-10 14:38:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-04-10 14:38:48,794 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 417 [2018-04-10 14:38:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:48,794 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-04-10 14:38:48,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 14:38:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-04-10 14:38:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-10 14:38:48,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:48,795 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:48,795 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash 886585847, now seen corresponding path program 83 times [2018-04-10 14:38:48,796 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:48,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:50,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:50,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-10 14:38:50,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:50,823 INFO L182 omatonBuilderFactory]: Interpolants [48009#true, 48010#false, 48011#(<= main_~i~0 0), 48012#(<= main_~i~0 1), 48013#(<= main_~i~0 2), 48014#(<= main_~i~0 3), 48015#(<= main_~i~0 4), 48016#(<= main_~i~0 5), 48017#(<= main_~i~0 6), 48018#(<= main_~i~0 7), 48019#(<= main_~i~0 8), 48020#(<= main_~i~0 9), 48021#(<= main_~i~0 10), 48022#(<= main_~i~0 11), 48023#(<= main_~i~0 12), 48024#(<= main_~i~0 13), 48025#(<= main_~i~0 14), 48026#(<= main_~i~0 15), 48027#(<= main_~i~0 16), 48028#(<= main_~i~0 17), 48029#(<= main_~i~0 18), 48030#(<= main_~i~0 19), 48031#(<= main_~i~0 20), 48032#(<= main_~i~0 21), 48033#(<= main_~i~0 22), 48034#(<= main_~i~0 23), 48035#(<= main_~i~0 24), 48036#(<= main_~i~0 25), 48037#(<= main_~i~0 26), 48038#(<= main_~i~0 27), 48039#(<= main_~i~0 28), 48040#(<= main_~i~0 29), 48041#(<= main_~i~0 30), 48042#(<= main_~i~0 31), 48043#(<= main_~i~0 32), 48044#(<= main_~i~0 33), 48045#(<= main_~i~0 34), 48046#(<= main_~i~0 35), 48047#(<= main_~i~0 36), 48048#(<= main_~i~0 37), 48049#(<= main_~i~0 38), 48050#(<= main_~i~0 39), 48051#(<= main_~i~0 40), 48052#(<= main_~i~0 41), 48053#(<= main_~i~0 42), 48054#(<= main_~i~0 43), 48055#(<= main_~i~0 44), 48056#(<= main_~i~0 45), 48057#(<= main_~i~0 46), 48058#(<= main_~i~0 47), 48059#(<= main_~i~0 48), 48060#(<= main_~i~0 49), 48061#(<= main_~i~0 50), 48062#(<= main_~i~0 51), 48063#(<= main_~i~0 52), 48064#(<= main_~i~0 53), 48065#(<= main_~i~0 54), 48066#(<= main_~i~0 55), 48067#(<= main_~i~0 56), 48068#(<= main_~i~0 57), 48069#(<= main_~i~0 58), 48070#(<= main_~i~0 59), 48071#(<= main_~i~0 60), 48072#(<= main_~i~0 61), 48073#(<= main_~i~0 62), 48074#(<= main_~i~0 63), 48075#(<= main_~i~0 64), 48076#(<= main_~i~0 65), 48077#(<= main_~i~0 66), 48078#(<= main_~i~0 67), 48079#(<= main_~i~0 68), 48080#(<= main_~i~0 69), 48081#(<= main_~i~0 70), 48082#(<= main_~i~0 71), 48083#(<= main_~i~0 72), 48084#(<= main_~i~0 73), 48085#(<= main_~i~0 74), 48086#(<= main_~i~0 75), 48087#(<= main_~i~0 76), 48088#(<= main_~i~0 77), 48089#(<= main_~i~0 78), 48090#(<= main_~i~0 79), 48091#(<= main_~i~0 80), 48092#(<= main_~i~0 81), 48093#(<= main_~i~0 82), 48094#(and (<= 0 main_~i~0) (<= main_~i~0 82)), 48095#(and (<= 1 main_~i~0) (<= main_~i~0 83))] [2018-04-10 14:38:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17181 backedges. 0 proven. 17181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:50,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-10 14:38:50,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-10 14:38:50,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3575, Invalid=3907, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 14:38:50,824 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 87 states. [2018-04-10 14:38:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:52,983 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-04-10 14:38:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-10 14:38:52,983 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-04-10 14:38:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:52,984 INFO L225 Difference]: With dead ends: 433 [2018-04-10 14:38:52,984 INFO L226 Difference]: Without dead ends: 433 [2018-04-10 14:38:52,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=10713, Invalid=18017, Unknown=0, NotChecked=0, Total=28730 [2018-04-10 14:38:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-10 14:38:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-10 14:38:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-10 14:38:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-04-10 14:38:52,988 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 422 [2018-04-10 14:38:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:52,988 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-04-10 14:38:52,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-10 14:38:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-04-10 14:38:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-10 14:38:52,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:52,989 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:52,989 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -15675034, now seen corresponding path program 84 times [2018-04-10 14:38:52,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:53,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:55,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:55,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-10 14:38:55,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:55,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-10 14:38:55,061 INFO L182 omatonBuilderFactory]: Interpolants [49152#(<= main_~i~0 22), 49153#(<= main_~i~0 23), 49154#(<= main_~i~0 24), 49155#(<= main_~i~0 25), 49156#(<= main_~i~0 26), 49157#(<= main_~i~0 27), 49158#(<= main_~i~0 28), 49159#(<= main_~i~0 29), 49160#(<= main_~i~0 30), 49161#(<= main_~i~0 31), 49162#(<= main_~i~0 32), 49163#(<= main_~i~0 33), 49164#(<= main_~i~0 34), 49165#(<= main_~i~0 35), 49166#(<= main_~i~0 36), 49167#(<= main_~i~0 37), 49168#(<= main_~i~0 38), 49169#(<= main_~i~0 39), 49170#(<= main_~i~0 40), 49171#(<= main_~i~0 41), 49172#(<= main_~i~0 42), 49173#(<= main_~i~0 43), 49174#(<= main_~i~0 44), 49175#(<= main_~i~0 45), 49176#(<= main_~i~0 46), 49177#(<= main_~i~0 47), 49178#(<= main_~i~0 48), 49179#(<= main_~i~0 49), 49180#(<= main_~i~0 50), 49181#(<= main_~i~0 51), 49182#(<= main_~i~0 52), 49183#(<= main_~i~0 53), 49184#(<= main_~i~0 54), 49185#(<= main_~i~0 55), 49186#(<= main_~i~0 56), 49187#(<= main_~i~0 57), 49188#(<= main_~i~0 58), 49189#(<= main_~i~0 59), 49190#(<= main_~i~0 60), 49191#(<= main_~i~0 61), 49192#(<= main_~i~0 62), 49193#(<= main_~i~0 63), 49194#(<= main_~i~0 64), 49195#(<= main_~i~0 65), 49196#(<= main_~i~0 66), 49197#(<= main_~i~0 67), 49198#(<= main_~i~0 68), 49199#(<= main_~i~0 69), 49200#(<= main_~i~0 70), 49201#(<= main_~i~0 71), 49202#(<= main_~i~0 72), 49203#(<= main_~i~0 73), 49204#(<= main_~i~0 74), 49205#(<= main_~i~0 75), 49206#(<= main_~i~0 76), 49207#(<= main_~i~0 77), 49208#(<= main_~i~0 78), 49209#(<= main_~i~0 79), 49210#(<= main_~i~0 80), 49211#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 49212#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 49213#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 49214#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 49215#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 49128#true, 49129#false, 49130#(<= main_~i~0 0), 49131#(<= main_~i~0 1), 49132#(<= main_~i~0 2), 49133#(<= main_~i~0 3), 49134#(<= main_~i~0 4), 49135#(<= main_~i~0 5), 49136#(<= main_~i~0 6), 49137#(<= main_~i~0 7), 49138#(<= main_~i~0 8), 49139#(<= main_~i~0 9), 49140#(<= main_~i~0 10), 49141#(<= main_~i~0 11), 49142#(<= main_~i~0 12), 49143#(<= main_~i~0 13), 49144#(<= main_~i~0 14), 49145#(<= main_~i~0 15), 49146#(<= main_~i~0 16), 49147#(<= main_~i~0 17), 49148#(<= main_~i~0 18), 49149#(<= main_~i~0 19), 49150#(<= main_~i~0 20), 49151#(<= main_~i~0 21)] [2018-04-10 14:38:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17598 backedges. 0 proven. 17598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:55,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-10 14:38:55,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-10 14:38:55,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3414, Invalid=4242, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 14:38:55,062 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 88 states. [2018-04-10 14:38:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:38:57,797 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-04-10 14:38:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-10 14:38:57,797 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 427 [2018-04-10 14:38:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:38:57,798 INFO L225 Difference]: With dead ends: 438 [2018-04-10 14:38:57,798 INFO L226 Difference]: Without dead ends: 438 [2018-04-10 14:38:57,799 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=10467, Invalid=18945, Unknown=0, NotChecked=0, Total=29412 [2018-04-10 14:38:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-04-10 14:38:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-04-10 14:38:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-10 14:38:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-04-10 14:38:57,802 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 427 [2018-04-10 14:38:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:38:57,802 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-04-10 14:38:57,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-10 14:38:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-04-10 14:38:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-04-10 14:38:57,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:38:57,803 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-04-10 14:38:57,803 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:38:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1091077975, now seen corresponding path program 85 times [2018-04-10 14:38:57,804 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:38:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:38:57,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:38:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:59,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:38:59,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-10 14:38:59,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:38:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:59,986 INFO L182 omatonBuilderFactory]: Interpolants [50304#(<= main_~i~0 42), 50305#(<= main_~i~0 43), 50306#(<= main_~i~0 44), 50307#(<= main_~i~0 45), 50308#(<= main_~i~0 46), 50309#(<= main_~i~0 47), 50310#(<= main_~i~0 48), 50311#(<= main_~i~0 49), 50312#(<= main_~i~0 50), 50313#(<= main_~i~0 51), 50314#(<= main_~i~0 52), 50315#(<= main_~i~0 53), 50316#(<= main_~i~0 54), 50317#(<= main_~i~0 55), 50318#(<= main_~i~0 56), 50319#(<= main_~i~0 57), 50320#(<= main_~i~0 58), 50321#(<= main_~i~0 59), 50322#(<= main_~i~0 60), 50323#(<= main_~i~0 61), 50324#(<= main_~i~0 62), 50325#(<= main_~i~0 63), 50326#(<= main_~i~0 64), 50327#(<= main_~i~0 65), 50328#(<= main_~i~0 66), 50329#(<= main_~i~0 67), 50330#(<= main_~i~0 68), 50331#(<= main_~i~0 69), 50332#(<= main_~i~0 70), 50333#(<= main_~i~0 71), 50334#(<= main_~i~0 72), 50335#(<= main_~i~0 73), 50336#(<= main_~i~0 74), 50337#(<= main_~i~0 75), 50338#(<= main_~i~0 76), 50339#(<= main_~i~0 77), 50340#(<= main_~i~0 78), 50341#(<= main_~i~0 79), 50342#(<= main_~i~0 80), 50343#(<= main_~i~0 81), 50344#(<= main_~i~0 82), 50345#(<= main_~i~0 83), 50346#(<= main_~i~0 84), 50347#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 50348#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 50260#true, 50261#false, 50262#(<= main_~i~0 0), 50263#(<= main_~i~0 1), 50264#(<= main_~i~0 2), 50265#(<= main_~i~0 3), 50266#(<= main_~i~0 4), 50267#(<= main_~i~0 5), 50268#(<= main_~i~0 6), 50269#(<= main_~i~0 7), 50270#(<= main_~i~0 8), 50271#(<= main_~i~0 9), 50272#(<= main_~i~0 10), 50273#(<= main_~i~0 11), 50274#(<= main_~i~0 12), 50275#(<= main_~i~0 13), 50276#(<= main_~i~0 14), 50277#(<= main_~i~0 15), 50278#(<= main_~i~0 16), 50279#(<= main_~i~0 17), 50280#(<= main_~i~0 18), 50281#(<= main_~i~0 19), 50282#(<= main_~i~0 20), 50283#(<= main_~i~0 21), 50284#(<= main_~i~0 22), 50285#(<= main_~i~0 23), 50286#(<= main_~i~0 24), 50287#(<= main_~i~0 25), 50288#(<= main_~i~0 26), 50289#(<= main_~i~0 27), 50290#(<= main_~i~0 28), 50291#(<= main_~i~0 29), 50292#(<= main_~i~0 30), 50293#(<= main_~i~0 31), 50294#(<= main_~i~0 32), 50295#(<= main_~i~0 33), 50296#(<= main_~i~0 34), 50297#(<= main_~i~0 35), 50298#(<= main_~i~0 36), 50299#(<= main_~i~0 37), 50300#(<= main_~i~0 38), 50301#(<= main_~i~0 39), 50302#(<= main_~i~0 40), 50303#(<= main_~i~0 41)] [2018-04-10 14:38:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18020 backedges. 0 proven. 18020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:38:59,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-10 14:38:59,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-10 14:38:59,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3746, Invalid=4086, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 14:38:59,987 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 89 states. [2018-04-10 14:39:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:02,403 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-04-10 14:39:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-10 14:39:02,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-04-10 14:39:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:02,405 INFO L225 Difference]: With dead ends: 443 [2018-04-10 14:39:02,405 INFO L226 Difference]: Without dead ends: 443 [2018-04-10 14:39:02,407 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11226, Invalid=18876, Unknown=0, NotChecked=0, Total=30102 [2018-04-10 14:39:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-10 14:39:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-04-10 14:39:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-04-10 14:39:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-04-10 14:39:02,410 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 432 [2018-04-10 14:39:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:02,411 INFO L459 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-04-10 14:39:02,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-10 14:39:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-04-10 14:39:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-10 14:39:02,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:02,412 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:02,412 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 433709062, now seen corresponding path program 86 times [2018-04-10 14:39:02,413 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:02,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:04,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:04,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-10 14:39:04,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:04,647 INFO L182 omatonBuilderFactory]: Interpolants [51456#(<= main_~i~0 49), 51457#(<= main_~i~0 50), 51458#(<= main_~i~0 51), 51459#(<= main_~i~0 52), 51460#(<= main_~i~0 53), 51461#(<= main_~i~0 54), 51462#(<= main_~i~0 55), 51463#(<= main_~i~0 56), 51464#(<= main_~i~0 57), 51465#(<= main_~i~0 58), 51466#(<= main_~i~0 59), 51467#(<= main_~i~0 60), 51468#(<= main_~i~0 61), 51469#(<= main_~i~0 62), 51470#(<= main_~i~0 63), 51471#(<= main_~i~0 64), 51472#(<= main_~i~0 65), 51473#(<= main_~i~0 66), 51474#(<= main_~i~0 67), 51475#(<= main_~i~0 68), 51476#(<= main_~i~0 69), 51477#(<= main_~i~0 70), 51478#(<= main_~i~0 71), 51479#(<= main_~i~0 72), 51480#(<= main_~i~0 73), 51481#(<= main_~i~0 74), 51482#(<= main_~i~0 75), 51483#(<= main_~i~0 76), 51484#(<= main_~i~0 77), 51485#(<= main_~i~0 78), 51486#(<= main_~i~0 79), 51487#(<= main_~i~0 80), 51488#(<= main_~i~0 81), 51489#(<= main_~i~0 82), 51490#(<= main_~i~0 83), 51491#(<= main_~i~0 84), 51492#(and (<= 0 main_~i~0) (<= main_~i~0 84)), 51493#(and (<= 1 main_~i~0) (<= main_~i~0 85)), 51494#(and (<= main_~i~0 86) (<= 2 main_~i~0)), 51405#true, 51406#false, 51407#(<= main_~i~0 0), 51408#(<= main_~i~0 1), 51409#(<= main_~i~0 2), 51410#(<= main_~i~0 3), 51411#(<= main_~i~0 4), 51412#(<= main_~i~0 5), 51413#(<= main_~i~0 6), 51414#(<= main_~i~0 7), 51415#(<= main_~i~0 8), 51416#(<= main_~i~0 9), 51417#(<= main_~i~0 10), 51418#(<= main_~i~0 11), 51419#(<= main_~i~0 12), 51420#(<= main_~i~0 13), 51421#(<= main_~i~0 14), 51422#(<= main_~i~0 15), 51423#(<= main_~i~0 16), 51424#(<= main_~i~0 17), 51425#(<= main_~i~0 18), 51426#(<= main_~i~0 19), 51427#(<= main_~i~0 20), 51428#(<= main_~i~0 21), 51429#(<= main_~i~0 22), 51430#(<= main_~i~0 23), 51431#(<= main_~i~0 24), 51432#(<= main_~i~0 25), 51433#(<= main_~i~0 26), 51434#(<= main_~i~0 27), 51435#(<= main_~i~0 28), 51436#(<= main_~i~0 29), 51437#(<= main_~i~0 30), 51438#(<= main_~i~0 31), 51439#(<= main_~i~0 32), 51440#(<= main_~i~0 33), 51441#(<= main_~i~0 34), 51442#(<= main_~i~0 35), 51443#(<= main_~i~0 36), 51444#(<= main_~i~0 37), 51445#(<= main_~i~0 38), 51446#(<= main_~i~0 39), 51447#(<= main_~i~0 40), 51448#(<= main_~i~0 41), 51449#(<= main_~i~0 42), 51450#(<= main_~i~0 43), 51451#(<= main_~i~0 44), 51452#(<= main_~i~0 45), 51453#(<= main_~i~0 46), 51454#(<= main_~i~0 47), 51455#(<= main_~i~0 48)] [2018-04-10 14:39:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18447 backedges. 0 proven. 18447 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-10 14:39:04,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-10 14:39:04,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3748, Invalid=4262, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 14:39:04,648 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 90 states. [2018-04-10 14:39:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:07,128 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-04-10 14:39:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-10 14:39:07,128 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 437 [2018-04-10 14:39:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:07,130 INFO L225 Difference]: With dead ends: 448 [2018-04-10 14:39:07,130 INFO L226 Difference]: Without dead ends: 448 [2018-04-10 14:39:07,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=11315, Invalid=19485, Unknown=0, NotChecked=0, Total=30800 [2018-04-10 14:39:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-10 14:39:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2018-04-10 14:39:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-10 14:39:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 448 transitions. [2018-04-10 14:39:07,133 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 448 transitions. Word has length 437 [2018-04-10 14:39:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:07,134 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 448 transitions. [2018-04-10 14:39:07,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-10 14:39:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 448 transitions. [2018-04-10 14:39:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-04-10 14:39:07,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:07,135 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:07,135 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1891605687, now seen corresponding path program 87 times [2018-04-10 14:39:07,136 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:07,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:09,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:09,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-10 14:39:09,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:09,353 INFO L182 omatonBuilderFactory]: Interpolants [52608#(<= main_~i~0 43), 52609#(<= main_~i~0 44), 52610#(<= main_~i~0 45), 52611#(<= main_~i~0 46), 52612#(<= main_~i~0 47), 52613#(<= main_~i~0 48), 52614#(<= main_~i~0 49), 52615#(<= main_~i~0 50), 52616#(<= main_~i~0 51), 52617#(<= main_~i~0 52), 52618#(<= main_~i~0 53), 52619#(<= main_~i~0 54), 52620#(<= main_~i~0 55), 52621#(<= main_~i~0 56), 52622#(<= main_~i~0 57), 52623#(<= main_~i~0 58), 52624#(<= main_~i~0 59), 52625#(<= main_~i~0 60), 52626#(<= main_~i~0 61), 52627#(<= main_~i~0 62), 52628#(<= main_~i~0 63), 52629#(<= main_~i~0 64), 52630#(<= main_~i~0 65), 52631#(<= main_~i~0 66), 52632#(<= main_~i~0 67), 52633#(<= main_~i~0 68), 52634#(<= main_~i~0 69), 52635#(<= main_~i~0 70), 52636#(<= main_~i~0 71), 52637#(<= main_~i~0 72), 52638#(<= main_~i~0 73), 52639#(<= main_~i~0 74), 52640#(<= main_~i~0 75), 52641#(<= main_~i~0 76), 52642#(<= main_~i~0 77), 52643#(<= main_~i~0 78), 52644#(<= main_~i~0 79), 52645#(<= main_~i~0 80), 52646#(<= main_~i~0 81), 52647#(<= main_~i~0 82), 52648#(<= main_~i~0 83), 52649#(<= main_~i~0 84), 52650#(<= main_~i~0 85), 52651#(<= main_~i~0 86), 52652#(and (<= main_~i~0 86) (<= 0 main_~i~0)), 52653#(and (<= 1 main_~i~0) (<= main_~i~0 87)), 52563#true, 52564#false, 52565#(<= main_~i~0 0), 52566#(<= main_~i~0 1), 52567#(<= main_~i~0 2), 52568#(<= main_~i~0 3), 52569#(<= main_~i~0 4), 52570#(<= main_~i~0 5), 52571#(<= main_~i~0 6), 52572#(<= main_~i~0 7), 52573#(<= main_~i~0 8), 52574#(<= main_~i~0 9), 52575#(<= main_~i~0 10), 52576#(<= main_~i~0 11), 52577#(<= main_~i~0 12), 52578#(<= main_~i~0 13), 52579#(<= main_~i~0 14), 52580#(<= main_~i~0 15), 52581#(<= main_~i~0 16), 52582#(<= main_~i~0 17), 52583#(<= main_~i~0 18), 52584#(<= main_~i~0 19), 52585#(<= main_~i~0 20), 52586#(<= main_~i~0 21), 52587#(<= main_~i~0 22), 52588#(<= main_~i~0 23), 52589#(<= main_~i~0 24), 52590#(<= main_~i~0 25), 52591#(<= main_~i~0 26), 52592#(<= main_~i~0 27), 52593#(<= main_~i~0 28), 52594#(<= main_~i~0 29), 52595#(<= main_~i~0 30), 52596#(<= main_~i~0 31), 52597#(<= main_~i~0 32), 52598#(<= main_~i~0 33), 52599#(<= main_~i~0 34), 52600#(<= main_~i~0 35), 52601#(<= main_~i~0 36), 52602#(<= main_~i~0 37), 52603#(<= main_~i~0 38), 52604#(<= main_~i~0 39), 52605#(<= main_~i~0 40), 52606#(<= main_~i~0 41), 52607#(<= main_~i~0 42)] [2018-04-10 14:39:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18879 backedges. 0 proven. 18879 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:09,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-10 14:39:09,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-10 14:39:09,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=4269, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 14:39:09,355 INFO L87 Difference]: Start difference. First operand 448 states and 448 transitions. Second operand 91 states. [2018-04-10 14:39:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:11,713 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-04-10 14:39:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-10 14:39:11,713 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-04-10 14:39:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:11,715 INFO L225 Difference]: With dead ends: 453 [2018-04-10 14:39:11,715 INFO L226 Difference]: Without dead ends: 453 [2018-04-10 14:39:11,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11751, Invalid=19755, Unknown=0, NotChecked=0, Total=31506 [2018-04-10 14:39:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-04-10 14:39:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-04-10 14:39:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-10 14:39:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2018-04-10 14:39:11,719 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 442 [2018-04-10 14:39:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:11,719 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 453 transitions. [2018-04-10 14:39:11,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-10 14:39:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 453 transitions. [2018-04-10 14:39:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-04-10 14:39:11,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:11,720 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:11,720 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1642518874, now seen corresponding path program 88 times [2018-04-10 14:39:11,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:11,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:13,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:13,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-10 14:39:13,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:13,969 INFO L182 omatonBuilderFactory]: Interpolants [53760#(<= main_~i~0 24), 53761#(<= main_~i~0 25), 53762#(<= main_~i~0 26), 53763#(<= main_~i~0 27), 53764#(<= main_~i~0 28), 53765#(<= main_~i~0 29), 53766#(<= main_~i~0 30), 53767#(<= main_~i~0 31), 53768#(<= main_~i~0 32), 53769#(<= main_~i~0 33), 53770#(<= main_~i~0 34), 53771#(<= main_~i~0 35), 53772#(<= main_~i~0 36), 53773#(<= main_~i~0 37), 53774#(<= main_~i~0 38), 53775#(<= main_~i~0 39), 53776#(<= main_~i~0 40), 53777#(<= main_~i~0 41), 53778#(<= main_~i~0 42), 53779#(<= main_~i~0 43), 53780#(<= main_~i~0 44), 53781#(<= main_~i~0 45), 53782#(<= main_~i~0 46), 53783#(<= main_~i~0 47), 53784#(<= main_~i~0 48), 53785#(<= main_~i~0 49), 53786#(<= main_~i~0 50), 53787#(<= main_~i~0 51), 53788#(<= main_~i~0 52), 53789#(<= main_~i~0 53), 53790#(<= main_~i~0 54), 53791#(<= main_~i~0 55), 53792#(<= main_~i~0 56), 53793#(<= main_~i~0 57), 53794#(<= main_~i~0 58), 53795#(<= main_~i~0 59), 53796#(<= main_~i~0 60), 53797#(<= main_~i~0 61), 53798#(<= main_~i~0 62), 53799#(<= main_~i~0 63), 53800#(<= main_~i~0 64), 53801#(<= main_~i~0 65), 53802#(<= main_~i~0 66), 53803#(<= main_~i~0 67), 53804#(<= main_~i~0 68), 53805#(<= main_~i~0 69), 53806#(<= main_~i~0 70), 53807#(<= main_~i~0 71), 53808#(<= main_~i~0 72), 53809#(<= main_~i~0 73), 53810#(<= main_~i~0 74), 53811#(<= main_~i~0 75), 53812#(<= main_~i~0 76), 53813#(<= main_~i~0 77), 53814#(<= main_~i~0 78), 53815#(<= main_~i~0 79), 53816#(<= main_~i~0 80), 53817#(and (<= 0 main_~i~0) (<= main_~i~0 80)), 53818#(and (<= 1 main_~i~0) (<= main_~i~0 81)), 53819#(and (<= 2 main_~i~0) (<= main_~i~0 82)), 53820#(and (<= main_~i~0 83) (<= 3 main_~i~0)), 53821#(and (<= main_~i~0 84) (<= 4 main_~i~0)), 53822#(and (<= 5 main_~i~0) (<= main_~i~0 85)), 53823#(and (<= main_~i~0 86) (<= 6 main_~i~0)), 53824#(and (<= 7 main_~i~0) (<= main_~i~0 87)), 53825#(and (<= 8 main_~i~0) (<= main_~i~0 88)), 53734#true, 53735#false, 53736#(<= main_~i~0 0), 53737#(<= main_~i~0 1), 53738#(<= main_~i~0 2), 53739#(<= main_~i~0 3), 53740#(<= main_~i~0 4), 53741#(<= main_~i~0 5), 53742#(<= main_~i~0 6), 53743#(<= main_~i~0 7), 53744#(<= main_~i~0 8), 53745#(<= main_~i~0 9), 53746#(<= main_~i~0 10), 53747#(<= main_~i~0 11), 53748#(<= main_~i~0 12), 53749#(<= main_~i~0 13), 53750#(<= main_~i~0 14), 53751#(<= main_~i~0 15), 53752#(<= main_~i~0 16), 53753#(<= main_~i~0 17), 53754#(<= main_~i~0 18), 53755#(<= main_~i~0 19), 53756#(<= main_~i~0 20), 53757#(<= main_~i~0 21), 53758#(<= main_~i~0 22), 53759#(<= main_~i~0 23)] [2018-04-10 14:39:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19316 backedges. 0 proven. 19316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:13,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-10 14:39:13,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-10 14:39:13,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3422, Invalid=4950, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 14:39:13,971 INFO L87 Difference]: Start difference. First operand 453 states and 453 transitions. Second operand 92 states. [2018-04-10 14:39:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:17,705 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-04-10 14:39:17,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-10 14:39:17,705 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 447 [2018-04-10 14:39:17,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:17,706 INFO L225 Difference]: With dead ends: 458 [2018-04-10 14:39:17,706 INFO L226 Difference]: Without dead ends: 458 [2018-04-10 14:39:17,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=10807, Invalid=21413, Unknown=0, NotChecked=0, Total=32220 [2018-04-10 14:39:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-10 14:39:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2018-04-10 14:39:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-10 14:39:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-04-10 14:39:17,710 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 447 [2018-04-10 14:39:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:17,710 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-04-10 14:39:17,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-10 14:39:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-04-10 14:39:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-10 14:39:17,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:17,711 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:17,711 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1076066839, now seen corresponding path program 89 times [2018-04-10 14:39:17,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:17,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:20,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:20,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-10 14:39:20,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:20,068 INFO L182 omatonBuilderFactory]: Interpolants [54918#true, 54919#false, 54920#(<= main_~i~0 0), 54921#(<= main_~i~0 1), 54922#(<= main_~i~0 2), 54923#(<= main_~i~0 3), 54924#(<= main_~i~0 4), 54925#(<= main_~i~0 5), 54926#(<= main_~i~0 6), 54927#(<= main_~i~0 7), 54928#(<= main_~i~0 8), 54929#(<= main_~i~0 9), 54930#(<= main_~i~0 10), 54931#(<= main_~i~0 11), 54932#(<= main_~i~0 12), 54933#(<= main_~i~0 13), 54934#(<= main_~i~0 14), 54935#(<= main_~i~0 15), 54936#(<= main_~i~0 16), 54937#(<= main_~i~0 17), 54938#(<= main_~i~0 18), 54939#(<= main_~i~0 19), 54940#(<= main_~i~0 20), 54941#(<= main_~i~0 21), 54942#(<= main_~i~0 22), 54943#(<= main_~i~0 23), 54944#(<= main_~i~0 24), 54945#(<= main_~i~0 25), 54946#(<= main_~i~0 26), 54947#(<= main_~i~0 27), 54948#(<= main_~i~0 28), 54949#(<= main_~i~0 29), 54950#(<= main_~i~0 30), 54951#(<= main_~i~0 31), 54952#(<= main_~i~0 32), 54953#(<= main_~i~0 33), 54954#(<= main_~i~0 34), 54955#(<= main_~i~0 35), 54956#(<= main_~i~0 36), 54957#(<= main_~i~0 37), 54958#(<= main_~i~0 38), 54959#(<= main_~i~0 39), 54960#(<= main_~i~0 40), 54961#(<= main_~i~0 41), 54962#(<= main_~i~0 42), 54963#(<= main_~i~0 43), 54964#(<= main_~i~0 44), 54965#(<= main_~i~0 45), 54966#(<= main_~i~0 46), 54967#(<= main_~i~0 47), 54968#(<= main_~i~0 48), 54969#(<= main_~i~0 49), 54970#(<= main_~i~0 50), 54971#(<= main_~i~0 51), 54972#(<= main_~i~0 52), 54973#(<= main_~i~0 53), 54974#(<= main_~i~0 54), 54975#(<= main_~i~0 55), 54976#(<= main_~i~0 56), 54977#(<= main_~i~0 57), 54978#(<= main_~i~0 58), 54979#(<= main_~i~0 59), 54980#(<= main_~i~0 60), 54981#(<= main_~i~0 61), 54982#(<= main_~i~0 62), 54983#(<= main_~i~0 63), 54984#(<= main_~i~0 64), 54985#(<= main_~i~0 65), 54986#(<= main_~i~0 66), 54987#(<= main_~i~0 67), 54988#(<= main_~i~0 68), 54989#(<= main_~i~0 69), 54990#(<= main_~i~0 70), 54991#(<= main_~i~0 71), 54992#(<= main_~i~0 72), 54993#(<= main_~i~0 73), 54994#(<= main_~i~0 74), 54995#(<= main_~i~0 75), 54996#(<= main_~i~0 76), 54997#(<= main_~i~0 77), 54998#(<= main_~i~0 78), 54999#(<= main_~i~0 79), 55000#(<= main_~i~0 80), 55001#(<= main_~i~0 81), 55002#(<= main_~i~0 82), 55003#(<= main_~i~0 83), 55004#(<= main_~i~0 84), 55005#(<= main_~i~0 85), 55006#(<= main_~i~0 86), 55007#(<= main_~i~0 87), 55008#(<= main_~i~0 88), 55009#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 55010#(and (<= 1 main_~i~0) (<= main_~i~0 89))] [2018-04-10 14:39:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 19758 backedges. 0 proven. 19758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:20,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-10 14:39:20,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-10 14:39:20,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4100, Invalid=4456, Unknown=0, NotChecked=0, Total=8556 [2018-04-10 14:39:20,070 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 93 states. [2018-04-10 14:39:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:22,590 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-04-10 14:39:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-10 14:39:22,591 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-04-10 14:39:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:22,592 INFO L225 Difference]: With dead ends: 463 [2018-04-10 14:39:22,592 INFO L226 Difference]: Without dead ends: 463 [2018-04-10 14:39:22,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=12288, Invalid=20654, Unknown=0, NotChecked=0, Total=32942 [2018-04-10 14:39:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-10 14:39:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-04-10 14:39:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-10 14:39:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-04-10 14:39:22,596 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 452 [2018-04-10 14:39:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:22,596 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-04-10 14:39:22,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-10 14:39:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-04-10 14:39:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-10 14:39:22,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:22,597 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:22,597 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1217878714, now seen corresponding path program 90 times [2018-04-10 14:39:22,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:22,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:25,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:25,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-10 14:39:25,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:25,021 INFO L182 omatonBuilderFactory]: Interpolants [56192#(<= main_~i~0 75), 56193#(<= main_~i~0 76), 56194#(<= main_~i~0 77), 56195#(<= main_~i~0 78), 56196#(<= main_~i~0 79), 56197#(<= main_~i~0 80), 56198#(<= main_~i~0 81), 56199#(<= main_~i~0 82), 56200#(<= main_~i~0 83), 56201#(<= main_~i~0 84), 56202#(<= main_~i~0 85), 56203#(<= main_~i~0 86), 56204#(<= main_~i~0 87), 56205#(<= main_~i~0 88), 56206#(and (<= 0 main_~i~0) (<= main_~i~0 88)), 56207#(and (<= 1 main_~i~0) (<= main_~i~0 89)), 56208#(and (<= 2 main_~i~0) (<= main_~i~0 90)), 56115#true, 56116#false, 56117#(<= main_~i~0 0), 56118#(<= main_~i~0 1), 56119#(<= main_~i~0 2), 56120#(<= main_~i~0 3), 56121#(<= main_~i~0 4), 56122#(<= main_~i~0 5), 56123#(<= main_~i~0 6), 56124#(<= main_~i~0 7), 56125#(<= main_~i~0 8), 56126#(<= main_~i~0 9), 56127#(<= main_~i~0 10), 56128#(<= main_~i~0 11), 56129#(<= main_~i~0 12), 56130#(<= main_~i~0 13), 56131#(<= main_~i~0 14), 56132#(<= main_~i~0 15), 56133#(<= main_~i~0 16), 56134#(<= main_~i~0 17), 56135#(<= main_~i~0 18), 56136#(<= main_~i~0 19), 56137#(<= main_~i~0 20), 56138#(<= main_~i~0 21), 56139#(<= main_~i~0 22), 56140#(<= main_~i~0 23), 56141#(<= main_~i~0 24), 56142#(<= main_~i~0 25), 56143#(<= main_~i~0 26), 56144#(<= main_~i~0 27), 56145#(<= main_~i~0 28), 56146#(<= main_~i~0 29), 56147#(<= main_~i~0 30), 56148#(<= main_~i~0 31), 56149#(<= main_~i~0 32), 56150#(<= main_~i~0 33), 56151#(<= main_~i~0 34), 56152#(<= main_~i~0 35), 56153#(<= main_~i~0 36), 56154#(<= main_~i~0 37), 56155#(<= main_~i~0 38), 56156#(<= main_~i~0 39), 56157#(<= main_~i~0 40), 56158#(<= main_~i~0 41), 56159#(<= main_~i~0 42), 56160#(<= main_~i~0 43), 56161#(<= main_~i~0 44), 56162#(<= main_~i~0 45), 56163#(<= main_~i~0 46), 56164#(<= main_~i~0 47), 56165#(<= main_~i~0 48), 56166#(<= main_~i~0 49), 56167#(<= main_~i~0 50), 56168#(<= main_~i~0 51), 56169#(<= main_~i~0 52), 56170#(<= main_~i~0 53), 56171#(<= main_~i~0 54), 56172#(<= main_~i~0 55), 56173#(<= main_~i~0 56), 56174#(<= main_~i~0 57), 56175#(<= main_~i~0 58), 56176#(<= main_~i~0 59), 56177#(<= main_~i~0 60), 56178#(<= main_~i~0 61), 56179#(<= main_~i~0 62), 56180#(<= main_~i~0 63), 56181#(<= main_~i~0 64), 56182#(<= main_~i~0 65), 56183#(<= main_~i~0 66), 56184#(<= main_~i~0 67), 56185#(<= main_~i~0 68), 56186#(<= main_~i~0 69), 56187#(<= main_~i~0 70), 56188#(<= main_~i~0 71), 56189#(<= main_~i~0 72), 56190#(<= main_~i~0 73), 56191#(<= main_~i~0 74)] [2018-04-10 14:39:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20205 backedges. 0 proven. 20205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:25,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-10 14:39:25,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-10 14:39:25,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4102, Invalid=4640, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 14:39:25,022 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 94 states. [2018-04-10 14:39:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:39:27,667 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-04-10 14:39:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-10 14:39:27,667 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 457 [2018-04-10 14:39:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:39:27,668 INFO L225 Difference]: With dead ends: 468 [2018-04-10 14:39:27,668 INFO L226 Difference]: Without dead ends: 468 [2018-04-10 14:39:27,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=12381, Invalid=21291, Unknown=0, NotChecked=0, Total=33672 [2018-04-10 14:39:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-04-10 14:39:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-04-10 14:39:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-10 14:39:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 468 transitions. [2018-04-10 14:39:27,673 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 468 transitions. Word has length 457 [2018-04-10 14:39:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:39:27,673 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 468 transitions. [2018-04-10 14:39:27,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-10 14:39:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 468 transitions. [2018-04-10 14:39:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-04-10 14:39:27,674 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:39:27,674 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-04-10 14:39:27,675 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 14:39:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1277550729, now seen corresponding path program 91 times [2018-04-10 14:39:27,675 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 14:39:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:39:27,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:39:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:30,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:39:30,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-10 14:39:30,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 14:39:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:30,186 INFO L182 omatonBuilderFactory]: Interpolants [57344#(<= main_~i~0 17), 57345#(<= main_~i~0 18), 57346#(<= main_~i~0 19), 57347#(<= main_~i~0 20), 57348#(<= main_~i~0 21), 57349#(<= main_~i~0 22), 57350#(<= main_~i~0 23), 57351#(<= main_~i~0 24), 57352#(<= main_~i~0 25), 57353#(<= main_~i~0 26), 57354#(<= main_~i~0 27), 57355#(<= main_~i~0 28), 57356#(<= main_~i~0 29), 57357#(<= main_~i~0 30), 57358#(<= main_~i~0 31), 57359#(<= main_~i~0 32), 57360#(<= main_~i~0 33), 57361#(<= main_~i~0 34), 57362#(<= main_~i~0 35), 57363#(<= main_~i~0 36), 57364#(<= main_~i~0 37), 57365#(<= main_~i~0 38), 57366#(<= main_~i~0 39), 57367#(<= main_~i~0 40), 57368#(<= main_~i~0 41), 57369#(<= main_~i~0 42), 57370#(<= main_~i~0 43), 57371#(<= main_~i~0 44), 57372#(<= main_~i~0 45), 57373#(<= main_~i~0 46), 57374#(<= main_~i~0 47), 57375#(<= main_~i~0 48), 57376#(<= main_~i~0 49), 57377#(<= main_~i~0 50), 57378#(<= main_~i~0 51), 57379#(<= main_~i~0 52), 57380#(<= main_~i~0 53), 57381#(<= main_~i~0 54), 57382#(<= main_~i~0 55), 57383#(<= main_~i~0 56), 57384#(<= main_~i~0 57), 57385#(<= main_~i~0 58), 57386#(<= main_~i~0 59), 57387#(<= main_~i~0 60), 57388#(<= main_~i~0 61), 57389#(<= main_~i~0 62), 57390#(<= main_~i~0 63), 57391#(<= main_~i~0 64), 57392#(<= main_~i~0 65), 57393#(<= main_~i~0 66), 57394#(<= main_~i~0 67), 57395#(<= main_~i~0 68), 57396#(<= main_~i~0 69), 57397#(<= main_~i~0 70), 57398#(<= main_~i~0 71), 57399#(<= main_~i~0 72), 57400#(<= main_~i~0 73), 57401#(<= main_~i~0 74), 57402#(<= main_~i~0 75), 57403#(<= main_~i~0 76), 57404#(<= main_~i~0 77), 57405#(<= main_~i~0 78), 57406#(<= main_~i~0 79), 57407#(<= main_~i~0 80), 57408#(<= main_~i~0 81), 57409#(<= main_~i~0 82), 57410#(<= main_~i~0 83), 57411#(<= main_~i~0 84), 57412#(<= main_~i~0 85), 57413#(<= main_~i~0 86), 57414#(<= main_~i~0 87), 57415#(<= main_~i~0 88), 57416#(<= main_~i~0 89), 57417#(<= main_~i~0 90), 57418#(and (<= 0 main_~i~0) (<= main_~i~0 90)), 57419#(and (<= main_~i~0 91) (<= 1 main_~i~0)), 57325#true, 57326#false, 57327#(<= main_~i~0 0), 57328#(<= main_~i~0 1), 57329#(<= main_~i~0 2), 57330#(<= main_~i~0 3), 57331#(<= main_~i~0 4), 57332#(<= main_~i~0 5), 57333#(<= main_~i~0 6), 57334#(<= main_~i~0 7), 57335#(<= main_~i~0 8), 57336#(<= main_~i~0 9), 57337#(<= main_~i~0 10), 57338#(<= main_~i~0 11), 57339#(<= main_~i~0 12), 57340#(<= main_~i~0 13), 57341#(<= main_~i~0 14), 57342#(<= main_~i~0 15), 57343#(<= main_~i~0 16)] [2018-04-10 14:39:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20657 backedges. 0 proven. 20657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:39:30,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-10 14:39:30,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-10 14:39:30,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4283, Invalid=4647, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 14:39:30,188 INFO L87 Difference]: Start difference. First operand 468 states and 468 transitions. Second operand 95 states. Received shutdown request... [2018-04-10 14:39:30,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:39:30,604 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:39:30,606 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:39:30,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:39:30 BoogieIcfgContainer [2018-04-10 14:39:30,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:39:30,608 INFO L168 Benchmark]: Toolchain (without parser) took 184762.11 ms. Allocated memory was 391.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 334.8 MB in the beginning and 786.7 MB in the end (delta: -451.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-10 14:39:30,609 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 391.6 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:39:30,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.61 ms. Allocated memory is still 391.6 MB. Free memory was 334.8 MB in the beginning and 325.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:39:30,609 INFO L168 Benchmark]: Boogie Preprocessor took 19.68 ms. Allocated memory is still 391.6 MB. Free memory was 325.4 MB in the beginning and 324.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-04-10 14:39:30,610 INFO L168 Benchmark]: RCFGBuilder took 197.14 ms. Allocated memory was 391.6 MB in the beginning and 586.7 MB in the end (delta: 195.0 MB). Free memory was 324.0 MB in the beginning and 553.3 MB in the end (delta: -229.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-10 14:39:30,610 INFO L168 Benchmark]: TraceAbstraction took 184365.10 ms. Allocated memory was 586.7 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 553.3 MB in the beginning and 786.7 MB in the end (delta: -233.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-04-10 14:39:30,611 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.11 ms. Allocated memory is still 391.6 MB. Free memory is still 354.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.61 ms. Allocated memory is still 391.6 MB. Free memory was 334.8 MB in the beginning and 325.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.68 ms. Allocated memory is still 391.6 MB. Free memory was 325.4 MB in the beginning and 324.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 197.14 ms. Allocated memory was 391.6 MB in the beginning and 586.7 MB in the end (delta: 195.0 MB). Free memory was 324.0 MB in the beginning and 553.3 MB in the end (delta: -229.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 184365.10 ms. Allocated memory was 586.7 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 553.3 MB in the beginning and 786.7 MB in the end (delta: -233.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 30 states, 95 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 30 states, 95 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 30 states, 95 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 30 states, 95 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (468states) and interpolant automaton (currently 30 states, 95 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 184.3s OverallTime, 96 OverallIterations, 92 TraceHistogramMax, 103.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1332 SDtfs, 27353 SDslu, 24304 SDs, 0 SdLazy, 54879 SolverSat, 4213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8474 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 8375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132709 ImplicationChecksByTransitivity, 136.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 14/636295 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 95 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 75.7s InterpolantComputationTime, 21662 NumberOfCodeBlocks, 21662 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 21566 ConstructedInterpolants, 0 QuantifiedInterpolants, 21382146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 96 InterpolantComputations, 2 PerfectInterpolantSequences, 14/636295 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-39-30-617.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-39-30-617.csv Completed graceful shutdown