java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 13:45:24,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 13:45:24,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 13:45:24,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 13:45:24,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 13:45:24,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 13:45:24,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 13:45:24,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 13:45:24,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 13:45:24,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 13:45:24,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 13:45:24,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 13:45:24,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 13:45:24,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 13:45:24,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 13:45:24,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 13:45:24,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 13:45:24,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 13:45:24,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 13:45:24,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 13:45:24,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 13:45:24,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 13:45:24,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 13:45:24,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 13:45:24,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 13:45:24,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 13:45:24,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 13:45:24,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 13:45:24,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 13:45:24,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 13:45:24,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 13:45:24,812 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_NoArray.epf [2018-04-13 13:45:24,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 13:45:24,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 13:45:24,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 13:45:24,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 13:45:24,822 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 13:45:24,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 13:45:24,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 13:45:24,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 13:45:24,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 13:45:24,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 13:45:24,825 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 13:45:24,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 13:45:24,858 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 13:45:24,861 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 13:45:24,862 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 13:45:24,862 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 13:45:24,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-04-13 13:45:25,156 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG071b4f404 [2018-04-13 13:45:25,244 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 13:45:25,245 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 13:45:25,245 INFO L168 CDTParser]: Scanning array3_false-valid-deref.i [2018-04-13 13:45:25,246 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 13:45:25,246 INFO L215 ultiparseSymbolTable]: [2018-04-13 13:45:25,246 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 13:45:25,246 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in array3_false-valid-deref.i [2018-04-13 13:45:25,246 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in array3_false-valid-deref.i [2018-04-13 13:45:25,246 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 13:45:25,246 INFO L233 ultiparseSymbolTable]: [2018-04-13 13:45:25,257 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG071b4f404 [2018-04-13 13:45:25,260 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 13:45:25,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 13:45:25,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 13:45:25,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 13:45:25,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 13:45:25,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1fc6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25, skipping insertion in model container [2018-04-13 13:45:25,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,279 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 13:45:25,288 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 13:45:25,380 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 13:45:25,391 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 13:45:25,394 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 6 non ball SCCs. Number of states in SCCs 6. [2018-04-13 13:45:25,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25 WrapperNode [2018-04-13 13:45:25,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 13:45:25,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 13:45:25,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 13:45:25,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 13:45:25,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... [2018-04-13 13:45:25,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 13:45:25,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 13:45:25,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 13:45:25,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 13:45:25,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 13:45:25,453 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 13:45:25,454 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 13:45:25,454 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-13 13:45:25,454 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 13:45:25,454 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 13:45:25,632 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 13:45:25,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:45:25 BoogieIcfgContainer [2018-04-13 13:45:25,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 13:45:25,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 13:45:25,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 13:45:25,635 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 13:45:25,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 01:45:25" (1/3) ... [2018-04-13 13:45:25,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9c8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:45:25, skipping insertion in model container [2018-04-13 13:45:25,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 01:45:25" (2/3) ... [2018-04-13 13:45:25,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9c8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 01:45:25, skipping insertion in model container [2018-04-13 13:45:25,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 01:45:25" (3/3) ... [2018-04-13 13:45:25,638 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-04-13 13:45:25,643 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 13:45:25,648 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-04-13 13:45:25,669 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 13:45:25,670 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 13:45:25,670 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 13:45:25,670 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 13:45:25,670 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 13:45:25,670 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 13:45:25,670 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 13:45:25,670 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 13:45:25,671 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 13:45:25,671 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 13:45:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-04-13 13:45:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 13:45:25,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:25,689 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:25,689 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1214141712, now seen corresponding path program 1 times [2018-04-13 13:45:25,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:25,695 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:25,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:25,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:25,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:25,753 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 13:45:25,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 13:45:25,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 13:45:25,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 13:45:25,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 13:45:25,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 13:45:25,817 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-04-13 13:45:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:25,892 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 13:45:25,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 13:45:25,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 13:45:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:25,901 INFO L225 Difference]: With dead ends: 44 [2018-04-13 13:45:25,901 INFO L226 Difference]: Without dead ends: 31 [2018-04-13 13:45:25,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 13:45:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-13 13:45:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-13 13:45:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-13 13:45:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-13 13:45:25,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-04-13 13:45:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:25,929 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-13 13:45:25,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 13:45:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-13 13:45:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 13:45:25,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:25,930 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:25,930 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:25,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1902176386, now seen corresponding path program 1 times [2018-04-13 13:45:25,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:25,930 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:25,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:25,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:25,943 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 13:45:25,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 13:45:25,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 13:45:25,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 13:45:25,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 13:45:25,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 13:45:25,997 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-04-13 13:45:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,028 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-04-13 13:45:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 13:45:26,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 13:45:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,029 INFO L225 Difference]: With dead ends: 30 [2018-04-13 13:45:26,029 INFO L226 Difference]: Without dead ends: 30 [2018-04-13 13:45:26,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 13:45:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-13 13:45:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-04-13 13:45:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-04-13 13:45:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-04-13 13:45:26,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-04-13 13:45:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,032 INFO L459 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-04-13 13:45:26,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 13:45:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-04-13 13:45:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 13:45:26,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,033 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,033 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1035544172, now seen corresponding path program 1 times [2018-04-13 13:45:26,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:26,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,041 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 13:45:26,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 13:45:26,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:26,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-13 13:45:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 13:45:26,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 13:45:26,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 13:45:26,109 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-04-13 13:45:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,153 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-13 13:45:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 13:45:26,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-13 13:45:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,154 INFO L225 Difference]: With dead ends: 44 [2018-04-13 13:45:26,154 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 13:45:26,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-13 13:45:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 13:45:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-13 13:45:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-13 13:45:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-04-13 13:45:26,158 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-04-13 13:45:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,158 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-04-13 13:45:26,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 13:45:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-04-13 13:45:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 13:45:26,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,160 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,160 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1402074139, now seen corresponding path program 2 times [2018-04-13 13:45:26,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,160 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:26,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,170 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 13:45:26,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:26,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:26,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:26,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 13:45:26,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:26,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-13 13:45:26,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 13:45:26,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 13:45:26,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 13:45:26,220 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-04-13 13:45:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,280 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-13 13:45:26,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 13:45:26,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-13 13:45:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,281 INFO L225 Difference]: With dead ends: 53 [2018-04-13 13:45:26,282 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 13:45:26,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-13 13:45:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 13:45:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-04-13 13:45:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 13:45:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-04-13 13:45:26,285 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-04-13 13:45:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,285 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-04-13 13:45:26,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 13:45:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-04-13 13:45:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 13:45:26,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,286 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,286 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1121029342, now seen corresponding path program 3 times [2018-04-13 13:45:26,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:26,287 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,295 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-13 13:45:26,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:26,339 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 13:45:26,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:26,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-04-13 13:45:26,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:26,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-04-13 13:45:26,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 13:45:26,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 13:45:26,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-04-13 13:45:26,359 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-04-13 13:45:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,450 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-04-13 13:45:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 13:45:26,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-13 13:45:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,452 INFO L225 Difference]: With dead ends: 62 [2018-04-13 13:45:26,452 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 13:45:26,452 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-04-13 13:45:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 13:45:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-04-13 13:45:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 13:45:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-13 13:45:26,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 36 [2018-04-13 13:45:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,456 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-13 13:45:26,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 13:45:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-13 13:45:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 13:45:26,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,458 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,458 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2049974933, now seen corresponding path program 4 times [2018-04-13 13:45:26,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:26,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,470 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-04-13 13:45:26,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:26,521 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:26,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:26,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-04-13 13:45:26,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:26,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-04-13 13:45:26,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 13:45:26,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 13:45:26,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-04-13 13:45:26,563 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 12 states. [2018-04-13 13:45:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,682 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-04-13 13:45:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 13:45:26,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-13 13:45:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,683 INFO L225 Difference]: With dead ends: 71 [2018-04-13 13:45:26,683 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 13:45:26,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-04-13 13:45:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 13:45:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-04-13 13:45:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 13:45:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-04-13 13:45:26,689 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2018-04-13 13:45:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,689 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-04-13 13:45:26,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 13:45:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-04-13 13:45:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 13:45:26,690 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,690 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,691 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1976658736, now seen corresponding path program 5 times [2018-04-13 13:45:26,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:26,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,703 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-13 13:45:26,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:26,805 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-13 13:45:26,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:26,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-13 13:45:26,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:26,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-04-13 13:45:26,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 13:45:26,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 13:45:26,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-13 13:45:26,819 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-04-13 13:45:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:26,915 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-04-13 13:45:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 13:45:26,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-13 13:45:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:26,916 INFO L225 Difference]: With dead ends: 80 [2018-04-13 13:45:26,916 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 13:45:26,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-13 13:45:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 13:45:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-04-13 13:45:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-13 13:45:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-04-13 13:45:26,920 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-04-13 13:45:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:26,921 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-04-13 13:45:26,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 13:45:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-04-13 13:45:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 13:45:26,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:26,922 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:26,922 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -617601783, now seen corresponding path program 6 times [2018-04-13 13:45:26,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:26,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:26,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:26,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:26,933 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-13 13:45:26,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:26,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:26,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:27,012 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-13 13:45:27,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:27,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-04-13 13:45:27,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:27,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2018-04-13 13:45:27,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 13:45:27,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 13:45:27,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-04-13 13:45:27,037 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2018-04-13 13:45:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:27,131 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-04-13 13:45:27,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 13:45:27,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-13 13:45:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:27,132 INFO L225 Difference]: With dead ends: 89 [2018-04-13 13:45:27,132 INFO L226 Difference]: Without dead ends: 89 [2018-04-13 13:45:27,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2018-04-13 13:45:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-13 13:45:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-04-13 13:45:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 13:45:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-04-13 13:45:27,137 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2018-04-13 13:45:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:27,137 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-04-13 13:45:27,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 13:45:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-04-13 13:45:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 13:45:27,138 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:27,138 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:27,138 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash -844102134, now seen corresponding path program 7 times [2018-04-13 13:45:27,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:27,138 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:27,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:27,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:27,148 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-13 13:45:27,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:27,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:27,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-13 13:45:27,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:27,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-04-13 13:45:27,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 13:45:27,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 13:45:27,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-13 13:45:27,225 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2018-04-13 13:45:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:27,284 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-04-13 13:45:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 13:45:27,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-13 13:45:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:27,286 INFO L225 Difference]: With dead ends: 98 [2018-04-13 13:45:27,286 INFO L226 Difference]: Without dead ends: 98 [2018-04-13 13:45:27,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-13 13:45:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-13 13:45:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-04-13 13:45:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 13:45:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-04-13 13:45:27,290 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-04-13 13:45:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:27,290 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-04-13 13:45:27,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 13:45:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-04-13 13:45:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-13 13:45:27,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:27,291 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:27,291 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -233153935, now seen corresponding path program 8 times [2018-04-13 13:45:27,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:27,291 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:27,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:27,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:27,299 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-13 13:45:27,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:27,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:27,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:27,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:27,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-13 13:45:27,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:27,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-04-13 13:45:27,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 13:45:27,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 13:45:27,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-13 13:45:27,359 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2018-04-13 13:45:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:27,438 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-04-13 13:45:27,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 13:45:27,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-04-13 13:45:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:27,439 INFO L225 Difference]: With dead ends: 107 [2018-04-13 13:45:27,439 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 13:45:27,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-13 13:45:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 13:45:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2018-04-13 13:45:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-13 13:45:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-04-13 13:45:27,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2018-04-13 13:45:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:27,444 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-04-13 13:45:27,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 13:45:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-04-13 13:45:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-13 13:45:27,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:27,445 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:27,445 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1994793816, now seen corresponding path program 9 times [2018-04-13 13:45:27,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:27,446 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:27,447 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:27,447 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:27,455 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-04-13 13:45:27,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:27,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:27,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-13 13:45:27,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:27,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-04-13 13:45:27,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:27,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 15 [2018-04-13 13:45:27,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 13:45:27,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 13:45:27,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=115, Unknown=0, NotChecked=0, Total=210 [2018-04-13 13:45:27,574 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 15 states. [2018-04-13 13:45:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:27,700 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-04-13 13:45:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 13:45:27,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-04-13 13:45:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:27,701 INFO L225 Difference]: With dead ends: 116 [2018-04-13 13:45:27,701 INFO L226 Difference]: Without dead ends: 116 [2018-04-13 13:45:27,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=215, Unknown=0, NotChecked=0, Total=380 [2018-04-13 13:45:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-13 13:45:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-04-13 13:45:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 13:45:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-13 13:45:27,708 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 75 [2018-04-13 13:45:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:27,708 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-13 13:45:27,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 13:45:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-13 13:45:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 13:45:27,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:27,710 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:27,713 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1158198227, now seen corresponding path program 10 times [2018-04-13 13:45:27,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:27,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:27,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:27,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:27,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-04-13 13:45:27,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:27,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:27,798 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:27,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:27,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-04-13 13:45:27,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:27,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-04-13 13:45:27,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 13:45:27,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 13:45:27,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-04-13 13:45:27,855 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 21 states. [2018-04-13 13:45:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:28,104 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-04-13 13:45:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 13:45:28,105 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-04-13 13:45:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:28,105 INFO L225 Difference]: With dead ends: 125 [2018-04-13 13:45:28,106 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 13:45:28,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-04-13 13:45:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 13:45:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2018-04-13 13:45:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-13 13:45:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-04-13 13:45:28,110 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-04-13 13:45:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:28,110 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-04-13 13:45:28,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 13:45:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-04-13 13:45:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-13 13:45:28,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:28,117 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:28,117 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1103434406, now seen corresponding path program 11 times [2018-04-13 13:45:28,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:28,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:28,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:28,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:28,127 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 13:45:28,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:28,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:28,218 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:28,318 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-13 13:45:28,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:28,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 13:45:28,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:28,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-04-13 13:45:28,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 13:45:28,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 13:45:28,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-13 13:45:28,338 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-04-13 13:45:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:28,450 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-04-13 13:45:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 13:45:28,450 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-04-13 13:45:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:28,451 INFO L225 Difference]: With dead ends: 134 [2018-04-13 13:45:28,451 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 13:45:28,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-13 13:45:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 13:45:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-04-13 13:45:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-13 13:45:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-04-13 13:45:28,455 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 93 [2018-04-13 13:45:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:28,455 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-04-13 13:45:28,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 13:45:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-04-13 13:45:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-13 13:45:28,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:28,456 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:28,456 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -20175795, now seen corresponding path program 12 times [2018-04-13 13:45:28,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:28,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:28,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:28,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:28,465 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-04-13 13:45:28,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:28,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:28,537 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:28,561 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-13 13:45:28,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:28,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-04-13 13:45:28,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:28,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 18 [2018-04-13 13:45:28,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 13:45:28,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 13:45:28,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-04-13 13:45:28,591 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 18 states. [2018-04-13 13:45:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:28,746 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-04-13 13:45:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 13:45:28,746 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-04-13 13:45:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:28,747 INFO L225 Difference]: With dead ends: 143 [2018-04-13 13:45:28,747 INFO L226 Difference]: Without dead ends: 143 [2018-04-13 13:45:28,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-13 13:45:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-13 13:45:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2018-04-13 13:45:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-13 13:45:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-04-13 13:45:28,749 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 97 [2018-04-13 13:45:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:28,750 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-04-13 13:45:28,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 13:45:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-04-13 13:45:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-04-13 13:45:28,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:28,750 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:28,751 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1913705576, now seen corresponding path program 13 times [2018-04-13 13:45:28,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:28,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:28,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:28,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:28,761 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-04-13 13:45:28,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:28,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:28,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:28,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-04-13 13:45:28,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:28,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-13 13:45:28,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 13:45:28,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 13:45:28,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-13 13:45:28,904 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 17 states. [2018-04-13 13:45:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:29,011 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-04-13 13:45:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 13:45:29,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-04-13 13:45:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:29,013 INFO L225 Difference]: With dead ends: 152 [2018-04-13 13:45:29,013 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 13:45:29,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-13 13:45:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 13:45:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2018-04-13 13:45:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-13 13:45:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-04-13 13:45:29,017 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-04-13 13:45:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:29,017 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-04-13 13:45:29,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 13:45:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-04-13 13:45:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-13 13:45:29,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:29,018 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:29,019 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2040905391, now seen corresponding path program 14 times [2018-04-13 13:45:29,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:29,019 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:29,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:29,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:29,028 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-04-13 13:45:29,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:29,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:29,158 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:29,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:29,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-04-13 13:45:29,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:29,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-04-13 13:45:29,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 13:45:29,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 13:45:29,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-04-13 13:45:29,223 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 27 states. [2018-04-13 13:45:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:29,480 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-13 13:45:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 13:45:29,480 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-04-13 13:45:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:29,481 INFO L225 Difference]: With dead ends: 161 [2018-04-13 13:45:29,481 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 13:45:29,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-04-13 13:45:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 13:45:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-04-13 13:45:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-13 13:45:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-04-13 13:45:29,485 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 110 [2018-04-13 13:45:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:29,485 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-04-13 13:45:29,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 13:45:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-04-13 13:45:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 13:45:29,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:29,487 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:29,487 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1165426366, now seen corresponding path program 15 times [2018-04-13 13:45:29,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:29,487 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:29,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:29,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:29,497 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-04-13 13:45:29,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:29,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:29,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:29,620 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 13:45:29,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:29,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-04-13 13:45:29,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:29,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 21 [2018-04-13 13:45:29,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 13:45:29,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 13:45:29,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-04-13 13:45:29,655 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2018-04-13 13:45:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:29,912 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-04-13 13:45:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 13:45:29,912 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-04-13 13:45:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:29,913 INFO L225 Difference]: With dead ends: 170 [2018-04-13 13:45:29,913 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 13:45:29,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=372, Invalid=498, Unknown=0, NotChecked=0, Total=870 [2018-04-13 13:45:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 13:45:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 129. [2018-04-13 13:45:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 13:45:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-13 13:45:29,916 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2018-04-13 13:45:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:29,917 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-13 13:45:29,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 13:45:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-13 13:45:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-13 13:45:29,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:29,918 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:29,918 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 175816451, now seen corresponding path program 16 times [2018-04-13 13:45:29,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:29,918 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:29,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:29,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:29,928 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-04-13 13:45:30,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:30,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:30,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:30,068 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:30,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:30,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-04-13 13:45:30,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:30,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-04-13 13:45:30,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 13:45:30,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 13:45:30,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-13 13:45:30,092 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-04-13 13:45:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:30,232 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-04-13 13:45:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 13:45:30,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-04-13 13:45:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:30,233 INFO L225 Difference]: With dead ends: 179 [2018-04-13 13:45:30,233 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 13:45:30,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-13 13:45:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 13:45:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2018-04-13 13:45:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 13:45:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-04-13 13:45:30,236 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-04-13 13:45:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:30,236 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-04-13 13:45:30,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 13:45:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-04-13 13:45:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-13 13:45:30,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:30,237 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:30,237 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1072704516, now seen corresponding path program 17 times [2018-04-13 13:45:30,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:30,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:30,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:30,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:30,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:30,243 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-04-13 13:45:30,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:30,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:30,542 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-04-13 13:45:30,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:30,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-04-13 13:45:30,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:30,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-04-13 13:45:30,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 13:45:30,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 13:45:30,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-13 13:45:30,568 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 21 states. [2018-04-13 13:45:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:30,724 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-04-13 13:45:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 13:45:30,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 132 [2018-04-13 13:45:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:30,726 INFO L225 Difference]: With dead ends: 188 [2018-04-13 13:45:30,726 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 13:45:30,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-13 13:45:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 13:45:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 137. [2018-04-13 13:45:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 13:45:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-13 13:45:30,729 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-04-13 13:45:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:30,729 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-13 13:45:30,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 13:45:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-13 13:45:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-13 13:45:30,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:30,730 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:30,730 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash -894450571, now seen corresponding path program 18 times [2018-04-13 13:45:30,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:30,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:30,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:30,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:30,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:30,740 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-04-13 13:45:30,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:30,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:30,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:30,975 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-04-13 13:45:30,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:30,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-04-13 13:45:31,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:31,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 24 [2018-04-13 13:45:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 13:45:31,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 13:45:31,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-04-13 13:45:31,015 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 24 states. [2018-04-13 13:45:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:31,266 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2018-04-13 13:45:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 13:45:31,266 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-04-13 13:45:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:31,267 INFO L225 Difference]: With dead ends: 197 [2018-04-13 13:45:31,267 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 13:45:31,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 13:45:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 13:45:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2018-04-13 13:45:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-13 13:45:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-04-13 13:45:31,271 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 136 [2018-04-13 13:45:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:31,271 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-04-13 13:45:31,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 13:45:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-04-13 13:45:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-13 13:45:31,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:31,272 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:31,273 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1789849122, now seen corresponding path program 19 times [2018-04-13 13:45:31,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:31,273 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:31,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:31,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:31,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:31,282 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-04-13 13:45:31,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:31,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:31,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-04-13 13:45:31,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:31,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-13 13:45:31,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 13:45:31,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 13:45:31,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-13 13:45:31,507 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 23 states. [2018-04-13 13:45:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:31,661 INFO L93 Difference]: Finished difference Result 206 states and 216 transitions. [2018-04-13 13:45:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 13:45:31,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2018-04-13 13:45:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:31,662 INFO L225 Difference]: With dead ends: 206 [2018-04-13 13:45:31,662 INFO L226 Difference]: Without dead ends: 206 [2018-04-13 13:45:31,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-13 13:45:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-13 13:45:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2018-04-13 13:45:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-13 13:45:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-04-13 13:45:31,665 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 145 [2018-04-13 13:45:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:31,666 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-04-13 13:45:31,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 13:45:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-04-13 13:45:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-13 13:45:31,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:31,667 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:31,667 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1276416507, now seen corresponding path program 20 times [2018-04-13 13:45:31,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:31,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:31,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:31,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:31,677 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-04-13 13:45:31,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:31,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:31,896 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:31,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:31,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1179 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-04-13 13:45:31,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:31,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-13 13:45:31,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 13:45:31,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 13:45:31,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-13 13:45:31,923 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 24 states. [2018-04-13 13:45:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:32,089 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2018-04-13 13:45:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 13:45:32,091 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 149 [2018-04-13 13:45:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:32,091 INFO L225 Difference]: With dead ends: 215 [2018-04-13 13:45:32,092 INFO L226 Difference]: Without dead ends: 215 [2018-04-13 13:45:32,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-13 13:45:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-13 13:45:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 154. [2018-04-13 13:45:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-13 13:45:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-04-13 13:45:32,095 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2018-04-13 13:45:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:32,095 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-04-13 13:45:32,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 13:45:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-04-13 13:45:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-04-13 13:45:32,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:32,096 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:32,097 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 136142508, now seen corresponding path program 21 times [2018-04-13 13:45:32,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:32,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:32,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:32,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:32,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:32,107 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-04-13 13:45:32,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:32,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:32,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:32,338 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-13 13:45:32,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:32,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-04-13 13:45:32,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:32,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 27 [2018-04-13 13:45:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 13:45:32,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 13:45:32,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=373, Unknown=0, NotChecked=0, Total=702 [2018-04-13 13:45:32,389 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 27 states. [2018-04-13 13:45:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:32,684 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-04-13 13:45:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 13:45:32,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2018-04-13 13:45:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:32,685 INFO L225 Difference]: With dead ends: 224 [2018-04-13 13:45:32,685 INFO L226 Difference]: Without dead ends: 224 [2018-04-13 13:45:32,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=615, Invalid=791, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 13:45:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-13 13:45:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2018-04-13 13:45:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 13:45:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-04-13 13:45:32,688 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 153 [2018-04-13 13:45:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:32,688 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-04-13 13:45:32,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 13:45:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-04-13 13:45:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-13 13:45:32,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:32,688 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:32,689 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 470717849, now seen corresponding path program 22 times [2018-04-13 13:45:32,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:32,689 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:32,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:32,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:32,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:32,695 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-04-13 13:45:32,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:32,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:32,928 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:32,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:32,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-04-13 13:45:33,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:33,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14] total 39 [2018-04-13 13:45:33,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 13:45:33,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 13:45:33,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=897, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 13:45:33,024 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 39 states. [2018-04-13 13:45:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:33,595 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-13 13:45:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 13:45:33,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 162 [2018-04-13 13:45:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:33,596 INFO L225 Difference]: With dead ends: 233 [2018-04-13 13:45:33,596 INFO L226 Difference]: Without dead ends: 233 [2018-04-13 13:45:33,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=585, Invalid=897, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 13:45:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-13 13:45:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 172. [2018-04-13 13:45:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-13 13:45:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-04-13 13:45:33,600 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 162 [2018-04-13 13:45:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:33,600 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-04-13 13:45:33,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 13:45:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-04-13 13:45:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-04-13 13:45:33,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:33,601 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:33,601 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2008188026, now seen corresponding path program 23 times [2018-04-13 13:45:33,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:33,602 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:33,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:33,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:33,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:33,611 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-04-13 13:45:33,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:33,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:33,906 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-04-13 13:45:33,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:33,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-04-13 13:45:33,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:33,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-04-13 13:45:33,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 13:45:33,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 13:45:33,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-13 13:45:33,939 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 27 states. [2018-04-13 13:45:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:34,157 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2018-04-13 13:45:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 13:45:34,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 171 [2018-04-13 13:45:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:34,158 INFO L225 Difference]: With dead ends: 242 [2018-04-13 13:45:34,158 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 13:45:34,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-13 13:45:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 13:45:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2018-04-13 13:45:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-13 13:45:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-04-13 13:45:34,162 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 171 [2018-04-13 13:45:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:34,162 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-04-13 13:45:34,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 13:45:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-04-13 13:45:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-04-13 13:45:34,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:34,163 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:34,164 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 120286689, now seen corresponding path program 24 times [2018-04-13 13:45:34,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:34,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:34,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:34,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:34,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:34,174 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-04-13 13:45:34,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:34,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:34,438 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:34,498 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-04-13 13:45:34,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:34,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-04-13 13:45:34,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:34,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 30 [2018-04-13 13:45:34,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 13:45:34,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 13:45:34,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-04-13 13:45:34,544 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 30 states. [2018-04-13 13:45:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:34,884 INFO L93 Difference]: Finished difference Result 251 states and 263 transitions. [2018-04-13 13:45:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 13:45:34,884 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 175 [2018-04-13 13:45:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:34,885 INFO L225 Difference]: With dead ends: 251 [2018-04-13 13:45:34,885 INFO L226 Difference]: Without dead ends: 251 [2018-04-13 13:45:34,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 13:45:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-13 13:45:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2018-04-13 13:45:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 13:45:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-13 13:45:34,889 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 175 [2018-04-13 13:45:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:34,890 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-13 13:45:34,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 13:45:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-13 13:45:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-13 13:45:34,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:34,891 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:34,891 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1190682940, now seen corresponding path program 25 times [2018-04-13 13:45:34,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:34,891 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:34,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:34,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:34,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:34,902 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-04-13 13:45:35,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:35,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:35,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-04-13 13:45:35,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:35,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-13 13:45:35,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 13:45:35,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 13:45:35,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-13 13:45:35,175 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 29 states. [2018-04-13 13:45:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:35,347 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2018-04-13 13:45:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 13:45:35,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 184 [2018-04-13 13:45:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:35,348 INFO L225 Difference]: With dead ends: 260 [2018-04-13 13:45:35,348 INFO L226 Difference]: Without dead ends: 260 [2018-04-13 13:45:35,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-13 13:45:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-13 13:45:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 189. [2018-04-13 13:45:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 13:45:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-04-13 13:45:35,351 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-04-13 13:45:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:35,352 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-04-13 13:45:35,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 13:45:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-04-13 13:45:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-13 13:45:35,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:35,353 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:35,353 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash -917670723, now seen corresponding path program 26 times [2018-04-13 13:45:35,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:35,353 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:35,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:35,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:35,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:35,363 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-04-13 13:45:35,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:35,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:35,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:35,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:35,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:35,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-04-13 13:45:35,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:35,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17] total 34 [2018-04-13 13:45:35,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 13:45:35,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 13:45:35,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=617, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 13:45:35,755 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 34 states. [2018-04-13 13:45:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:36,110 INFO L93 Difference]: Finished difference Result 269 states and 282 transitions. [2018-04-13 13:45:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 13:45:36,111 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-04-13 13:45:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:36,111 INFO L225 Difference]: With dead ends: 269 [2018-04-13 13:45:36,111 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 13:45:36,112 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=936, Invalid=1320, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 13:45:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 13:45:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 198. [2018-04-13 13:45:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 13:45:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-04-13 13:45:36,114 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 188 [2018-04-13 13:45:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:36,114 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-04-13 13:45:36,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 13:45:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-04-13 13:45:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-13 13:45:36,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:36,115 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:36,115 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1535285526, now seen corresponding path program 27 times [2018-04-13 13:45:36,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:36,115 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:36,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:36,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:36,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:36,123 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-04-13 13:45:36,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:36,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:36,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 13:45:36,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:36,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-04-13 13:45:36,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:36,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 33 [2018-04-13 13:45:36,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 13:45:36,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 13:45:36,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 13:45:36,514 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 33 states. [2018-04-13 13:45:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:36,932 INFO L93 Difference]: Finished difference Result 278 states and 291 transitions. [2018-04-13 13:45:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 13:45:36,932 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 197 [2018-04-13 13:45:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:36,933 INFO L225 Difference]: With dead ends: 278 [2018-04-13 13:45:36,933 INFO L226 Difference]: Without dead ends: 278 [2018-04-13 13:45:36,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=978, Invalid=1278, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 13:45:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-13 13:45:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2018-04-13 13:45:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-13 13:45:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-04-13 13:45:36,937 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2018-04-13 13:45:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:36,937 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-04-13 13:45:36,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 13:45:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-04-13 13:45:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-13 13:45:36,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:36,938 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:36,938 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -68281361, now seen corresponding path program 28 times [2018-04-13 13:45:36,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:36,939 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:36,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:36,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:36,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:36,948 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-04-13 13:45:37,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:37,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:37,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:37,259 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:37,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:37,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-04-13 13:45:37,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:37,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-04-13 13:45:37,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 13:45:37,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 13:45:37,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-13 13:45:37,286 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 32 states. [2018-04-13 13:45:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:37,537 INFO L93 Difference]: Finished difference Result 287 states and 301 transitions. [2018-04-13 13:45:37,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 13:45:37,538 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-04-13 13:45:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:37,539 INFO L225 Difference]: With dead ends: 287 [2018-04-13 13:45:37,539 INFO L226 Difference]: Without dead ends: 287 [2018-04-13 13:45:37,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-13 13:45:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-13 13:45:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 211. [2018-04-13 13:45:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-13 13:45:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-04-13 13:45:37,543 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-04-13 13:45:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:37,543 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-04-13 13:45:37,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 13:45:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-04-13 13:45:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-13 13:45:37,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:37,544 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:37,544 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:37,545 INFO L82 PathProgramCache]: Analyzing trace with hash -919322328, now seen corresponding path program 29 times [2018-04-13 13:45:37,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:37,545 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:37,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:37,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:37,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:37,555 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-04-13 13:45:37,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:37,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:38,180 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-04-13 13:45:38,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:38,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2432 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-04-13 13:45:38,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:38,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2018-04-13 13:45:38,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 13:45:38,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 13:45:38,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1497, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 13:45:38,357 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 50 states. [2018-04-13 13:45:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:39,059 INFO L93 Difference]: Finished difference Result 296 states and 310 transitions. [2018-04-13 13:45:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 13:45:39,095 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 210 [2018-04-13 13:45:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:39,096 INFO L225 Difference]: With dead ends: 296 [2018-04-13 13:45:39,096 INFO L226 Difference]: Without dead ends: 296 [2018-04-13 13:45:39,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=953, Invalid=1497, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 13:45:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-13 13:45:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2018-04-13 13:45:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 13:45:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-04-13 13:45:39,098 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 210 [2018-04-13 13:45:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:39,099 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-04-13 13:45:39,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 13:45:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-04-13 13:45:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-13 13:45:39,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:39,099 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:39,099 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -841568181, now seen corresponding path program 30 times [2018-04-13 13:45:39,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:39,100 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:39,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:39,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:39,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:39,105 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-04-13 13:45:39,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:39,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:39,505 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-04-13 13:45:39,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:39,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-04-13 13:45:39,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:39,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20] total 36 [2018-04-13 13:45:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 13:45:39,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 13:45:39,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=664, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 13:45:39,593 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 36 states. [2018-04-13 13:45:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:39,953 INFO L93 Difference]: Finished difference Result 305 states and 319 transitions. [2018-04-13 13:45:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 13:45:39,953 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 219 [2018-04-13 13:45:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:39,954 INFO L225 Difference]: With dead ends: 305 [2018-04-13 13:45:39,954 INFO L226 Difference]: Without dead ends: 305 [2018-04-13 13:45:39,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1191, Invalid=1565, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 13:45:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-13 13:45:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 229. [2018-04-13 13:45:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-13 13:45:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-04-13 13:45:39,957 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 219 [2018-04-13 13:45:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:39,957 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-04-13 13:45:39,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 13:45:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-04-13 13:45:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-13 13:45:39,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:39,958 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:39,958 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash -205243110, now seen corresponding path program 31 times [2018-04-13 13:45:39,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:39,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:39,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:39,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:39,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:39,965 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2849 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-04-13 13:45:40,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:40,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:40,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:40,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2849 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-04-13 13:45:40,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:40,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-04-13 13:45:40,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 13:45:40,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 13:45:40,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 13:45:40,333 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 35 states. [2018-04-13 13:45:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:40,503 INFO L93 Difference]: Finished difference Result 314 states and 329 transitions. [2018-04-13 13:45:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 13:45:40,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 228 [2018-04-13 13:45:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:40,504 INFO L225 Difference]: With dead ends: 314 [2018-04-13 13:45:40,504 INFO L226 Difference]: Without dead ends: 314 [2018-04-13 13:45:40,504 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 13:45:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-13 13:45:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 233. [2018-04-13 13:45:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-13 13:45:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-13 13:45:40,507 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-04-13 13:45:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:40,507 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-13 13:45:40,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 13:45:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-13 13:45:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-13 13:45:40,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:40,508 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:40,508 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1732525677, now seen corresponding path program 32 times [2018-04-13 13:45:40,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:40,508 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:40,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:40,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:40,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:40,514 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-04-13 13:45:40,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:40,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:40,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:40,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:40,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:40,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-04-13 13:45:40,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:40,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-13 13:45:40,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 13:45:40,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 13:45:40,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 13:45:40,837 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 36 states. [2018-04-13 13:45:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:41,029 INFO L93 Difference]: Finished difference Result 323 states and 339 transitions. [2018-04-13 13:45:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 13:45:41,029 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-04-13 13:45:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:41,030 INFO L225 Difference]: With dead ends: 323 [2018-04-13 13:45:41,030 INFO L226 Difference]: Without dead ends: 323 [2018-04-13 13:45:41,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 13:45:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-13 13:45:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2018-04-13 13:45:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-13 13:45:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-04-13 13:45:41,032 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 232 [2018-04-13 13:45:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:41,032 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-04-13 13:45:41,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 13:45:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-04-13 13:45:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-13 13:45:41,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:41,033 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:41,033 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:41,033 INFO L82 PathProgramCache]: Analyzing trace with hash 888824204, now seen corresponding path program 33 times [2018-04-13 13:45:41,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:41,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:41,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:41,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:41,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:41,039 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3113 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-04-13 13:45:41,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:41,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:41,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-04-13 13:45:41,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:41,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3113 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-04-13 13:45:41,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:41,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 39 [2018-04-13 13:45:41,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 13:45:41,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 13:45:41,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 13:45:41,451 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 39 states. [2018-04-13 13:45:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:41,874 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-04-13 13:45:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 13:45:41,874 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 236 [2018-04-13 13:45:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:41,875 INFO L225 Difference]: With dead ends: 332 [2018-04-13 13:45:41,875 INFO L226 Difference]: Without dead ends: 332 [2018-04-13 13:45:41,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1389, Invalid=1803, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 13:45:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-13 13:45:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 246. [2018-04-13 13:45:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-13 13:45:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-04-13 13:45:41,878 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 236 [2018-04-13 13:45:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:41,878 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-04-13 13:45:41,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 13:45:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-04-13 13:45:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-04-13 13:45:41,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:41,879 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:41,879 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash -762393689, now seen corresponding path program 34 times [2018-04-13 13:45:41,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:41,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:41,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:41,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:41,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:41,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3343 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-04-13 13:45:42,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:42,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:42,245 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:42,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:42,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3343 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-04-13 13:45:42,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:42,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-04-13 13:45:42,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 13:45:42,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 13:45:42,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 13:45:42,283 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 38 states. [2018-04-13 13:45:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:42,559 INFO L93 Difference]: Finished difference Result 341 states and 358 transitions. [2018-04-13 13:45:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 13:45:42,559 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 245 [2018-04-13 13:45:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:42,560 INFO L225 Difference]: With dead ends: 341 [2018-04-13 13:45:42,560 INFO L226 Difference]: Without dead ends: 341 [2018-04-13 13:45:42,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 13:45:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-13 13:45:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2018-04-13 13:45:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-13 13:45:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-04-13 13:45:42,563 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 245 [2018-04-13 13:45:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:42,564 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-04-13 13:45:42,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 13:45:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-04-13 13:45:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-13 13:45:42,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:42,565 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:42,565 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash -66869170, now seen corresponding path program 35 times [2018-04-13 13:45:42,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:42,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:42,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:42,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:42,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:42,576 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-04-13 13:45:42,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:42,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:42,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:43,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-04-13 13:45:43,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:43,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3485 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-04-13 13:45:43,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:43,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-04-13 13:45:43,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 13:45:43,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 13:45:43,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 13:45:43,363 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 39 states. [2018-04-13 13:45:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:43,576 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2018-04-13 13:45:43,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 13:45:43,576 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 249 [2018-04-13 13:45:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:43,577 INFO L225 Difference]: With dead ends: 350 [2018-04-13 13:45:43,577 INFO L226 Difference]: Without dead ends: 350 [2018-04-13 13:45:43,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 13:45:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-13 13:45:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 254. [2018-04-13 13:45:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-13 13:45:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-04-13 13:45:43,580 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 249 [2018-04-13 13:45:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:43,580 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-04-13 13:45:43,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 13:45:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-04-13 13:45:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-13 13:45:43,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:43,582 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:43,582 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1893456245, now seen corresponding path program 36 times [2018-04-13 13:45:43,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:43,582 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:43,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:43,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:43,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:43,594 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3631 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-04-13 13:45:43,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:43,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:44,031 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-04-13 13:45:44,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:44,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3631 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-04-13 13:45:44,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:44,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 22] total 42 [2018-04-13 13:45:44,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 13:45:44,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 13:45:44,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 13:45:44,149 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 42 states. [2018-04-13 13:45:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:44,494 INFO L93 Difference]: Finished difference Result 359 states and 377 transitions. [2018-04-13 13:45:44,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 13:45:44,494 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 253 [2018-04-13 13:45:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:44,495 INFO L225 Difference]: With dead ends: 359 [2018-04-13 13:45:44,495 INFO L226 Difference]: Without dead ends: 359 [2018-04-13 13:45:44,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 13:45:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-13 13:45:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 263. [2018-04-13 13:45:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-13 13:45:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-04-13 13:45:44,499 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2018-04-13 13:45:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:44,499 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-04-13 13:45:44,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 13:45:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-04-13 13:45:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-13 13:45:44,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:44,500 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:44,500 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1151025168, now seen corresponding path program 37 times [2018-04-13 13:45:44,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:44,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:44,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:44,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:44,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:44,509 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-04-13 13:45:44,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:44,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:44,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:44,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-04-13 13:45:44,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:44,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-13 13:45:44,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 13:45:44,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 13:45:44,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 13:45:44,925 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 41 states. [2018-04-13 13:45:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:45,148 INFO L93 Difference]: Finished difference Result 368 states and 387 transitions. [2018-04-13 13:45:45,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 13:45:45,148 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 262 [2018-04-13 13:45:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:45,149 INFO L225 Difference]: With dead ends: 368 [2018-04-13 13:45:45,149 INFO L226 Difference]: Without dead ends: 368 [2018-04-13 13:45:45,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 13:45:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-13 13:45:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 267. [2018-04-13 13:45:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-13 13:45:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-04-13 13:45:45,152 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-04-13 13:45:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:45,153 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-04-13 13:45:45,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 13:45:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-04-13 13:45:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-04-13 13:45:45,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:45,154 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:45,154 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1041373655, now seen corresponding path program 38 times [2018-04-13 13:45:45,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:45,155 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:45,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:45,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:45,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:45,166 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-04-13 13:45:45,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:45,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:45,574 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:45,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:45,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-04-13 13:45:45,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:45,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 23] total 44 [2018-04-13 13:45:45,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 13:45:45,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 13:45:45,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 13:45:45,633 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 44 states. [2018-04-13 13:45:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:46,100 INFO L93 Difference]: Finished difference Result 377 states and 396 transitions. [2018-04-13 13:45:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 13:45:46,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 266 [2018-04-13 13:45:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:46,101 INFO L225 Difference]: With dead ends: 377 [2018-04-13 13:45:46,101 INFO L226 Difference]: Without dead ends: 377 [2018-04-13 13:45:46,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 13:45:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-13 13:45:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 276. [2018-04-13 13:45:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-13 13:45:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-04-13 13:45:46,104 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 266 [2018-04-13 13:45:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:46,104 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-04-13 13:45:46,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 13:45:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-04-13 13:45:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-04-13 13:45:46,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:46,106 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:46,106 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1113644310, now seen corresponding path program 39 times [2018-04-13 13:45:46,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:46,106 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:46,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:46,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:46,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:46,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4292 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-04-13 13:45:46,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:46,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:46,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:46,532 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 13:45:46,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:46,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4292 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-04-13 13:45:46,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:46,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 24] total 45 [2018-04-13 13:45:46,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 13:45:46,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 13:45:46,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 13:45:46,629 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 45 states. [2018-04-13 13:45:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:47,044 INFO L93 Difference]: Finished difference Result 386 states and 405 transitions. [2018-04-13 13:45:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 13:45:47,044 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 275 [2018-04-13 13:45:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:47,045 INFO L225 Difference]: With dead ends: 386 [2018-04-13 13:45:47,045 INFO L226 Difference]: Without dead ends: 386 [2018-04-13 13:45:47,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1872, Invalid=2418, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 13:45:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-13 13:45:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 285. [2018-04-13 13:45:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 13:45:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-04-13 13:45:47,048 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 275 [2018-04-13 13:45:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:47,048 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-04-13 13:45:47,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 13:45:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-04-13 13:45:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-13 13:45:47,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:47,049 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:47,049 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1906988763, now seen corresponding path program 40 times [2018-04-13 13:45:47,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:47,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:47,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:47,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:47,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:47,056 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4561 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-04-13 13:45:47,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:47,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:47,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:47,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:47,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:47,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4561 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-04-13 13:45:47,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:47,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-04-13 13:45:47,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 13:45:47,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 13:45:47,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 13:45:47,537 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 44 states. [2018-04-13 13:45:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:47,770 INFO L93 Difference]: Finished difference Result 395 states and 415 transitions. [2018-04-13 13:45:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 13:45:47,771 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 284 [2018-04-13 13:45:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:47,771 INFO L225 Difference]: With dead ends: 395 [2018-04-13 13:45:47,771 INFO L226 Difference]: Without dead ends: 395 [2018-04-13 13:45:47,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 13:45:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-13 13:45:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 289. [2018-04-13 13:45:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-13 13:45:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-13 13:45:47,775 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-04-13 13:45:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:47,775 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-13 13:45:47,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 13:45:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-13 13:45:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-13 13:45:47,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:47,776 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:47,776 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash -583132076, now seen corresponding path program 41 times [2018-04-13 13:45:47,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:47,777 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:47,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:47,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:47,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:47,784 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-04-13 13:45:48,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:48,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:48,253 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-04-13 13:45:48,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:48,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-04-13 13:45:48,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:48,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 25] total 68 [2018-04-13 13:45:48,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 13:45:48,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 13:45:48,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=2784, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 13:45:48,592 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 68 states. [2018-04-13 13:45:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:49,846 INFO L93 Difference]: Finished difference Result 404 states and 424 transitions. [2018-04-13 13:45:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 13:45:49,846 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 288 [2018-04-13 13:45:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:49,847 INFO L225 Difference]: With dead ends: 404 [2018-04-13 13:45:49,847 INFO L226 Difference]: Without dead ends: 404 [2018-04-13 13:45:49,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1772, Invalid=2784, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 13:45:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-13 13:45:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2018-04-13 13:45:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-13 13:45:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-04-13 13:45:49,850 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 288 [2018-04-13 13:45:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:49,851 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-04-13 13:45:49,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 13:45:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-04-13 13:45:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-13 13:45:49,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:49,852 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:49,852 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -113928097, now seen corresponding path program 42 times [2018-04-13 13:45:49,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:49,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:49,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:49,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:49,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:49,865 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-04-13 13:45:50,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:50,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:50,364 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-04-13 13:45:50,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:50,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5009 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-04-13 13:45:50,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:50,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 26] total 48 [2018-04-13 13:45:50,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 13:45:50,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 13:45:50,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=1174, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 13:45:50,425 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 48 states. [2018-04-13 13:45:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:50,878 INFO L93 Difference]: Finished difference Result 413 states and 433 transitions. [2018-04-13 13:45:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 13:45:50,878 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 297 [2018-04-13 13:45:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:50,879 INFO L225 Difference]: With dead ends: 413 [2018-04-13 13:45:50,879 INFO L226 Difference]: Without dead ends: 413 [2018-04-13 13:45:50,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2163, Invalid=2807, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 13:45:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-13 13:45:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 307. [2018-04-13 13:45:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-13 13:45:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-04-13 13:45:50,881 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 297 [2018-04-13 13:45:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:50,882 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-04-13 13:45:50,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 13:45:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-04-13 13:45:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-04-13 13:45:50,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:50,883 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:50,883 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1504357946, now seen corresponding path program 43 times [2018-04-13 13:45:50,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:50,883 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:50,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:50,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:50,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:50,891 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5300 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-04-13 13:45:51,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:51,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:51,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:51,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5300 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-04-13 13:45:51,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:51,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-04-13 13:45:51,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 13:45:51,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 13:45:51,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 13:45:51,398 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 47 states. [2018-04-13 13:45:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:51,626 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2018-04-13 13:45:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 13:45:51,626 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 306 [2018-04-13 13:45:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:51,627 INFO L225 Difference]: With dead ends: 422 [2018-04-13 13:45:51,627 INFO L226 Difference]: Without dead ends: 422 [2018-04-13 13:45:51,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 13:45:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-13 13:45:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 311. [2018-04-13 13:45:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-13 13:45:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-04-13 13:45:51,630 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-04-13 13:45:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:51,630 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-04-13 13:45:51,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 13:45:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-04-13 13:45:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-13 13:45:51,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:51,631 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:51,631 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 235456127, now seen corresponding path program 44 times [2018-04-13 13:45:51,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:51,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:51,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:51,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:51,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:51,639 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-04-13 13:45:52,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:52,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:45:52,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:45:52,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:52,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-04-13 13:45:52,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:52,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-13 13:45:52,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 13:45:52,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 13:45:52,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 13:45:52,178 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 48 states. [2018-04-13 13:45:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:52,449 INFO L93 Difference]: Finished difference Result 431 states and 453 transitions. [2018-04-13 13:45:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 13:45:52,449 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 310 [2018-04-13 13:45:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:52,450 INFO L225 Difference]: With dead ends: 431 [2018-04-13 13:45:52,450 INFO L226 Difference]: Without dead ends: 431 [2018-04-13 13:45:52,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 13:45:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-13 13:45:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 315. [2018-04-13 13:45:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-13 13:45:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-04-13 13:45:52,453 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-04-13 13:45:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:52,453 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-04-13 13:45:52,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 13:45:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-04-13 13:45:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-04-13 13:45:52,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:52,454 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:52,454 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -787401032, now seen corresponding path program 45 times [2018-04-13 13:45:52,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:52,455 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:52,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:52,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:52,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:52,462 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5660 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-04-13 13:45:52,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:52,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:52,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:45:53,004 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-04-13 13:45:53,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:53,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5660 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-04-13 13:45:53,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:53,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 27] total 51 [2018-04-13 13:45:53,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 13:45:53,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 13:45:53,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 13:45:53,076 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 51 states. [2018-04-13 13:45:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:53,533 INFO L93 Difference]: Finished difference Result 440 states and 462 transitions. [2018-04-13 13:45:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 13:45:53,533 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 314 [2018-04-13 13:45:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:53,534 INFO L225 Difference]: With dead ends: 440 [2018-04-13 13:45:53,534 INFO L226 Difference]: Without dead ends: 440 [2018-04-13 13:45:53,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2427, Invalid=3123, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 13:45:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-13 13:45:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 324. [2018-04-13 13:45:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-13 13:45:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-04-13 13:45:53,537 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 314 [2018-04-13 13:45:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:53,537 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-04-13 13:45:53,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 13:45:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-04-13 13:45:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-04-13 13:45:53,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:53,538 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:53,538 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1093061051, now seen corresponding path program 46 times [2018-04-13 13:45:53,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:53,539 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:53,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:53,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:53,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:53,546 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5968 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-04-13 13:45:54,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:54,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:54,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:45:54,047 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:45:54,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:54,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5968 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-04-13 13:45:54,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:54,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 27] total 76 [2018-04-13 13:45:54,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 13:45:54,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 13:45:54,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2200, Invalid=3500, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 13:45:54,244 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 76 states. [2018-04-13 13:45:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:55,708 INFO L93 Difference]: Finished difference Result 449 states and 471 transitions. [2018-04-13 13:45:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 13:45:55,708 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 323 [2018-04-13 13:45:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:55,709 INFO L225 Difference]: With dead ends: 449 [2018-04-13 13:45:55,709 INFO L226 Difference]: Without dead ends: 449 [2018-04-13 13:45:55,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2200, Invalid=3500, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 13:45:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-13 13:45:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 333. [2018-04-13 13:45:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-13 13:45:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-04-13 13:45:55,712 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 323 [2018-04-13 13:45:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:55,712 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-04-13 13:45:55,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 13:45:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-04-13 13:45:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 13:45:55,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:55,713 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:55,713 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash 782242986, now seen corresponding path program 47 times [2018-04-13 13:45:55,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:55,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:55,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:55,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:55,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:55,727 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6285 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-04-13 13:45:56,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:56,251 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:45:57,473 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-04-13 13:45:57,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:57,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6285 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-04-13 13:45:57,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:57,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-04-13 13:45:57,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 13:45:57,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 13:45:57,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 13:45:57,539 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 51 states. [2018-04-13 13:45:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:57,810 INFO L93 Difference]: Finished difference Result 458 states and 481 transitions. [2018-04-13 13:45:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 13:45:57,811 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 332 [2018-04-13 13:45:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:57,812 INFO L225 Difference]: With dead ends: 458 [2018-04-13 13:45:57,812 INFO L226 Difference]: Without dead ends: 458 [2018-04-13 13:45:57,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 13:45:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-13 13:45:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 337. [2018-04-13 13:45:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-13 13:45:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-13 13:45:57,814 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 332 [2018-04-13 13:45:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:57,814 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-13 13:45:57,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 13:45:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-13 13:45:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-04-13 13:45:57,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:57,816 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:57,816 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1279286237, now seen corresponding path program 48 times [2018-04-13 13:45:57,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:57,816 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:57,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:57,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:57,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:57,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6479 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-04-13 13:45:58,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:58,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:45:58,568 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-04-13 13:45:58,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:45:58,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6479 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-04-13 13:45:58,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:58,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 29] total 54 [2018-04-13 13:45:58,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 13:45:58,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 13:45:58,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1379, Invalid=1483, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 13:45:58,640 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 54 states. [2018-04-13 13:45:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:45:59,177 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-04-13 13:45:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 13:45:59,178 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 336 [2018-04-13 13:45:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:45:59,179 INFO L225 Difference]: With dead ends: 467 [2018-04-13 13:45:59,179 INFO L226 Difference]: Without dead ends: 467 [2018-04-13 13:45:59,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2757, Invalid=3563, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 13:45:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-13 13:45:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 346. [2018-04-13 13:45:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-13 13:45:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2018-04-13 13:45:59,181 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 336 [2018-04-13 13:45:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:45:59,182 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2018-04-13 13:45:59,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 13:45:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2018-04-13 13:45:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-04-13 13:45:59,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:45:59,183 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:45:59,183 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:45:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 820187120, now seen corresponding path program 49 times [2018-04-13 13:45:59,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:45:59,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:45:59,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:59,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:45:59,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:45:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:59,191 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:45:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6809 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-04-13 13:45:59,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:45:59,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:45:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:45:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:45:59,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:45:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6809 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-04-13 13:45:59,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:45:59,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-04-13 13:45:59,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 13:45:59,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 13:45:59,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 13:45:59,832 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 53 states. [2018-04-13 13:46:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:00,189 INFO L93 Difference]: Finished difference Result 476 states and 500 transitions. [2018-04-13 13:46:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 13:46:00,189 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 345 [2018-04-13 13:46:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:00,190 INFO L225 Difference]: With dead ends: 476 [2018-04-13 13:46:00,190 INFO L226 Difference]: Without dead ends: 476 [2018-04-13 13:46:00,191 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 13:46:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-13 13:46:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 350. [2018-04-13 13:46:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-13 13:46:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-04-13 13:46:00,194 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 345 [2018-04-13 13:46:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:00,194 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-04-13 13:46:00,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 13:46:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-04-13 13:46:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-04-13 13:46:00,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:00,196 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:00,196 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -610783977, now seen corresponding path program 50 times [2018-04-13 13:46:00,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:00,197 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:00,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:00,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:00,209 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7011 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-04-13 13:46:00,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:00,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:46:00,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:46:00,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:00,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7011 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-04-13 13:46:00,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:00,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 30] total 60 [2018-04-13 13:46:00,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 13:46:00,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 13:46:00,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1608, Invalid=1932, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 13:46:00,917 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 60 states. [2018-04-13 13:46:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:01,652 INFO L93 Difference]: Finished difference Result 485 states and 509 transitions. [2018-04-13 13:46:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 13:46:01,653 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 349 [2018-04-13 13:46:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:01,654 INFO L225 Difference]: With dead ends: 485 [2018-04-13 13:46:01,654 INFO L226 Difference]: Without dead ends: 485 [2018-04-13 13:46:01,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3083, Invalid=4399, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 13:46:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-13 13:46:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 359. [2018-04-13 13:46:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-13 13:46:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-04-13 13:46:01,656 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2018-04-13 13:46:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:01,656 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-04-13 13:46:01,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 13:46:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-04-13 13:46:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-13 13:46:01,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:01,658 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:01,658 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1295911538, now seen corresponding path program 51 times [2018-04-13 13:46:01,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:01,658 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:01,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:01,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:01,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:01,666 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7354 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-04-13 13:46:02,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:02,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:46:02,612 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-04-13 13:46:02,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:02,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7354 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-04-13 13:46:02,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:02,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 31] total 57 [2018-04-13 13:46:02,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 13:46:02,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 13:46:02,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1652, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 13:46:02,703 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 57 states. [2018-04-13 13:46:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:03,428 INFO L93 Difference]: Finished difference Result 494 states and 518 transitions. [2018-04-13 13:46:03,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 13:46:03,428 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 358 [2018-04-13 13:46:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:03,429 INFO L225 Difference]: With dead ends: 494 [2018-04-13 13:46:03,429 INFO L226 Difference]: Without dead ends: 494 [2018-04-13 13:46:03,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3108, Invalid=4032, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 13:46:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-13 13:46:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 368. [2018-04-13 13:46:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-13 13:46:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2018-04-13 13:46:03,432 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 358 [2018-04-13 13:46:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:03,432 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2018-04-13 13:46:03,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 13:46:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2018-04-13 13:46:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-13 13:46:03,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:03,433 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:03,433 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:03,433 INFO L82 PathProgramCache]: Analyzing trace with hash -787029467, now seen corresponding path program 52 times [2018-04-13 13:46:03,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:03,433 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:03,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:03,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:03,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:03,441 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7706 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-04-13 13:46:04,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:04,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:46:04,093 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:46:04,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:04,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7706 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-04-13 13:46:04,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:04,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-04-13 13:46:04,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 13:46:04,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 13:46:04,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 13:46:04,147 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 56 states. [2018-04-13 13:46:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:04,546 INFO L93 Difference]: Finished difference Result 503 states and 528 transitions. [2018-04-13 13:46:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 13:46:04,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 367 [2018-04-13 13:46:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:04,548 INFO L225 Difference]: With dead ends: 503 [2018-04-13 13:46:04,548 INFO L226 Difference]: Without dead ends: 503 [2018-04-13 13:46:04,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 13:46:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-13 13:46:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 372. [2018-04-13 13:46:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-13 13:46:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 373 transitions. [2018-04-13 13:46:04,550 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 373 transitions. Word has length 367 [2018-04-13 13:46:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:04,551 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 373 transitions. [2018-04-13 13:46:04,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 13:46:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 373 transitions. [2018-04-13 13:46:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-04-13 13:46:04,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:04,552 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:04,552 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1106679820, now seen corresponding path program 53 times [2018-04-13 13:46:04,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:04,552 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:04,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:04,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:04,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:04,560 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7920 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-04-13 13:46:05,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:05,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:46:07,581 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-04-13 13:46:07,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:07,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7920 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-04-13 13:46:07,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:07,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-04-13 13:46:07,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 13:46:07,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 13:46:07,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 13:46:07,668 INFO L87 Difference]: Start difference. First operand 372 states and 373 transitions. Second operand 57 states. [2018-04-13 13:46:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:08,048 INFO L93 Difference]: Finished difference Result 512 states and 538 transitions. [2018-04-13 13:46:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 13:46:08,048 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 371 [2018-04-13 13:46:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:08,049 INFO L225 Difference]: With dead ends: 512 [2018-04-13 13:46:08,050 INFO L226 Difference]: Without dead ends: 512 [2018-04-13 13:46:08,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 13:46:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-13 13:46:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 376. [2018-04-13 13:46:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-13 13:46:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2018-04-13 13:46:08,052 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 371 [2018-04-13 13:46:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:08,052 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2018-04-13 13:46:08,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 13:46:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2018-04-13 13:46:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-04-13 13:46:08,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:08,053 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:08,054 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 782959219, now seen corresponding path program 54 times [2018-04-13 13:46:08,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:08,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:08,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:08,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:08,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:08,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8138 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-04-13 13:46:08,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:08,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:08,728 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:46:08,816 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-04-13 13:46:08,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:08,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8138 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-04-13 13:46:08,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:08,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 32] total 60 [2018-04-13 13:46:08,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 13:46:08,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 13:46:08,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1712, Invalid=1828, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 13:46:08,897 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 60 states. [2018-04-13 13:46:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:09,573 INFO L93 Difference]: Finished difference Result 521 states and 547 transitions. [2018-04-13 13:46:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 13:46:09,573 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 375 [2018-04-13 13:46:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:09,574 INFO L225 Difference]: With dead ends: 521 [2018-04-13 13:46:09,574 INFO L226 Difference]: Without dead ends: 521 [2018-04-13 13:46:09,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3423, Invalid=4409, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 13:46:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-13 13:46:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 385. [2018-04-13 13:46:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 13:46:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-13 13:46:09,577 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 375 [2018-04-13 13:46:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:09,577 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-13 13:46:09,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 13:46:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-13 13:46:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-13 13:46:09,578 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:09,578 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:09,578 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:09,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1181594738, now seen corresponding path program 55 times [2018-04-13 13:46:09,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:09,578 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:09,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:09,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:09,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:09,587 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-04-13 13:46:10,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:10,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:10,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-04-13 13:46:10,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:10,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-13 13:46:10,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 13:46:10,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 13:46:10,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 13:46:10,348 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 59 states. [2018-04-13 13:46:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:10,771 INFO L93 Difference]: Finished difference Result 530 states and 557 transitions. [2018-04-13 13:46:10,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 13:46:10,771 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 384 [2018-04-13 13:46:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:10,772 INFO L225 Difference]: With dead ends: 530 [2018-04-13 13:46:10,772 INFO L226 Difference]: Without dead ends: 530 [2018-04-13 13:46:10,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 13:46:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-13 13:46:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 389. [2018-04-13 13:46:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-13 13:46:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-04-13 13:46:10,774 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-04-13 13:46:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:10,774 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-04-13 13:46:10,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 13:46:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-04-13 13:46:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-13 13:46:10,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:10,776 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:10,776 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1408346475, now seen corresponding path program 56 times [2018-04-13 13:46:10,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:10,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:10,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:10,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:10,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:10,785 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8733 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-04-13 13:46:11,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:11,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:46:11,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:46:11,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:11,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8733 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-04-13 13:46:11,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:11,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 33] total 69 [2018-04-13 13:46:11,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 13:46:11,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 13:46:11,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2076, Invalid=2616, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 13:46:11,659 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 69 states. [2018-04-13 13:46:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:12,660 INFO L93 Difference]: Finished difference Result 539 states and 566 transitions. [2018-04-13 13:46:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 13:46:12,660 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 388 [2018-04-13 13:46:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:12,661 INFO L225 Difference]: With dead ends: 539 [2018-04-13 13:46:12,662 INFO L226 Difference]: Without dead ends: 539 [2018-04-13 13:46:12,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3878, Invalid=5824, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 13:46:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-13 13:46:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 398. [2018-04-13 13:46:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-13 13:46:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 399 transitions. [2018-04-13 13:46:12,665 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 399 transitions. Word has length 388 [2018-04-13 13:46:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:12,665 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 399 transitions. [2018-04-13 13:46:12,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 13:46:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 399 transitions. [2018-04-13 13:46:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-13 13:46:12,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:12,666 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:12,666 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:12,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1451302360, now seen corresponding path program 57 times [2018-04-13 13:46:12,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:12,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:12,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:12,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:12,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:12,675 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9115 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-04-13 13:46:13,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:13,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:13,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:46:13,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-04-13 13:46:13,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:13,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9115 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-04-13 13:46:13,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:13,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 34] total 63 [2018-04-13 13:46:13,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 13:46:13,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 13:46:13,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=2015, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 13:46:13,589 INFO L87 Difference]: Start difference. First operand 398 states and 399 transitions. Second operand 63 states. [2018-04-13 13:46:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:14,314 INFO L93 Difference]: Finished difference Result 548 states and 575 transitions. [2018-04-13 13:46:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 13:46:14,314 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 397 [2018-04-13 13:46:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:14,315 INFO L225 Difference]: With dead ends: 548 [2018-04-13 13:46:14,315 INFO L226 Difference]: Without dead ends: 548 [2018-04-13 13:46:14,316 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3813, Invalid=4929, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 13:46:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-13 13:46:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 407. [2018-04-13 13:46:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-13 13:46:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-04-13 13:46:14,319 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2018-04-13 13:46:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:14,319 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-04-13 13:46:14,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 13:46:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-04-13 13:46:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-04-13 13:46:14,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:14,320 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:14,320 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -947712739, now seen corresponding path program 58 times [2018-04-13 13:46:14,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:14,320 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:14,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:14,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:14,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:14,329 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-04-13 13:46:15,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:15,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:15,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:46:15,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:46:15,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:15,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-04-13 13:46:15,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:15,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-04-13 13:46:15,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 13:46:15,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 13:46:15,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 13:46:15,212 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 62 states. [2018-04-13 13:46:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:15,703 INFO L93 Difference]: Finished difference Result 557 states and 585 transitions. [2018-04-13 13:46:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 13:46:15,703 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 406 [2018-04-13 13:46:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:15,704 INFO L225 Difference]: With dead ends: 557 [2018-04-13 13:46:15,704 INFO L226 Difference]: Without dead ends: 557 [2018-04-13 13:46:15,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 13:46:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-13 13:46:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 411. [2018-04-13 13:46:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-04-13 13:46:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-04-13 13:46:15,708 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 406 [2018-04-13 13:46:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:15,708 INFO L459 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-04-13 13:46:15,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 13:46:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-04-13 13:46:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-04-13 13:46:15,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:15,709 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:15,709 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -250212010, now seen corresponding path program 59 times [2018-04-13 13:46:15,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:15,710 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:15,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:15,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:15,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:15,719 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9744 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-04-13 13:46:16,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:16,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:16,567 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:46:26,503 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-04-13 13:46:26,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:26,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9744 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-04-13 13:46:26,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:26,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-04-13 13:46:26,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 13:46:26,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 13:46:26,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 13:46:26,626 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 63 states. [2018-04-13 13:46:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:27,151 INFO L93 Difference]: Finished difference Result 566 states and 595 transitions. [2018-04-13 13:46:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 13:46:27,151 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 410 [2018-04-13 13:46:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:27,152 INFO L225 Difference]: With dead ends: 566 [2018-04-13 13:46:27,152 INFO L226 Difference]: Without dead ends: 566 [2018-04-13 13:46:27,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 13:46:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-13 13:46:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 415. [2018-04-13 13:46:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-13 13:46:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-04-13 13:46:27,155 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 410 [2018-04-13 13:46:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:27,155 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-04-13 13:46:27,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 13:46:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-04-13 13:46:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-04-13 13:46:27,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:27,156 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:27,157 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1420448015, now seen corresponding path program 60 times [2018-04-13 13:46:27,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:27,157 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:27,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:27,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:27,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:27,166 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9986 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-04-13 13:46:27,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:27,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:46:28,151 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2018-04-13 13:46:28,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:28,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9986 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-04-13 13:46:28,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:28,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 35] total 66 [2018-04-13 13:46:28,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 13:46:28,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 13:46:28,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 13:46:28,245 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 66 states. [2018-04-13 13:46:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:29,029 INFO L93 Difference]: Finished difference Result 575 states and 604 transitions. [2018-04-13 13:46:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 13:46:29,030 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 414 [2018-04-13 13:46:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:29,031 INFO L225 Difference]: With dead ends: 575 [2018-04-13 13:46:29,031 INFO L226 Difference]: Without dead ends: 575 [2018-04-13 13:46:29,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4161, Invalid=5345, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 13:46:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-13 13:46:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 424. [2018-04-13 13:46:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-13 13:46:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2018-04-13 13:46:29,034 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 414 [2018-04-13 13:46:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:29,034 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2018-04-13 13:46:29,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 13:46:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2018-04-13 13:46:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-04-13 13:46:29,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:29,036 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:29,036 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1521036868, now seen corresponding path program 61 times [2018-04-13 13:46:29,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:29,036 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:29,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:29,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:29,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:29,045 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10394 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-04-13 13:46:29,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:29,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:29,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:29,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10394 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-04-13 13:46:30,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:30,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-13 13:46:30,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 13:46:30,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 13:46:30,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 13:46:30,041 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 65 states. [2018-04-13 13:46:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:30,476 INFO L93 Difference]: Finished difference Result 584 states and 614 transitions. [2018-04-13 13:46:30,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 13:46:30,476 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 423 [2018-04-13 13:46:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:30,477 INFO L225 Difference]: With dead ends: 584 [2018-04-13 13:46:30,477 INFO L226 Difference]: Without dead ends: 584 [2018-04-13 13:46:30,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 13:46:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-04-13 13:46:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 428. [2018-04-13 13:46:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-13 13:46:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-04-13 13:46:30,480 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 423 [2018-04-13 13:46:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:30,480 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-04-13 13:46:30,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 13:46:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-04-13 13:46:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-13 13:46:30,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:30,482 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:30,482 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash 897188651, now seen corresponding path program 62 times [2018-04-13 13:46:30,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:30,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:30,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:30,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:30,491 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10644 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-04-13 13:46:31,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:31,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:46:31,360 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:46:31,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:31,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10644 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-04-13 13:46:31,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:31,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 35] total 100 [2018-04-13 13:46:31,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 13:46:31,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 13:46:31,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=6072, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 13:46:31,688 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 100 states. [2018-04-13 13:46:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:33,252 INFO L93 Difference]: Finished difference Result 593 states and 623 transitions. [2018-04-13 13:46:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 13:46:33,252 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 427 [2018-04-13 13:46:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:33,254 INFO L225 Difference]: With dead ends: 593 [2018-04-13 13:46:33,254 INFO L226 Difference]: Without dead ends: 593 [2018-04-13 13:46:33,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3828, Invalid=6072, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 13:46:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-13 13:46:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 437. [2018-04-13 13:46:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-13 13:46:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-04-13 13:46:33,257 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 427 [2018-04-13 13:46:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:33,258 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-04-13 13:46:33,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 13:46:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-04-13 13:46:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-13 13:46:33,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:33,259 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:33,259 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:33,260 INFO L82 PathProgramCache]: Analyzing trace with hash 569232442, now seen corresponding path program 63 times [2018-04-13 13:46:33,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:33,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:33,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:33,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:33,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:33,270 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 11065 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-04-13 13:46:34,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:34,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:34,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:46:34,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-04-13 13:46:34,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:34,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11065 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-04-13 13:46:34,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:34,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 37] total 69 [2018-04-13 13:46:34,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 13:46:34,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 13:46:34,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2414, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 13:46:34,388 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 69 states. [2018-04-13 13:46:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:35,238 INFO L93 Difference]: Finished difference Result 602 states and 632 transitions. [2018-04-13 13:46:35,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 13:46:35,238 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 436 [2018-04-13 13:46:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:35,239 INFO L225 Difference]: With dead ends: 602 [2018-04-13 13:46:35,240 INFO L226 Difference]: Without dead ends: 602 [2018-04-13 13:46:35,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4590, Invalid=5916, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 13:46:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-04-13 13:46:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 446. [2018-04-13 13:46:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-13 13:46:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2018-04-13 13:46:35,243 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 436 [2018-04-13 13:46:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:35,243 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2018-04-13 13:46:35,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 13:46:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2018-04-13 13:46:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-04-13 13:46:35,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:35,245 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:35,245 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 40345273, now seen corresponding path program 64 times [2018-04-13 13:46:35,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:35,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:35,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:35,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:35,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:35,263 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11495 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-04-13 13:46:36,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:36,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:46:36,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:46:36,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:36,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11495 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-04-13 13:46:36,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:36,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-04-13 13:46:36,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 13:46:36,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 13:46:36,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 13:46:36,286 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 68 states. [2018-04-13 13:46:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:36,901 INFO L93 Difference]: Finished difference Result 611 states and 642 transitions. [2018-04-13 13:46:36,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 13:46:36,902 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 445 [2018-04-13 13:46:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:36,903 INFO L225 Difference]: With dead ends: 611 [2018-04-13 13:46:36,903 INFO L226 Difference]: Without dead ends: 611 [2018-04-13 13:46:36,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 13:46:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-04-13 13:46:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 450. [2018-04-13 13:46:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-13 13:46:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 451 transitions. [2018-04-13 13:46:36,906 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 451 transitions. Word has length 445 [2018-04-13 13:46:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:36,906 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 451 transitions. [2018-04-13 13:46:36,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 13:46:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 451 transitions. [2018-04-13 13:46:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-04-13 13:46:36,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:36,907 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:36,908 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -421348256, now seen corresponding path program 65 times [2018-04-13 13:46:36,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:36,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:36,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:36,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:36,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:36,918 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11757 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-04-13 13:46:37,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:37,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:37,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:46:45,631 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2018-04-13 13:46:45,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:45,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11757 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-04-13 13:46:46,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:46,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 38] total 105 [2018-04-13 13:46:46,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-13 13:46:46,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-13 13:46:46,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4200, Invalid=6720, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 13:46:46,154 INFO L87 Difference]: Start difference. First operand 450 states and 451 transitions. Second operand 105 states. [2018-04-13 13:46:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:48,967 INFO L93 Difference]: Finished difference Result 620 states and 651 transitions. [2018-04-13 13:46:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 13:46:48,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 449 [2018-04-13 13:46:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:48,968 INFO L225 Difference]: With dead ends: 620 [2018-04-13 13:46:48,968 INFO L226 Difference]: Without dead ends: 620 [2018-04-13 13:46:48,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4200, Invalid=6720, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 13:46:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-04-13 13:46:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 459. [2018-04-13 13:46:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-13 13:46:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2018-04-13 13:46:48,971 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 449 [2018-04-13 13:46:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:48,971 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 460 transitions. [2018-04-13 13:46:48,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-13 13:46:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 460 transitions. [2018-04-13 13:46:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-04-13 13:46:48,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:48,973 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:48,973 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 821893989, now seen corresponding path program 66 times [2018-04-13 13:46:48,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:48,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:48,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:48,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:48,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:48,983 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12200 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-04-13 13:46:49,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:49,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:49,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:46:50,093 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-04-13 13:46:50,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:50,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12200 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-04-13 13:46:50,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:50,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 39] total 72 [2018-04-13 13:46:50,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 13:46:50,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 13:46:50,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2484, Invalid=2628, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 13:46:50,238 INFO L87 Difference]: Start difference. First operand 459 states and 460 transitions. Second operand 72 states. [2018-04-13 13:46:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:51,193 INFO L93 Difference]: Finished difference Result 629 states and 660 transitions. [2018-04-13 13:46:51,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 13:46:51,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 458 [2018-04-13 13:46:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:51,238 INFO L225 Difference]: With dead ends: 629 [2018-04-13 13:46:51,238 INFO L226 Difference]: Without dead ends: 629 [2018-04-13 13:46:51,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=5040, Invalid=6516, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 13:46:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-13 13:46:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 468. [2018-04-13 13:46:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-13 13:46:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 469 transitions. [2018-04-13 13:46:51,241 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 469 transitions. Word has length 458 [2018-04-13 13:46:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:51,241 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 469 transitions. [2018-04-13 13:46:51,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 13:46:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 469 transitions. [2018-04-13 13:46:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-13 13:46:51,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:51,243 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:51,243 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -77354194, now seen corresponding path program 67 times [2018-04-13 13:46:51,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:51,243 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:51,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:51,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:51,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:51,253 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12652 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-04-13 13:46:52,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:52,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:52,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:52,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12652 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-04-13 13:46:52,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:52,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-04-13 13:46:52,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 13:46:52,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 13:46:52,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 13:46:52,311 INFO L87 Difference]: Start difference. First operand 468 states and 469 transitions. Second operand 71 states. [2018-04-13 13:46:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:53,036 INFO L93 Difference]: Finished difference Result 638 states and 670 transitions. [2018-04-13 13:46:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 13:46:53,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 467 [2018-04-13 13:46:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:53,038 INFO L225 Difference]: With dead ends: 638 [2018-04-13 13:46:53,038 INFO L226 Difference]: Without dead ends: 638 [2018-04-13 13:46:53,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 13:46:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-13 13:46:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 472. [2018-04-13 13:46:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-13 13:46:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2018-04-13 13:46:53,041 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 467 [2018-04-13 13:46:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:53,041 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2018-04-13 13:46:53,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 13:46:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2018-04-13 13:46:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-04-13 13:46:53,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:53,043 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:53,043 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2041183851, now seen corresponding path program 68 times [2018-04-13 13:46:53,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:53,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:53,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:46:53,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:53,053 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12926 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-04-13 13:46:54,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:54,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:54,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:46:54,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:46:54,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:54,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12926 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-04-13 13:46:54,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:54,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-13 13:46:54,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 13:46:54,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 13:46:54,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 13:46:54,187 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 72 states. [2018-04-13 13:46:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:54,864 INFO L93 Difference]: Finished difference Result 647 states and 680 transitions. [2018-04-13 13:46:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 13:46:54,864 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 471 [2018-04-13 13:46:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:54,865 INFO L225 Difference]: With dead ends: 647 [2018-04-13 13:46:54,865 INFO L226 Difference]: Without dead ends: 647 [2018-04-13 13:46:54,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 13:46:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-04-13 13:46:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 476. [2018-04-13 13:46:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-04-13 13:46:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 477 transitions. [2018-04-13 13:46:54,868 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 477 transitions. Word has length 471 [2018-04-13 13:46:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:54,868 INFO L459 AbstractCegarLoop]: Abstraction has 476 states and 477 transitions. [2018-04-13 13:46:54,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 13:46:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 477 transitions. [2018-04-13 13:46:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-04-13 13:46:54,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:54,870 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:54,870 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash 165203068, now seen corresponding path program 69 times [2018-04-13 13:46:54,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:54,870 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:54,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:54,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:54,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:54,880 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13204 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-04-13 13:46:55,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:55,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:46:56,004 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-04-13 13:46:56,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:56,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13204 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-04-13 13:46:56,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:56,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 40] total 75 [2018-04-13 13:46:56,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 13:46:56,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 13:46:56,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2849, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 13:46:56,145 INFO L87 Difference]: Start difference. First operand 476 states and 477 transitions. Second operand 75 states. [2018-04-13 13:46:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:57,122 INFO L93 Difference]: Finished difference Result 656 states and 689 transitions. [2018-04-13 13:46:57,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 13:46:57,122 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 475 [2018-04-13 13:46:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:57,124 INFO L225 Difference]: With dead ends: 656 [2018-04-13 13:46:57,124 INFO L226 Difference]: Without dead ends: 656 [2018-04-13 13:46:57,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=5439, Invalid=6993, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 13:46:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-04-13 13:46:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 485. [2018-04-13 13:46:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-13 13:46:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-04-13 13:46:57,127 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 475 [2018-04-13 13:46:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:57,127 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-04-13 13:46:57,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 13:46:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-04-13 13:46:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-04-13 13:46:57,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:57,129 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:57,129 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 29357961, now seen corresponding path program 70 times [2018-04-13 13:46:57,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:57,129 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:57,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:57,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:57,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:57,139 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:46:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13673 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-04-13 13:46:58,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:46:58,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:46:58,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:46:58,230 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:46:58,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:46:58,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:46:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13673 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-04-13 13:46:58,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:46:58,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-04-13 13:46:58,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 13:46:58,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 13:46:58,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 13:46:58,321 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 74 states. [2018-04-13 13:46:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:46:59,139 INFO L93 Difference]: Finished difference Result 665 states and 699 transitions. [2018-04-13 13:46:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 13:46:59,139 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 484 [2018-04-13 13:46:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:46:59,140 INFO L225 Difference]: With dead ends: 665 [2018-04-13 13:46:59,140 INFO L226 Difference]: Without dead ends: 665 [2018-04-13 13:46:59,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 13:46:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-13 13:46:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 489. [2018-04-13 13:46:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-04-13 13:46:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-04-13 13:46:59,143 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 484 [2018-04-13 13:46:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:46:59,143 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-04-13 13:46:59,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 13:46:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-04-13 13:46:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-04-13 13:46:59,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:46:59,145 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:46:59,145 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:46:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1850319870, now seen corresponding path program 71 times [2018-04-13 13:46:59,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:46:59,145 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:46:59,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:59,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:46:59,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:46:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:46:59,156 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13959 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-04-13 13:47:00,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:00,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:00,245 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:47:12,338 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2018-04-13 13:47:12,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:47:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:47:12,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 13:47:12,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 13:47:12,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 13:47:12,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 13:47:12,641 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 75 states. [2018-04-13 13:47:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:13,463 INFO L93 Difference]: Finished difference Result 674 states and 709 transitions. [2018-04-13 13:47:13,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 13:47:13,463 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 488 [2018-04-13 13:47:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:13,464 INFO L225 Difference]: With dead ends: 674 [2018-04-13 13:47:13,464 INFO L226 Difference]: Without dead ends: 674 [2018-04-13 13:47:13,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 13:47:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-13 13:47:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 493. [2018-04-13 13:47:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-13 13:47:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-04-13 13:47:13,467 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 488 [2018-04-13 13:47:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:13,467 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-04-13 13:47:13,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 13:47:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-04-13 13:47:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-13 13:47:13,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:13,469 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:13,469 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1098654725, now seen corresponding path program 72 times [2018-04-13 13:47:13,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:13,469 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:13,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:13,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:13,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:13,481 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14249 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-04-13 13:47:14,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:14,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:14,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:47:15,156 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 74 check-sat command(s) [2018-04-13 13:47:15,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:15,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14249 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-04-13 13:47:15,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:15,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 41] total 78 [2018-04-13 13:47:15,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 13:47:15,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 13:47:15,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2927, Invalid=3079, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 13:47:15,275 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 78 states. [2018-04-13 13:47:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:16,321 INFO L93 Difference]: Finished difference Result 683 states and 718 transitions. [2018-04-13 13:47:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 13:47:16,344 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 492 [2018-04-13 13:47:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:16,345 INFO L225 Difference]: With dead ends: 683 [2018-04-13 13:47:16,345 INFO L226 Difference]: Without dead ends: 683 [2018-04-13 13:47:16,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5853, Invalid=7487, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 13:47:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-13 13:47:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 502. [2018-04-13 13:47:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-04-13 13:47:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2018-04-13 13:47:16,348 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 492 [2018-04-13 13:47:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:16,349 INFO L459 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2018-04-13 13:47:16,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 13:47:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2018-04-13 13:47:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-04-13 13:47:16,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:16,350 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:16,350 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash 897097368, now seen corresponding path program 73 times [2018-04-13 13:47:16,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:16,350 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:16,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:16,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:16,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:16,362 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14735 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-04-13 13:47:17,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:17,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:17,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:47:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:17,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14735 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-04-13 13:47:17,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:17,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-04-13 13:47:17,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 13:47:17,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 13:47:17,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 13:47:17,662 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 77 states. [2018-04-13 13:47:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:18,607 INFO L93 Difference]: Finished difference Result 692 states and 728 transitions. [2018-04-13 13:47:18,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 13:47:18,608 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 501 [2018-04-13 13:47:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:18,609 INFO L225 Difference]: With dead ends: 692 [2018-04-13 13:47:18,609 INFO L226 Difference]: Without dead ends: 692 [2018-04-13 13:47:18,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 13:47:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-04-13 13:47:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 506. [2018-04-13 13:47:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-13 13:47:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 507 transitions. [2018-04-13 13:47:18,612 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 507 transitions. Word has length 501 [2018-04-13 13:47:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:18,612 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 507 transitions. [2018-04-13 13:47:18,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 13:47:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 507 transitions. [2018-04-13 13:47:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-04-13 13:47:18,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:18,614 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:18,614 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1249207489, now seen corresponding path program 74 times [2018-04-13 13:47:18,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:18,614 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:18,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:47:18,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:18,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15033 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-04-13 13:47:19,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:19,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:47:19,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:47:19,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:19,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15033 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-04-13 13:47:20,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:20,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 42] total 83 [2018-04-13 13:47:20,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 13:47:20,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 13:47:20,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3208, Invalid=3598, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 13:47:20,031 INFO L87 Difference]: Start difference. First operand 506 states and 507 transitions. Second operand 83 states. [2018-04-13 13:47:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:21,330 INFO L93 Difference]: Finished difference Result 701 states and 737 transitions. [2018-04-13 13:47:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 13:47:21,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 505 [2018-04-13 13:47:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:21,361 INFO L225 Difference]: With dead ends: 701 [2018-04-13 13:47:21,362 INFO L226 Difference]: Without dead ends: 701 [2018-04-13 13:47:21,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6283, Invalid=8479, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 13:47:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-13 13:47:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 515. [2018-04-13 13:47:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-04-13 13:47:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2018-04-13 13:47:21,365 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 505 [2018-04-13 13:47:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:21,365 INFO L459 AbstractCegarLoop]: Abstraction has 515 states and 516 transitions. [2018-04-13 13:47:21,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 13:47:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 516 transitions. [2018-04-13 13:47:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-13 13:47:21,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:21,367 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:21,367 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash -909332250, now seen corresponding path program 75 times [2018-04-13 13:47:21,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:21,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:21,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:21,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:21,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:21,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15532 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 3980 trivial. 0 not checked. [2018-04-13 13:47:22,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:22,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:47:22,738 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-04-13 13:47:22,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:22,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15532 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2018-04-13 13:47:22,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:22,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 43] total 81 [2018-04-13 13:47:22,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 13:47:22,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 13:47:22,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3320, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 13:47:22,871 INFO L87 Difference]: Start difference. First operand 515 states and 516 transitions. Second operand 81 states. [2018-04-13 13:47:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:23,999 INFO L93 Difference]: Finished difference Result 710 states and 746 transitions. [2018-04-13 13:47:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 13:47:23,999 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 514 [2018-04-13 13:47:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:24,001 INFO L225 Difference]: With dead ends: 710 [2018-04-13 13:47:24,001 INFO L226 Difference]: Without dead ends: 710 [2018-04-13 13:47:24,001 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=6360, Invalid=8160, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 13:47:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-13 13:47:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 524. [2018-04-13 13:47:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-13 13:47:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 525 transitions. [2018-04-13 13:47:24,004 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 525 transitions. Word has length 514 [2018-04-13 13:47:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:24,004 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 525 transitions. [2018-04-13 13:47:24,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 13:47:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 525 transitions. [2018-04-13 13:47:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-13 13:47:24,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:24,006 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:24,006 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 929529165, now seen corresponding path program 76 times [2018-04-13 13:47:24,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:24,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:24,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:24,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:24,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:24,018 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-04-13 13:47:25,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:25,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:25,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:47:25,366 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:47:25,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:25,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2018-04-13 13:47:25,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:25,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 43] total 122 [2018-04-13 13:47:25,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 13:47:25,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 13:47:25,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5659, Invalid=9103, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 13:47:25,863 INFO L87 Difference]: Start difference. First operand 524 states and 525 transitions. Second operand 122 states. [2018-04-13 13:47:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:28,550 INFO L93 Difference]: Finished difference Result 719 states and 755 transitions. [2018-04-13 13:47:28,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 13:47:28,550 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 523 [2018-04-13 13:47:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:28,552 INFO L225 Difference]: With dead ends: 719 [2018-04-13 13:47:28,552 INFO L226 Difference]: Without dead ends: 719 [2018-04-13 13:47:28,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6468 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5659, Invalid=9103, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 13:47:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-13 13:47:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 533. [2018-04-13 13:47:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-13 13:47:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 534 transitions. [2018-04-13 13:47:28,555 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 534 transitions. Word has length 523 [2018-04-13 13:47:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:28,555 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 534 transitions. [2018-04-13 13:47:28,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 13:47:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 534 transitions. [2018-04-13 13:47:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-13 13:47:28,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:28,557 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:28,557 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash -13964456, now seen corresponding path program 77 times [2018-04-13 13:47:28,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:28,557 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:28,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:28,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:28,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:28,621 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16557 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-04-13 13:47:29,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:29,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:29,887 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:47:30,067 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2018-04-13 13:47:30,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:30,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16557 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-04-13 13:47:30,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:30,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-04-13 13:47:30,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 13:47:30,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 13:47:30,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 13:47:30,175 INFO L87 Difference]: Start difference. First operand 533 states and 534 transitions. Second operand 81 states. [2018-04-13 13:47:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:30,927 INFO L93 Difference]: Finished difference Result 728 states and 765 transitions. [2018-04-13 13:47:30,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 13:47:30,928 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 532 [2018-04-13 13:47:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:30,929 INFO L225 Difference]: With dead ends: 728 [2018-04-13 13:47:30,929 INFO L226 Difference]: Without dead ends: 728 [2018-04-13 13:47:30,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 13:47:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-04-13 13:47:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 537. [2018-04-13 13:47:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-13 13:47:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-04-13 13:47:30,933 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 532 [2018-04-13 13:47:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:30,933 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-04-13 13:47:30,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 13:47:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-04-13 13:47:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-04-13 13:47:30,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:30,934 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:30,935 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash 324213201, now seen corresponding path program 78 times [2018-04-13 13:47:30,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:30,935 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:30,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:30,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:30,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:30,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16871 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-04-13 13:47:32,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:32,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:32,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:47:32,529 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2018-04-13 13:47:32,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:32,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16871 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2018-04-13 13:47:32,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:32,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 45] total 84 [2018-04-13 13:47:32,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 13:47:32,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 13:47:32,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3402, Invalid=3570, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 13:47:32,683 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 84 states. [2018-04-13 13:47:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:33,949 INFO L93 Difference]: Finished difference Result 737 states and 774 transitions. [2018-04-13 13:47:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 13:47:33,985 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 536 [2018-04-13 13:47:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:33,987 INFO L225 Difference]: With dead ends: 737 [2018-04-13 13:47:33,987 INFO L226 Difference]: Without dead ends: 737 [2018-04-13 13:47:33,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6888, Invalid=8862, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 13:47:33,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-13 13:47:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 546. [2018-04-13 13:47:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-04-13 13:47:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-04-13 13:47:33,990 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 536 [2018-04-13 13:47:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:33,990 INFO L459 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-04-13 13:47:33,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 13:47:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-04-13 13:47:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-13 13:47:33,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:33,992 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:33,992 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash -598329342, now seen corresponding path program 79 times [2018-04-13 13:47:33,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:33,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:33,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:33,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:33,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:34,005 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-04-13 13:47:35,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:35,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:35,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:47:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:35,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17401 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-04-13 13:47:35,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:35,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-04-13 13:47:35,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 13:47:35,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 13:47:35,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 13:47:35,559 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 83 states. [2018-04-13 13:47:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:36,599 INFO L93 Difference]: Finished difference Result 746 states and 784 transitions. [2018-04-13 13:47:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 13:47:36,600 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 545 [2018-04-13 13:47:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:36,601 INFO L225 Difference]: With dead ends: 746 [2018-04-13 13:47:36,601 INFO L226 Difference]: Without dead ends: 746 [2018-04-13 13:47:36,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 13:47:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-04-13 13:47:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 550. [2018-04-13 13:47:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-04-13 13:47:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 551 transitions. [2018-04-13 13:47:36,605 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 551 transitions. Word has length 545 [2018-04-13 13:47:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:36,605 INFO L459 AbstractCegarLoop]: Abstraction has 550 states and 551 transitions. [2018-04-13 13:47:36,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 13:47:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 551 transitions. [2018-04-13 13:47:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-04-13 13:47:36,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:36,607 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:36,607 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1698502185, now seen corresponding path program 80 times [2018-04-13 13:47:36,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:36,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:36,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:36,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:47:36,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:36,620 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17723 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-04-13 13:47:38,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:38,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:38,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:47:38,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:47:38,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:38,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17723 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-04-13 13:47:38,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:38,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-04-13 13:47:38,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-13 13:47:38,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-13 13:47:38,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 13:47:38,217 INFO L87 Difference]: Start difference. First operand 550 states and 551 transitions. Second operand 84 states. [2018-04-13 13:47:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:39,246 INFO L93 Difference]: Finished difference Result 755 states and 794 transitions. [2018-04-13 13:47:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 13:47:39,302 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 549 [2018-04-13 13:47:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:39,303 INFO L225 Difference]: With dead ends: 755 [2018-04-13 13:47:39,303 INFO L226 Difference]: Without dead ends: 755 [2018-04-13 13:47:39,304 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 13:47:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-04-13 13:47:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 554. [2018-04-13 13:47:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-13 13:47:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-04-13 13:47:39,306 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 549 [2018-04-13 13:47:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:39,307 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-04-13 13:47:39,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-13 13:47:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-04-13 13:47:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-04-13 13:47:39,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:39,309 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:39,309 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1168804048, now seen corresponding path program 81 times [2018-04-13 13:47:39,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:39,309 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:39,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:39,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:39,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:39,322 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18049 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-04-13 13:47:40,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:40,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:40,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:47:40,876 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-04-13 13:47:40,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:40,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18049 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2018-04-13 13:47:41,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:41,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 46] total 87 [2018-04-13 13:47:41,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 13:47:41,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 13:47:41,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3827, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 13:47:41,011 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 87 states. [2018-04-13 13:47:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:42,620 INFO L93 Difference]: Finished difference Result 764 states and 803 transitions. [2018-04-13 13:47:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 13:47:42,620 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 553 [2018-04-13 13:47:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:42,621 INFO L225 Difference]: With dead ends: 764 [2018-04-13 13:47:42,621 INFO L226 Difference]: Without dead ends: 764 [2018-04-13 13:47:42,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=7353, Invalid=9417, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 13:47:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-13 13:47:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 563. [2018-04-13 13:47:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-13 13:47:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 564 transitions. [2018-04-13 13:47:42,625 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 564 transitions. Word has length 553 [2018-04-13 13:47:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:42,625 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 564 transitions. [2018-04-13 13:47:42,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 13:47:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 564 transitions. [2018-04-13 13:47:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-04-13 13:47:42,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:42,627 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:42,627 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1993285643, now seen corresponding path program 82 times [2018-04-13 13:47:42,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:42,627 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:42,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:42,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:42,628 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:42,640 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18596 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 4818 trivial. 0 not checked. [2018-04-13 13:47:44,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:44,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:44,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:47:44,213 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:47:44,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:44,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18596 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 4818 trivial. 0 not checked. [2018-04-13 13:47:44,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:44,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-04-13 13:47:44,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 13:47:44,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 13:47:44,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 13:47:44,334 INFO L87 Difference]: Start difference. First operand 563 states and 564 transitions. Second operand 86 states. [2018-04-13 13:47:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:45,706 INFO L93 Difference]: Finished difference Result 773 states and 813 transitions. [2018-04-13 13:47:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 13:47:45,707 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 562 [2018-04-13 13:47:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:45,708 INFO L225 Difference]: With dead ends: 773 [2018-04-13 13:47:45,708 INFO L226 Difference]: Without dead ends: 773 [2018-04-13 13:47:45,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 13:47:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-13 13:47:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 567. [2018-04-13 13:47:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-04-13 13:47:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-04-13 13:47:45,711 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 562 [2018-04-13 13:47:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:45,711 INFO L459 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-04-13 13:47:45,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 13:47:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-04-13 13:47:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-04-13 13:47:45,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:45,713 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:45,713 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1654967122, now seen corresponding path program 83 times [2018-04-13 13:47:45,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:45,713 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:45,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:45,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:45,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:45,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18930 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 4818 trivial. 0 not checked. [2018-04-13 13:47:47,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:47,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:47,344 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:47:47,629 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-04-13 13:47:47,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:47,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18930 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2018-04-13 13:47:48,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:48,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 47] total 132 [2018-04-13 13:47:48,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-13 13:47:48,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-13 13:47:48,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6666, Invalid=10626, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 13:47:48,436 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 132 states. [2018-04-13 13:47:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:53,282 INFO L93 Difference]: Finished difference Result 782 states and 822 transitions. [2018-04-13 13:47:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 13:47:53,282 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 566 [2018-04-13 13:47:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:53,283 INFO L225 Difference]: With dead ends: 782 [2018-04-13 13:47:53,283 INFO L226 Difference]: Without dead ends: 782 [2018-04-13 13:47:53,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=6666, Invalid=10626, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 13:47:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-13 13:47:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 576. [2018-04-13 13:47:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-04-13 13:47:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2018-04-13 13:47:53,287 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 566 [2018-04-13 13:47:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:53,288 INFO L459 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2018-04-13 13:47:53,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-13 13:47:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2018-04-13 13:47:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-04-13 13:47:53,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:53,291 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:53,291 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash 164774149, now seen corresponding path program 84 times [2018-04-13 13:47:53,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:53,291 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:53,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:53,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:53,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:53,307 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19490 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-04-13 13:47:54,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:54,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:47:55,224 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-04-13 13:47:55,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:47:55,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19490 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2018-04-13 13:47:55,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:55,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 48] total 90 [2018-04-13 13:47:55,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 13:47:55,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 13:47:55,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3915, Invalid=4095, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 13:47:55,466 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 90 states. [2018-04-13 13:47:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:47:57,198 INFO L93 Difference]: Finished difference Result 791 states and 831 transitions. [2018-04-13 13:47:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 13:47:57,198 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 575 [2018-04-13 13:47:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:47:57,199 INFO L225 Difference]: With dead ends: 791 [2018-04-13 13:47:57,200 INFO L226 Difference]: Without dead ends: 791 [2018-04-13 13:47:57,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7920, Invalid=10170, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 13:47:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-04-13 13:47:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 585. [2018-04-13 13:47:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-04-13 13:47:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-04-13 13:47:57,204 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 575 [2018-04-13 13:47:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:47:57,204 INFO L459 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-04-13 13:47:57,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 13:47:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-04-13 13:47:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-04-13 13:47:57,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:47:57,206 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:47:57,206 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:47:57,206 INFO L82 PathProgramCache]: Analyzing trace with hash -420519904, now seen corresponding path program 85 times [2018-04-13 13:47:57,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:47:57,206 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:47:57,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:57,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:47:57,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:47:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:57,221 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:47:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20059 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-04-13 13:47:58,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:47:58,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:47:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:47:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:47:58,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:47:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20059 backedges. 0 proven. 14792 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-04-13 13:47:59,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:47:59,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-04-13 13:47:59,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 13:47:59,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 13:47:59,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 13:47:59,089 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand 89 states. [2018-04-13 13:48:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:00,537 INFO L93 Difference]: Finished difference Result 800 states and 841 transitions. [2018-04-13 13:48:00,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 13:48:00,538 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 584 [2018-04-13 13:48:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:00,539 INFO L225 Difference]: With dead ends: 800 [2018-04-13 13:48:00,539 INFO L226 Difference]: Without dead ends: 800 [2018-04-13 13:48:00,539 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 13:48:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-04-13 13:48:00,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 589. [2018-04-13 13:48:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-04-13 13:48:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 590 transitions. [2018-04-13 13:48:00,543 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 590 transitions. Word has length 584 [2018-04-13 13:48:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:00,543 INFO L459 AbstractCegarLoop]: Abstraction has 589 states and 590 transitions. [2018-04-13 13:48:00,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 13:48:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 590 transitions. [2018-04-13 13:48:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-04-13 13:48:00,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:00,545 INFO L355 BasicCegarLoop]: trace histogram [88, 87, 87, 87, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:00,545 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash 62551065, now seen corresponding path program 86 times [2018-04-13 13:48:00,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:00,545 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:00,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:48:00,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:00,559 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20405 backedges. 0 proven. 15138 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-04-13 13:48:02,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:02,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:48:02,653 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:48:02,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:02,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20405 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 15138 trivial. 0 not checked. [2018-04-13 13:48:02,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:02,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 49] total 99 [2018-04-13 13:48:02,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 13:48:02,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 13:48:02,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4437, Invalid=5265, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 13:48:02,905 INFO L87 Difference]: Start difference. First operand 589 states and 590 transitions. Second operand 99 states. [2018-04-13 13:48:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:05,214 INFO L93 Difference]: Finished difference Result 809 states and 850 transitions. [2018-04-13 13:48:05,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 13:48:05,214 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 588 [2018-04-13 13:48:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:05,215 INFO L225 Difference]: With dead ends: 809 [2018-04-13 13:48:05,215 INFO L226 Difference]: Without dead ends: 809 [2018-04-13 13:48:05,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8595, Invalid=12285, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 13:48:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-13 13:48:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 598. [2018-04-13 13:48:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-04-13 13:48:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 599 transitions. [2018-04-13 13:48:05,219 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 599 transitions. Word has length 588 [2018-04-13 13:48:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:05,219 INFO L459 AbstractCegarLoop]: Abstraction has 598 states and 599 transitions. [2018-04-13 13:48:05,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 13:48:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 599 transitions. [2018-04-13 13:48:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-13 13:48:05,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:05,221 INFO L355 BasicCegarLoop]: trace histogram [89, 88, 88, 88, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:05,221 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2015668934, now seen corresponding path program 87 times [2018-04-13 13:48:05,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:05,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:05,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:05,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:05,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:05,236 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20987 backedges. 0 proven. 15488 refuted. 0 times theorem prover too weak. 5499 trivial. 0 not checked. [2018-04-13 13:48:07,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:07,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:48:07,167 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-04-13 13:48:07,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:07,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20987 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2018-04-13 13:48:07,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:07,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 50] total 93 [2018-04-13 13:48:07,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 13:48:07,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 13:48:07,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4184, Invalid=4372, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 13:48:07,336 INFO L87 Difference]: Start difference. First operand 598 states and 599 transitions. Second operand 93 states. [2018-04-13 13:48:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:09,106 INFO L93 Difference]: Finished difference Result 818 states and 859 transitions. [2018-04-13 13:48:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 13:48:09,106 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 597 [2018-04-13 13:48:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:09,107 INFO L225 Difference]: With dead ends: 818 [2018-04-13 13:48:09,107 INFO L226 Difference]: Without dead ends: 818 [2018-04-13 13:48:09,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=8508, Invalid=10952, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 13:48:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-04-13 13:48:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 607. [2018-04-13 13:48:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-04-13 13:48:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-04-13 13:48:09,110 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 597 [2018-04-13 13:48:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:09,110 INFO L459 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-04-13 13:48:09,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 13:48:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-04-13 13:48:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-04-13 13:48:09,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:09,112 INFO L355 BasicCegarLoop]: trace histogram [90, 89, 89, 89, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:09,112 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:09,112 INFO L82 PathProgramCache]: Analyzing trace with hash -334818229, now seen corresponding path program 88 times [2018-04-13 13:48:09,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:09,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:09,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:09,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:09,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:09,125 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21578 backedges. 0 proven. 15842 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-04-13 13:48:10,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:10,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:10,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:48:11,015 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:48:11,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:11,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21578 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2018-04-13 13:48:11,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:11,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 50] total 141 [2018-04-13 13:48:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-13 13:48:11,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-13 13:48:11,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7518, Invalid=12222, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 13:48:11,758 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 141 states. [2018-04-13 13:48:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:16,375 INFO L93 Difference]: Finished difference Result 827 states and 868 transitions. [2018-04-13 13:48:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 13:48:16,375 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 606 [2018-04-13 13:48:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:16,376 INFO L225 Difference]: With dead ends: 827 [2018-04-13 13:48:16,376 INFO L226 Difference]: Without dead ends: 827 [2018-04-13 13:48:16,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7518, Invalid=12222, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 13:48:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-04-13 13:48:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 616. [2018-04-13 13:48:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-04-13 13:48:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 617 transitions. [2018-04-13 13:48:16,380 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 617 transitions. Word has length 606 [2018-04-13 13:48:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:16,380 INFO L459 AbstractCegarLoop]: Abstraction has 616 states and 617 transitions. [2018-04-13 13:48:16,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-13 13:48:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 617 transitions. [2018-04-13 13:48:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-04-13 13:48:16,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:16,383 INFO L355 BasicCegarLoop]: trace histogram [91, 90, 90, 90, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:16,383 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2096568184, now seen corresponding path program 89 times [2018-04-13 13:48:16,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:16,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:16,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:16,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:16,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:16,399 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22178 backedges. 0 proven. 16200 refuted. 0 times theorem prover too weak. 5978 trivial. 0 not checked. [2018-04-13 13:48:18,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:18,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:48:30,302 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 91 check-sat command(s) [2018-04-13 13:48:30,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:48:30,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:48:30,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 13:48:30,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 13:48:30,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 13:48:30,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 13:48:30,423 INFO L87 Difference]: Start difference. First operand 616 states and 617 transitions. Second operand 93 states. [2018-04-13 13:48:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:31,619 INFO L93 Difference]: Finished difference Result 836 states and 878 transitions. [2018-04-13 13:48:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 13:48:31,619 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 615 [2018-04-13 13:48:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:31,621 INFO L225 Difference]: With dead ends: 836 [2018-04-13 13:48:31,621 INFO L226 Difference]: Without dead ends: 836 [2018-04-13 13:48:31,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 13:48:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-04-13 13:48:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 620. [2018-04-13 13:48:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-04-13 13:48:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 621 transitions. [2018-04-13 13:48:31,624 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 621 transitions. Word has length 615 [2018-04-13 13:48:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:31,624 INFO L459 AbstractCegarLoop]: Abstraction has 620 states and 621 transitions. [2018-04-13 13:48:31,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 13:48:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 621 transitions. [2018-04-13 13:48:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-04-13 13:48:31,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:31,626 INFO L355 BasicCegarLoop]: trace histogram [92, 91, 91, 91, 50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:31,626 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1735813777, now seen corresponding path program 90 times [2018-04-13 13:48:31,627 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:31,627 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:31,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:31,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:31,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:31,641 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22540 backedges. 0 proven. 16562 refuted. 0 times theorem prover too weak. 5978 trivial. 0 not checked. [2018-04-13 13:48:33,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:33,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:48:34,279 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 92 check-sat command(s) [2018-04-13 13:48:34,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:34,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22540 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2018-04-13 13:48:34,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:34,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 52] total 96 [2018-04-13 13:48:34,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-13 13:48:34,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-13 13:48:34,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4462, Invalid=4658, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 13:48:34,475 INFO L87 Difference]: Start difference. First operand 620 states and 621 transitions. Second operand 96 states. [2018-04-13 13:48:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:36,356 INFO L93 Difference]: Finished difference Result 845 states and 887 transitions. [2018-04-13 13:48:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 13:48:36,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 619 [2018-04-13 13:48:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:36,357 INFO L225 Difference]: With dead ends: 845 [2018-04-13 13:48:36,357 INFO L226 Difference]: Without dead ends: 845 [2018-04-13 13:48:36,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=9117, Invalid=11763, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 13:48:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-13 13:48:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 629. [2018-04-13 13:48:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-04-13 13:48:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-04-13 13:48:36,361 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 619 [2018-04-13 13:48:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:36,361 INFO L459 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-04-13 13:48:36,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-13 13:48:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-04-13 13:48:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-04-13 13:48:36,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:36,363 INFO L355 BasicCegarLoop]: trace histogram [93, 92, 92, 92, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:36,363 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash 964045942, now seen corresponding path program 91 times [2018-04-13 13:48:36,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:36,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:36,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:36,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:36,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:36,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23153 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-04-13 13:48:38,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:38,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:48:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:38,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23153 backedges. 0 proven. 16928 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-04-13 13:48:38,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:38,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-04-13 13:48:38,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 13:48:38,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 13:48:38,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 13:48:38,404 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 95 states. [2018-04-13 13:48:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:39,698 INFO L93 Difference]: Finished difference Result 854 states and 897 transitions. [2018-04-13 13:48:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 13:48:39,698 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 628 [2018-04-13 13:48:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:39,700 INFO L225 Difference]: With dead ends: 854 [2018-04-13 13:48:39,700 INFO L226 Difference]: Without dead ends: 854 [2018-04-13 13:48:39,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 13:48:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-04-13 13:48:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 633. [2018-04-13 13:48:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-04-13 13:48:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 634 transitions. [2018-04-13 13:48:39,703 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 634 transitions. Word has length 628 [2018-04-13 13:48:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:39,704 INFO L459 AbstractCegarLoop]: Abstraction has 633 states and 634 transitions. [2018-04-13 13:48:39,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 13:48:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 634 transitions. [2018-04-13 13:48:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-04-13 13:48:39,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:39,706 INFO L355 BasicCegarLoop]: trace histogram [94, 93, 93, 93, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:39,706 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash -426905873, now seen corresponding path program 92 times [2018-04-13 13:48:39,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:39,706 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:39,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:39,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:48:39,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:39,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 23523 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-04-13 13:48:41,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:41,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:48:41,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:48:41,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:41,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 23523 backedges. 0 proven. 17298 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-04-13 13:48:41,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:41,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-04-13 13:48:41,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-04-13 13:48:41,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-04-13 13:48:41,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 13:48:41,872 INFO L87 Difference]: Start difference. First operand 633 states and 634 transitions. Second operand 96 states. [2018-04-13 13:48:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:43,165 INFO L93 Difference]: Finished difference Result 863 states and 907 transitions. [2018-04-13 13:48:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 13:48:43,165 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 632 [2018-04-13 13:48:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:43,167 INFO L225 Difference]: With dead ends: 863 [2018-04-13 13:48:43,167 INFO L226 Difference]: Without dead ends: 863 [2018-04-13 13:48:43,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 13:48:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-04-13 13:48:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 637. [2018-04-13 13:48:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-04-13 13:48:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 638 transitions. [2018-04-13 13:48:43,171 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 638 transitions. Word has length 632 [2018-04-13 13:48:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:43,171 INFO L459 AbstractCegarLoop]: Abstraction has 637 states and 638 transitions. [2018-04-13 13:48:43,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-04-13 13:48:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 638 transitions. [2018-04-13 13:48:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-04-13 13:48:43,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:43,173 INFO L355 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:43,173 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:43,173 INFO L82 PathProgramCache]: Analyzing trace with hash -459420440, now seen corresponding path program 93 times [2018-04-13 13:48:43,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:43,173 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:43,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:43,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:43,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:43,189 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23897 backedges. 0 proven. 17672 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-04-13 13:48:45,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:45,204 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:45,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:48:45,436 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-04-13 13:48:45,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:45,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23897 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2018-04-13 13:48:45,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:45,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 53] total 99 [2018-04-13 13:48:45,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 13:48:45,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 13:48:45,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4751, Invalid=4951, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 13:48:45,650 INFO L87 Difference]: Start difference. First operand 637 states and 638 transitions. Second operand 99 states. [2018-04-13 13:48:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:47,778 INFO L93 Difference]: Finished difference Result 872 states and 916 transitions. [2018-04-13 13:48:47,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 13:48:47,778 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 636 [2018-04-13 13:48:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:47,779 INFO L225 Difference]: With dead ends: 872 [2018-04-13 13:48:47,779 INFO L226 Difference]: Without dead ends: 872 [2018-04-13 13:48:47,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=9651, Invalid=12401, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 13:48:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-04-13 13:48:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 646. [2018-04-13 13:48:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-04-13 13:48:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 647 transitions. [2018-04-13 13:48:47,782 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 647 transitions. Word has length 636 [2018-04-13 13:48:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:47,782 INFO L459 AbstractCegarLoop]: Abstraction has 646 states and 647 transitions. [2018-04-13 13:48:47,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 13:48:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 647 transitions. [2018-04-13 13:48:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-04-13 13:48:47,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:47,785 INFO L355 BasicCegarLoop]: trace histogram [96, 95, 95, 95, 52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:47,785 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:47,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2029478965, now seen corresponding path program 94 times [2018-04-13 13:48:47,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:47,785 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:47,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:47,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:47,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:47,799 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24527 backedges. 0 proven. 18050 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-04-13 13:48:49,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:49,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:48:49,853 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:48:49,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:48:49,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:48:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24527 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2018-04-13 13:48:50,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:48:50,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 53] total 150 [2018-04-13 13:48:50,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-13 13:48:50,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-13 13:48:50,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8523, Invalid=13827, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 13:48:50,637 INFO L87 Difference]: Start difference. First operand 646 states and 647 transitions. Second operand 150 states. [2018-04-13 13:48:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:48:54,683 INFO L93 Difference]: Finished difference Result 881 states and 925 transitions. [2018-04-13 13:48:54,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 13:48:54,683 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 645 [2018-04-13 13:48:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:48:54,683 INFO L225 Difference]: With dead ends: 881 [2018-04-13 13:48:54,683 INFO L226 Difference]: Without dead ends: 881 [2018-04-13 13:48:54,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9880 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8523, Invalid=13827, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 13:48:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-04-13 13:48:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 655. [2018-04-13 13:48:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-04-13 13:48:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-04-13 13:48:54,686 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 645 [2018-04-13 13:48:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:48:54,687 INFO L459 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-04-13 13:48:54,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-13 13:48:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-04-13 13:48:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-04-13 13:48:54,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:48:54,689 INFO L355 BasicCegarLoop]: trace histogram [97, 96, 96, 96, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:48:54,689 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:48:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -720467366, now seen corresponding path program 95 times [2018-04-13 13:48:54,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:48:54,689 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:48:54,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:54,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:48:54,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:48:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:48:54,702 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:48:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25166 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 6734 trivial. 0 not checked. [2018-04-13 13:48:56,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:48:56,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:48:56,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:49:08,682 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 97 check-sat command(s) [2018-04-13 13:49:08,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:49:08,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:49:08,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 13:49:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 13:49:08,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 13:49:08,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 13:49:08,814 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 99 states. [2018-04-13 13:49:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:10,242 INFO L93 Difference]: Finished difference Result 890 states and 935 transitions. [2018-04-13 13:49:10,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 13:49:10,242 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 654 [2018-04-13 13:49:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:10,243 INFO L225 Difference]: With dead ends: 890 [2018-04-13 13:49:10,243 INFO L226 Difference]: Without dead ends: 890 [2018-04-13 13:49:10,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 13:49:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-13 13:49:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 659. [2018-04-13 13:49:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-04-13 13:49:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-04-13 13:49:10,246 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 654 [2018-04-13 13:49:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:10,246 INFO L459 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-04-13 13:49:10,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 13:49:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-04-13 13:49:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-04-13 13:49:10,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:10,248 INFO L355 BasicCegarLoop]: trace histogram [98, 97, 97, 97, 53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:10,248 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1231599507, now seen corresponding path program 96 times [2018-04-13 13:49:10,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:10,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:10,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:10,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:10,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:10,262 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 25552 backedges. 0 proven. 18818 refuted. 0 times theorem prover too weak. 6734 trivial. 0 not checked. [2018-04-13 13:49:12,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:12,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:12,163 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:49:13,288 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2018-04-13 13:49:13,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:13,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25552 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2018-04-13 13:49:13,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:13,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 55] total 102 [2018-04-13 13:49:13,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-04-13 13:49:13,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-04-13 13:49:13,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5047, Invalid=5255, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 13:49:13,485 INFO L87 Difference]: Start difference. First operand 659 states and 660 transitions. Second operand 102 states. [2018-04-13 13:49:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:15,317 INFO L93 Difference]: Finished difference Result 899 states and 944 transitions. [2018-04-13 13:49:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 13:49:15,318 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 658 [2018-04-13 13:49:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:15,318 INFO L225 Difference]: With dead ends: 899 [2018-04-13 13:49:15,318 INFO L226 Difference]: Without dead ends: 899 [2018-04-13 13:49:15,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=10299, Invalid=13263, Unknown=0, NotChecked=0, Total=23562 [2018-04-13 13:49:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-13 13:49:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 668. [2018-04-13 13:49:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-04-13 13:49:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 669 transitions. [2018-04-13 13:49:15,322 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 669 transitions. Word has length 658 [2018-04-13 13:49:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:15,322 INFO L459 AbstractCegarLoop]: Abstraction has 668 states and 669 transitions. [2018-04-13 13:49:15,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-04-13 13:49:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 669 transitions. [2018-04-13 13:49:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-04-13 13:49:15,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:15,324 INFO L355 BasicCegarLoop]: trace histogram [99, 98, 98, 98, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:15,324 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1148748608, now seen corresponding path program 97 times [2018-04-13 13:49:15,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:15,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:15,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:15,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:15,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:15,338 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26204 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 6996 trivial. 0 not checked. [2018-04-13 13:49:17,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:17,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:17,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:49:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:17,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 26204 backedges. 0 proven. 19208 refuted. 0 times theorem prover too weak. 6996 trivial. 0 not checked. [2018-04-13 13:49:17,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:17,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-04-13 13:49:17,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 13:49:17,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 13:49:17,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 13:49:17,495 INFO L87 Difference]: Start difference. First operand 668 states and 669 transitions. Second operand 101 states. [2018-04-13 13:49:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:18,959 INFO L93 Difference]: Finished difference Result 908 states and 954 transitions. [2018-04-13 13:49:18,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-04-13 13:49:18,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 667 [2018-04-13 13:49:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:18,960 INFO L225 Difference]: With dead ends: 908 [2018-04-13 13:49:18,960 INFO L226 Difference]: Without dead ends: 908 [2018-04-13 13:49:18,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 13:49:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-04-13 13:49:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 672. [2018-04-13 13:49:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-04-13 13:49:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2018-04-13 13:49:18,963 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 667 [2018-04-13 13:49:18,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:18,963 INFO L459 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2018-04-13 13:49:18,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 13:49:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2018-04-13 13:49:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-04-13 13:49:18,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:18,965 INFO L355 BasicCegarLoop]: trace histogram [100, 99, 99, 99, 54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:18,965 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:18,965 INFO L82 PathProgramCache]: Analyzing trace with hash -264219609, now seen corresponding path program 98 times [2018-04-13 13:49:18,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:18,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:18,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:18,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:49:18,966 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:18,979 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 26598 backedges. 0 proven. 19602 refuted. 0 times theorem prover too weak. 6996 trivial. 0 not checked. [2018-04-13 13:49:20,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:20,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:20,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:49:20,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:49:20,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:20,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26598 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2018-04-13 13:49:21,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:21,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 56] total 109 [2018-04-13 13:49:21,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-13 13:49:21,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-13 13:49:21,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5515, Invalid=6257, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 13:49:21,188 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 109 states. [2018-04-13 13:49:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:23,619 INFO L93 Difference]: Finished difference Result 917 states and 963 transitions. [2018-04-13 13:49:23,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-04-13 13:49:23,619 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 671 [2018-04-13 13:49:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:23,620 INFO L225 Difference]: With dead ends: 917 [2018-04-13 13:49:23,620 INFO L226 Difference]: Without dead ends: 917 [2018-04-13 13:49:23,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=10959, Invalid=15123, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 13:49:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-13 13:49:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 681. [2018-04-13 13:49:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-04-13 13:49:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 682 transitions. [2018-04-13 13:49:23,624 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 682 transitions. Word has length 671 [2018-04-13 13:49:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:23,624 INFO L459 AbstractCegarLoop]: Abstraction has 681 states and 682 transitions. [2018-04-13 13:49:23,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-13 13:49:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 682 transitions. [2018-04-13 13:49:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2018-04-13 13:49:23,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:23,626 INFO L355 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:23,626 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1733396030, now seen corresponding path program 99 times [2018-04-13 13:49:23,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:23,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:23,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:23,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:23,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:23,640 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 27263 backedges. 0 proven. 20000 refuted. 0 times theorem prover too weak. 7263 trivial. 0 not checked. [2018-04-13 13:49:25,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:25,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:25,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:49:25,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-04-13 13:49:25,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:25,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2018-04-13 13:49:26,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:26,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 57] total 105 [2018-04-13 13:49:26,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-13 13:49:26,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-13 13:49:26,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5352, Invalid=5568, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 13:49:26,123 INFO L87 Difference]: Start difference. First operand 681 states and 682 transitions. Second operand 105 states. [2018-04-13 13:49:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:28,052 INFO L93 Difference]: Finished difference Result 926 states and 972 transitions. [2018-04-13 13:49:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 13:49:28,052 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 680 [2018-04-13 13:49:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:28,053 INFO L225 Difference]: With dead ends: 926 [2018-04-13 13:49:28,053 INFO L226 Difference]: Without dead ends: 926 [2018-04-13 13:49:28,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=10968, Invalid=14154, Unknown=0, NotChecked=0, Total=25122 [2018-04-13 13:49:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-04-13 13:49:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 690. [2018-04-13 13:49:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-04-13 13:49:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 691 transitions. [2018-04-13 13:49:28,056 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 691 transitions. Word has length 680 [2018-04-13 13:49:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:28,056 INFO L459 AbstractCegarLoop]: Abstraction has 690 states and 691 transitions. [2018-04-13 13:49:28,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-13 13:49:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 691 transitions. [2018-04-13 13:49:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-04-13 13:49:28,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:28,058 INFO L355 BasicCegarLoop]: trace histogram [102, 101, 101, 101, 56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:28,058 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:28,059 INFO L82 PathProgramCache]: Analyzing trace with hash -386405963, now seen corresponding path program 100 times [2018-04-13 13:49:28,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:28,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:28,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:28,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:28,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:28,073 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 27937 backedges. 0 proven. 20402 refuted. 0 times theorem prover too weak. 7535 trivial. 0 not checked. [2018-04-13 13:49:30,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:30,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:30,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:49:30,151 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:49:30,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:30,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27937 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2018-04-13 13:49:30,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:30,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 57] total 160 [2018-04-13 13:49:30,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-04-13 13:49:30,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-04-13 13:49:30,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9640, Invalid=15800, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 13:49:30,957 INFO L87 Difference]: Start difference. First operand 690 states and 691 transitions. Second operand 160 states. [2018-04-13 13:49:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:36,228 INFO L93 Difference]: Finished difference Result 935 states and 981 transitions. [2018-04-13 13:49:36,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-13 13:49:36,228 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 689 [2018-04-13 13:49:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:36,229 INFO L225 Difference]: With dead ends: 935 [2018-04-13 13:49:36,229 INFO L226 Difference]: Without dead ends: 935 [2018-04-13 13:49:36,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11312 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=9640, Invalid=15800, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 13:49:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-04-13 13:49:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 699. [2018-04-13 13:49:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-04-13 13:49:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 700 transitions. [2018-04-13 13:49:36,232 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 700 transitions. Word has length 689 [2018-04-13 13:49:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:36,232 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 700 transitions. [2018-04-13 13:49:36,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-04-13 13:49:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 700 transitions. [2018-04-13 13:49:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2018-04-13 13:49:36,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:36,234 INFO L355 BasicCegarLoop]: trace histogram [103, 102, 102, 102, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:36,234 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash -182686416, now seen corresponding path program 101 times [2018-04-13 13:49:36,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:36,235 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:36,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:36,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:36,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:36,249 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 28620 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2018-04-13 13:49:38,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:38,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:38,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:49:38,676 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 103 check-sat command(s) [2018-04-13 13:49:38,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:38,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28620 backedges. 0 proven. 20808 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2018-04-13 13:49:38,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:38,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-04-13 13:49:38,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-13 13:49:38,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-13 13:49:38,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 13:49:38,840 INFO L87 Difference]: Start difference. First operand 699 states and 700 transitions. Second operand 105 states. [2018-04-13 13:49:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:41,072 INFO L93 Difference]: Finished difference Result 944 states and 991 transitions. [2018-04-13 13:49:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-04-13 13:49:41,072 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 698 [2018-04-13 13:49:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:41,073 INFO L225 Difference]: With dead ends: 944 [2018-04-13 13:49:41,073 INFO L226 Difference]: Without dead ends: 944 [2018-04-13 13:49:41,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 13:49:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-13 13:49:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 703. [2018-04-13 13:49:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-04-13 13:49:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 704 transitions. [2018-04-13 13:49:41,076 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 704 transitions. Word has length 698 [2018-04-13 13:49:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:41,076 INFO L459 AbstractCegarLoop]: Abstraction has 703 states and 704 transitions. [2018-04-13 13:49:41,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-13 13:49:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 704 transitions. [2018-04-13 13:49:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-04-13 13:49:41,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:41,078 INFO L355 BasicCegarLoop]: trace histogram [104, 103, 103, 103, 57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:41,078 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2054318313, now seen corresponding path program 102 times [2018-04-13 13:49:41,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:41,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:41,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:41,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:41,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:41,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 29030 backedges. 0 proven. 21218 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2018-04-13 13:49:43,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:43,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:43,227 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:49:44,363 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 104 check-sat command(s) [2018-04-13 13:49:44,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:44,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 29030 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2018-04-13 13:49:44,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:44,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 59] total 108 [2018-04-13 13:49:44,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-04-13 13:49:44,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-04-13 13:49:44,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5666, Invalid=5890, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 13:49:44,594 INFO L87 Difference]: Start difference. First operand 703 states and 704 transitions. Second operand 108 states. [2018-04-13 13:49:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:46,842 INFO L93 Difference]: Finished difference Result 953 states and 1000 transitions. [2018-04-13 13:49:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 13:49:46,843 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 702 [2018-04-13 13:49:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:46,843 INFO L225 Difference]: With dead ends: 953 [2018-04-13 13:49:46,843 INFO L226 Difference]: Without dead ends: 953 [2018-04-13 13:49:46,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=11658, Invalid=15074, Unknown=0, NotChecked=0, Total=26732 [2018-04-13 13:49:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-04-13 13:49:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 712. [2018-04-13 13:49:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-04-13 13:49:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 713 transitions. [2018-04-13 13:49:46,848 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 713 transitions. Word has length 702 [2018-04-13 13:49:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:46,848 INFO L459 AbstractCegarLoop]: Abstraction has 712 states and 713 transitions. [2018-04-13 13:49:46,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-04-13 13:49:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 713 transitions. [2018-04-13 13:49:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-04-13 13:49:46,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:46,852 INFO L355 BasicCegarLoop]: trace histogram [105, 104, 104, 104, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:46,852 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2076816042, now seen corresponding path program 103 times [2018-04-13 13:49:46,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:46,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:46,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:46,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 29726 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 8094 trivial. 0 not checked. [2018-04-13 13:49:49,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:49,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:49:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:49,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29726 backedges. 0 proven. 21632 refuted. 0 times theorem prover too weak. 8094 trivial. 0 not checked. [2018-04-13 13:49:49,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:49,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-04-13 13:49:49,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 13:49:49,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 13:49:49,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 13:49:49,253 INFO L87 Difference]: Start difference. First operand 712 states and 713 transitions. Second operand 107 states. [2018-04-13 13:49:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:51,056 INFO L93 Difference]: Finished difference Result 962 states and 1010 transitions. [2018-04-13 13:49:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 13:49:51,056 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 711 [2018-04-13 13:49:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:51,057 INFO L225 Difference]: With dead ends: 962 [2018-04-13 13:49:51,057 INFO L226 Difference]: Without dead ends: 962 [2018-04-13 13:49:51,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 13:49:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-04-13 13:49:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 716. [2018-04-13 13:49:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-04-13 13:49:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 717 transitions. [2018-04-13 13:49:51,060 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 717 transitions. Word has length 711 [2018-04-13 13:49:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:51,060 INFO L459 AbstractCegarLoop]: Abstraction has 716 states and 717 transitions. [2018-04-13 13:49:51,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 13:49:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 717 transitions. [2018-04-13 13:49:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2018-04-13 13:49:51,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:51,062 INFO L355 BasicCegarLoop]: trace histogram [106, 105, 105, 105, 58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:51,062 INFO L408 AbstractCegarLoop]: === Iteration 106 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1232450671, now seen corresponding path program 104 times [2018-04-13 13:49:51,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:51,063 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:51,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:49:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:51,077 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30144 backedges. 0 proven. 22050 refuted. 0 times theorem prover too weak. 8094 trivial. 0 not checked. [2018-04-13 13:49:53,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:53,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:53,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:49:53,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:49:53,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:53,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30144 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2018-04-13 13:49:53,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:53,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 60] total 119 [2018-04-13 13:49:53,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 13:49:53,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 13:49:53,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6394, Invalid=7648, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 13:49:53,611 INFO L87 Difference]: Start difference. First operand 716 states and 717 transitions. Second operand 119 states. [2018-04-13 13:49:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:49:56,636 INFO L93 Difference]: Finished difference Result 971 states and 1019 transitions. [2018-04-13 13:49:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-04-13 13:49:56,636 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 715 [2018-04-13 13:49:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:49:56,637 INFO L225 Difference]: With dead ends: 971 [2018-04-13 13:49:56,637 INFO L226 Difference]: Without dead ends: 971 [2018-04-13 13:49:56,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=12562, Invalid=18238, Unknown=0, NotChecked=0, Total=30800 [2018-04-13 13:49:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-04-13 13:49:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 725. [2018-04-13 13:49:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-04-13 13:49:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 726 transitions. [2018-04-13 13:49:56,640 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 726 transitions. Word has length 715 [2018-04-13 13:49:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:49:56,640 INFO L459 AbstractCegarLoop]: Abstraction has 725 states and 726 transitions. [2018-04-13 13:49:56,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 13:49:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 726 transitions. [2018-04-13 13:49:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-04-13 13:49:56,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:49:56,643 INFO L355 BasicCegarLoop]: trace histogram [107, 106, 106, 106, 59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:49:56,643 INFO L408 AbstractCegarLoop]: === Iteration 107 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:49:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1385853036, now seen corresponding path program 105 times [2018-04-13 13:49:56,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:49:56,643 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:49:56,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:56,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:49:56,643 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:49:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:49:56,658 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:49:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 30853 backedges. 0 proven. 22472 refuted. 0 times theorem prover too weak. 8381 trivial. 0 not checked. [2018-04-13 13:49:58,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:49:58,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:49:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:49:59,093 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-04-13 13:49:59,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:49:59,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:49:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30853 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2018-04-13 13:49:59,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:49:59,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 61] total 111 [2018-04-13 13:49:59,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-13 13:49:59,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-13 13:49:59,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5989, Invalid=6221, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 13:49:59,355 INFO L87 Difference]: Start difference. First operand 725 states and 726 transitions. Second operand 111 states. [2018-04-13 13:50:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:01,773 INFO L93 Difference]: Finished difference Result 980 states and 1028 transitions. [2018-04-13 13:50:01,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-13 13:50:01,773 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 724 [2018-04-13 13:50:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:01,774 INFO L225 Difference]: With dead ends: 980 [2018-04-13 13:50:01,774 INFO L226 Difference]: Without dead ends: 980 [2018-04-13 13:50:01,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=12369, Invalid=16023, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 13:50:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-04-13 13:50:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 734. [2018-04-13 13:50:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-13 13:50:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 735 transitions. [2018-04-13 13:50:01,778 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 735 transitions. Word has length 724 [2018-04-13 13:50:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:01,778 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 735 transitions. [2018-04-13 13:50:01,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-13 13:50:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 735 transitions. [2018-04-13 13:50:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2018-04-13 13:50:01,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:01,780 INFO L355 BasicCegarLoop]: trace histogram [108, 107, 107, 107, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:01,780 INFO L408 AbstractCegarLoop]: === Iteration 108 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1192450145, now seen corresponding path program 106 times [2018-04-13 13:50:01,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:01,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:01,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:01,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:01,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:01,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31571 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:04,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:04,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:50:04,089 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:50:04,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:50:04,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 31571 backedges. 0 proven. 22898 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:04,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:04,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-04-13 13:50:04,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-13 13:50:04,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-13 13:50:04,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 13:50:04,267 INFO L87 Difference]: Start difference. First operand 734 states and 735 transitions. Second operand 110 states. [2018-04-13 13:50:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:06,887 INFO L93 Difference]: Finished difference Result 989 states and 1038 transitions. [2018-04-13 13:50:06,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-04-13 13:50:06,887 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 733 [2018-04-13 13:50:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:06,888 INFO L225 Difference]: With dead ends: 989 [2018-04-13 13:50:06,888 INFO L226 Difference]: Without dead ends: 989 [2018-04-13 13:50:06,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 13:50:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2018-04-13 13:50:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 738. [2018-04-13 13:50:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-04-13 13:50:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 739 transitions. [2018-04-13 13:50:06,891 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 739 transitions. Word has length 733 [2018-04-13 13:50:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:06,891 INFO L459 AbstractCegarLoop]: Abstraction has 738 states and 739 transitions. [2018-04-13 13:50:06,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-13 13:50:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 739 transitions. [2018-04-13 13:50:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2018-04-13 13:50:06,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:06,893 INFO L355 BasicCegarLoop]: trace histogram [109, 108, 108, 108, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:06,893 INFO L408 AbstractCegarLoop]: === Iteration 109 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash -915633850, now seen corresponding path program 107 times [2018-04-13 13:50:06,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:06,893 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:06,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:06,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:06,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:06,908 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32001 backedges. 0 proven. 23328 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:09,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:09,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:50:21,398 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 109 check-sat command(s) [2018-04-13 13:50:21,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:50:21,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:50:21,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-04-13 13:50:21,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-04-13 13:50:21,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-04-13 13:50:21,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 13:50:21,603 INFO L87 Difference]: Start difference. First operand 738 states and 739 transitions. Second operand 111 states. [2018-04-13 13:50:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:23,331 INFO L93 Difference]: Finished difference Result 998 states and 1048 transitions. [2018-04-13 13:50:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-13 13:50:23,331 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 737 [2018-04-13 13:50:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:23,332 INFO L225 Difference]: With dead ends: 998 [2018-04-13 13:50:23,332 INFO L226 Difference]: Without dead ends: 998 [2018-04-13 13:50:23,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 13:50:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-04-13 13:50:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 742. [2018-04-13 13:50:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-04-13 13:50:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 743 transitions. [2018-04-13 13:50:23,335 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 743 transitions. Word has length 737 [2018-04-13 13:50:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:23,335 INFO L459 AbstractCegarLoop]: Abstraction has 742 states and 743 transitions. [2018-04-13 13:50:23,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-04-13 13:50:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 743 transitions. [2018-04-13 13:50:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2018-04-13 13:50:23,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:23,337 INFO L355 BasicCegarLoop]: trace histogram [110, 109, 109, 109, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:23,337 INFO L408 AbstractCegarLoop]: === Iteration 110 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -297451667, now seen corresponding path program 108 times [2018-04-13 13:50:23,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:23,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:23,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:23,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:23,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:23,352 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32435 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:25,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:25,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:25,738 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:50:26,381 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 110 check-sat command(s) [2018-04-13 13:50:26,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:50:26,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 32435 backedges. 0 proven. 23762 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:26,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:26,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-04-13 13:50:26,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-13 13:50:26,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-13 13:50:26,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 13:50:26,617 INFO L87 Difference]: Start difference. First operand 742 states and 743 transitions. Second operand 112 states. [2018-04-13 13:50:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:29,265 INFO L93 Difference]: Finished difference Result 1007 states and 1058 transitions. [2018-04-13 13:50:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-13 13:50:29,265 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 741 [2018-04-13 13:50:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:29,266 INFO L225 Difference]: With dead ends: 1007 [2018-04-13 13:50:29,266 INFO L226 Difference]: Without dead ends: 1007 [2018-04-13 13:50:29,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 13:50:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2018-04-13 13:50:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 746. [2018-04-13 13:50:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-13 13:50:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 747 transitions. [2018-04-13 13:50:29,269 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 747 transitions. Word has length 741 [2018-04-13 13:50:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:29,269 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 747 transitions. [2018-04-13 13:50:29,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-13 13:50:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 747 transitions. [2018-04-13 13:50:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-04-13 13:50:29,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:29,272 INFO L355 BasicCegarLoop]: trace histogram [111, 110, 110, 110, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:29,272 INFO L408 AbstractCegarLoop]: === Iteration 111 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash -302478828, now seen corresponding path program 109 times [2018-04-13 13:50:29,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:29,272 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:29,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:29,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:29,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:29,287 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32873 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:31,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:31,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:31,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:50:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:31,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32873 backedges. 0 proven. 24200 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:31,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:31,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-04-13 13:50:31,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-04-13 13:50:31,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-04-13 13:50:31,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 13:50:31,925 INFO L87 Difference]: Start difference. First operand 746 states and 747 transitions. Second operand 113 states. [2018-04-13 13:50:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:34,846 INFO L93 Difference]: Finished difference Result 1016 states and 1068 transitions. [2018-04-13 13:50:34,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-13 13:50:34,847 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 745 [2018-04-13 13:50:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:34,847 INFO L225 Difference]: With dead ends: 1016 [2018-04-13 13:50:34,847 INFO L226 Difference]: Without dead ends: 1016 [2018-04-13 13:50:34,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-04-13 13:50:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-04-13 13:50:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 750. [2018-04-13 13:50:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-04-13 13:50:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 751 transitions. [2018-04-13 13:50:34,852 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 751 transitions. Word has length 745 [2018-04-13 13:50:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:34,853 INFO L459 AbstractCegarLoop]: Abstraction has 750 states and 751 transitions. [2018-04-13 13:50:34,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-04-13 13:50:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 751 transitions. [2018-04-13 13:50:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-04-13 13:50:34,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:34,857 INFO L355 BasicCegarLoop]: trace histogram [112, 111, 111, 111, 60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:34,857 INFO L408 AbstractCegarLoop]: === Iteration 112 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:34,857 INFO L82 PathProgramCache]: Analyzing trace with hash -131585733, now seen corresponding path program 110 times [2018-04-13 13:50:34,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:34,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:34,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:34,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:50:34,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:34,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33315 backedges. 0 proven. 24642 refuted. 0 times theorem prover too weak. 8673 trivial. 0 not checked. [2018-04-13 13:50:37,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:37,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:50:37,391 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:50:37,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:50:37,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33315 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 24642 trivial. 0 not checked. [2018-04-13 13:50:37,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:37,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 62] total 127 [2018-04-13 13:50:37,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-13 13:50:37,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-13 13:50:37,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7234, Invalid=8768, Unknown=0, NotChecked=0, Total=16002 [2018-04-13 13:50:37,802 INFO L87 Difference]: Start difference. First operand 750 states and 751 transitions. Second operand 127 states. [2018-04-13 13:50:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:41,832 INFO L93 Difference]: Finished difference Result 1025 states and 1077 transitions. [2018-04-13 13:50:41,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-04-13 13:50:41,833 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 749 [2018-04-13 13:50:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:41,833 INFO L225 Difference]: With dead ends: 1025 [2018-04-13 13:50:41,833 INFO L226 Difference]: Without dead ends: 1025 [2018-04-13 13:50:41,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 795 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4734 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=13953, Invalid=20457, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 13:50:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-04-13 13:50:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 759. [2018-04-13 13:50:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-04-13 13:50:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 760 transitions. [2018-04-13 13:50:41,837 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 760 transitions. Word has length 749 [2018-04-13 13:50:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:41,837 INFO L459 AbstractCegarLoop]: Abstraction has 759 states and 760 transitions. [2018-04-13 13:50:41,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-13 13:50:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 760 transitions. [2018-04-13 13:50:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-04-13 13:50:41,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:41,840 INFO L355 BasicCegarLoop]: trace histogram [113, 112, 112, 112, 61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:41,840 INFO L408 AbstractCegarLoop]: === Iteration 113 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash 259370474, now seen corresponding path program 111 times [2018-04-13 13:50:41,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:41,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:41,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:41,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:41,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:41,855 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 34058 backedges. 0 proven. 25088 refuted. 0 times theorem prover too weak. 8970 trivial. 0 not checked. [2018-04-13 13:50:44,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:44,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:44,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:50:44,685 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-04-13 13:50:44,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:50:44,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 34058 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2018-04-13 13:50:44,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:44,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 63] total 117 [2018-04-13 13:50:44,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-13 13:50:44,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-13 13:50:44,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6666, Invalid=6906, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 13:50:44,915 INFO L87 Difference]: Start difference. First operand 759 states and 760 transitions. Second operand 117 states. [2018-04-13 13:50:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:47,614 INFO L93 Difference]: Finished difference Result 1034 states and 1086 transitions. [2018-04-13 13:50:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-13 13:50:47,614 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 758 [2018-04-13 13:50:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:47,615 INFO L225 Difference]: With dead ends: 1034 [2018-04-13 13:50:47,615 INFO L226 Difference]: Without dead ends: 1034 [2018-04-13 13:50:47,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=13626, Invalid=17526, Unknown=0, NotChecked=0, Total=31152 [2018-04-13 13:50:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-04-13 13:50:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 768. [2018-04-13 13:50:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2018-04-13 13:50:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 769 transitions. [2018-04-13 13:50:47,619 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 769 transitions. Word has length 758 [2018-04-13 13:50:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:47,620 INFO L459 AbstractCegarLoop]: Abstraction has 768 states and 769 transitions. [2018-04-13 13:50:47,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-13 13:50:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 769 transitions. [2018-04-13 13:50:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2018-04-13 13:50:47,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:47,622 INFO L355 BasicCegarLoop]: trace histogram [114, 113, 113, 113, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:47,622 INFO L408 AbstractCegarLoop]: === Iteration 114 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1080949431, now seen corresponding path program 112 times [2018-04-13 13:50:47,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:47,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:47,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:47,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:47,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:47,638 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34810 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 9272 trivial. 0 not checked. [2018-04-13 13:50:50,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:50,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:50,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:50:50,188 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:50:50,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:50:50,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:50:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 34810 backedges. 0 proven. 25538 refuted. 0 times theorem prover too weak. 9272 trivial. 0 not checked. [2018-04-13 13:50:50,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:50:50,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-04-13 13:50:50,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-13 13:50:50,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-13 13:50:50,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 13:50:50,422 INFO L87 Difference]: Start difference. First operand 768 states and 769 transitions. Second operand 116 states. [2018-04-13 13:50:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:50:53,684 INFO L93 Difference]: Finished difference Result 1043 states and 1096 transitions. [2018-04-13 13:50:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-13 13:50:53,684 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 767 [2018-04-13 13:50:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:50:53,685 INFO L225 Difference]: With dead ends: 1043 [2018-04-13 13:50:53,685 INFO L226 Difference]: Without dead ends: 1043 [2018-04-13 13:50:53,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 13:50:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-04-13 13:50:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 772. [2018-04-13 13:50:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-04-13 13:50:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 773 transitions. [2018-04-13 13:50:53,688 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 773 transitions. Word has length 767 [2018-04-13 13:50:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:50:53,688 INFO L459 AbstractCegarLoop]: Abstraction has 772 states and 773 transitions. [2018-04-13 13:50:53,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-13 13:50:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 773 transitions. [2018-04-13 13:50:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-04-13 13:50:53,690 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:50:53,690 INFO L355 BasicCegarLoop]: trace histogram [115, 114, 114, 114, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:50:53,690 INFO L408 AbstractCegarLoop]: === Iteration 115 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:50:53,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2009154256, now seen corresponding path program 113 times [2018-04-13 13:50:53,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:50:53,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:50:53,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:53,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:50:53,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:50:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:50:53,706 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:50:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35264 backedges. 0 proven. 25992 refuted. 0 times theorem prover too weak. 9272 trivial. 0 not checked. [2018-04-13 13:50:56,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:50:56,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:50:56,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:51:08,558 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 115 check-sat command(s) [2018-04-13 13:51:08,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:51:08,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:51:08,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-04-13 13:51:08,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-13 13:51:08,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-13 13:51:08,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 13:51:08,800 INFO L87 Difference]: Start difference. First operand 772 states and 773 transitions. Second operand 117 states. [2018-04-13 13:51:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:11,624 INFO L93 Difference]: Finished difference Result 1052 states and 1106 transitions. [2018-04-13 13:51:11,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-13 13:51:11,624 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 771 [2018-04-13 13:51:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:11,625 INFO L225 Difference]: With dead ends: 1052 [2018-04-13 13:51:11,625 INFO L226 Difference]: Without dead ends: 1052 [2018-04-13 13:51:11,626 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 13:51:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-04-13 13:51:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 776. [2018-04-13 13:51:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-04-13 13:51:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 777 transitions. [2018-04-13 13:51:11,629 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 777 transitions. Word has length 771 [2018-04-13 13:51:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:11,629 INFO L459 AbstractCegarLoop]: Abstraction has 776 states and 777 transitions. [2018-04-13 13:51:11,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-13 13:51:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 777 transitions. [2018-04-13 13:51:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2018-04-13 13:51:11,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:11,631 INFO L355 BasicCegarLoop]: trace histogram [116, 115, 115, 115, 62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:11,631 INFO L408 AbstractCegarLoop]: === Iteration 116 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash 980363671, now seen corresponding path program 114 times [2018-04-13 13:51:11,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:11,632 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:11,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:11,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:51:11,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:11,648 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 35722 backedges. 0 proven. 26450 refuted. 0 times theorem prover too weak. 9272 trivial. 0 not checked. [2018-04-13 13:51:14,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:14,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:51:16,038 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 116 check-sat command(s) [2018-04-13 13:51:16,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:51:16,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:51:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 35722 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2018-04-13 13:51:16,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:51:16,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 64] total 120 [2018-04-13 13:51:16,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-13 13:51:16,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-13 13:51:16,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7018, Invalid=7262, Unknown=0, NotChecked=0, Total=14280 [2018-04-13 13:51:16,373 INFO L87 Difference]: Start difference. First operand 776 states and 777 transitions. Second operand 120 states. [2018-04-13 13:51:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:19,135 INFO L93 Difference]: Finished difference Result 1061 states and 1115 transitions. [2018-04-13 13:51:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-13 13:51:19,136 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 775 [2018-04-13 13:51:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:19,136 INFO L225 Difference]: With dead ends: 1061 [2018-04-13 13:51:19,136 INFO L226 Difference]: Without dead ends: 1061 [2018-04-13 13:51:19,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=14277, Invalid=18303, Unknown=0, NotChecked=0, Total=32580 [2018-04-13 13:51:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-04-13 13:51:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 785. [2018-04-13 13:51:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-04-13 13:51:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 786 transitions. [2018-04-13 13:51:19,140 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 786 transitions. Word has length 775 [2018-04-13 13:51:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:19,140 INFO L459 AbstractCegarLoop]: Abstraction has 785 states and 786 transitions. [2018-04-13 13:51:19,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-13 13:51:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 786 transitions. [2018-04-13 13:51:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-04-13 13:51:19,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:19,143 INFO L355 BasicCegarLoop]: trace histogram [117, 116, 116, 116, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:19,143 INFO L408 AbstractCegarLoop]: === Iteration 117 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -125918770, now seen corresponding path program 115 times [2018-04-13 13:51:19,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:19,143 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:19,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:19,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:51:19,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:19,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36491 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 9579 trivial. 0 not checked. [2018-04-13 13:51:21,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:21,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:21,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:51:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:21,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:51:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36491 backedges. 0 proven. 26912 refuted. 0 times theorem prover too weak. 9579 trivial. 0 not checked. [2018-04-13 13:51:22,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:51:22,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2018-04-13 13:51:22,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 13:51:22,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 13:51:22,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 13:51:22,104 INFO L87 Difference]: Start difference. First operand 785 states and 786 transitions. Second operand 119 states. [2018-04-13 13:51:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:24,598 INFO L93 Difference]: Finished difference Result 1070 states and 1125 transitions. [2018-04-13 13:51:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-13 13:51:24,598 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 784 [2018-04-13 13:51:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:24,599 INFO L225 Difference]: With dead ends: 1070 [2018-04-13 13:51:24,599 INFO L226 Difference]: Without dead ends: 1070 [2018-04-13 13:51:24,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 13:51:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-04-13 13:51:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 789. [2018-04-13 13:51:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-04-13 13:51:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 790 transitions. [2018-04-13 13:51:24,602 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 790 transitions. Word has length 784 [2018-04-13 13:51:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:24,603 INFO L459 AbstractCegarLoop]: Abstraction has 789 states and 790 transitions. [2018-04-13 13:51:24,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 13:51:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 790 transitions. [2018-04-13 13:51:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2018-04-13 13:51:24,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:24,605 INFO L355 BasicCegarLoop]: trace histogram [118, 117, 117, 117, 63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:24,605 INFO L408 AbstractCegarLoop]: === Iteration 118 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash -979774265, now seen corresponding path program 116 times [2018-04-13 13:51:24,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:24,605 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:24,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:51:24,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:24,621 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36957 backedges. 0 proven. 27378 refuted. 0 times theorem prover too weak. 9579 trivial. 0 not checked. [2018-04-13 13:51:27,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:27,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:27,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:51:27,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:51:27,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:51:27,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:51:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36957 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 27378 trivial. 0 not checked. [2018-04-13 13:51:27,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:51:27,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 65] total 136 [2018-04-13 13:51:27,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-04-13 13:51:27,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-04-13 13:51:27,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8188, Invalid=10172, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 13:51:27,877 INFO L87 Difference]: Start difference. First operand 789 states and 790 transitions. Second operand 136 states. [2018-04-13 13:51:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:32,929 INFO L93 Difference]: Finished difference Result 1079 states and 1134 transitions. [2018-04-13 13:51:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-13 13:51:32,929 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 788 [2018-04-13 13:51:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:32,930 INFO L225 Difference]: With dead ends: 1079 [2018-04-13 13:51:32,930 INFO L226 Difference]: Without dead ends: 1079 [2018-04-13 13:51:32,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 825 SyntacticMatches, 10 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6534 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=15585, Invalid=23421, Unknown=0, NotChecked=0, Total=39006 [2018-04-13 13:51:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2018-04-13 13:51:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 798. [2018-04-13 13:51:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-04-13 13:51:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 799 transitions. [2018-04-13 13:51:32,933 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 799 transitions. Word has length 788 [2018-04-13 13:51:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:32,934 INFO L459 AbstractCegarLoop]: Abstraction has 798 states and 799 transitions. [2018-04-13 13:51:32,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-04-13 13:51:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 799 transitions. [2018-04-13 13:51:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2018-04-13 13:51:32,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:32,936 INFO L355 BasicCegarLoop]: trace histogram [119, 118, 118, 118, 64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:32,936 INFO L408 AbstractCegarLoop]: === Iteration 119 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1578765748, now seen corresponding path program 117 times [2018-04-13 13:51:32,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:32,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:32,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:32,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:51:32,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:32,952 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 37739 backedges. 0 proven. 27848 refuted. 0 times theorem prover too weak. 9891 trivial. 0 not checked. [2018-04-13 13:51:35,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:35,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:35,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:51:36,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-13 13:51:36,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:51:36,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:51:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 37739 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2018-04-13 13:51:36,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:51:36,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 66] total 123 [2018-04-13 13:51:36,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-13 13:51:36,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-13 13:51:36,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7377, Invalid=7629, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 13:51:36,449 INFO L87 Difference]: Start difference. First operand 798 states and 799 transitions. Second operand 123 states. [2018-04-13 13:51:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:39,654 INFO L93 Difference]: Finished difference Result 1088 states and 1143 transitions. [2018-04-13 13:51:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-13 13:51:39,654 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 797 [2018-04-13 13:51:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:39,655 INFO L225 Difference]: With dead ends: 1088 [2018-04-13 13:51:39,655 INFO L226 Difference]: Without dead ends: 1088 [2018-04-13 13:51:39,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 859 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=15063, Invalid=19347, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 13:51:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-04-13 13:51:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 807. [2018-04-13 13:51:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-04-13 13:51:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 808 transitions. [2018-04-13 13:51:39,658 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 808 transitions. Word has length 797 [2018-04-13 13:51:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:39,659 INFO L459 AbstractCegarLoop]: Abstraction has 807 states and 808 transitions. [2018-04-13 13:51:39,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-13 13:51:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 808 transitions. [2018-04-13 13:51:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2018-04-13 13:51:39,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:39,661 INFO L355 BasicCegarLoop]: trace histogram [120, 119, 119, 119, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:39,661 INFO L408 AbstractCegarLoop]: === Iteration 120 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1844982137, now seen corresponding path program 118 times [2018-04-13 13:51:39,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:39,662 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:39,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:39,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:51:39,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:39,678 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 38530 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2018-04-13 13:51:42,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:42,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:42,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:51:42,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:51:42,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:51:42,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:51:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 38530 backedges. 0 proven. 28322 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2018-04-13 13:51:42,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:51:42,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2018-04-13 13:51:42,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 13:51:42,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 13:51:42,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 13:51:42,777 INFO L87 Difference]: Start difference. First operand 807 states and 808 transitions. Second operand 122 states. [2018-04-13 13:51:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:51:45,802 INFO L93 Difference]: Finished difference Result 1097 states and 1153 transitions. [2018-04-13 13:51:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-13 13:51:45,802 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 806 [2018-04-13 13:51:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:51:45,803 INFO L225 Difference]: With dead ends: 1097 [2018-04-13 13:51:45,803 INFO L226 Difference]: Without dead ends: 1097 [2018-04-13 13:51:45,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 13:51:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-04-13 13:51:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 811. [2018-04-13 13:51:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-04-13 13:51:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 812 transitions. [2018-04-13 13:51:45,806 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 812 transitions. Word has length 806 [2018-04-13 13:51:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:51:45,806 INFO L459 AbstractCegarLoop]: Abstraction has 811 states and 812 transitions. [2018-04-13 13:51:45,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 13:51:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 812 transitions. [2018-04-13 13:51:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2018-04-13 13:51:45,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:51:45,809 INFO L355 BasicCegarLoop]: trace histogram [121, 120, 120, 120, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:51:45,809 INFO L408 AbstractCegarLoop]: === Iteration 121 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:51:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2130703282, now seen corresponding path program 119 times [2018-04-13 13:51:45,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:51:45,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:51:45,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:45,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:51:45,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:51:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:51:45,826 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:51:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 39008 backedges. 0 proven. 28800 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2018-04-13 13:51:48,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:51:48,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:51:48,661 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:52:00,995 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 121 check-sat command(s) [2018-04-13 13:52:00,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:52:01,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:52:01,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-04-13 13:52:01,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-04-13 13:52:01,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-04-13 13:52:01,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 13:52:01,302 INFO L87 Difference]: Start difference. First operand 811 states and 812 transitions. Second operand 123 states. [2018-04-13 13:52:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:03,954 INFO L93 Difference]: Finished difference Result 1106 states and 1163 transitions. [2018-04-13 13:52:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-13 13:52:03,954 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 810 [2018-04-13 13:52:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:03,954 INFO L225 Difference]: With dead ends: 1106 [2018-04-13 13:52:03,955 INFO L226 Difference]: Without dead ends: 1106 [2018-04-13 13:52:03,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 13:52:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-04-13 13:52:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 815. [2018-04-13 13:52:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-13 13:52:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 816 transitions. [2018-04-13 13:52:03,957 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 816 transitions. Word has length 810 [2018-04-13 13:52:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:03,958 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 816 transitions. [2018-04-13 13:52:03,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-04-13 13:52:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 816 transitions. [2018-04-13 13:52:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-04-13 13:52:03,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:03,960 INFO L355 BasicCegarLoop]: trace histogram [122, 121, 121, 121, 65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:03,960 INFO L408 AbstractCegarLoop]: === Iteration 122 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1702490475, now seen corresponding path program 120 times [2018-04-13 13:52:03,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:03,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:03,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:03,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:03,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:03,977 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39490 backedges. 0 proven. 29282 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2018-04-13 13:52:06,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:06,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:52:08,813 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 122 check-sat command(s) [2018-04-13 13:52:08,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:52:08,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 39490 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2018-04-13 13:52:09,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:09,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 67] total 126 [2018-04-13 13:52:09,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-04-13 13:52:09,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-04-13 13:52:09,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7747, Invalid=8003, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 13:52:09,133 INFO L87 Difference]: Start difference. First operand 815 states and 816 transitions. Second operand 126 states. [2018-04-13 13:52:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:12,126 INFO L93 Difference]: Finished difference Result 1115 states and 1172 transitions. [2018-04-13 13:52:12,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-13 13:52:12,152 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 814 [2018-04-13 13:52:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:12,153 INFO L225 Difference]: With dead ends: 1115 [2018-04-13 13:52:12,153 INFO L226 Difference]: Without dead ends: 1115 [2018-04-13 13:52:12,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1065 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=15747, Invalid=20163, Unknown=0, NotChecked=0, Total=35910 [2018-04-13 13:52:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-04-13 13:52:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 824. [2018-04-13 13:52:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-04-13 13:52:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 825 transitions. [2018-04-13 13:52:12,157 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 825 transitions. Word has length 814 [2018-04-13 13:52:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:12,157 INFO L459 AbstractCegarLoop]: Abstraction has 824 states and 825 transitions. [2018-04-13 13:52:12,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-04-13 13:52:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 825 transitions. [2018-04-13 13:52:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2018-04-13 13:52:12,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:12,160 INFO L355 BasicCegarLoop]: trace histogram [123, 122, 122, 122, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:12,160 INFO L408 AbstractCegarLoop]: === Iteration 123 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2008323736, now seen corresponding path program 121 times [2018-04-13 13:52:12,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:12,160 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:12,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:12,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:12,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:12,177 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40298 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 10530 trivial. 0 not checked. [2018-04-13 13:52:15,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:15,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:52:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:15,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40298 backedges. 0 proven. 29768 refuted. 0 times theorem prover too weak. 10530 trivial. 0 not checked. [2018-04-13 13:52:15,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:15,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2018-04-13 13:52:15,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-04-13 13:52:15,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-04-13 13:52:15,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 13:52:15,422 INFO L87 Difference]: Start difference. First operand 824 states and 825 transitions. Second operand 125 states. [2018-04-13 13:52:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:19,642 INFO L93 Difference]: Finished difference Result 1124 states and 1182 transitions. [2018-04-13 13:52:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-04-13 13:52:19,642 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 823 [2018-04-13 13:52:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:19,643 INFO L225 Difference]: With dead ends: 1124 [2018-04-13 13:52:19,643 INFO L226 Difference]: Without dead ends: 1124 [2018-04-13 13:52:19,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 13:52:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-04-13 13:52:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 828. [2018-04-13 13:52:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-04-13 13:52:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 829 transitions. [2018-04-13 13:52:19,646 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 829 transitions. Word has length 823 [2018-04-13 13:52:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:19,646 INFO L459 AbstractCegarLoop]: Abstraction has 828 states and 829 transitions. [2018-04-13 13:52:19,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-04-13 13:52:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 829 transitions. [2018-04-13 13:52:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2018-04-13 13:52:19,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:19,650 INFO L355 BasicCegarLoop]: trace histogram [124, 123, 123, 123, 66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:19,650 INFO L408 AbstractCegarLoop]: === Iteration 124 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 402341967, now seen corresponding path program 122 times [2018-04-13 13:52:19,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:19,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:19,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:52:19,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:19,667 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 40788 backedges. 0 proven. 30258 refuted. 0 times theorem prover too weak. 10530 trivial. 0 not checked. [2018-04-13 13:52:22,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:22,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:22,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:52:22,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:52:22,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:52:22,763 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 40788 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 30258 trivial. 0 not checked. [2018-04-13 13:52:23,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:23,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 67] total 192 [2018-04-13 13:52:23,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-04-13 13:52:23,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-04-13 13:52:23,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14046, Invalid=22626, Unknown=0, NotChecked=0, Total=36672 [2018-04-13 13:52:23,880 INFO L87 Difference]: Start difference. First operand 828 states and 829 transitions. Second operand 192 states. [2018-04-13 13:52:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:30,988 INFO L93 Difference]: Finished difference Result 1133 states and 1191 transitions. [2018-04-13 13:52:30,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-13 13:52:30,988 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 827 [2018-04-13 13:52:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:30,989 INFO L225 Difference]: With dead ends: 1133 [2018-04-13 13:52:30,989 INFO L226 Difference]: Without dead ends: 1133 [2018-04-13 13:52:30,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16236 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=14046, Invalid=22626, Unknown=0, NotChecked=0, Total=36672 [2018-04-13 13:52:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-13 13:52:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 837. [2018-04-13 13:52:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-13 13:52:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 838 transitions. [2018-04-13 13:52:30,992 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 838 transitions. Word has length 827 [2018-04-13 13:52:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:30,992 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 838 transitions. [2018-04-13 13:52:30,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-04-13 13:52:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 838 transitions. [2018-04-13 13:52:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2018-04-13 13:52:30,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:30,995 INFO L355 BasicCegarLoop]: trace histogram [125, 124, 124, 124, 67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:30,995 INFO L408 AbstractCegarLoop]: === Iteration 125 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash -436444266, now seen corresponding path program 123 times [2018-04-13 13:52:30,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:30,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:30,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:30,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:30,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:31,012 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 41609 backedges. 0 proven. 30752 refuted. 0 times theorem prover too weak. 10857 trivial. 0 not checked. [2018-04-13 13:52:34,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:34,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:34,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:52:34,356 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-04-13 13:52:34,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:52:34,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41609 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2018-04-13 13:52:34,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:34,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 69] total 129 [2018-04-13 13:52:34,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-13 13:52:34,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-13 13:52:34,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8124, Invalid=8388, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 13:52:34,713 INFO L87 Difference]: Start difference. First operand 837 states and 838 transitions. Second operand 129 states. [2018-04-13 13:52:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:38,072 INFO L93 Difference]: Finished difference Result 1142 states and 1200 transitions. [2018-04-13 13:52:38,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-13 13:52:38,072 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 836 [2018-04-13 13:52:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:38,073 INFO L225 Difference]: With dead ends: 1142 [2018-04-13 13:52:38,073 INFO L226 Difference]: Without dead ends: 1142 [2018-04-13 13:52:38,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1094 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=16572, Invalid=21258, Unknown=0, NotChecked=0, Total=37830 [2018-04-13 13:52:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-04-13 13:52:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 846. [2018-04-13 13:52:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-04-13 13:52:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 847 transitions. [2018-04-13 13:52:38,078 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 847 transitions. Word has length 836 [2018-04-13 13:52:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:38,078 INFO L459 AbstractCegarLoop]: Abstraction has 846 states and 847 transitions. [2018-04-13 13:52:38,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-13 13:52:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 847 transitions. [2018-04-13 13:52:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2018-04-13 13:52:38,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:38,081 INFO L355 BasicCegarLoop]: trace histogram [126, 125, 125, 125, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:38,081 INFO L408 AbstractCegarLoop]: === Iteration 126 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 264225501, now seen corresponding path program 124 times [2018-04-13 13:52:38,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:38,081 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:38,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:38,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:38,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:38,098 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 42439 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-04-13 13:52:41,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:41,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:52:41,277 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:52:41,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:52:41,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 42439 backedges. 0 proven. 31250 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-04-13 13:52:41,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:41,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2018-04-13 13:52:41,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-13 13:52:41,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-13 13:52:41,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 13:52:41,513 INFO L87 Difference]: Start difference. First operand 846 states and 847 transitions. Second operand 128 states. [2018-04-13 13:52:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:44,270 INFO L93 Difference]: Finished difference Result 1151 states and 1210 transitions. [2018-04-13 13:52:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-04-13 13:52:44,270 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 845 [2018-04-13 13:52:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:44,271 INFO L225 Difference]: With dead ends: 1151 [2018-04-13 13:52:44,271 INFO L226 Difference]: Without dead ends: 1151 [2018-04-13 13:52:44,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-04-13 13:52:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-04-13 13:52:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 850. [2018-04-13 13:52:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-04-13 13:52:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 851 transitions. [2018-04-13 13:52:44,274 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 851 transitions. Word has length 845 [2018-04-13 13:52:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:44,274 INFO L459 AbstractCegarLoop]: Abstraction has 850 states and 851 transitions. [2018-04-13 13:52:44,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-13 13:52:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 851 transitions. [2018-04-13 13:52:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2018-04-13 13:52:44,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:44,277 INFO L355 BasicCegarLoop]: trace histogram [127, 126, 126, 126, 68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:44,277 INFO L408 AbstractCegarLoop]: === Iteration 127 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1962122620, now seen corresponding path program 125 times [2018-04-13 13:52:44,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:44,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:44,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:44,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:44,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:44,295 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:52:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 42941 backedges. 0 proven. 31752 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-04-13 13:52:47,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:52:47,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:52:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:52:48,135 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 127 check-sat command(s) [2018-04-13 13:52:48,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:52:48,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:52:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 42941 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 31752 trivial. 0 not checked. [2018-04-13 13:52:49,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:52:49,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 70] total 197 [2018-04-13 13:52:49,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-04-13 13:52:49,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-04-13 13:52:49,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14750, Invalid=23862, Unknown=0, NotChecked=0, Total=38612 [2018-04-13 13:52:49,576 INFO L87 Difference]: Start difference. First operand 850 states and 851 transitions. Second operand 197 states. [2018-04-13 13:52:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:52:58,208 INFO L93 Difference]: Finished difference Result 1160 states and 1219 transitions. [2018-04-13 13:52:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-04-13 13:52:58,208 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 849 [2018-04-13 13:52:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:52:58,209 INFO L225 Difference]: With dead ends: 1160 [2018-04-13 13:52:58,209 INFO L226 Difference]: Without dead ends: 1160 [2018-04-13 13:52:58,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17136 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=14750, Invalid=23862, Unknown=0, NotChecked=0, Total=38612 [2018-04-13 13:52:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-04-13 13:52:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 859. [2018-04-13 13:52:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-04-13 13:52:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 860 transitions. [2018-04-13 13:52:58,212 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 860 transitions. Word has length 849 [2018-04-13 13:52:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:52:58,212 INFO L459 AbstractCegarLoop]: Abstraction has 859 states and 860 transitions. [2018-04-13 13:52:58,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-04-13 13:52:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 860 transitions. [2018-04-13 13:52:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2018-04-13 13:52:58,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:52:58,215 INFO L355 BasicCegarLoop]: trace histogram [128, 127, 127, 127, 69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:52:58,215 INFO L408 AbstractCegarLoop]: === Iteration 128 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:52:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 270166465, now seen corresponding path program 126 times [2018-04-13 13:52:58,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:52:58,216 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:52:58,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:58,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:52:58,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:52:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:52:58,232 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 43784 backedges. 0 proven. 32258 refuted. 0 times theorem prover too weak. 11526 trivial. 0 not checked. [2018-04-13 13:53:01,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:01,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:53:02,248 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 128 check-sat command(s) [2018-04-13 13:53:02,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:53:02,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:53:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 43784 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 32258 trivial. 0 not checked. [2018-04-13 13:53:02,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:53:02,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 71] total 132 [2018-04-13 13:53:02,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-13 13:53:02,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-13 13:53:02,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8510, Invalid=8782, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 13:53:02,567 INFO L87 Difference]: Start difference. First operand 859 states and 860 transitions. Second operand 132 states. [2018-04-13 13:53:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:53:06,444 INFO L93 Difference]: Finished difference Result 1169 states and 1228 transitions. [2018-04-13 13:53:06,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-13 13:53:06,444 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 858 [2018-04-13 13:53:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:53:06,445 INFO L225 Difference]: With dead ends: 1169 [2018-04-13 13:53:06,445 INFO L226 Difference]: Without dead ends: 1169 [2018-04-13 13:53:06,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 925 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=17418, Invalid=22382, Unknown=0, NotChecked=0, Total=39800 [2018-04-13 13:53:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-04-13 13:53:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 868. [2018-04-13 13:53:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-04-13 13:53:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 869 transitions. [2018-04-13 13:53:06,451 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 869 transitions. Word has length 858 [2018-04-13 13:53:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:53:06,451 INFO L459 AbstractCegarLoop]: Abstraction has 868 states and 869 transitions. [2018-04-13 13:53:06,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-13 13:53:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 869 transitions. [2018-04-13 13:53:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-04-13 13:53:06,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:53:06,455 INFO L355 BasicCegarLoop]: trace histogram [129, 128, 128, 128, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:53:06,455 INFO L408 AbstractCegarLoop]: === Iteration 129 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:53:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 664402002, now seen corresponding path program 127 times [2018-04-13 13:53:06,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:53:06,455 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:53:06,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:06,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:53:06,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:06,475 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 44636 backedges. 0 proven. 32768 refuted. 0 times theorem prover too weak. 11868 trivial. 0 not checked. [2018-04-13 13:53:09,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:09,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:53:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:09,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:53:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 44636 backedges. 0 proven. 32768 refuted. 0 times theorem prover too weak. 11868 trivial. 0 not checked. [2018-04-13 13:53:09,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:53:09,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2018-04-13 13:53:09,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-13 13:53:09,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-13 13:53:09,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 13:53:09,964 INFO L87 Difference]: Start difference. First operand 868 states and 869 transitions. Second operand 131 states. [2018-04-13 13:53:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:53:13,083 INFO L93 Difference]: Finished difference Result 1178 states and 1238 transitions. [2018-04-13 13:53:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-04-13 13:53:13,083 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 867 [2018-04-13 13:53:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:53:13,084 INFO L225 Difference]: With dead ends: 1178 [2018-04-13 13:53:13,084 INFO L226 Difference]: Without dead ends: 1178 [2018-04-13 13:53:13,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-04-13 13:53:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-04-13 13:53:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 872. [2018-04-13 13:53:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-04-13 13:53:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 873 transitions. [2018-04-13 13:53:13,088 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 873 transitions. Word has length 867 [2018-04-13 13:53:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:53:13,088 INFO L459 AbstractCegarLoop]: Abstraction has 872 states and 873 transitions. [2018-04-13 13:53:13,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-13 13:53:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 873 transitions. [2018-04-13 13:53:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2018-04-13 13:53:13,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:53:13,091 INFO L355 BasicCegarLoop]: trace histogram [130, 129, 129, 129, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:53:13,091 INFO L408 AbstractCegarLoop]: === Iteration 130 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:53:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash 376459449, now seen corresponding path program 128 times [2018-04-13 13:53:13,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:53:13,091 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:53:13,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:53:13,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:13,109 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 45150 backedges. 0 proven. 33282 refuted. 0 times theorem prover too weak. 11868 trivial. 0 not checked. [2018-04-13 13:53:16,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:16,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:53:16,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:53:16,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:53:16,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:53:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 45150 backedges. 0 proven. 33282 refuted. 0 times theorem prover too weak. 11868 trivial. 0 not checked. [2018-04-13 13:53:16,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:53:16,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2018-04-13 13:53:16,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-13 13:53:16,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-13 13:53:16,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 13:53:16,688 INFO L87 Difference]: Start difference. First operand 872 states and 873 transitions. Second operand 132 states. [2018-04-13 13:53:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:53:21,706 INFO L93 Difference]: Finished difference Result 1187 states and 1248 transitions. [2018-04-13 13:53:21,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-04-13 13:53:21,706 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 871 [2018-04-13 13:53:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:53:21,707 INFO L225 Difference]: With dead ends: 1187 [2018-04-13 13:53:21,707 INFO L226 Difference]: Without dead ends: 1187 [2018-04-13 13:53:21,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1002 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 13:53:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-04-13 13:53:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 876. [2018-04-13 13:53:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-04-13 13:53:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 877 transitions. [2018-04-13 13:53:21,710 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 877 transitions. Word has length 871 [2018-04-13 13:53:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:53:21,710 INFO L459 AbstractCegarLoop]: Abstraction has 876 states and 877 transitions. [2018-04-13 13:53:21,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-13 13:53:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 877 transitions. [2018-04-13 13:53:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-04-13 13:53:21,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:53:21,716 INFO L355 BasicCegarLoop]: trace histogram [131, 130, 130, 130, 70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:53:21,716 INFO L408 AbstractCegarLoop]: === Iteration 131 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:53:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2012865120, now seen corresponding path program 129 times [2018-04-13 13:53:21,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:53:21,716 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:53:21,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:21,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:53:21,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:21,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45668 backedges. 0 proven. 33800 refuted. 0 times theorem prover too weak. 11868 trivial. 0 not checked. [2018-04-13 13:53:25,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:25,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:53:25,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-13 13:53:25,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:53:25,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:53:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 45668 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 33800 trivial. 0 not checked. [2018-04-13 13:53:25,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:53:25,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 72] total 135 [2018-04-13 13:53:25,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-04-13 13:53:25,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-04-13 13:53:25,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8907, Invalid=9183, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 13:53:25,972 INFO L87 Difference]: Start difference. First operand 876 states and 877 transitions. Second operand 135 states. [2018-04-13 13:53:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:53:30,096 INFO L93 Difference]: Finished difference Result 1196 states and 1257 transitions. [2018-04-13 13:53:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-04-13 13:53:30,096 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 875 [2018-04-13 13:53:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:53:30,097 INFO L225 Difference]: With dead ends: 1196 [2018-04-13 13:53:30,097 INFO L226 Difference]: Without dead ends: 1196 [2018-04-13 13:53:30,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=18153, Invalid=23259, Unknown=0, NotChecked=0, Total=41412 [2018-04-13 13:53:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-04-13 13:53:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 885. [2018-04-13 13:53:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-04-13 13:53:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 886 transitions. [2018-04-13 13:53:30,101 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 886 transitions. Word has length 875 [2018-04-13 13:53:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:53:30,101 INFO L459 AbstractCegarLoop]: Abstraction has 885 states and 886 transitions. [2018-04-13 13:53:30,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-04-13 13:53:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 886 transitions. [2018-04-13 13:53:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2018-04-13 13:53:30,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:53:30,105 INFO L355 BasicCegarLoop]: trace histogram [132, 131, 131, 131, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:53:30,105 INFO L408 AbstractCegarLoop]: === Iteration 132 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:53:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1747256603, now seen corresponding path program 130 times [2018-04-13 13:53:30,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:53:30,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:53:30,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:30,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:53:30,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:30,123 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 46537 backedges. 0 proven. 34322 refuted. 0 times theorem prover too weak. 12215 trivial. 0 not checked. [2018-04-13 13:53:33,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:33,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:33,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:53:33,544 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:53:33,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:53:33,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:53:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 46537 backedges. 0 proven. 34322 refuted. 0 times theorem prover too weak. 12215 trivial. 0 not checked. [2018-04-13 13:53:33,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:53:33,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2018-04-13 13:53:33,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-13 13:53:33,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-13 13:53:33,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 13:53:33,806 INFO L87 Difference]: Start difference. First operand 885 states and 886 transitions. Second operand 134 states. [2018-04-13 13:53:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:53:38,888 INFO L93 Difference]: Finished difference Result 1205 states and 1267 transitions. [2018-04-13 13:53:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-04-13 13:53:38,888 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 884 [2018-04-13 13:53:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:53:38,889 INFO L225 Difference]: With dead ends: 1205 [2018-04-13 13:53:38,889 INFO L226 Difference]: Without dead ends: 1205 [2018-04-13 13:53:38,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 885 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 13:53:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-04-13 13:53:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 889. [2018-04-13 13:53:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-04-13 13:53:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 890 transitions. [2018-04-13 13:53:38,892 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 890 transitions. Word has length 884 [2018-04-13 13:53:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:53:38,892 INFO L459 AbstractCegarLoop]: Abstraction has 889 states and 890 transitions. [2018-04-13 13:53:38,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-13 13:53:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 890 transitions. [2018-04-13 13:53:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-04-13 13:53:38,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:53:38,895 INFO L355 BasicCegarLoop]: trace histogram [133, 132, 132, 132, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:53:38,895 INFO L408 AbstractCegarLoop]: === Iteration 133 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:53:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1406034594, now seen corresponding path program 131 times [2018-04-13 13:53:38,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:53:38,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:53:38,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:38,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:53:38,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:53:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:53:38,914 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:53:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 47063 backedges. 0 proven. 34848 refuted. 0 times theorem prover too weak. 12215 trivial. 0 not checked. [2018-04-13 13:53:42,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:53:42,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:53:42,389 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:53:54,579 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 133 check-sat command(s) [2018-04-13 13:53:54,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:53:54,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:53:54,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-04-13 13:53:54,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-04-13 13:53:54,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-04-13 13:53:54,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 13:53:54,964 INFO L87 Difference]: Start difference. First operand 889 states and 890 transitions. Second operand 135 states. [2018-04-13 13:54:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:00,490 INFO L93 Difference]: Finished difference Result 1214 states and 1277 transitions. [2018-04-13 13:54:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-13 13:54:00,490 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 888 [2018-04-13 13:54:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:00,491 INFO L225 Difference]: With dead ends: 1214 [2018-04-13 13:54:00,491 INFO L226 Difference]: Without dead ends: 1214 [2018-04-13 13:54:00,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 13:54:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-04-13 13:54:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 893. [2018-04-13 13:54:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-04-13 13:54:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 894 transitions. [2018-04-13 13:54:00,494 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 894 transitions. Word has length 888 [2018-04-13 13:54:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:00,494 INFO L459 AbstractCegarLoop]: Abstraction has 893 states and 894 transitions. [2018-04-13 13:54:00,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-04-13 13:54:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 894 transitions. [2018-04-13 13:54:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2018-04-13 13:54:00,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:00,497 INFO L355 BasicCegarLoop]: trace histogram [134, 133, 133, 133, 71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:00,497 INFO L408 AbstractCegarLoop]: === Iteration 134 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1760535721, now seen corresponding path program 132 times [2018-04-13 13:54:00,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:00,498 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:00,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:00,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:54:00,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:00,516 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47593 backedges. 0 proven. 35378 refuted. 0 times theorem prover too weak. 12215 trivial. 0 not checked. [2018-04-13 13:54:04,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:04,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:04,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:54:07,055 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 134 check-sat command(s) [2018-04-13 13:54:07,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:54:07,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:54:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 47593 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2018-04-13 13:54:07,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:54:07,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 73] total 138 [2018-04-13 13:54:07,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-04-13 13:54:07,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-04-13 13:54:07,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9313, Invalid=9593, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 13:54:07,454 INFO L87 Difference]: Start difference. First operand 893 states and 894 transitions. Second operand 138 states. [2018-04-13 13:54:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:11,517 INFO L93 Difference]: Finished difference Result 1223 states and 1286 transitions. [2018-04-13 13:54:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 13:54:11,517 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 892 [2018-04-13 13:54:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:11,518 INFO L225 Difference]: With dead ends: 1223 [2018-04-13 13:54:11,518 INFO L226 Difference]: Without dead ends: 1223 [2018-04-13 13:54:11,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2872 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=18903, Invalid=24153, Unknown=0, NotChecked=0, Total=43056 [2018-04-13 13:54:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-04-13 13:54:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 902. [2018-04-13 13:54:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-04-13 13:54:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 903 transitions. [2018-04-13 13:54:11,522 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 903 transitions. Word has length 892 [2018-04-13 13:54:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:11,523 INFO L459 AbstractCegarLoop]: Abstraction has 902 states and 903 transitions. [2018-04-13 13:54:11,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-04-13 13:54:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 903 transitions. [2018-04-13 13:54:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2018-04-13 13:54:11,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:11,526 INFO L355 BasicCegarLoop]: trace histogram [135, 134, 134, 134, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:11,526 INFO L408 AbstractCegarLoop]: === Iteration 135 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2002115260, now seen corresponding path program 133 times [2018-04-13 13:54:11,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:11,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:11,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:11,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:54:11,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:11,545 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 48479 backedges. 0 proven. 35912 refuted. 0 times theorem prover too weak. 12567 trivial. 0 not checked. [2018-04-13 13:54:15,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:15,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:54:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:15,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:54:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 48479 backedges. 0 proven. 35912 refuted. 0 times theorem prover too weak. 12567 trivial. 0 not checked. [2018-04-13 13:54:15,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:54:15,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2018-04-13 13:54:15,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-13 13:54:15,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-13 13:54:15,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 13:54:15,377 INFO L87 Difference]: Start difference. First operand 902 states and 903 transitions. Second operand 137 states. [2018-04-13 13:54:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:19,376 INFO L93 Difference]: Finished difference Result 1232 states and 1296 transitions. [2018-04-13 13:54:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 13:54:19,377 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 901 [2018-04-13 13:54:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:19,377 INFO L225 Difference]: With dead ends: 1232 [2018-04-13 13:54:19,377 INFO L226 Difference]: Without dead ends: 1232 [2018-04-13 13:54:19,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-04-13 13:54:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2018-04-13 13:54:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 906. [2018-04-13 13:54:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-04-13 13:54:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 907 transitions. [2018-04-13 13:54:19,381 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 907 transitions. Word has length 901 [2018-04-13 13:54:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:19,381 INFO L459 AbstractCegarLoop]: Abstraction has 906 states and 907 transitions. [2018-04-13 13:54:19,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-13 13:54:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 907 transitions. [2018-04-13 13:54:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2018-04-13 13:54:19,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:19,384 INFO L355 BasicCegarLoop]: trace histogram [136, 135, 135, 135, 72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:19,384 INFO L408 AbstractCegarLoop]: === Iteration 136 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash 332093795, now seen corresponding path program 134 times [2018-04-13 13:54:19,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:19,384 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:19,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:19,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:54:19,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:19,402 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 49017 backedges. 0 proven. 36450 refuted. 0 times theorem prover too weak. 12567 trivial. 0 not checked. [2018-04-13 13:54:22,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:22,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:22,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:54:22,971 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:54:22,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:54:22,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:54:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49017 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 36450 trivial. 0 not checked. [2018-04-13 13:54:23,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:54:23,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 74] total 143 [2018-04-13 13:54:23,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-04-13 13:54:23,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-04-13 13:54:23,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9798, Invalid=10508, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 13:54:23,314 INFO L87 Difference]: Start difference. First operand 906 states and 907 transitions. Second operand 143 states. [2018-04-13 13:54:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:28,514 INFO L93 Difference]: Finished difference Result 1241 states and 1305 transitions. [2018-04-13 13:54:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-04-13 13:54:28,515 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 905 [2018-04-13 13:54:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:28,516 INFO L225 Difference]: With dead ends: 1241 [2018-04-13 13:54:28,516 INFO L226 Difference]: Without dead ends: 1241 [2018-04-13 13:54:28,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1184 GetRequests, 972 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=19661, Invalid=25921, Unknown=0, NotChecked=0, Total=45582 [2018-04-13 13:54:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-04-13 13:54:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 915. [2018-04-13 13:54:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-04-13 13:54:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 916 transitions. [2018-04-13 13:54:28,521 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 916 transitions. Word has length 905 [2018-04-13 13:54:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:28,522 INFO L459 AbstractCegarLoop]: Abstraction has 915 states and 916 transitions. [2018-04-13 13:54:28,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-04-13 13:54:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 916 transitions. [2018-04-13 13:54:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-04-13 13:54:28,525 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:28,525 INFO L355 BasicCegarLoop]: trace histogram [137, 136, 136, 136, 73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:28,525 INFO L408 AbstractCegarLoop]: === Iteration 137 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash 942663490, now seen corresponding path program 135 times [2018-04-13 13:54:28,525 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:28,525 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:28,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:28,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:54:28,526 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:28,562 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 49916 backedges. 0 proven. 36992 refuted. 0 times theorem prover too weak. 12924 trivial. 0 not checked. [2018-04-13 13:54:32,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:32,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:54:32,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-04-13 13:54:32,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:54:32,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:54:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 49916 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 36992 trivial. 0 not checked. [2018-04-13 13:54:32,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:54:32,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 75] total 141 [2018-04-13 13:54:32,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-13 13:54:32,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-13 13:54:32,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9726, Invalid=10014, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 13:54:32,960 INFO L87 Difference]: Start difference. First operand 915 states and 916 transitions. Second operand 141 states. [2018-04-13 13:54:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:37,125 INFO L93 Difference]: Finished difference Result 1250 states and 1314 transitions. [2018-04-13 13:54:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-13 13:54:37,126 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 914 [2018-04-13 13:54:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:37,127 INFO L225 Difference]: With dead ends: 1250 [2018-04-13 13:54:37,127 INFO L226 Difference]: Without dead ends: 1250 [2018-04-13 13:54:37,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=19806, Invalid=25350, Unknown=0, NotChecked=0, Total=45156 [2018-04-13 13:54:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-13 13:54:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 924. [2018-04-13 13:54:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-04-13 13:54:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 925 transitions. [2018-04-13 13:54:37,130 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 925 transitions. Word has length 914 [2018-04-13 13:54:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:37,130 INFO L459 AbstractCegarLoop]: Abstraction has 924 states and 925 transitions. [2018-04-13 13:54:37,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-13 13:54:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 925 transitions. [2018-04-13 13:54:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2018-04-13 13:54:37,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:37,134 INFO L355 BasicCegarLoop]: trace histogram [138, 137, 137, 137, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:37,134 INFO L408 AbstractCegarLoop]: === Iteration 138 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2133138831, now seen corresponding path program 136 times [2018-04-13 13:54:37,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:37,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:37,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:37,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:54:37,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:37,153 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 50824 backedges. 0 proven. 37538 refuted. 0 times theorem prover too weak. 13286 trivial. 0 not checked. [2018-04-13 13:54:40,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:40,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:54:40,891 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:54:40,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:54:40,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:54:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 50824 backedges. 0 proven. 37538 refuted. 0 times theorem prover too weak. 13286 trivial. 0 not checked. [2018-04-13 13:54:41,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:54:41,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2018-04-13 13:54:41,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-13 13:54:41,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-13 13:54:41,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 13:54:41,195 INFO L87 Difference]: Start difference. First operand 924 states and 925 transitions. Second operand 140 states. [2018-04-13 13:54:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:54:46,623 INFO L93 Difference]: Finished difference Result 1259 states and 1324 transitions. [2018-04-13 13:54:46,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-13 13:54:46,623 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 923 [2018-04-13 13:54:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:54:46,624 INFO L225 Difference]: With dead ends: 1259 [2018-04-13 13:54:46,624 INFO L226 Difference]: Without dead ends: 1259 [2018-04-13 13:54:46,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 13:54:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2018-04-13 13:54:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 928. [2018-04-13 13:54:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-04-13 13:54:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 929 transitions. [2018-04-13 13:54:46,629 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 929 transitions. Word has length 923 [2018-04-13 13:54:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:54:46,629 INFO L459 AbstractCegarLoop]: Abstraction has 928 states and 929 transitions. [2018-04-13 13:54:46,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-13 13:54:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 929 transitions. [2018-04-13 13:54:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-04-13 13:54:46,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:54:46,635 INFO L355 BasicCegarLoop]: trace histogram [139, 138, 138, 138, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:54:46,635 INFO L408 AbstractCegarLoop]: === Iteration 139 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:54:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash -145172008, now seen corresponding path program 137 times [2018-04-13 13:54:46,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:54:46,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:54:46,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:46,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:54:46,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:54:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:54:46,654 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:54:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 51374 backedges. 0 proven. 38088 refuted. 0 times theorem prover too weak. 13286 trivial. 0 not checked. [2018-04-13 13:54:50,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:54:50,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:54:50,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:55:02,874 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 139 check-sat command(s) [2018-04-13 13:55:02,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:55:02,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:55:02,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-04-13 13:55:02,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-13 13:55:02,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-13 13:55:02,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 13:55:02,958 INFO L87 Difference]: Start difference. First operand 928 states and 929 transitions. Second operand 141 states. [2018-04-13 13:55:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:55:08,923 INFO L93 Difference]: Finished difference Result 1268 states and 1334 transitions. [2018-04-13 13:55:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-04-13 13:55:08,923 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 927 [2018-04-13 13:55:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:55:08,924 INFO L225 Difference]: With dead ends: 1268 [2018-04-13 13:55:08,924 INFO L226 Difference]: Without dead ends: 1268 [2018-04-13 13:55:08,925 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 13:55:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-04-13 13:55:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 932. [2018-04-13 13:55:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-04-13 13:55:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 933 transitions. [2018-04-13 13:55:08,931 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 933 transitions. Word has length 927 [2018-04-13 13:55:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:55:08,931 INFO L459 AbstractCegarLoop]: Abstraction has 932 states and 933 transitions. [2018-04-13 13:55:08,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-13 13:55:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 933 transitions. [2018-04-13 13:55:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-04-13 13:55:08,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:55:08,937 INFO L355 BasicCegarLoop]: trace histogram [140, 139, 139, 139, 74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:55:08,937 INFO L408 AbstractCegarLoop]: === Iteration 140 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:55:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2052143681, now seen corresponding path program 138 times [2018-04-13 13:55:08,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:55:08,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:55:08,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:08,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:55:08,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:08,970 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:55:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 51928 backedges. 0 proven. 38642 refuted. 0 times theorem prover too weak. 13286 trivial. 0 not checked. [2018-04-13 13:55:12,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:55:12,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:55:12,774 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:55:17,081 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 140 check-sat command(s) [2018-04-13 13:55:17,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:55:17,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:55:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 51928 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 38642 trivial. 0 not checked. [2018-04-13 13:55:17,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:55:17,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 76] total 144 [2018-04-13 13:55:17,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-04-13 13:55:17,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-04-13 13:55:17,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10150, Invalid=10442, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 13:55:17,530 INFO L87 Difference]: Start difference. First operand 932 states and 933 transitions. Second operand 144 states. [2018-04-13 13:55:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:55:23,056 INFO L93 Difference]: Finished difference Result 1277 states and 1343 transitions. [2018-04-13 13:55:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-04-13 13:55:23,056 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 931 [2018-04-13 13:55:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:55:23,057 INFO L225 Difference]: With dead ends: 1277 [2018-04-13 13:55:23,057 INFO L226 Difference]: Without dead ends: 1277 [2018-04-13 13:55:23,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3106 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=20589, Invalid=26283, Unknown=0, NotChecked=0, Total=46872 [2018-04-13 13:55:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-04-13 13:55:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 941. [2018-04-13 13:55:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-04-13 13:55:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 942 transitions. [2018-04-13 13:55:23,061 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 942 transitions. Word has length 931 [2018-04-13 13:55:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:55:23,061 INFO L459 AbstractCegarLoop]: Abstraction has 941 states and 942 transitions. [2018-04-13 13:55:23,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-04-13 13:55:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 942 transitions. [2018-04-13 13:55:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2018-04-13 13:55:23,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:55:23,065 INFO L355 BasicCegarLoop]: trace histogram [141, 140, 140, 140, 75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:55:23,065 INFO L408 AbstractCegarLoop]: === Iteration 141 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:55:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash -432779482, now seen corresponding path program 139 times [2018-04-13 13:55:23,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:55:23,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:55:23,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:23,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:55:23,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:23,085 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:55:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 52853 backedges. 0 proven. 39200 refuted. 0 times theorem prover too weak. 13653 trivial. 0 not checked. [2018-04-13 13:55:26,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:55:26,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:55:26,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:55:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:26,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:55:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 52853 backedges. 0 proven. 39200 refuted. 0 times theorem prover too weak. 13653 trivial. 0 not checked. [2018-04-13 13:55:27,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:55:27,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2018-04-13 13:55:27,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-04-13 13:55:27,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-04-13 13:55:27,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 13:55:27,181 INFO L87 Difference]: Start difference. First operand 941 states and 942 transitions. Second operand 143 states. [2018-04-13 13:55:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:55:33,115 INFO L93 Difference]: Finished difference Result 1286 states and 1353 transitions. [2018-04-13 13:55:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-04-13 13:55:33,115 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 940 [2018-04-13 13:55:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:55:33,116 INFO L225 Difference]: With dead ends: 1286 [2018-04-13 13:55:33,116 INFO L226 Difference]: Without dead ends: 1286 [2018-04-13 13:55:33,117 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1082 GetRequests, 941 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-04-13 13:55:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-04-13 13:55:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 945. [2018-04-13 13:55:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2018-04-13 13:55:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 946 transitions. [2018-04-13 13:55:33,120 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 946 transitions. Word has length 940 [2018-04-13 13:55:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:55:33,120 INFO L459 AbstractCegarLoop]: Abstraction has 945 states and 946 transitions. [2018-04-13 13:55:33,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-04-13 13:55:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 946 transitions. [2018-04-13 13:55:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2018-04-13 13:55:33,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:55:33,123 INFO L355 BasicCegarLoop]: trace histogram [142, 141, 141, 141, 75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:55:33,123 INFO L408 AbstractCegarLoop]: === Iteration 142 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:55:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1899311775, now seen corresponding path program 140 times [2018-04-13 13:55:33,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:55:33,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:55:33,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:55:33,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:33,142 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:55:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 53415 backedges. 0 proven. 39762 refuted. 0 times theorem prover too weak. 13653 trivial. 0 not checked. [2018-04-13 13:55:37,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:55:37,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:55:37,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:55:37,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:55:37,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:55:37,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:55:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 53415 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 39762 trivial. 0 not checked. [2018-04-13 13:55:37,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:55:37,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 77] total 149 [2018-04-13 13:55:37,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-04-13 13:55:37,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-04-13 13:55:37,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10656, Invalid=11396, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 13:55:37,418 INFO L87 Difference]: Start difference. First operand 945 states and 946 transitions. Second operand 149 states. [2018-04-13 13:55:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:55:42,523 INFO L93 Difference]: Finished difference Result 1295 states and 1362 transitions. [2018-04-13 13:55:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-04-13 13:55:42,523 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 944 [2018-04-13 13:55:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:55:42,524 INFO L225 Difference]: With dead ends: 1295 [2018-04-13 13:55:42,524 INFO L226 Difference]: Without dead ends: 1295 [2018-04-13 13:55:42,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1014 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=21380, Invalid=28126, Unknown=0, NotChecked=0, Total=49506 [2018-04-13 13:55:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2018-04-13 13:55:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 954. [2018-04-13 13:55:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2018-04-13 13:55:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 955 transitions. [2018-04-13 13:55:42,528 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 955 transitions. Word has length 944 [2018-04-13 13:55:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:55:42,528 INFO L459 AbstractCegarLoop]: Abstraction has 954 states and 955 transitions. [2018-04-13 13:55:42,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-04-13 13:55:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 955 transitions. [2018-04-13 13:55:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2018-04-13 13:55:42,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:55:42,532 INFO L355 BasicCegarLoop]: trace histogram [143, 142, 142, 142, 76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:55:42,532 INFO L408 AbstractCegarLoop]: === Iteration 143 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:55:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash -659793164, now seen corresponding path program 141 times [2018-04-13 13:55:42,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:55:42,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:55:42,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:42,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:55:42,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:42,551 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:55:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 54353 backedges. 0 proven. 40328 refuted. 0 times theorem prover too weak. 14025 trivial. 0 not checked. [2018-04-13 13:55:46,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:55:46,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:55:46,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:55:47,038 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-13 13:55:47,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:55:47,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:55:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 54353 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 40328 trivial. 0 not checked. [2018-04-13 13:55:47,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:55:47,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 78] total 147 [2018-04-13 13:55:47,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-13 13:55:47,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-13 13:55:47,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10581, Invalid=10881, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 13:55:47,421 INFO L87 Difference]: Start difference. First operand 954 states and 955 transitions. Second operand 147 states. [2018-04-13 13:55:52,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:55:52,979 INFO L93 Difference]: Finished difference Result 1304 states and 1371 transitions. [2018-04-13 13:55:52,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-13 13:55:52,979 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 953 [2018-04-13 13:55:52,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:55:52,980 INFO L225 Difference]: With dead ends: 1304 [2018-04-13 13:55:52,980 INFO L226 Difference]: Without dead ends: 1304 [2018-04-13 13:55:52,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1027 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=21531, Invalid=27531, Unknown=0, NotChecked=0, Total=49062 [2018-04-13 13:55:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2018-04-13 13:55:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 963. [2018-04-13 13:55:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-04-13 13:55:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 964 transitions. [2018-04-13 13:55:52,985 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 964 transitions. Word has length 953 [2018-04-13 13:55:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:55:52,985 INFO L459 AbstractCegarLoop]: Abstraction has 963 states and 964 transitions. [2018-04-13 13:55:52,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-13 13:55:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 964 transitions. [2018-04-13 13:55:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2018-04-13 13:55:52,989 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:55:52,989 INFO L355 BasicCegarLoop]: trace histogram [144, 143, 143, 143, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:55:52,989 INFO L408 AbstractCegarLoop]: === Iteration 144 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:55:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash 11240017, now seen corresponding path program 142 times [2018-04-13 13:55:52,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:55:52,989 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:55:52,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:52,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:55:52,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:55:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:55:53,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:55:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55300 backedges. 0 proven. 40898 refuted. 0 times theorem prover too weak. 14402 trivial. 0 not checked. [2018-04-13 13:55:57,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:55:57,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:55:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:55:57,109 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:55:57,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:55:57,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:55:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 55300 backedges. 0 proven. 40898 refuted. 0 times theorem prover too weak. 14402 trivial. 0 not checked. [2018-04-13 13:55:57,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:55:57,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2018-04-13 13:55:57,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-04-13 13:55:57,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-04-13 13:55:57,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 13:55:57,413 INFO L87 Difference]: Start difference. First operand 963 states and 964 transitions. Second operand 146 states. [2018-04-13 13:56:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:56:03,877 INFO L93 Difference]: Finished difference Result 1313 states and 1381 transitions. [2018-04-13 13:56:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-13 13:56:03,878 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 962 [2018-04-13 13:56:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:56:03,878 INFO L225 Difference]: With dead ends: 1313 [2018-04-13 13:56:03,879 INFO L226 Difference]: Without dead ends: 1313 [2018-04-13 13:56:03,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1107 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 13:56:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2018-04-13 13:56:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 967. [2018-04-13 13:56:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-04-13 13:56:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 968 transitions. [2018-04-13 13:56:03,882 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 968 transitions. Word has length 962 [2018-04-13 13:56:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:56:03,882 INFO L459 AbstractCegarLoop]: Abstraction has 967 states and 968 transitions. [2018-04-13 13:56:03,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-04-13 13:56:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 968 transitions. [2018-04-13 13:56:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2018-04-13 13:56:03,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:56:03,886 INFO L355 BasicCegarLoop]: trace histogram [145, 144, 144, 144, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:56:03,886 INFO L408 AbstractCegarLoop]: === Iteration 145 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:56:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1476498698, now seen corresponding path program 143 times [2018-04-13 13:56:03,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:56:03,886 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:56:03,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:03,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:56:03,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:03,906 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:56:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 55874 backedges. 0 proven. 41472 refuted. 0 times theorem prover too weak. 14402 trivial. 0 not checked. [2018-04-13 13:56:08,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:56:08,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:56:08,245 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:56:09,166 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 145 check-sat command(s) [2018-04-13 13:56:09,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:56:09,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:56:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 55874 backedges. 0 proven. 41472 refuted. 0 times theorem prover too weak. 14402 trivial. 0 not checked. [2018-04-13 13:56:09,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:56:09,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2018-04-13 13:56:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-04-13 13:56:09,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-04-13 13:56:09,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 13:56:09,501 INFO L87 Difference]: Start difference. First operand 967 states and 968 transitions. Second operand 147 states. [2018-04-13 13:56:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:56:16,654 INFO L93 Difference]: Finished difference Result 1322 states and 1391 transitions. [2018-04-13 13:56:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-04-13 13:56:16,654 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 966 [2018-04-13 13:56:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:56:16,655 INFO L225 Difference]: With dead ends: 1322 [2018-04-13 13:56:16,655 INFO L226 Difference]: Without dead ends: 1322 [2018-04-13 13:56:16,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-04-13 13:56:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-04-13 13:56:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 971. [2018-04-13 13:56:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2018-04-13 13:56:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 972 transitions. [2018-04-13 13:56:16,659 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 972 transitions. Word has length 966 [2018-04-13 13:56:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:56:16,659 INFO L459 AbstractCegarLoop]: Abstraction has 971 states and 972 transitions. [2018-04-13 13:56:16,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-04-13 13:56:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 972 transitions. [2018-04-13 13:56:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2018-04-13 13:56:16,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:56:16,662 INFO L355 BasicCegarLoop]: trace histogram [146, 145, 145, 145, 77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:56:16,662 INFO L408 AbstractCegarLoop]: === Iteration 146 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:56:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash 472752963, now seen corresponding path program 144 times [2018-04-13 13:56:16,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:56:16,663 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:56:16,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:16,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:56:16,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:16,682 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:56:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 56452 backedges. 0 proven. 42050 refuted. 0 times theorem prover too weak. 14402 trivial. 0 not checked. [2018-04-13 13:56:20,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:56:20,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:56:20,816 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:56:22,331 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 146 check-sat command(s) [2018-04-13 13:56:22,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:56:22,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:56:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 56452 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 42050 trivial. 0 not checked. [2018-04-13 13:56:22,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:56:22,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 79] total 150 [2018-04-13 13:56:22,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-13 13:56:22,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-13 13:56:22,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11023, Invalid=11327, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 13:56:22,732 INFO L87 Difference]: Start difference. First operand 971 states and 972 transitions. Second operand 150 states. [2018-04-13 13:56:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:56:28,260 INFO L93 Difference]: Finished difference Result 1331 states and 1400 transitions. [2018-04-13 13:56:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-04-13 13:56:28,260 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 970 [2018-04-13 13:56:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:56:28,261 INFO L225 Difference]: With dead ends: 1331 [2018-04-13 13:56:28,261 INFO L226 Difference]: Without dead ends: 1331 [2018-04-13 13:56:28,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=22347, Invalid=28503, Unknown=0, NotChecked=0, Total=50850 [2018-04-13 13:56:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2018-04-13 13:56:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 980. [2018-04-13 13:56:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2018-04-13 13:56:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 981 transitions. [2018-04-13 13:56:28,265 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 981 transitions. Word has length 970 [2018-04-13 13:56:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:56:28,265 INFO L459 AbstractCegarLoop]: Abstraction has 980 states and 981 transitions. [2018-04-13 13:56:28,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-13 13:56:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 981 transitions. [2018-04-13 13:56:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2018-04-13 13:56:28,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:56:28,269 INFO L355 BasicCegarLoop]: trace histogram [147, 146, 146, 146, 78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:56:28,269 INFO L408 AbstractCegarLoop]: === Iteration 147 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:56:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1439850992, now seen corresponding path program 145 times [2018-04-13 13:56:28,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:56:28,269 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:56:28,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:28,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:56:28,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:28,289 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:56:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 57416 backedges. 0 proven. 42632 refuted. 0 times theorem prover too weak. 14784 trivial. 0 not checked. [2018-04-13 13:56:32,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:56:32,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:56:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:56:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:32,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:56:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 57416 backedges. 0 proven. 42632 refuted. 0 times theorem prover too weak. 14784 trivial. 0 not checked. [2018-04-13 13:56:32,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:56:32,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2018-04-13 13:56:32,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-04-13 13:56:32,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-04-13 13:56:32,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 13:56:32,795 INFO L87 Difference]: Start difference. First operand 980 states and 981 transitions. Second operand 149 states. [2018-04-13 13:56:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:56:37,778 INFO L93 Difference]: Finished difference Result 1340 states and 1410 transitions. [2018-04-13 13:56:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-04-13 13:56:37,778 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 979 [2018-04-13 13:56:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:56:37,779 INFO L225 Difference]: With dead ends: 1340 [2018-04-13 13:56:37,779 INFO L226 Difference]: Without dead ends: 1340 [2018-04-13 13:56:37,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 13:56:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2018-04-13 13:56:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 984. [2018-04-13 13:56:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-04-13 13:56:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 985 transitions. [2018-04-13 13:56:37,783 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 985 transitions. Word has length 979 [2018-04-13 13:56:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:56:37,783 INFO L459 AbstractCegarLoop]: Abstraction has 984 states and 985 transitions. [2018-04-13 13:56:37,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-04-13 13:56:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 985 transitions. [2018-04-13 13:56:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-04-13 13:56:37,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:56:37,787 INFO L355 BasicCegarLoop]: trace histogram [148, 147, 147, 147, 78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:56:37,787 INFO L408 AbstractCegarLoop]: === Iteration 148 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:56:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2028614775, now seen corresponding path program 146 times [2018-04-13 13:56:37,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:56:37,787 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:56:37,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:37,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:56:37,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:37,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:56:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 58002 backedges. 0 proven. 43218 refuted. 0 times theorem prover too weak. 14784 trivial. 0 not checked. [2018-04-13 13:56:42,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:56:42,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:56:42,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:56:42,029 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:56:42,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:56:42,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:56:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 58002 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 43218 trivial. 0 not checked. [2018-04-13 13:56:42,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:56:42,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 80] total 158 [2018-04-13 13:56:42,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-04-13 13:56:42,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-04-13 13:56:42,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11787, Invalid=13019, Unknown=0, NotChecked=0, Total=24806 [2018-04-13 13:56:42,475 INFO L87 Difference]: Start difference. First operand 984 states and 985 transitions. Second operand 158 states. [2018-04-13 13:56:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:56:48,778 INFO L93 Difference]: Finished difference Result 1349 states and 1419 transitions. [2018-04-13 13:56:48,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-04-13 13:56:48,778 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 983 [2018-04-13 13:56:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:56:48,779 INFO L225 Difference]: With dead ends: 1349 [2018-04-13 13:56:48,779 INFO L226 Difference]: Without dead ends: 1349 [2018-04-13 13:56:48,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1286 GetRequests, 1052 SyntacticMatches, 1 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5305 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=23393, Invalid=31597, Unknown=0, NotChecked=0, Total=54990 [2018-04-13 13:56:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-04-13 13:56:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 993. [2018-04-13 13:56:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-04-13 13:56:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 994 transitions. [2018-04-13 13:56:48,783 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 994 transitions. Word has length 983 [2018-04-13 13:56:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:56:48,784 INFO L459 AbstractCegarLoop]: Abstraction has 993 states and 994 transitions. [2018-04-13 13:56:48,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-04-13 13:56:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 994 transitions. [2018-04-13 13:56:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2018-04-13 13:56:48,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:56:48,787 INFO L355 BasicCegarLoop]: trace histogram [149, 148, 148, 148, 79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:56:48,787 INFO L408 AbstractCegarLoop]: === Iteration 149 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:56:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1796897006, now seen corresponding path program 147 times [2018-04-13 13:56:48,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:56:48,788 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:56:48,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:48,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:56:48,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:56:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:56:48,808 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:56:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 58979 backedges. 0 proven. 43808 refuted. 0 times theorem prover too weak. 15171 trivial. 0 not checked. [2018-04-13 13:56:53,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:56:53,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:56:53,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 13:56:53,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-04-13 13:56:53,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:56:53,794 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:56:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 58979 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 43808 trivial. 0 not checked. [2018-04-13 13:56:54,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:56:54,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 81] total 153 [2018-04-13 13:56:54,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-04-13 13:56:54,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-04-13 13:56:54,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11472, Invalid=11784, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 13:56:54,112 INFO L87 Difference]: Start difference. First operand 993 states and 994 transitions. Second operand 153 states. [2018-04-13 13:57:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:57:00,104 INFO L93 Difference]: Finished difference Result 1358 states and 1428 transitions. [2018-04-13 13:57:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-04-13 13:57:00,104 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 992 [2018-04-13 13:57:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:57:00,105 INFO L225 Difference]: With dead ends: 1358 [2018-04-13 13:57:00,105 INFO L226 Difference]: Without dead ends: 1358 [2018-04-13 13:57:00,106 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1298 GetRequests, 1069 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3511 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=23328, Invalid=29802, Unknown=0, NotChecked=0, Total=53130 [2018-04-13 13:57:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2018-04-13 13:57:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1002. [2018-04-13 13:57:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2018-04-13 13:57:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1003 transitions. [2018-04-13 13:57:00,109 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1003 transitions. Word has length 992 [2018-04-13 13:57:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:57:00,109 INFO L459 AbstractCegarLoop]: Abstraction has 1002 states and 1003 transitions. [2018-04-13 13:57:00,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-04-13 13:57:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1003 transitions. [2018-04-13 13:57:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-04-13 13:57:00,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:57:00,113 INFO L355 BasicCegarLoop]: trace histogram [150, 149, 149, 149, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:57:00,113 INFO L408 AbstractCegarLoop]: === Iteration 150 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:57:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2122505211, now seen corresponding path program 148 times [2018-04-13 13:57:00,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:57:00,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:57:00,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:00,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:57:00,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:57:00,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:57:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 59965 backedges. 0 proven. 44402 refuted. 0 times theorem prover too weak. 15563 trivial. 0 not checked. [2018-04-13 13:57:04,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:57:04,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:57:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 13:57:04,793 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 13:57:04,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:57:04,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:57:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 59965 backedges. 0 proven. 44402 refuted. 0 times theorem prover too weak. 15563 trivial. 0 not checked. [2018-04-13 13:57:05,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:57:05,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2018-04-13 13:57:05,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-04-13 13:57:05,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-04-13 13:57:05,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 13:57:05,143 INFO L87 Difference]: Start difference. First operand 1002 states and 1003 transitions. Second operand 152 states. [2018-04-13 13:57:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:57:12,817 INFO L93 Difference]: Finished difference Result 1367 states and 1438 transitions. [2018-04-13 13:57:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-04-13 13:57:12,818 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 1001 [2018-04-13 13:57:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:57:12,819 INFO L225 Difference]: With dead ends: 1367 [2018-04-13 13:57:12,819 INFO L226 Difference]: Without dead ends: 1367 [2018-04-13 13:57:12,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1152 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 13:57:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-04-13 13:57:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1006. [2018-04-13 13:57:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-04-13 13:57:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1007 transitions. [2018-04-13 13:57:12,824 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1007 transitions. Word has length 1001 [2018-04-13 13:57:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:57:12,824 INFO L459 AbstractCegarLoop]: Abstraction has 1006 states and 1007 transitions. [2018-04-13 13:57:12,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-04-13 13:57:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1007 transitions. [2018-04-13 13:57:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2018-04-13 13:57:12,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:57:12,828 INFO L355 BasicCegarLoop]: trace histogram [151, 150, 150, 150, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:57:12,828 INFO L408 AbstractCegarLoop]: === Iteration 151 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:57:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1157227308, now seen corresponding path program 149 times [2018-04-13 13:57:12,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:57:12,828 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:57:12,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:12,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:57:12,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:57:12,850 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:57:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 60563 backedges. 0 proven. 45000 refuted. 0 times theorem prover too weak. 15563 trivial. 0 not checked. [2018-04-13 13:57:17,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:57:17,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:57:17,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 13:57:29,524 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 151 check-sat command(s) [2018-04-13 13:57:29,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 13:57:30,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 13:57:30,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-04-13 13:57:30,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-04-13 13:57:30,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-04-13 13:57:30,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 13:57:30,090 INFO L87 Difference]: Start difference. First operand 1006 states and 1007 transitions. Second operand 153 states. [2018-04-13 13:57:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:57:39,270 INFO L93 Difference]: Finished difference Result 1376 states and 1448 transitions. [2018-04-13 13:57:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-04-13 13:57:39,271 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 1005 [2018-04-13 13:57:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:57:39,271 INFO L225 Difference]: With dead ends: 1376 [2018-04-13 13:57:39,271 INFO L226 Difference]: Without dead ends: 1376 [2018-04-13 13:57:39,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 13:57:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-04-13 13:57:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1010. [2018-04-13 13:57:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-04-13 13:57:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1011 transitions. [2018-04-13 13:57:39,275 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1011 transitions. Word has length 1005 [2018-04-13 13:57:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:57:39,275 INFO L459 AbstractCegarLoop]: Abstraction has 1010 states and 1011 transitions. [2018-04-13 13:57:39,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-04-13 13:57:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1011 transitions. [2018-04-13 13:57:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2018-04-13 13:57:39,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:57:39,279 INFO L355 BasicCegarLoop]: trace histogram [152, 151, 151, 151, 80, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:57:39,279 INFO L408 AbstractCegarLoop]: === Iteration 152 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:57:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1881454291, now seen corresponding path program 150 times [2018-04-13 13:57:39,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:57:39,280 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:57:39,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:39,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:57:39,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:57:39,300 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:57:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 61165 backedges. 0 proven. 45602 refuted. 0 times theorem prover too weak. 15563 trivial. 0 not checked. [2018-04-13 13:57:43,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:57:43,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:57:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 13:57:45,019 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 152 check-sat command(s) [2018-04-13 13:57:45,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:57:45,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:57:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 61165 backedges. 0 proven. 15563 refuted. 0 times theorem prover too weak. 45602 trivial. 0 not checked. [2018-04-13 13:57:45,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:57:45,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 82] total 156 [2018-04-13 13:57:45,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-04-13 13:57:45,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-04-13 13:57:45,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11932, Invalid=12248, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 13:57:45,667 INFO L87 Difference]: Start difference. First operand 1010 states and 1011 transitions. Second operand 156 states. [2018-04-13 13:57:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:57:51,929 INFO L93 Difference]: Finished difference Result 1385 states and 1457 transitions. [2018-04-13 13:57:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-04-13 13:57:51,930 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 1009 [2018-04-13 13:57:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:57:51,931 INFO L225 Difference]: With dead ends: 1385 [2018-04-13 13:57:51,931 INFO L226 Difference]: Without dead ends: 1385 [2018-04-13 13:57:51,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1087 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3601 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=24177, Invalid=30813, Unknown=0, NotChecked=0, Total=54990 [2018-04-13 13:57:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-04-13 13:57:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1019. [2018-04-13 13:57:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-04-13 13:57:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1020 transitions. [2018-04-13 13:57:51,935 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1020 transitions. Word has length 1009 [2018-04-13 13:57:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:57:51,936 INFO L459 AbstractCegarLoop]: Abstraction has 1019 states and 1020 transitions. [2018-04-13 13:57:51,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-04-13 13:57:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1020 transitions. [2018-04-13 13:57:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2018-04-13 13:57:51,939 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:57:51,939 INFO L355 BasicCegarLoop]: trace histogram [153, 152, 152, 152, 81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:57:51,939 INFO L408 AbstractCegarLoop]: === Iteration 153 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:57:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1396589870, now seen corresponding path program 151 times [2018-04-13 13:57:51,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:57:51,940 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:57:51,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:51,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 13:57:51,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:57:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:57:51,960 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:57:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 62168 backedges. 0 proven. 46208 refuted. 0 times theorem prover too weak. 15960 trivial. 0 not checked. [2018-04-13 13:57:56,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:57:56,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:57:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:57:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:57:56,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:57:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 62168 backedges. 0 proven. 46208 refuted. 0 times theorem prover too weak. 15960 trivial. 0 not checked. [2018-04-13 13:57:57,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:57:57,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2018-04-13 13:57:57,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-04-13 13:57:57,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-04-13 13:57:57,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 13:57:57,014 INFO L87 Difference]: Start difference. First operand 1019 states and 1020 transitions. Second operand 155 states. [2018-04-13 13:58:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 13:58:02,575 INFO L93 Difference]: Finished difference Result 1394 states and 1467 transitions. [2018-04-13 13:58:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-04-13 13:58:02,575 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 1018 [2018-04-13 13:58:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 13:58:02,576 INFO L225 Difference]: With dead ends: 1394 [2018-04-13 13:58:02,576 INFO L226 Difference]: Without dead ends: 1394 [2018-04-13 13:58:02,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 13:58:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-04-13 13:58:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1023. [2018-04-13 13:58:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-04-13 13:58:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1024 transitions. [2018-04-13 13:58:02,580 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1024 transitions. Word has length 1018 [2018-04-13 13:58:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 13:58:02,580 INFO L459 AbstractCegarLoop]: Abstraction has 1023 states and 1024 transitions. [2018-04-13 13:58:02,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-04-13 13:58:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1024 transitions. [2018-04-13 13:58:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2018-04-13 13:58:02,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 13:58:02,584 INFO L355 BasicCegarLoop]: trace histogram [154, 153, 153, 153, 81, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 13:58:02,584 INFO L408 AbstractCegarLoop]: === Iteration 154 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-13 13:58:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1699459445, now seen corresponding path program 152 times [2018-04-13 13:58:02,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 13:58:02,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 13:58:02,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:58:02,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 13:58:02,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 13:58:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 13:58:02,606 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 13:58:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 62778 backedges. 0 proven. 46818 refuted. 0 times theorem prover too weak. 15960 trivial. 0 not checked. [2018-04-13 13:58:07,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 13:58:07,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 13:58:07,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 13:58:07,238 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 13:58:07,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 13:58:07,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 13:58:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 62778 backedges. 0 proven. 15960 refuted. 0 times theorem prover too weak. 46818 trivial. 0 not checked. [2018-04-13 13:58:07,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 13:58:07,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 83] total 158 [2018-04-13 13:58:07,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-04-13 13:58:07,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-04-13 13:58:07,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12243, Invalid=12563, Unknown=0, NotChecked=0, Total=24806 [2018-04-13 13:58:07,624 INFO L87 Difference]: Start difference. First operand 1023 states and 1024 transitions. Second operand 158 states. Received shutdown request... [2018-04-13 13:58:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-04-13 13:58:13,001 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 13:58:13,004 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 13:58:13,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 01:58:13 BoogieIcfgContainer [2018-04-13 13:58:13,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 13:58:13,005 INFO L168 Benchmark]: Toolchain (without parser) took 767744.36 ms. Allocated memory was 402.1 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 343.8 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 991.9 MB. Max. memory is 5.3 GB. [2018-04-13 13:58:13,006 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 13:58:13,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.52 ms. Allocated memory is still 402.1 MB. Free memory was 343.8 MB in the beginning and 334.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. [2018-04-13 13:58:13,006 INFO L168 Benchmark]: Boogie Preprocessor took 17.19 ms. Allocated memory is still 402.1 MB. Free memory was 334.4 MB in the beginning and 333.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 13:58:13,007 INFO L168 Benchmark]: RCFGBuilder took 216.83 ms. Allocated memory was 402.1 MB in the beginning and 622.3 MB in the end (delta: 220.2 MB). Free memory was 333.0 MB in the beginning and 589.6 MB in the end (delta: -256.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-13 13:58:13,007 INFO L168 Benchmark]: TraceAbstraction took 767371.36 ms. Allocated memory was 622.3 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 589.6 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-13 13:58:13,008 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 136.52 ms. Allocated memory is still 402.1 MB. Free memory was 343.8 MB in the beginning and 334.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.19 ms. Allocated memory is still 402.1 MB. Free memory was 334.4 MB in the beginning and 333.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 216.83 ms. Allocated memory was 402.1 MB in the beginning and 622.3 MB in the end (delta: 220.2 MB). Free memory was 333.0 MB in the beginning and 589.6 MB in the end (delta: -256.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 767371.36 ms. Allocated memory was 622.3 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 589.6 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (1023states) and interpolant automaton (currently 157 states, 158 states before enhancement), while ReachableStatesComputation was computing reachable states (1349 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (1023states) and interpolant automaton (currently 157 states, 158 states before enhancement), while ReachableStatesComputation was computing reachable states (1349 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 767.3s OverallTime, 154 OverallIterations, 154 TraceHistogramMax, 321.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2735 SDtfs, 168759 SDslu, 93901 SDs, 0 SdLazy, 282914 SolverSat, 53697 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90681 GetRequests, 75276 SyntacticMatches, 13 SemanticMatches, 15392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200441 ImplicationChecksByTransitivity, 284.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 153 MinimizatonAttempts, 28387 StatesRemovedByMinimization, 152 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 161.7s SatisfiabilityAnalysisTime, 262.0s InterpolantComputationTime, 160144 NumberOfCodeBlocks, 156584 NumberOfCodeBlocksAsserted, 5292 NumberOfCheckSat, 152952 ConstructedInterpolants, 0 QuantifiedInterpolants, 221297544 SizeOfPredicates, 64 NumberOfNonLiveVariables, 131577 ConjunctsInSsa, 8925 ConjunctsInUnsatCore, 297 InterpolantComputations, 2 PerfectInterpolantSequences, 2421494/6198602 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_13-58-13-012.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_13-58-13-012.csv Completed graceful shutdown