java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:54:43,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:54:43,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:54:43,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:54:43,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:54:43,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:54:43,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:54:43,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:54:43,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:54:43,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:54:43,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:54:43,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:54:43,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:54:43,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:54:43,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:54:43,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:54:43,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:54:43,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:54:43,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:54:43,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:54:43,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:54:43,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:54:43,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:54:43,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:54:43,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:54:43,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:54:43,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:54:43,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:54:43,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:54:43,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:54:43,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:54:43,965 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-10 16:54:43,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:54:43,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:54:43,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:54:43,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:54:43,983 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:54:43,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:54:43,984 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:54:43,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:54:43,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:54:43,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:54:43,986 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:54:43,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:54:43,986 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:54:44,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:54:44,024 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:54:44,027 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:54:44,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:54:44,029 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:54:44,029 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-10 16:54:44,400 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG60ebd9cbb [2018-04-10 16:54:44,492 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:54:44,492 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:54:44,492 INFO L168 CDTParser]: Scanning array3_false-valid-deref.i [2018-04-10 16:54:44,493 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:54:44,493 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:54:44,493 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:54:44,493 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-10 16:54:44,494 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in array3_false-valid-deref.i [2018-04-10 16:54:44,494 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:54:44,494 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:54:44,506 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG60ebd9cbb [2018-04-10 16:54:44,508 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:54:44,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:54:44,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:54:44,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:54:44,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:54:44,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a819b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44, skipping insertion in model container [2018-04-10 16:54:44,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,526 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:54:44,534 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:54:44,624 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:54:44,635 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:54:44,638 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 6 non ball SCCs. Number of states in SCCs 6. [2018-04-10 16:54:44,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44 WrapperNode [2018-04-10 16:54:44,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:54:44,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:54:44,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:54:44,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:54:44,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... [2018-04-10 16:54:44,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:54:44,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:54:44,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:54:44,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:54:44,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:54:44,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:54:44,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:54:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-10 16:54:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_farray__false_valid_deref_i____VERIFIER_assert [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:54:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:54:44,856 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:54:44,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:54:44 BoogieIcfgContainer [2018-04-10 16:54:44,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:54:44,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:54:44,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:54:44,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:54:44,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:54:44" (1/3) ... [2018-04-10 16:54:44,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:54:44, skipping insertion in model container [2018-04-10 16:54:44,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:54:44" (2/3) ... [2018-04-10 16:54:44,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330d454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:54:44, skipping insertion in model container [2018-04-10 16:54:44,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:54:44" (3/3) ... [2018-04-10 16:54:44,860 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-04-10 16:54:44,866 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:54:44,871 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-04-10 16:54:44,894 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:54:44,895 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:54:44,895 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:54:44,895 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:54:44,895 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:54:44,895 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:54:44,895 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:54:44,895 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:54:44,895 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:54:44,896 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:54:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-04-10 16:54:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:54:44,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:44,913 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:44,913 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1214141712, now seen corresponding path program 1 times [2018-04-10 16:54:44,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:44,919 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:44,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:44,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:44,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:45,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:45,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:54:45,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:54:45,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:54:45,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:54:45,045 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-04-10 16:54:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,123 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-10 16:54:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:54:45,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:54:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,130 INFO L225 Difference]: With dead ends: 44 [2018-04-10 16:54:45,131 INFO L226 Difference]: Without dead ends: 31 [2018-04-10 16:54:45,132 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-10 16:54:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-10 16:54:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-10 16:54:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-10 16:54:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-10 16:54:45,154 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-04-10 16:54:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,154 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-10 16:54:45,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:54:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-10 16:54:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:54:45,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,155 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,155 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1902176386, now seen corresponding path program 1 times [2018-04-10 16:54:45,156 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,156 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:45,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,202 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-10 16:54:45,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:54:45,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:54:45,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:45,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:45,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:45,205 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-04-10 16:54:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,257 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-04-10 16:54:45,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:54:45,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 16:54:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,258 INFO L225 Difference]: With dead ends: 30 [2018-04-10 16:54:45,258 INFO L226 Difference]: Without dead ends: 30 [2018-04-10 16:54:45,259 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-10 16:54:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-10 16:54:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-04-10 16:54:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-04-10 16:54:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-04-10 16:54:45,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-04-10 16:54:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,263 INFO L459 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-04-10 16:54:45,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-04-10 16:54:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:54:45,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,264 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,264 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1035544172, now seen corresponding path program 1 times [2018-04-10 16:54:45,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:45,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,306 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-10 16:54:45,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:45,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:45,342 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-10 16:54:45,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:45,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-10 16:54:45,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:54:45,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:54:45,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:54:45,344 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-04-10 16:54:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,392 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-10 16:54:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:54:45,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:54:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,393 INFO L225 Difference]: With dead ends: 44 [2018-04-10 16:54:45,393 INFO L226 Difference]: Without dead ends: 44 [2018-04-10 16:54:45,393 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-10 16:54:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-10 16:54:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-04-10 16:54:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-10 16:54:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-04-10 16:54:45,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-04-10 16:54:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,397 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-04-10 16:54:45,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:54:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-04-10 16:54:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 16:54:45,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,398 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,398 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1402074139, now seen corresponding path program 2 times [2018-04-10 16:54:45,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:45,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,448 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-10 16:54:45,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:45,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:45,462 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:45,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:45,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:45,471 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-10 16:54:45,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:45,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-10 16:54:45,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:54:45,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:54:45,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:54:45,472 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-04-10 16:54:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,526 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-04-10 16:54:45,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:54:45,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 16:54:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,527 INFO L225 Difference]: With dead ends: 53 [2018-04-10 16:54:45,527 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 16:54:45,527 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-10 16:54:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 16:54:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-04-10 16:54:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-10 16:54:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-04-10 16:54:45,531 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-04-10 16:54:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,531 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-04-10 16:54:45,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:54:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-04-10 16:54:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:54:45,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,532 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,532 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1121029342, now seen corresponding path program 3 times [2018-04-10 16:54:45,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:45,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,583 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-10 16:54:45,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:45,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:45,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:54:45,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:45,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:45,615 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-10 16:54:45,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:45,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-04-10 16:54:45,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:54:45,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:54:45,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:54:45,616 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-04-10 16:54:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,679 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-04-10 16:54:45,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:54:45,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-10 16:54:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,680 INFO L225 Difference]: With dead ends: 62 [2018-04-10 16:54:45,680 INFO L226 Difference]: Without dead ends: 62 [2018-04-10 16:54:45,680 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-10 16:54:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-10 16:54:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-04-10 16:54:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-10 16:54:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-10 16:54:45,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 36 [2018-04-10 16:54:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,683 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-10 16:54:45,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:54:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-10 16:54:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 16:54:45,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,683 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,683 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2049974933, now seen corresponding path program 4 times [2018-04-10 16:54:45,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,684 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:45,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,753 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-10 16:54:45,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:45,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:45,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:54:45,765 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:54:45,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:45,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:45,788 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-10 16:54:45,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:45,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-04-10 16:54:45,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:54:45,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:54:45,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:54:45,790 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 12 states. [2018-04-10 16:54:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:45,894 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-04-10 16:54:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:54:45,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-10 16:54:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:45,895 INFO L225 Difference]: With dead ends: 71 [2018-04-10 16:54:45,896 INFO L226 Difference]: Without dead ends: 71 [2018-04-10 16:54:45,896 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-10 16:54:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-10 16:54:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-04-10 16:54:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-10 16:54:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-04-10 16:54:45,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2018-04-10 16:54:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:45,900 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-04-10 16:54:45,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:54:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-04-10 16:54:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 16:54:45,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:45,901 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:45,901 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1976658736, now seen corresponding path program 5 times [2018-04-10 16:54:45,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:45,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:45,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:45,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:45,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:45,972 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-10 16:54:45,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:45,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:45,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:54:46,007 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-10 16:54:46,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:46,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:46,020 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-10 16:54:46,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:46,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-04-10 16:54:46,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:54:46,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:54:46,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:54:46,021 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-04-10 16:54:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:46,087 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-04-10 16:54:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:54:46,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-10 16:54:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:46,092 INFO L225 Difference]: With dead ends: 80 [2018-04-10 16:54:46,092 INFO L226 Difference]: Without dead ends: 80 [2018-04-10 16:54:46,092 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-10 16:54:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-10 16:54:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-04-10 16:54:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-10 16:54:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-04-10 16:54:46,096 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-04-10 16:54:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:46,096 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-04-10 16:54:46,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:54:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-04-10 16:54:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 16:54:46,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:46,098 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:46,098 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash -617601783, now seen corresponding path program 6 times [2018-04-10 16:54:46,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:46,098 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:46,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:46,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:46,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:46,173 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-10 16:54:46,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:46,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:46,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:54:46,192 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-10 16:54:46,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:46,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:46,214 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-10 16:54:46,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:46,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2018-04-10 16:54:46,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:54:46,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:54:46,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:54:46,216 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2018-04-10 16:54:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:46,349 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-04-10 16:54:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:54:46,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-10 16:54:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:46,351 INFO L225 Difference]: With dead ends: 89 [2018-04-10 16:54:46,351 INFO L226 Difference]: Without dead ends: 89 [2018-04-10 16:54:46,351 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-10 16:54:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-10 16:54:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-04-10 16:54:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-10 16:54:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-04-10 16:54:46,362 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2018-04-10 16:54:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:46,362 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-04-10 16:54:46,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:54:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-04-10 16:54:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:54:46,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:46,363 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:46,363 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -844102134, now seen corresponding path program 7 times [2018-04-10 16:54:46,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:46,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:46,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:46,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:46,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:46,450 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-10 16:54:46,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:46,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:46,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:46,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:46,473 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-10 16:54:46,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:46,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-04-10 16:54:46,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:54:46,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:54:46,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:54:46,475 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2018-04-10 16:54:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:46,545 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-04-10 16:54:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:54:46,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-10 16:54:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:46,547 INFO L225 Difference]: With dead ends: 98 [2018-04-10 16:54:46,547 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 16:54:46,547 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-10 16:54:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 16:54:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-04-10 16:54:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-10 16:54:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-04-10 16:54:46,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-04-10 16:54:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:46,552 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-04-10 16:54:46,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:54:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-04-10 16:54:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-10 16:54:46,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:46,553 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:46,553 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash -233153935, now seen corresponding path program 8 times [2018-04-10 16:54:46,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:46,554 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:46,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:46,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:46,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:46,636 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-10 16:54:46,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:46,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:46,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:46,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:46,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:46,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:46,661 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-10 16:54:46,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:46,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-04-10 16:54:46,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:54:46,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:54:46,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:54:46,662 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2018-04-10 16:54:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:46,756 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-04-10 16:54:46,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:54:46,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-04-10 16:54:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:46,757 INFO L225 Difference]: With dead ends: 107 [2018-04-10 16:54:46,757 INFO L226 Difference]: Without dead ends: 107 [2018-04-10 16:54:46,757 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-10 16:54:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-10 16:54:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2018-04-10 16:54:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-10 16:54:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-04-10 16:54:46,761 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2018-04-10 16:54:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:46,761 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-04-10 16:54:46,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:54:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-04-10 16:54:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-10 16:54:46,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:46,762 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:46,762 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1994793816, now seen corresponding path program 9 times [2018-04-10 16:54:46,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:46,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:46,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:46,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:46,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:46,857 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-10 16:54:46,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:46,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:46,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-10 16:54:46,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:46,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:46,889 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-10 16:54:46,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:46,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 15 [2018-04-10 16:54:46,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:54:46,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:54:46,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=115, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:54:46,891 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 15 states. [2018-04-10 16:54:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:47,011 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-04-10 16:54:47,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:54:47,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-04-10 16:54:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:47,012 INFO L225 Difference]: With dead ends: 116 [2018-04-10 16:54:47,013 INFO L226 Difference]: Without dead ends: 116 [2018-04-10 16:54:47,013 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-10 16:54:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-10 16:54:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-04-10 16:54:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-10 16:54:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-10 16:54:47,016 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 75 [2018-04-10 16:54:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:47,017 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-10 16:54:47,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:54:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-10 16:54:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-10 16:54:47,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:47,018 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:47,018 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1158198227, now seen corresponding path program 10 times [2018-04-10 16:54:47,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:47,019 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:47,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:47,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:47,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:47,105 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-10 16:54:47,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:47,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:54:47,113 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:54:47,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:47,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:47,165 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-10 16:54:47,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:47,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-04-10 16:54:47,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:54:47,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:54:47,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:54:47,166 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 21 states. [2018-04-10 16:54:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:47,309 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-04-10 16:54:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:54:47,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-04-10 16:54:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:47,310 INFO L225 Difference]: With dead ends: 125 [2018-04-10 16:54:47,310 INFO L226 Difference]: Without dead ends: 125 [2018-04-10 16:54:47,311 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-10 16:54:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-10 16:54:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2018-04-10 16:54:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-10 16:54:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-04-10 16:54:47,314 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-04-10 16:54:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:47,314 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-04-10 16:54:47,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:54:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-04-10 16:54:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-10 16:54:47,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:47,315 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:47,315 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1103434406, now seen corresponding path program 11 times [2018-04-10 16:54:47,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:47,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:47,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:47,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:47,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:47,442 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-10 16:54:47,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:47,442 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:47,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:54:47,527 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-10 16:54:47,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:47,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:47,546 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-10 16:54:47,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:47,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-04-10 16:54:47,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:54:47,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:54:47,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:54:47,547 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-04-10 16:54:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:47,634 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-04-10 16:54:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:54:47,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-04-10 16:54:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:47,635 INFO L225 Difference]: With dead ends: 134 [2018-04-10 16:54:47,635 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 16:54:47,635 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-10 16:54:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 16:54:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-04-10 16:54:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 16:54:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-04-10 16:54:47,639 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 93 [2018-04-10 16:54:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:47,639 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-04-10 16:54:47,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:54:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-04-10 16:54:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 16:54:47,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:47,640 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:47,640 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash -20175795, now seen corresponding path program 12 times [2018-04-10 16:54:47,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:47,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:47,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:47,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:47,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:47,759 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-10 16:54:47,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:47,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:54:47,784 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-10 16:54:47,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:47,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:47,814 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-10 16:54:47,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:47,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 18 [2018-04-10 16:54:47,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:54:47,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:54:47,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:54:47,816 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 18 states. [2018-04-10 16:54:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:47,979 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-04-10 16:54:47,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:54:47,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-04-10 16:54:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:47,980 INFO L225 Difference]: With dead ends: 143 [2018-04-10 16:54:47,980 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 16:54:47,980 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-10 16:54:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 16:54:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2018-04-10 16:54:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-10 16:54:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-04-10 16:54:47,983 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 97 [2018-04-10 16:54:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:47,984 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-04-10 16:54:47,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:54:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-04-10 16:54:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-04-10 16:54:47,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:47,985 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:47,985 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1913705576, now seen corresponding path program 13 times [2018-04-10 16:54:47,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:47,985 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:47,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:47,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:47,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:48,133 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-10 16:54:48,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:48,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:48,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:48,160 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-10 16:54:48,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:48,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-10 16:54:48,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:54:48,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:54:48,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:54:48,161 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 17 states. [2018-04-10 16:54:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:48,268 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-04-10 16:54:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:54:48,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-04-10 16:54:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:48,272 INFO L225 Difference]: With dead ends: 152 [2018-04-10 16:54:48,272 INFO L226 Difference]: Without dead ends: 152 [2018-04-10 16:54:48,272 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-10 16:54:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-10 16:54:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2018-04-10 16:54:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-10 16:54:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-04-10 16:54:48,275 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-04-10 16:54:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:48,275 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-04-10 16:54:48,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:54:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-04-10 16:54:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-10 16:54:48,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:48,277 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:48,277 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2040905391, now seen corresponding path program 14 times [2018-04-10 16:54:48,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:48,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:48,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:48,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:48,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:48,422 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-10 16:54:48,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:48,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:48,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:48,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:48,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:48,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:48,488 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-10 16:54:48,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:48,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-04-10 16:54:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:54:48,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:54:48,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:54:48,490 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 27 states. [2018-04-10 16:54:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:48,818 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-10 16:54:48,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:54:48,819 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-04-10 16:54:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:48,819 INFO L225 Difference]: With dead ends: 161 [2018-04-10 16:54:48,820 INFO L226 Difference]: Without dead ends: 161 [2018-04-10 16:54:48,820 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-10 16:54:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-10 16:54:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-04-10 16:54:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-10 16:54:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-04-10 16:54:48,822 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 110 [2018-04-10 16:54:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:48,822 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-04-10 16:54:48,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:54:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-04-10 16:54:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-10 16:54:48,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:48,823 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:48,823 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1165426366, now seen corresponding path program 15 times [2018-04-10 16:54:48,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:48,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:48,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:48,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:48,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:48,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:48,960 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-10 16:54:48,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:48,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:48,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:48,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-10 16:54:48,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:48,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:49,045 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-10 16:54:49,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:49,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 21 [2018-04-10 16:54:49,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:54:49,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:54:49,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:54:49,047 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2018-04-10 16:54:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:49,356 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-04-10 16:54:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:54:49,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-04-10 16:54:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:49,357 INFO L225 Difference]: With dead ends: 170 [2018-04-10 16:54:49,357 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 16:54:49,358 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-10 16:54:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 16:54:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 129. [2018-04-10 16:54:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:54:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-04-10 16:54:49,361 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2018-04-10 16:54:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:49,361 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-04-10 16:54:49,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:54:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-04-10 16:54:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-04-10 16:54:49,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:49,362 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:49,363 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash 175816451, now seen corresponding path program 16 times [2018-04-10 16:54:49,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:49,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:49,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:49,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:49,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:49,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:49,563 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-10 16:54:49,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:49,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:54:49,575 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:54:49,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:49,577 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:49,603 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-10 16:54:49,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:49,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-04-10 16:54:49,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:54:49,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:54:49,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:54:49,604 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-04-10 16:54:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:49,719 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-04-10 16:54:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:54:49,719 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-04-10 16:54:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:49,720 INFO L225 Difference]: With dead ends: 179 [2018-04-10 16:54:49,720 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 16:54:49,720 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-10 16:54:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 16:54:49,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2018-04-10 16:54:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 16:54:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-04-10 16:54:49,722 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-04-10 16:54:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:49,722 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-04-10 16:54:49,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:54:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-04-10 16:54:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 16:54:49,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:49,722 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:49,722 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1072704516, now seen corresponding path program 17 times [2018-04-10 16:54:49,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:49,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:49,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:49,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:49,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:49,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:49,912 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-10 16:54:49,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:49,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:49,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:54:50,093 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-04-10 16:54:50,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:50,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:50,118 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-10 16:54:50,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:50,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-04-10 16:54:50,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 16:54:50,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 16:54:50,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:54:50,120 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 21 states. [2018-04-10 16:54:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:50,251 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-04-10 16:54:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:54:50,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 132 [2018-04-10 16:54:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:50,253 INFO L225 Difference]: With dead ends: 188 [2018-04-10 16:54:50,253 INFO L226 Difference]: Without dead ends: 188 [2018-04-10 16:54:50,253 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-10 16:54:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-10 16:54:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 137. [2018-04-10 16:54:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 16:54:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-04-10 16:54:50,256 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-04-10 16:54:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:50,256 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-04-10 16:54:50,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 16:54:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-04-10 16:54:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-10 16:54:50,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:50,257 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:50,257 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash -894450571, now seen corresponding path program 18 times [2018-04-10 16:54:50,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:50,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:50,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:50,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:50,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:50,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:50,462 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-10 16:54:50,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:50,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:50,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:54:50,492 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-04-10 16:54:50,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:50,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:50,532 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-10 16:54:50,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:50,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 24 [2018-04-10 16:54:50,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:54:50,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:54:50,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:54:50,533 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 24 states. [2018-04-10 16:54:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:50,811 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2018-04-10 16:54:50,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:54:50,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-04-10 16:54:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:50,813 INFO L225 Difference]: With dead ends: 197 [2018-04-10 16:54:50,813 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 16:54:50,813 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-10 16:54:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 16:54:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2018-04-10 16:54:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 16:54:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-04-10 16:54:50,816 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 136 [2018-04-10 16:54:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:50,816 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-04-10 16:54:50,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:54:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-04-10 16:54:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-10 16:54:50,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:50,817 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:50,817 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1789849122, now seen corresponding path program 19 times [2018-04-10 16:54:50,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:50,818 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:50,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:50,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:50,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:50,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:51,010 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-10 16:54:51,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:51,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:51,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:51,031 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-10 16:54:51,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:51,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-10 16:54:51,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:54:51,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:54:51,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:54:51,032 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 23 states. [2018-04-10 16:54:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:51,183 INFO L93 Difference]: Finished difference Result 206 states and 216 transitions. [2018-04-10 16:54:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:54:51,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2018-04-10 16:54:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:51,184 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:54:51,184 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:54:51,184 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-10 16:54:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:54:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2018-04-10 16:54:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 16:54:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-04-10 16:54:51,187 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 145 [2018-04-10 16:54:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:51,188 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-04-10 16:54:51,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:54:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-04-10 16:54:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-10 16:54:51,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:51,188 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:51,188 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1276416507, now seen corresponding path program 20 times [2018-04-10 16:54:51,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:51,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:51,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:51,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:51,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:51,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:51,404 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-10 16:54:51,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:51,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:51,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:51,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:51,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:51,414 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:51,427 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-10 16:54:51,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:51,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-10 16:54:51,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:54:51,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:54:51,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:54:51,428 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 24 states. [2018-04-10 16:54:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:51,604 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2018-04-10 16:54:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:54:51,606 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 149 [2018-04-10 16:54:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:51,607 INFO L225 Difference]: With dead ends: 215 [2018-04-10 16:54:51,607 INFO L226 Difference]: Without dead ends: 215 [2018-04-10 16:54:51,608 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-10 16:54:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-10 16:54:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 154. [2018-04-10 16:54:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 16:54:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-04-10 16:54:51,611 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2018-04-10 16:54:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:51,611 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-04-10 16:54:51,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:54:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-04-10 16:54:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-04-10 16:54:51,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:51,612 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:51,612 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 136142508, now seen corresponding path program 21 times [2018-04-10 16:54:51,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:51,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:51,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:51,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:51,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:51,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:51,888 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-10 16:54:51,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:51,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:51,902 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-10 16:54:51,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:51,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:51,929 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-10 16:54:51,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:51,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 27 [2018-04-10 16:54:51,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:54:51,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:54:51,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=373, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:54:51,931 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 27 states. [2018-04-10 16:54:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:52,146 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-04-10 16:54:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:54:52,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2018-04-10 16:54:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:52,147 INFO L225 Difference]: With dead ends: 224 [2018-04-10 16:54:52,147 INFO L226 Difference]: Without dead ends: 224 [2018-04-10 16:54:52,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=615, Invalid=791, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:54:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-10 16:54:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 163. [2018-04-10 16:54:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 16:54:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-04-10 16:54:52,151 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 153 [2018-04-10 16:54:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:52,151 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-04-10 16:54:52,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:54:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-04-10 16:54:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 16:54:52,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:52,152 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:52,152 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 470717849, now seen corresponding path program 22 times [2018-04-10 16:54:52,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:52,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:52,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:52,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:52,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:52,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:52,402 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-10 16:54:52,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:52,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:52,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:54:52,410 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:54:52,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:52,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:52,530 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-10 16:54:52,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:52,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14] total 39 [2018-04-10 16:54:52,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 16:54:52,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 16:54:52,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=897, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:54:52,532 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 39 states. [2018-04-10 16:54:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:53,054 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-04-10 16:54:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:54:53,054 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 162 [2018-04-10 16:54:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:53,055 INFO L225 Difference]: With dead ends: 233 [2018-04-10 16:54:53,055 INFO L226 Difference]: Without dead ends: 233 [2018-04-10 16:54:53,055 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-10 16:54:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-10 16:54:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 172. [2018-04-10 16:54:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-10 16:54:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-04-10 16:54:53,059 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 162 [2018-04-10 16:54:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:53,059 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-04-10 16:54:53,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 16:54:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-04-10 16:54:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-04-10 16:54:53,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:53,060 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:53,060 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2008188026, now seen corresponding path program 23 times [2018-04-10 16:54:53,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:53,060 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:53,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:53,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:53,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:53,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:53,388 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-10 16:54:53,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:53,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:53,389 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:54:53,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-04-10 16:54:53,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:53,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:53,491 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-10 16:54:53,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:53,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-04-10 16:54:53,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:54:53,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:54:53,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:54:53,492 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 27 states. [2018-04-10 16:54:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:53,681 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2018-04-10 16:54:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:54:53,681 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 171 [2018-04-10 16:54:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:53,682 INFO L225 Difference]: With dead ends: 242 [2018-04-10 16:54:53,682 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 16:54:53,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:54:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 16:54:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2018-04-10 16:54:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 16:54:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-04-10 16:54:53,687 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 171 [2018-04-10 16:54:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:53,687 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-04-10 16:54:53,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:54:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-04-10 16:54:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-04-10 16:54:53,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:53,688 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:53,688 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 120286689, now seen corresponding path program 24 times [2018-04-10 16:54:53,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:53,689 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:53,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:53,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:53,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:53,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:54,047 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-10 16:54:54,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:54,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:54:54,107 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-04-10 16:54:54,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:54,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:54,153 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-10 16:54:54,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:54,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 30 [2018-04-10 16:54:54,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:54:54,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:54:54,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:54:54,154 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 30 states. [2018-04-10 16:54:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:54,500 INFO L93 Difference]: Finished difference Result 251 states and 263 transitions. [2018-04-10 16:54:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:54:54,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 175 [2018-04-10 16:54:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:54,502 INFO L225 Difference]: With dead ends: 251 [2018-04-10 16:54:54,502 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 16:54:54,502 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 16:54:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 16:54:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 185. [2018-04-10 16:54:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 16:54:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-10 16:54:54,506 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 175 [2018-04-10 16:54:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:54,506 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-10 16:54:54,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:54:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-10 16:54:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-10 16:54:54,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:54,507 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:54,507 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1190682940, now seen corresponding path program 25 times [2018-04-10 16:54:54,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:54,508 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:54,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:54,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:54,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:54,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:54,899 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-10 16:54:54,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:54,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:54,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:54,946 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-10 16:54:54,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:54,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-10 16:54:54,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 16:54:54,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 16:54:54,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:54:54,947 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 29 states. [2018-04-10 16:54:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:55,147 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2018-04-10 16:54:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:54:55,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 184 [2018-04-10 16:54:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:55,148 INFO L225 Difference]: With dead ends: 260 [2018-04-10 16:54:55,148 INFO L226 Difference]: Without dead ends: 260 [2018-04-10 16:54:55,148 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:54:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-10 16:54:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 189. [2018-04-10 16:54:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 16:54:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-04-10 16:54:55,150 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-04-10 16:54:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:55,150 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-04-10 16:54:55,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 16:54:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-04-10 16:54:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-10 16:54:55,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:55,151 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:55,151 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:55,151 INFO L82 PathProgramCache]: Analyzing trace with hash -917670723, now seen corresponding path program 26 times [2018-04-10 16:54:55,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:55,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:55,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:55,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:55,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:55,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:55,499 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-10 16:54:55,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:55,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:55,516 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:55,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:55,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:55,582 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-10 16:54:55,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:55,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 17] total 34 [2018-04-10 16:54:55,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 16:54:55,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 16:54:55,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=617, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:54:55,584 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 34 states. [2018-04-10 16:54:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:56,035 INFO L93 Difference]: Finished difference Result 269 states and 282 transitions. [2018-04-10 16:54:56,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 16:54:56,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-04-10 16:54:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:56,036 INFO L225 Difference]: With dead ends: 269 [2018-04-10 16:54:56,036 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 16:54:56,037 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-10 16:54:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 16:54:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 198. [2018-04-10 16:54:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 16:54:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-04-10 16:54:56,041 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 188 [2018-04-10 16:54:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:56,041 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-04-10 16:54:56,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 16:54:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-04-10 16:54:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 16:54:56,042 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:56,042 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:56,042 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1535285526, now seen corresponding path program 27 times [2018-04-10 16:54:56,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:56,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:56,043 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:56,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:56,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:56,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:56,409 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-10 16:54:56,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:56,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:56,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:56,426 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-10 16:54:56,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:56,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:56,459 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-10 16:54:56,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:56,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 33 [2018-04-10 16:54:56,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 16:54:56,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 16:54:56,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:54:56,460 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 33 states. [2018-04-10 16:54:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:56,773 INFO L93 Difference]: Finished difference Result 278 states and 291 transitions. [2018-04-10 16:54:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:54:56,773 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 197 [2018-04-10 16:54:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:56,774 INFO L225 Difference]: With dead ends: 278 [2018-04-10 16:54:56,774 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 16:54:56,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=978, Invalid=1278, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:54:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 16:54:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 207. [2018-04-10 16:54:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-10 16:54:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-04-10 16:54:56,778 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 197 [2018-04-10 16:54:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:56,779 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-04-10 16:54:56,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 16:54:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-04-10 16:54:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-10 16:54:56,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:56,780 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:56,780 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash -68281361, now seen corresponding path program 28 times [2018-04-10 16:54:56,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:56,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:56,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:56,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:56,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:56,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:57,266 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-10 16:54:57,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:57,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:57,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:54:57,279 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:54:57,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:57,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:57,319 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-10 16:54:57,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:57,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-04-10 16:54:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:54:57,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:54:57,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:54:57,320 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 32 states. [2018-04-10 16:54:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:57,539 INFO L93 Difference]: Finished difference Result 287 states and 301 transitions. [2018-04-10 16:54:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 16:54:57,539 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-04-10 16:54:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:57,540 INFO L225 Difference]: With dead ends: 287 [2018-04-10 16:54:57,540 INFO L226 Difference]: Without dead ends: 287 [2018-04-10 16:54:57,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:54:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-10 16:54:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 211. [2018-04-10 16:54:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-10 16:54:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-04-10 16:54:57,544 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2018-04-10 16:54:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:57,545 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-04-10 16:54:57,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:54:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-04-10 16:54:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-10 16:54:57,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:57,546 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:57,546 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -919322328, now seen corresponding path program 29 times [2018-04-10 16:54:57,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:57,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:57,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:57,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:57,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:57,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:57,938 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-10 16:54:57,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:57,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:54:58,263 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-04-10 16:54:58,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:58,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:58,464 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-10 16:54:58,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:58,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2018-04-10 16:54:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 16:54:58,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 16:54:58,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1497, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:54:58,466 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 50 states. [2018-04-10 16:54:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:59,176 INFO L93 Difference]: Finished difference Result 296 states and 310 transitions. [2018-04-10 16:54:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 16:54:59,176 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 210 [2018-04-10 16:54:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:59,177 INFO L225 Difference]: With dead ends: 296 [2018-04-10 16:54:59,177 INFO L226 Difference]: Without dead ends: 296 [2018-04-10 16:54:59,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=953, Invalid=1497, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:54:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-04-10 16:54:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 220. [2018-04-10 16:54:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 16:54:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-04-10 16:54:59,180 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 210 [2018-04-10 16:54:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:59,181 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-04-10 16:54:59,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 16:54:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-04-10 16:54:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-10 16:54:59,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:59,182 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:59,182 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:54:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash -841568181, now seen corresponding path program 30 times [2018-04-10 16:54:59,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:59,182 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:59,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:59,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:59,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:59,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:59,643 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-10 16:54:59,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:59,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:59,644 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:54:59,672 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-04-10 16:54:59,672 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:59,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:59,711 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-10 16:54:59,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:54:59,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20] total 36 [2018-04-10 16:54:59,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 16:54:59,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 16:54:59,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=664, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:54:59,713 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 36 states. [2018-04-10 16:55:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:00,156 INFO L93 Difference]: Finished difference Result 305 states and 319 transitions. [2018-04-10 16:55:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:55:00,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 219 [2018-04-10 16:55:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:00,157 INFO L225 Difference]: With dead ends: 305 [2018-04-10 16:55:00,157 INFO L226 Difference]: Without dead ends: 305 [2018-04-10 16:55:00,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1191, Invalid=1565, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:55:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-10 16:55:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 229. [2018-04-10 16:55:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-10 16:55:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-04-10 16:55:00,160 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 219 [2018-04-10 16:55:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:00,160 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-04-10 16:55:00,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 16:55:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-04-10 16:55:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-10 16:55:00,161 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:00,161 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:00,161 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash -205243110, now seen corresponding path program 31 times [2018-04-10 16:55:00,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:00,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:00,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:00,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:00,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:00,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:00,552 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-10 16:55:00,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:00,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:00,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:00,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:00,599 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-10 16:55:00,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:00,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-04-10 16:55:00,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 16:55:00,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 16:55:00,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:55:00,601 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 35 states. [2018-04-10 16:55:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:00,753 INFO L93 Difference]: Finished difference Result 314 states and 329 transitions. [2018-04-10 16:55:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:55:00,753 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 228 [2018-04-10 16:55:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:00,754 INFO L225 Difference]: With dead ends: 314 [2018-04-10 16:55:00,754 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 16:55:00,754 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-10 16:55:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 16:55:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 233. [2018-04-10 16:55:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 16:55:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-04-10 16:55:00,758 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-04-10 16:55:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:00,758 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-04-10 16:55:00,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 16:55:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-04-10 16:55:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 16:55:00,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:00,759 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:00,759 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1732525677, now seen corresponding path program 32 times [2018-04-10 16:55:00,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:00,760 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:00,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:00,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:00,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:01,143 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-10 16:55:01,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:01,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:55:01,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:55:01,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:01,153 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:01,195 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-10 16:55:01,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:01,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-10 16:55:01,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 16:55:01,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 16:55:01,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:55:01,197 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 36 states. [2018-04-10 16:55:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:01,559 INFO L93 Difference]: Finished difference Result 323 states and 339 transitions. [2018-04-10 16:55:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 16:55:01,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-04-10 16:55:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:01,560 INFO L225 Difference]: With dead ends: 323 [2018-04-10 16:55:01,560 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 16:55:01,560 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-10 16:55:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 16:55:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2018-04-10 16:55:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 16:55:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-04-10 16:55:01,563 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 232 [2018-04-10 16:55:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:01,564 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-04-10 16:55:01,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 16:55:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-04-10 16:55:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-10 16:55:01,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:01,565 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:01,565 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash 888824204, now seen corresponding path program 33 times [2018-04-10 16:55:01,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:01,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:01,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:01,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:01,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:01,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:02,131 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-10 16:55:02,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:02,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:02,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:55:02,158 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-04-10 16:55:02,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:02,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:02,213 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-10 16:55:02,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:02,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 39 [2018-04-10 16:55:02,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 16:55:02,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 16:55:02,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:55:02,214 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 39 states. [2018-04-10 16:55:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:02,568 INFO L93 Difference]: Finished difference Result 332 states and 348 transitions. [2018-04-10 16:55:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:55:02,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 236 [2018-04-10 16:55:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:02,569 INFO L225 Difference]: With dead ends: 332 [2018-04-10 16:55:02,569 INFO L226 Difference]: Without dead ends: 332 [2018-04-10 16:55:02,569 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-10 16:55:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-10 16:55:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 246. [2018-04-10 16:55:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-10 16:55:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-04-10 16:55:02,572 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 236 [2018-04-10 16:55:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:02,573 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-04-10 16:55:02,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 16:55:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-04-10 16:55:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-04-10 16:55:02,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:02,574 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:02,574 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:02,574 INFO L82 PathProgramCache]: Analyzing trace with hash -762393689, now seen corresponding path program 34 times [2018-04-10 16:55:02,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:02,575 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:02,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:02,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:02,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:02,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:02,990 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-10 16:55:02,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:02,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:55:03,000 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:55:03,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:03,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:03,048 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-10 16:55:03,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:03,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-04-10 16:55:03,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 16:55:03,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 16:55:03,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:55:03,050 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 38 states. [2018-04-10 16:55:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:03,272 INFO L93 Difference]: Finished difference Result 341 states and 358 transitions. [2018-04-10 16:55:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 16:55:03,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 245 [2018-04-10 16:55:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:03,273 INFO L225 Difference]: With dead ends: 341 [2018-04-10 16:55:03,273 INFO L226 Difference]: Without dead ends: 341 [2018-04-10 16:55:03,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:55:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-10 16:55:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2018-04-10 16:55:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 16:55:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-04-10 16:55:03,277 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 245 [2018-04-10 16:55:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:03,277 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-04-10 16:55:03,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 16:55:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-04-10 16:55:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-10 16:55:03,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:03,279 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:03,279 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash -66869170, now seen corresponding path program 35 times [2018-04-10 16:55:03,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:03,279 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:03,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:03,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:03,280 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:03,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:03,802 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-10 16:55:03,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:03,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:55:04,064 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-04-10 16:55:04,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:04,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:04,098 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-10 16:55:04,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:04,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-04-10 16:55:04,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 16:55:04,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 16:55:04,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 16:55:04,099 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 39 states. [2018-04-10 16:55:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:04,324 INFO L93 Difference]: Finished difference Result 350 states and 368 transitions. [2018-04-10 16:55:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 16:55:04,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 249 [2018-04-10 16:55:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:04,325 INFO L225 Difference]: With dead ends: 350 [2018-04-10 16:55:04,325 INFO L226 Difference]: Without dead ends: 350 [2018-04-10 16:55:04,326 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-10 16:55:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-10 16:55:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 254. [2018-04-10 16:55:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-10 16:55:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-04-10 16:55:04,328 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 249 [2018-04-10 16:55:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:04,328 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-04-10 16:55:04,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 16:55:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-04-10 16:55:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-10 16:55:04,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:04,329 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:04,329 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1893456245, now seen corresponding path program 36 times [2018-04-10 16:55:04,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:04,329 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:04,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:04,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:04,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:04,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:04,756 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-10 16:55:04,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:04,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:04,757 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:55:04,825 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-04-10 16:55:04,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:04,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:04,883 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-10 16:55:04,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:04,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 22] total 42 [2018-04-10 16:55:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:55:04,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:55:04,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:55:04,884 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 42 states. [2018-04-10 16:55:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:05,217 INFO L93 Difference]: Finished difference Result 359 states and 377 transitions. [2018-04-10 16:55:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 16:55:05,217 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 253 [2018-04-10 16:55:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:05,218 INFO L225 Difference]: With dead ends: 359 [2018-04-10 16:55:05,218 INFO L226 Difference]: Without dead ends: 359 [2018-04-10 16:55:05,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 16:55:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-10 16:55:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 263. [2018-04-10 16:55:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 16:55:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-04-10 16:55:05,221 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 253 [2018-04-10 16:55:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:05,221 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-04-10 16:55:05,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:55:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-04-10 16:55:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-10 16:55:05,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:05,222 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:05,222 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1151025168, now seen corresponding path program 37 times [2018-04-10 16:55:05,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:05,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:05,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:05,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:05,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:05,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:05,672 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-10 16:55:05,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:05,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:05,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:05,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:05,740 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-10 16:55:05,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:05,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-10 16:55:05,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:55:05,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:55:05,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:55:05,742 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 41 states. [2018-04-10 16:55:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:05,952 INFO L93 Difference]: Finished difference Result 368 states and 387 transitions. [2018-04-10 16:55:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 16:55:05,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 262 [2018-04-10 16:55:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:05,953 INFO L225 Difference]: With dead ends: 368 [2018-04-10 16:55:05,953 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 16:55:05,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:55:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 16:55:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 267. [2018-04-10 16:55:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-10 16:55:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-04-10 16:55:05,955 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 262 [2018-04-10 16:55:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:05,956 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-04-10 16:55:05,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:55:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-04-10 16:55:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-04-10 16:55:05,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:05,956 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:05,956 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1041373655, now seen corresponding path program 38 times [2018-04-10 16:55:05,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:05,957 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:05,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:05,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:05,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:05,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:06,429 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-10 16:55:06,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:06,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:55:06,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:55:06,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:06,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:06,502 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-10 16:55:06,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:06,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 23] total 44 [2018-04-10 16:55:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 16:55:06,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 16:55:06,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:55:06,503 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 44 states. [2018-04-10 16:55:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:06,950 INFO L93 Difference]: Finished difference Result 377 states and 396 transitions. [2018-04-10 16:55:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 16:55:06,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 266 [2018-04-10 16:55:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:06,951 INFO L225 Difference]: With dead ends: 377 [2018-04-10 16:55:06,951 INFO L226 Difference]: Without dead ends: 377 [2018-04-10 16:55:06,951 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-10 16:55:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-10 16:55:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 276. [2018-04-10 16:55:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-10 16:55:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-04-10 16:55:06,954 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 266 [2018-04-10 16:55:06,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:06,954 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-04-10 16:55:06,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 16:55:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-04-10 16:55:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-04-10 16:55:06,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:06,955 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:06,955 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1113644310, now seen corresponding path program 39 times [2018-04-10 16:55:06,956 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:06,956 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:06,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:06,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:06,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:06,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:07,465 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-10 16:55:07,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:07,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:55:07,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-10 16:55:07,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:07,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:07,564 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-10 16:55:07,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:07,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 24] total 45 [2018-04-10 16:55:07,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 16:55:07,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 16:55:07,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:55:07,566 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 45 states. [2018-04-10 16:55:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:08,077 INFO L93 Difference]: Finished difference Result 386 states and 405 transitions. [2018-04-10 16:55:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 16:55:08,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 275 [2018-04-10 16:55:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:08,078 INFO L225 Difference]: With dead ends: 386 [2018-04-10 16:55:08,078 INFO L226 Difference]: Without dead ends: 386 [2018-04-10 16:55:08,078 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-10 16:55:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-10 16:55:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 285. [2018-04-10 16:55:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-10 16:55:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-04-10 16:55:08,080 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 275 [2018-04-10 16:55:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:08,080 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-04-10 16:55:08,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 16:55:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-04-10 16:55:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-10 16:55:08,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:08,081 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:08,081 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1906988763, now seen corresponding path program 40 times [2018-04-10 16:55:08,081 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:08,081 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:08,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:08,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:08,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:08,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:08,608 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-10 16:55:08,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:08,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:55:08,618 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:55:08,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:08,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:08,653 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-10 16:55:08,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:08,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-04-10 16:55:08,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 16:55:08,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 16:55:08,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:55:08,654 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 44 states. [2018-04-10 16:55:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:08,886 INFO L93 Difference]: Finished difference Result 395 states and 415 transitions. [2018-04-10 16:55:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 16:55:08,886 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 284 [2018-04-10 16:55:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:08,887 INFO L225 Difference]: With dead ends: 395 [2018-04-10 16:55:08,887 INFO L226 Difference]: Without dead ends: 395 [2018-04-10 16:55:08,887 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-10 16:55:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-10 16:55:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 289. [2018-04-10 16:55:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-10 16:55:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-04-10 16:55:08,889 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-04-10 16:55:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:08,889 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-04-10 16:55:08,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 16:55:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-04-10 16:55:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-10 16:55:08,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:08,890 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:08,890 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash -583132076, now seen corresponding path program 41 times [2018-04-10 16:55:08,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:08,890 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:08,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:08,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:08,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:08,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:09,443 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-10 16:55:09,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:09,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:55:09,510 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-04-10 16:55:09,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:09,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:09,785 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-10 16:55:09,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:09,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 25] total 68 [2018-04-10 16:55:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 16:55:09,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 16:55:09,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=2784, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:55:09,786 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 68 states. [2018-04-10 16:55:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:11,160 INFO L93 Difference]: Finished difference Result 404 states and 424 transitions. [2018-04-10 16:55:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 16:55:11,160 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 288 [2018-04-10 16:55:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:11,161 INFO L225 Difference]: With dead ends: 404 [2018-04-10 16:55:11,161 INFO L226 Difference]: Without dead ends: 404 [2018-04-10 16:55:11,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1772, Invalid=2784, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:55:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-10 16:55:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 298. [2018-04-10 16:55:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-10 16:55:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-04-10 16:55:11,164 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 288 [2018-04-10 16:55:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:11,164 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-04-10 16:55:11,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 16:55:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-04-10 16:55:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 16:55:11,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:11,166 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:11,166 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -113928097, now seen corresponding path program 42 times [2018-04-10 16:55:11,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:11,166 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:11,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:11,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:11,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:11,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:11,794 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-10 16:55:11,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:11,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:11,795 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:55:11,869 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-04-10 16:55:11,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:11,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:11,981 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-10 16:55:11,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:11,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 26] total 48 [2018-04-10 16:55:11,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 16:55:11,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 16:55:11,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=1174, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:55:11,983 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 48 states. [2018-04-10 16:55:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:12,494 INFO L93 Difference]: Finished difference Result 413 states and 433 transitions. [2018-04-10 16:55:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 16:55:12,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 297 [2018-04-10 16:55:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:12,495 INFO L225 Difference]: With dead ends: 413 [2018-04-10 16:55:12,495 INFO L226 Difference]: Without dead ends: 413 [2018-04-10 16:55:12,496 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-10 16:55:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-10 16:55:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 307. [2018-04-10 16:55:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-04-10 16:55:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-04-10 16:55:12,498 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 297 [2018-04-10 16:55:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:12,498 INFO L459 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-04-10 16:55:12,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 16:55:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-04-10 16:55:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-04-10 16:55:12,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:12,499 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:12,499 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1504357946, now seen corresponding path program 43 times [2018-04-10 16:55:12,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:12,499 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:12,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:12,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:12,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:12,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:13,157 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-10 16:55:13,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:13,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:13,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:13,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:13,212 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-10 16:55:13,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:13,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-04-10 16:55:13,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 16:55:13,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 16:55:13,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 16:55:13,213 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 47 states. [2018-04-10 16:55:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:13,476 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2018-04-10 16:55:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 16:55:13,476 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 306 [2018-04-10 16:55:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:13,477 INFO L225 Difference]: With dead ends: 422 [2018-04-10 16:55:13,477 INFO L226 Difference]: Without dead ends: 422 [2018-04-10 16:55:13,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 16:55:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-10 16:55:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 311. [2018-04-10 16:55:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-10 16:55:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-04-10 16:55:13,479 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 306 [2018-04-10 16:55:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:13,479 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-04-10 16:55:13,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 16:55:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-04-10 16:55:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-04-10 16:55:13,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:13,481 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:13,481 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash 235456127, now seen corresponding path program 44 times [2018-04-10 16:55:13,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:13,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:13,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:13,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:13,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:13,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:14,179 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-10 16:55:14,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:14,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:55:14,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:55:14,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:14,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:14,230 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-10 16:55:14,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:14,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-10 16:55:14,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 16:55:14,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 16:55:14,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:55:14,231 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 48 states. [2018-04-10 16:55:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:14,534 INFO L93 Difference]: Finished difference Result 431 states and 453 transitions. [2018-04-10 16:55:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 16:55:14,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 310 [2018-04-10 16:55:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:14,535 INFO L225 Difference]: With dead ends: 431 [2018-04-10 16:55:14,535 INFO L226 Difference]: Without dead ends: 431 [2018-04-10 16:55:14,535 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-10 16:55:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-10 16:55:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 315. [2018-04-10 16:55:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-10 16:55:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-04-10 16:55:14,537 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 310 [2018-04-10 16:55:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:14,537 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-04-10 16:55:14,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 16:55:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-04-10 16:55:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-04-10 16:55:14,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:14,538 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:14,539 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -787401032, now seen corresponding path program 45 times [2018-04-10 16:55:14,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:14,539 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:14,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:14,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:14,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:14,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:15,235 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-10 16:55:15,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:15,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:15,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:55:15,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-04-10 16:55:15,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:15,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:15,335 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-10 16:55:15,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:15,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 27] total 51 [2018-04-10 16:55:15,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 16:55:15,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 16:55:15,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:55:15,337 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 51 states. [2018-04-10 16:55:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:15,850 INFO L93 Difference]: Finished difference Result 440 states and 462 transitions. [2018-04-10 16:55:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 16:55:15,850 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 314 [2018-04-10 16:55:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:15,851 INFO L225 Difference]: With dead ends: 440 [2018-04-10 16:55:15,851 INFO L226 Difference]: Without dead ends: 440 [2018-04-10 16:55:15,852 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-10 16:55:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-10 16:55:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 324. [2018-04-10 16:55:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-10 16:55:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-04-10 16:55:15,854 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 314 [2018-04-10 16:55:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:15,854 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-04-10 16:55:15,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 16:55:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-04-10 16:55:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-04-10 16:55:15,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:15,855 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:15,856 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1093061051, now seen corresponding path program 46 times [2018-04-10 16:55:15,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:15,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:15,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:15,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:15,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:15,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:16,612 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-10 16:55:16,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:16,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:55:16,624 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:55:16,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:16,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:16,860 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-10 16:55:16,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:16,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 27] total 76 [2018-04-10 16:55:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 16:55:16,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 16:55:16,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2200, Invalid=3500, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 16:55:16,862 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 76 states. [2018-04-10 16:55:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:18,444 INFO L93 Difference]: Finished difference Result 449 states and 471 transitions. [2018-04-10 16:55:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 16:55:18,444 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 323 [2018-04-10 16:55:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:18,445 INFO L225 Difference]: With dead ends: 449 [2018-04-10 16:55:18,445 INFO L226 Difference]: Without dead ends: 449 [2018-04-10 16:55:18,445 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-10 16:55:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-10 16:55:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 333. [2018-04-10 16:55:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-10 16:55:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-04-10 16:55:18,447 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 323 [2018-04-10 16:55:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:18,448 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-04-10 16:55:18,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 16:55:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-04-10 16:55:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 16:55:18,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:18,449 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:18,449 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash 782242986, now seen corresponding path program 47 times [2018-04-10 16:55:18,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:18,449 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:18,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:18,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:18,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:18,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:19,209 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-10 16:55:19,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:19,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:55:20,412 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-04-10 16:55:20,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:20,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:20,491 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-10 16:55:20,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:20,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-04-10 16:55:20,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 16:55:20,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 16:55:20,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:55:20,492 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 51 states. [2018-04-10 16:55:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:20,799 INFO L93 Difference]: Finished difference Result 458 states and 481 transitions. [2018-04-10 16:55:20,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 16:55:20,799 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 332 [2018-04-10 16:55:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:20,800 INFO L225 Difference]: With dead ends: 458 [2018-04-10 16:55:20,800 INFO L226 Difference]: Without dead ends: 458 [2018-04-10 16:55:20,800 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-10 16:55:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-10 16:55:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 337. [2018-04-10 16:55:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-10 16:55:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-04-10 16:55:20,802 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 332 [2018-04-10 16:55:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:20,802 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-04-10 16:55:20,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 16:55:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-04-10 16:55:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-04-10 16:55:20,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:20,804 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:20,804 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1279286237, now seen corresponding path program 48 times [2018-04-10 16:55:20,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:20,804 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:20,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:20,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:20,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:20,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:21,581 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-10 16:55:21,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:21,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:21,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:55:21,838 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-04-10 16:55:21,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:21,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:21,928 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-10 16:55:21,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:21,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 29] total 54 [2018-04-10 16:55:21,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 16:55:21,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 16:55:21,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1379, Invalid=1483, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 16:55:21,929 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 54 states. [2018-04-10 16:55:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:22,550 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-04-10 16:55:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 16:55:22,551 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 336 [2018-04-10 16:55:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:22,552 INFO L225 Difference]: With dead ends: 467 [2018-04-10 16:55:22,552 INFO L226 Difference]: Without dead ends: 467 [2018-04-10 16:55:22,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2757, Invalid=3563, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 16:55:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-10 16:55:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 346. [2018-04-10 16:55:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-10 16:55:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2018-04-10 16:55:22,554 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 336 [2018-04-10 16:55:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:22,555 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2018-04-10 16:55:22,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 16:55:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2018-04-10 16:55:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-04-10 16:55:22,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:22,556 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:22,556 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 820187120, now seen corresponding path program 49 times [2018-04-10 16:55:22,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:22,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:22,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:22,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:22,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:22,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:23,404 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-10 16:55:23,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:23,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:23,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:23,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:23,465 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-10 16:55:23,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:23,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-04-10 16:55:23,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 16:55:23,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 16:55:23,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:55:23,467 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 53 states. [2018-04-10 16:55:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:23,858 INFO L93 Difference]: Finished difference Result 476 states and 500 transitions. [2018-04-10 16:55:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 16:55:23,858 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 345 [2018-04-10 16:55:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:23,859 INFO L225 Difference]: With dead ends: 476 [2018-04-10 16:55:23,859 INFO L226 Difference]: Without dead ends: 476 [2018-04-10 16:55:23,859 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:55:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-04-10 16:55:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 350. [2018-04-10 16:55:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 16:55:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-04-10 16:55:23,862 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 345 [2018-04-10 16:55:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:23,862 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-04-10 16:55:23,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 16:55:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-04-10 16:55:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-04-10 16:55:23,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:23,864 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:23,864 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:23,864 INFO L82 PathProgramCache]: Analyzing trace with hash -610783977, now seen corresponding path program 50 times [2018-04-10 16:55:23,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:23,864 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:23,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:23,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:23,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:23,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:24,742 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-10 16:55:24,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:24,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:55:24,754 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:55:24,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:24,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:24,858 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-10 16:55:24,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:24,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 30] total 60 [2018-04-10 16:55:24,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 16:55:24,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 16:55:24,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1608, Invalid=1932, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:55:24,860 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 60 states. [2018-04-10 16:55:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:25,721 INFO L93 Difference]: Finished difference Result 485 states and 509 transitions. [2018-04-10 16:55:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 16:55:25,721 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 349 [2018-04-10 16:55:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:25,722 INFO L225 Difference]: With dead ends: 485 [2018-04-10 16:55:25,722 INFO L226 Difference]: Without dead ends: 485 [2018-04-10 16:55:25,723 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3083, Invalid=4399, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 16:55:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-10 16:55:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 359. [2018-04-10 16:55:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-10 16:55:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-04-10 16:55:25,725 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 349 [2018-04-10 16:55:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:25,725 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-04-10 16:55:25,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 16:55:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-04-10 16:55:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-10 16:55:25,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:25,726 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:25,726 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:25,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1295911538, now seen corresponding path program 51 times [2018-04-10 16:55:25,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:25,726 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:25,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:25,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:25,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:25,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:26,679 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-10 16:55:26,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:26,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:26,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:55:26,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-04-10 16:55:26,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:26,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:26,883 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-10 16:55:26,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:26,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 31] total 57 [2018-04-10 16:55:26,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 16:55:26,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 16:55:26,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1652, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 16:55:26,885 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 57 states. [2018-04-10 16:55:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:27,699 INFO L93 Difference]: Finished difference Result 494 states and 518 transitions. [2018-04-10 16:55:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 16:55:27,700 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 358 [2018-04-10 16:55:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:27,701 INFO L225 Difference]: With dead ends: 494 [2018-04-10 16:55:27,701 INFO L226 Difference]: Without dead ends: 494 [2018-04-10 16:55:27,701 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3108, Invalid=4032, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 16:55:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-10 16:55:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 368. [2018-04-10 16:55:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-10 16:55:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2018-04-10 16:55:27,703 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 358 [2018-04-10 16:55:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:27,703 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2018-04-10 16:55:27,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 16:55:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2018-04-10 16:55:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-10 16:55:27,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:27,704 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:27,704 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:27,705 INFO L82 PathProgramCache]: Analyzing trace with hash -787029467, now seen corresponding path program 52 times [2018-04-10 16:55:27,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:27,705 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:27,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:27,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:27,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:27,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:28,729 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-10 16:55:28,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:28,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:55:28,743 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:55:28,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:28,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:28,799 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-10 16:55:28,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:28,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-04-10 16:55:28,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 16:55:28,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 16:55:28,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:55:28,800 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 56 states. [2018-04-10 16:55:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:29,261 INFO L93 Difference]: Finished difference Result 503 states and 528 transitions. [2018-04-10 16:55:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 16:55:29,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 367 [2018-04-10 16:55:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:29,262 INFO L225 Difference]: With dead ends: 503 [2018-04-10 16:55:29,262 INFO L226 Difference]: Without dead ends: 503 [2018-04-10 16:55:29,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:55:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-10 16:55:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 372. [2018-04-10 16:55:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-10 16:55:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 373 transitions. [2018-04-10 16:55:29,265 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 373 transitions. Word has length 367 [2018-04-10 16:55:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:29,265 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 373 transitions. [2018-04-10 16:55:29,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 16:55:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 373 transitions. [2018-04-10 16:55:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-04-10 16:55:29,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:29,266 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:29,266 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1106679820, now seen corresponding path program 53 times [2018-04-10 16:55:29,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:29,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:29,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:29,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:29,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:29,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:30,281 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-10 16:55:30,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:30,281 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:30,281 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:55:32,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-04-10 16:55:32,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:32,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:32,714 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-10 16:55:32,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:32,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-04-10 16:55:32,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 16:55:32,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 16:55:32,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 16:55:32,715 INFO L87 Difference]: Start difference. First operand 372 states and 373 transitions. Second operand 57 states. [2018-04-10 16:55:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:33,101 INFO L93 Difference]: Finished difference Result 512 states and 538 transitions. [2018-04-10 16:55:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 16:55:33,102 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 371 [2018-04-10 16:55:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:33,103 INFO L225 Difference]: With dead ends: 512 [2018-04-10 16:55:33,103 INFO L226 Difference]: Without dead ends: 512 [2018-04-10 16:55:33,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 16:55:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-04-10 16:55:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 376. [2018-04-10 16:55:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-10 16:55:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 377 transitions. [2018-04-10 16:55:33,105 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 377 transitions. Word has length 371 [2018-04-10 16:55:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:33,105 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 377 transitions. [2018-04-10 16:55:33,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 16:55:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 377 transitions. [2018-04-10 16:55:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-04-10 16:55:33,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:33,106 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:33,106 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 782959219, now seen corresponding path program 54 times [2018-04-10 16:55:33,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:33,106 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:33,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:33,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:33,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:33,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:34,150 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-10 16:55:34,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:34,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:55:34,237 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-04-10 16:55:34,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:34,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:34,336 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-10 16:55:34,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:34,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 32] total 60 [2018-04-10 16:55:34,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 16:55:34,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 16:55:34,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1712, Invalid=1828, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:55:34,337 INFO L87 Difference]: Start difference. First operand 376 states and 377 transitions. Second operand 60 states. [2018-04-10 16:55:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:35,134 INFO L93 Difference]: Finished difference Result 521 states and 547 transitions. [2018-04-10 16:55:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 16:55:35,134 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 375 [2018-04-10 16:55:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:35,136 INFO L225 Difference]: With dead ends: 521 [2018-04-10 16:55:35,136 INFO L226 Difference]: Without dead ends: 521 [2018-04-10 16:55:35,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3423, Invalid=4409, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 16:55:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-10 16:55:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 385. [2018-04-10 16:55:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-10 16:55:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-10 16:55:35,139 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 375 [2018-04-10 16:55:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:35,139 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-10 16:55:35,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 16:55:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-10 16:55:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-10 16:55:35,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:35,140 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:35,140 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1181594738, now seen corresponding path program 55 times [2018-04-10 16:55:35,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:35,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:35,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:35,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:35,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:35,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:36,208 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-10 16:55:36,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:36,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:36,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:36,279 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-10 16:55:36,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:36,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-10 16:55:36,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 16:55:36,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 16:55:36,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 16:55:36,281 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 59 states. [2018-04-10 16:55:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:36,712 INFO L93 Difference]: Finished difference Result 530 states and 557 transitions. [2018-04-10 16:55:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 16:55:36,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 384 [2018-04-10 16:55:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:36,714 INFO L225 Difference]: With dead ends: 530 [2018-04-10 16:55:36,714 INFO L226 Difference]: Without dead ends: 530 [2018-04-10 16:55:36,714 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-10 16:55:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-10 16:55:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 389. [2018-04-10 16:55:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-10 16:55:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-04-10 16:55:36,716 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-04-10 16:55:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:36,716 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-04-10 16:55:36,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 16:55:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-04-10 16:55:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-10 16:55:36,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:36,717 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:36,717 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1408346475, now seen corresponding path program 56 times [2018-04-10 16:55:36,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:36,717 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:36,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:36,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:36,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:36,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:37,806 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-10 16:55:37,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:37,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:37,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:55:37,819 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:55:37,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:37,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:37,961 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-10 16:55:37,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:37,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 33] total 69 [2018-04-10 16:55:37,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 16:55:37,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 16:55:37,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2076, Invalid=2616, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 16:55:37,963 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 69 states. [2018-04-10 16:55:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:39,115 INFO L93 Difference]: Finished difference Result 539 states and 566 transitions. [2018-04-10 16:55:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 16:55:39,115 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 388 [2018-04-10 16:55:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:39,116 INFO L225 Difference]: With dead ends: 539 [2018-04-10 16:55:39,116 INFO L226 Difference]: Without dead ends: 539 [2018-04-10 16:55:39,117 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-10 16:55:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-10 16:55:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 398. [2018-04-10 16:55:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-10 16:55:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 399 transitions. [2018-04-10 16:55:39,119 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 399 transitions. Word has length 388 [2018-04-10 16:55:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:39,120 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 399 transitions. [2018-04-10 16:55:39,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 16:55:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 399 transitions. [2018-04-10 16:55:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-10 16:55:39,121 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:39,121 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:39,121 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1451302360, now seen corresponding path program 57 times [2018-04-10 16:55:39,121 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:39,121 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:39,122 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:39,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:39,122 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:39,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:40,258 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-10 16:55:40,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:40,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:40,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:55:40,326 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-04-10 16:55:40,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:40,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:40,408 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-10 16:55:40,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:40,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 34] total 63 [2018-04-10 16:55:40,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 16:55:40,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 16:55:40,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=2015, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 16:55:40,410 INFO L87 Difference]: Start difference. First operand 398 states and 399 transitions. Second operand 63 states. [2018-04-10 16:55:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:41,195 INFO L93 Difference]: Finished difference Result 548 states and 575 transitions. [2018-04-10 16:55:41,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 16:55:41,195 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 397 [2018-04-10 16:55:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:41,196 INFO L225 Difference]: With dead ends: 548 [2018-04-10 16:55:41,196 INFO L226 Difference]: Without dead ends: 548 [2018-04-10 16:55:41,197 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-10 16:55:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-10 16:55:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 407. [2018-04-10 16:55:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-10 16:55:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-04-10 16:55:41,199 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 397 [2018-04-10 16:55:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:41,199 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-04-10 16:55:41,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 16:55:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-04-10 16:55:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-04-10 16:55:41,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:41,201 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:41,201 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash -947712739, now seen corresponding path program 58 times [2018-04-10 16:55:41,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:41,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:41,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:41,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:41,201 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:41,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:42,412 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-10 16:55:42,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:42,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:42,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:55:42,427 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:55:42,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:42,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:42,493 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-10 16:55:42,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:42,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-04-10 16:55:42,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 16:55:42,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 16:55:42,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 16:55:42,494 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 62 states. [2018-04-10 16:55:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:43,002 INFO L93 Difference]: Finished difference Result 557 states and 585 transitions. [2018-04-10 16:55:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 16:55:43,003 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 406 [2018-04-10 16:55:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:43,004 INFO L225 Difference]: With dead ends: 557 [2018-04-10 16:55:43,004 INFO L226 Difference]: Without dead ends: 557 [2018-04-10 16:55:43,004 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-10 16:55:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-04-10 16:55:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 411. [2018-04-10 16:55:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-04-10 16:55:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-04-10 16:55:43,006 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 406 [2018-04-10 16:55:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:43,006 INFO L459 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-04-10 16:55:43,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 16:55:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-04-10 16:55:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-04-10 16:55:43,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:43,008 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:43,008 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -250212010, now seen corresponding path program 59 times [2018-04-10 16:55:43,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:43,008 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:43,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:43,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:43,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:43,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:44,281 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-10 16:55:44,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:44,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:55:54,499 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-04-10 16:55:54,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:54,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:54,611 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-10 16:55:54,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:54,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-04-10 16:55:54,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 16:55:54,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 16:55:54,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 16:55:54,612 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 63 states. [2018-04-10 16:55:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:55,154 INFO L93 Difference]: Finished difference Result 566 states and 595 transitions. [2018-04-10 16:55:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 16:55:55,154 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 410 [2018-04-10 16:55:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:55,155 INFO L225 Difference]: With dead ends: 566 [2018-04-10 16:55:55,155 INFO L226 Difference]: Without dead ends: 566 [2018-04-10 16:55:55,155 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-10 16:55:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-10 16:55:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 415. [2018-04-10 16:55:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-10 16:55:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-04-10 16:55:55,158 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 410 [2018-04-10 16:55:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:55,158 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-04-10 16:55:55,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 16:55:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-04-10 16:55:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-04-10 16:55:55,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:55,159 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:55,159 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1420448015, now seen corresponding path program 60 times [2018-04-10 16:55:55,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:55,159 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:55,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:55,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:55,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:55,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:56,440 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-10 16:55:56,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:56,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:55:56,625 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2018-04-10 16:55:56,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:55:56,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:56,709 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-10 16:55:56,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:56,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 35] total 66 [2018-04-10 16:55:56,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 16:55:56,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 16:55:56,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 16:55:56,710 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 66 states. [2018-04-10 16:55:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:57,533 INFO L93 Difference]: Finished difference Result 575 states and 604 transitions. [2018-04-10 16:55:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 16:55:57,533 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 414 [2018-04-10 16:55:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:57,534 INFO L225 Difference]: With dead ends: 575 [2018-04-10 16:55:57,534 INFO L226 Difference]: Without dead ends: 575 [2018-04-10 16:55:57,535 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-10 16:55:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-10 16:55:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 424. [2018-04-10 16:55:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 16:55:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2018-04-10 16:55:57,537 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 414 [2018-04-10 16:55:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:57,537 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2018-04-10 16:55:57,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 16:55:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2018-04-10 16:55:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-04-10 16:55:57,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:57,538 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:57,538 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1521036868, now seen corresponding path program 61 times [2018-04-10 16:55:57,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:57,539 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:57,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:57,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:55:57,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:57,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:55:58,815 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-10 16:55:58,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:55:58,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:55:58,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:58,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:55:58,901 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-10 16:55:58,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:55:58,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-10 16:55:58,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 16:55:58,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 16:55:58,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 16:55:58,902 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 65 states. [2018-04-10 16:55:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:55:59,442 INFO L93 Difference]: Finished difference Result 584 states and 614 transitions. [2018-04-10 16:55:59,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 16:55:59,443 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 423 [2018-04-10 16:55:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:55:59,444 INFO L225 Difference]: With dead ends: 584 [2018-04-10 16:55:59,444 INFO L226 Difference]: Without dead ends: 584 [2018-04-10 16:55:59,444 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-10 16:55:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-04-10 16:55:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 428. [2018-04-10 16:55:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-10 16:55:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 429 transitions. [2018-04-10 16:55:59,447 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 429 transitions. Word has length 423 [2018-04-10 16:55:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:55:59,447 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 429 transitions. [2018-04-10 16:55:59,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 16:55:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 429 transitions. [2018-04-10 16:55:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-04-10 16:55:59,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:55:59,448 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:55:59,449 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:55:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 897188651, now seen corresponding path program 62 times [2018-04-10 16:55:59,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:55:59,449 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:55:59,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:55:59,449 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:55:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:55:59,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:00,796 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-10 16:56:00,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:00,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:56:00,810 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:56:00,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:00,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:01,173 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-10 16:56:01,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:01,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 35] total 100 [2018-04-10 16:56:01,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-10 16:56:01,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-10 16:56:01,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=6072, Unknown=0, NotChecked=0, Total=9900 [2018-04-10 16:56:01,175 INFO L87 Difference]: Start difference. First operand 428 states and 429 transitions. Second operand 100 states. [2018-04-10 16:56:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:03,177 INFO L93 Difference]: Finished difference Result 593 states and 623 transitions. [2018-04-10 16:56:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 16:56:03,178 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 427 [2018-04-10 16:56:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:03,179 INFO L225 Difference]: With dead ends: 593 [2018-04-10 16:56:03,179 INFO L226 Difference]: Without dead ends: 593 [2018-04-10 16:56:03,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3828, Invalid=6072, Unknown=0, NotChecked=0, Total=9900 [2018-04-10 16:56:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-04-10 16:56:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 437. [2018-04-10 16:56:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-10 16:56:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-04-10 16:56:03,182 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 427 [2018-04-10 16:56:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:03,183 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-04-10 16:56:03,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-10 16:56:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-04-10 16:56:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-10 16:56:03,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:03,184 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:03,184 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash 569232442, now seen corresponding path program 63 times [2018-04-10 16:56:03,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:03,185 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:03,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:03,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:03,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:03,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:04,556 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-10 16:56:04,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:04,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:04,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:56:04,628 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-04-10 16:56:04,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:04,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:04,740 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-10 16:56:04,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:04,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 37] total 69 [2018-04-10 16:56:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 16:56:04,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 16:56:04,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2414, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 16:56:04,741 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 69 states. [2018-04-10 16:56:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:05,682 INFO L93 Difference]: Finished difference Result 602 states and 632 transitions. [2018-04-10 16:56:05,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 16:56:05,682 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 436 [2018-04-10 16:56:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:05,684 INFO L225 Difference]: With dead ends: 602 [2018-04-10 16:56:05,684 INFO L226 Difference]: Without dead ends: 602 [2018-04-10 16:56:05,684 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-10 16:56:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-04-10 16:56:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 446. [2018-04-10 16:56:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-10 16:56:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 447 transitions. [2018-04-10 16:56:05,687 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 447 transitions. Word has length 436 [2018-04-10 16:56:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:05,687 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 447 transitions. [2018-04-10 16:56:05,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 16:56:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 447 transitions. [2018-04-10 16:56:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-04-10 16:56:05,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:05,690 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:05,690 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash 40345273, now seen corresponding path program 64 times [2018-04-10 16:56:05,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:05,690 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:05,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:05,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:05,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:05,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:07,175 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-10 16:56:07,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:07,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:07,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:56:07,191 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:56:07,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:07,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:07,266 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-10 16:56:07,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:07,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-04-10 16:56:07,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 16:56:07,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 16:56:07,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:56:07,268 INFO L87 Difference]: Start difference. First operand 446 states and 447 transitions. Second operand 68 states. [2018-04-10 16:56:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:07,992 INFO L93 Difference]: Finished difference Result 611 states and 642 transitions. [2018-04-10 16:56:07,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 16:56:07,992 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 445 [2018-04-10 16:56:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:07,994 INFO L225 Difference]: With dead ends: 611 [2018-04-10 16:56:07,994 INFO L226 Difference]: Without dead ends: 611 [2018-04-10 16:56:07,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:56:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-04-10 16:56:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 450. [2018-04-10 16:56:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-10 16:56:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 451 transitions. [2018-04-10 16:56:07,997 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 451 transitions. Word has length 445 [2018-04-10 16:56:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:07,997 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 451 transitions. [2018-04-10 16:56:07,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 16:56:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 451 transitions. [2018-04-10 16:56:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-04-10 16:56:07,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:07,998 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:07,998 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash -421348256, now seen corresponding path program 65 times [2018-04-10 16:56:07,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:07,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:07,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:07,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:07,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:08,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:09,478 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-10 16:56:09,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:09,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:09,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:56:17,464 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2018-04-10 16:56:17,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:17,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:18,001 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-10 16:56:18,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:18,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 38] total 105 [2018-04-10 16:56:18,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-04-10 16:56:18,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-04-10 16:56:18,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4200, Invalid=6720, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 16:56:18,003 INFO L87 Difference]: Start difference. First operand 450 states and 451 transitions. Second operand 105 states. [2018-04-10 16:56:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:21,018 INFO L93 Difference]: Finished difference Result 620 states and 651 transitions. [2018-04-10 16:56:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 16:56:21,018 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 449 [2018-04-10 16:56:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:21,019 INFO L225 Difference]: With dead ends: 620 [2018-04-10 16:56:21,019 INFO L226 Difference]: Without dead ends: 620 [2018-04-10 16:56:21,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4200, Invalid=6720, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 16:56:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-04-10 16:56:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 459. [2018-04-10 16:56:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-10 16:56:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 460 transitions. [2018-04-10 16:56:21,022 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 460 transitions. Word has length 449 [2018-04-10 16:56:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:21,022 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 460 transitions. [2018-04-10 16:56:21,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-04-10 16:56:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 460 transitions. [2018-04-10 16:56:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-04-10 16:56:21,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:21,024 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:21,024 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 821893989, now seen corresponding path program 66 times [2018-04-10 16:56:21,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:21,024 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:21,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:21,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:21,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:21,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:22,572 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-10 16:56:22,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:22,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:56:22,721 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-04-10 16:56:22,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:22,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:22,840 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-10 16:56:22,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:22,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 39] total 72 [2018-04-10 16:56:22,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 16:56:22,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 16:56:22,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2484, Invalid=2628, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 16:56:22,842 INFO L87 Difference]: Start difference. First operand 459 states and 460 transitions. Second operand 72 states. [2018-04-10 16:56:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:23,774 INFO L93 Difference]: Finished difference Result 629 states and 660 transitions. [2018-04-10 16:56:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 16:56:23,774 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 458 [2018-04-10 16:56:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:23,775 INFO L225 Difference]: With dead ends: 629 [2018-04-10 16:56:23,775 INFO L226 Difference]: Without dead ends: 629 [2018-04-10 16:56:23,776 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-10 16:56:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-04-10 16:56:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 468. [2018-04-10 16:56:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-10 16:56:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 469 transitions. [2018-04-10 16:56:23,778 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 469 transitions. Word has length 458 [2018-04-10 16:56:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:23,778 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 469 transitions. [2018-04-10 16:56:23,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 16:56:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 469 transitions. [2018-04-10 16:56:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-10 16:56:23,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:23,779 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:23,780 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:23,780 INFO L82 PathProgramCache]: Analyzing trace with hash -77354194, now seen corresponding path program 67 times [2018-04-10 16:56:23,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:23,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:23,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:23,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:23,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:23,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:25,234 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-10 16:56:25,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:25,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:25,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:56:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:25,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:25,326 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-10 16:56:25,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:25,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-04-10 16:56:25,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 16:56:25,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 16:56:25,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 16:56:25,327 INFO L87 Difference]: Start difference. First operand 468 states and 469 transitions. Second operand 71 states. [2018-04-10 16:56:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:26,013 INFO L93 Difference]: Finished difference Result 638 states and 670 transitions. [2018-04-10 16:56:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 16:56:26,013 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 467 [2018-04-10 16:56:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:26,014 INFO L225 Difference]: With dead ends: 638 [2018-04-10 16:56:26,014 INFO L226 Difference]: Without dead ends: 638 [2018-04-10 16:56:26,014 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-10 16:56:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-10 16:56:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 472. [2018-04-10 16:56:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-04-10 16:56:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2018-04-10 16:56:26,016 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 467 [2018-04-10 16:56:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:26,017 INFO L459 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2018-04-10 16:56:26,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 16:56:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2018-04-10 16:56:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-04-10 16:56:26,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:26,018 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:26,018 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2041183851, now seen corresponding path program 68 times [2018-04-10 16:56:26,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:26,018 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:26,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:56:26,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:26,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:27,518 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-10 16:56:27,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:27,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:27,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:56:27,532 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:56:27,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:27,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:27,610 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-10 16:56:27,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:27,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-10 16:56:27,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 16:56:27,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 16:56:27,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 16:56:27,612 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 72 states. [2018-04-10 16:56:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:28,273 INFO L93 Difference]: Finished difference Result 647 states and 680 transitions. [2018-04-10 16:56:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 16:56:28,273 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 471 [2018-04-10 16:56:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:28,274 INFO L225 Difference]: With dead ends: 647 [2018-04-10 16:56:28,274 INFO L226 Difference]: Without dead ends: 647 [2018-04-10 16:56:28,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 16:56:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-04-10 16:56:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 476. [2018-04-10 16:56:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-04-10 16:56:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 477 transitions. [2018-04-10 16:56:28,277 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 477 transitions. Word has length 471 [2018-04-10 16:56:28,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:28,277 INFO L459 AbstractCegarLoop]: Abstraction has 476 states and 477 transitions. [2018-04-10 16:56:28,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 16:56:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 477 transitions. [2018-04-10 16:56:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-04-10 16:56:28,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:28,278 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:28,278 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 165203068, now seen corresponding path program 69 times [2018-04-10 16:56:28,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:28,279 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:28,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:28,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:28,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:28,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:29,777 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-10 16:56:29,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:29,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:29,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:56:29,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-04-10 16:56:29,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:29,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:29,980 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-10 16:56:29,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:29,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 40] total 75 [2018-04-10 16:56:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 16:56:29,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 16:56:29,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2849, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 16:56:29,982 INFO L87 Difference]: Start difference. First operand 476 states and 477 transitions. Second operand 75 states. [2018-04-10 16:56:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:30,923 INFO L93 Difference]: Finished difference Result 656 states and 689 transitions. [2018-04-10 16:56:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 16:56:30,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 475 [2018-04-10 16:56:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:30,925 INFO L225 Difference]: With dead ends: 656 [2018-04-10 16:56:30,925 INFO L226 Difference]: Without dead ends: 656 [2018-04-10 16:56:30,925 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-10 16:56:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-04-10 16:56:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 485. [2018-04-10 16:56:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-10 16:56:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-04-10 16:56:30,927 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 475 [2018-04-10 16:56:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:30,927 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-04-10 16:56:30,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 16:56:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-04-10 16:56:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-04-10 16:56:30,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:30,929 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:30,929 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 29357961, now seen corresponding path program 70 times [2018-04-10 16:56:30,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:30,929 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:30,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:30,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:30,930 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:30,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:32,533 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-10 16:56:32,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:32,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:32,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:56:32,556 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:56:32,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:32,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:32,645 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-10 16:56:32,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:32,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-04-10 16:56:32,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 16:56:32,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 16:56:32,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 16:56:32,646 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 74 states. [2018-04-10 16:56:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:33,460 INFO L93 Difference]: Finished difference Result 665 states and 699 transitions. [2018-04-10 16:56:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 16:56:33,460 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 484 [2018-04-10 16:56:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:33,461 INFO L225 Difference]: With dead ends: 665 [2018-04-10 16:56:33,461 INFO L226 Difference]: Without dead ends: 665 [2018-04-10 16:56:33,461 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-10 16:56:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-10 16:56:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 489. [2018-04-10 16:56:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-04-10 16:56:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-04-10 16:56:33,464 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 484 [2018-04-10 16:56:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:33,464 INFO L459 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-04-10 16:56:33,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 16:56:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-04-10 16:56:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-04-10 16:56:33,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:33,465 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:33,465 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1850319870, now seen corresponding path program 71 times [2018-04-10 16:56:33,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:33,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:33,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:33,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:33,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:33,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:35,117 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-10 16:56:35,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:35,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:35,118 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:56:47,204 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2018-04-10 16:56:47,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-10 16:56:47,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:56:47,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-10 16:56:47,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 16:56:47,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 16:56:47,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 16:56:47,483 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 75 states. [2018-04-10 16:56:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:48,373 INFO L93 Difference]: Finished difference Result 674 states and 709 transitions. [2018-04-10 16:56:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 16:56:48,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 488 [2018-04-10 16:56:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:48,374 INFO L225 Difference]: With dead ends: 674 [2018-04-10 16:56:48,374 INFO L226 Difference]: Without dead ends: 674 [2018-04-10 16:56:48,374 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-10 16:56:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-10 16:56:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 493. [2018-04-10 16:56:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-10 16:56:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 494 transitions. [2018-04-10 16:56:48,377 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 494 transitions. Word has length 488 [2018-04-10 16:56:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:48,377 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 494 transitions. [2018-04-10 16:56:48,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 16:56:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 494 transitions. [2018-04-10 16:56:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-10 16:56:48,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:48,378 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:48,378 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1098654725, now seen corresponding path program 72 times [2018-04-10 16:56:48,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:48,378 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:48,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:48,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:48,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:48,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:50,081 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-10 16:56:50,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:50,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:50,082 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:56:50,500 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 74 check-sat command(s) [2018-04-10 16:56:50,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:50,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:50,658 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-10 16:56:50,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:50,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 41] total 78 [2018-04-10 16:56:50,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 16:56:50,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 16:56:50,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2927, Invalid=3079, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 16:56:50,659 INFO L87 Difference]: Start difference. First operand 493 states and 494 transitions. Second operand 78 states. [2018-04-10 16:56:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:51,641 INFO L93 Difference]: Finished difference Result 683 states and 718 transitions. [2018-04-10 16:56:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 16:56:51,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 492 [2018-04-10 16:56:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:51,643 INFO L225 Difference]: With dead ends: 683 [2018-04-10 16:56:51,643 INFO L226 Difference]: Without dead ends: 683 [2018-04-10 16:56:51,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5853, Invalid=7487, Unknown=0, NotChecked=0, Total=13340 [2018-04-10 16:56:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-10 16:56:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 502. [2018-04-10 16:56:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-04-10 16:56:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2018-04-10 16:56:51,646 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 492 [2018-04-10 16:56:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:51,646 INFO L459 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2018-04-10 16:56:51,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 16:56:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2018-04-10 16:56:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-04-10 16:56:51,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:51,647 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:51,647 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash 897097368, now seen corresponding path program 73 times [2018-04-10 16:56:51,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:51,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:51,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:51,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:51,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:51,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:53,466 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-10 16:56:53,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:53,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:53,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:56:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:53,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:53,616 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-10 16:56:53,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:53,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-04-10 16:56:53,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 16:56:53,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 16:56:53,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 16:56:53,617 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 77 states. [2018-04-10 16:56:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:54,478 INFO L93 Difference]: Finished difference Result 692 states and 728 transitions. [2018-04-10 16:56:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 16:56:54,478 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 501 [2018-04-10 16:56:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:54,479 INFO L225 Difference]: With dead ends: 692 [2018-04-10 16:56:54,479 INFO L226 Difference]: Without dead ends: 692 [2018-04-10 16:56:54,479 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-10 16:56:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-04-10 16:56:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 506. [2018-04-10 16:56:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-10 16:56:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 507 transitions. [2018-04-10 16:56:54,482 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 507 transitions. Word has length 501 [2018-04-10 16:56:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:54,482 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 507 transitions. [2018-04-10 16:56:54,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 16:56:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 507 transitions. [2018-04-10 16:56:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-04-10 16:56:54,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:54,484 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:54,484 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1249207489, now seen corresponding path program 74 times [2018-04-10 16:56:54,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:54,484 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:54,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:56:54,484 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:54,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:56,273 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-10 16:56:56,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:56,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:56,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:56:56,288 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:56:56,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:56,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:56,468 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-10 16:56:56,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:56,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 42] total 83 [2018-04-10 16:56:56,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-10 16:56:56,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-10 16:56:56,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3208, Invalid=3598, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 16:56:56,470 INFO L87 Difference]: Start difference. First operand 506 states and 507 transitions. Second operand 83 states. [2018-04-10 16:56:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:56:57,684 INFO L93 Difference]: Finished difference Result 701 states and 737 transitions. [2018-04-10 16:56:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-10 16:56:57,684 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 505 [2018-04-10 16:56:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:56:57,686 INFO L225 Difference]: With dead ends: 701 [2018-04-10 16:56:57,686 INFO L226 Difference]: Without dead ends: 701 [2018-04-10 16:56:57,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=6283, Invalid=8479, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 16:56:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-10 16:56:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 515. [2018-04-10 16:56:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-04-10 16:56:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2018-04-10 16:56:57,689 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 505 [2018-04-10 16:56:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:56:57,689 INFO L459 AbstractCegarLoop]: Abstraction has 515 states and 516 transitions. [2018-04-10 16:56:57,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-10 16:56:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 516 transitions. [2018-04-10 16:56:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-10 16:56:57,690 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:56:57,691 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:56:57,691 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:56:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -909332250, now seen corresponding path program 75 times [2018-04-10 16:56:57,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:56:57,691 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:56:57,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:57,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:56:57,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:56:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:56:57,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:56:59,593 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-10 16:56:59,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:56:59,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:56:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:56:59,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-04-10 16:56:59,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:56:59,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:56:59,796 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-10 16:56:59,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:56:59,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 43] total 81 [2018-04-10 16:56:59,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 16:56:59,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 16:56:59,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3320, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 16:56:59,797 INFO L87 Difference]: Start difference. First operand 515 states and 516 transitions. Second operand 81 states. [2018-04-10 16:57:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:00,888 INFO L93 Difference]: Finished difference Result 710 states and 746 transitions. [2018-04-10 16:57:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-10 16:57:00,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 514 [2018-04-10 16:57:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:00,890 INFO L225 Difference]: With dead ends: 710 [2018-04-10 16:57:00,890 INFO L226 Difference]: Without dead ends: 710 [2018-04-10 16:57:00,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=6360, Invalid=8160, Unknown=0, NotChecked=0, Total=14520 [2018-04-10 16:57:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-10 16:57:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 524. [2018-04-10 16:57:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-10 16:57:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 525 transitions. [2018-04-10 16:57:00,893 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 525 transitions. Word has length 514 [2018-04-10 16:57:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:00,893 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 525 transitions. [2018-04-10 16:57:00,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 16:57:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 525 transitions. [2018-04-10 16:57:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-04-10 16:57:00,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:00,894 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:00,895 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash 929529165, now seen corresponding path program 76 times [2018-04-10 16:57:00,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:00,895 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:00,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:00,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:00,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:00,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:02,975 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-10 16:57:02,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:02,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:02,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:57:02,994 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:57:02,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:02,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:03,470 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-10 16:57:03,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:03,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 43] total 122 [2018-04-10 16:57:03,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-10 16:57:03,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-10 16:57:03,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5659, Invalid=9103, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 16:57:03,472 INFO L87 Difference]: Start difference. First operand 524 states and 525 transitions. Second operand 122 states. [2018-04-10 16:57:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:06,104 INFO L93 Difference]: Finished difference Result 719 states and 755 transitions. [2018-04-10 16:57:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-10 16:57:06,104 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 523 [2018-04-10 16:57:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:06,105 INFO L225 Difference]: With dead ends: 719 [2018-04-10 16:57:06,105 INFO L226 Difference]: Without dead ends: 719 [2018-04-10 16:57:06,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6468 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=5659, Invalid=9103, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 16:57:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-04-10 16:57:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 533. [2018-04-10 16:57:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-10 16:57:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 534 transitions. [2018-04-10 16:57:06,108 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 534 transitions. Word has length 523 [2018-04-10 16:57:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:06,108 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 534 transitions. [2018-04-10 16:57:06,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-10 16:57:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 534 transitions. [2018-04-10 16:57:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-10 16:57:06,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:06,110 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:06,110 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -13964456, now seen corresponding path program 77 times [2018-04-10 16:57:06,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:06,110 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:06,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:06,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:06,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:06,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:08,076 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-10 16:57:08,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:08,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:57:08,243 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2018-04-10 16:57:08,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:08,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:08,344 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-10 16:57:08,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:08,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-04-10 16:57:08,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 16:57:08,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 16:57:08,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 16:57:08,345 INFO L87 Difference]: Start difference. First operand 533 states and 534 transitions. Second operand 81 states. [2018-04-10 16:57:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:09,081 INFO L93 Difference]: Finished difference Result 728 states and 765 transitions. [2018-04-10 16:57:09,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-10 16:57:09,081 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 532 [2018-04-10 16:57:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:09,083 INFO L225 Difference]: With dead ends: 728 [2018-04-10 16:57:09,083 INFO L226 Difference]: Without dead ends: 728 [2018-04-10 16:57:09,083 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-10 16:57:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-04-10 16:57:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 537. [2018-04-10 16:57:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-10 16:57:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 538 transitions. [2018-04-10 16:57:09,085 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 538 transitions. Word has length 532 [2018-04-10 16:57:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:09,085 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 538 transitions. [2018-04-10 16:57:09,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 16:57:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 538 transitions. [2018-04-10 16:57:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-04-10 16:57:09,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:09,087 INFO L355 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:09,087 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 324213201, now seen corresponding path program 78 times [2018-04-10 16:57:09,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:09,087 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:09,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:09,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:09,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:09,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:11,155 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-10 16:57:11,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:11,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:11,178 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:57:11,367 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2018-04-10 16:57:11,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:11,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:11,504 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-10 16:57:11,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:11,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 45] total 84 [2018-04-10 16:57:11,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-10 16:57:11,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-10 16:57:11,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3402, Invalid=3570, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 16:57:11,505 INFO L87 Difference]: Start difference. First operand 537 states and 538 transitions. Second operand 84 states. [2018-04-10 16:57:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:12,708 INFO L93 Difference]: Finished difference Result 737 states and 774 transitions. [2018-04-10 16:57:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 16:57:12,708 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 536 [2018-04-10 16:57:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:12,709 INFO L225 Difference]: With dead ends: 737 [2018-04-10 16:57:12,709 INFO L226 Difference]: Without dead ends: 737 [2018-04-10 16:57:12,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6888, Invalid=8862, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 16:57:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-10 16:57:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 546. [2018-04-10 16:57:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-04-10 16:57:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-04-10 16:57:12,712 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 536 [2018-04-10 16:57:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:12,713 INFO L459 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-04-10 16:57:12,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-10 16:57:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-04-10 16:57:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-10 16:57:12,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:12,714 INFO L355 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:12,714 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -598329342, now seen corresponding path program 79 times [2018-04-10 16:57:12,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:12,715 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:12,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:12,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:12,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:12,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:14,787 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-10 16:57:14,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:14,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:14,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:57:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:14,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:14,903 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-10 16:57:14,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:14,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-04-10 16:57:14,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-10 16:57:14,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-10 16:57:14,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 16:57:14,904 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 83 states. [2018-04-10 16:57:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:15,879 INFO L93 Difference]: Finished difference Result 746 states and 784 transitions. [2018-04-10 16:57:15,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 16:57:15,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 545 [2018-04-10 16:57:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:15,880 INFO L225 Difference]: With dead ends: 746 [2018-04-10 16:57:15,881 INFO L226 Difference]: Without dead ends: 746 [2018-04-10 16:57:15,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 16:57:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-04-10 16:57:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 550. [2018-04-10 16:57:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-04-10 16:57:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 551 transitions. [2018-04-10 16:57:15,885 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 551 transitions. Word has length 545 [2018-04-10 16:57:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:15,885 INFO L459 AbstractCegarLoop]: Abstraction has 550 states and 551 transitions. [2018-04-10 16:57:15,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-10 16:57:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 551 transitions. [2018-04-10 16:57:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-04-10 16:57:15,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:15,887 INFO L355 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:15,887 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:15,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1698502185, now seen corresponding path program 80 times [2018-04-10 16:57:15,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:15,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:15,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:57:15,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:15,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:18,018 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-10 16:57:18,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:18,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:18,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:57:18,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:57:18,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:18,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:18,138 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-10 16:57:18,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:18,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-04-10 16:57:18,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-04-10 16:57:18,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-04-10 16:57:18,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-04-10 16:57:18,139 INFO L87 Difference]: Start difference. First operand 550 states and 551 transitions. Second operand 84 states. [2018-04-10 16:57:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:19,099 INFO L93 Difference]: Finished difference Result 755 states and 794 transitions. [2018-04-10 16:57:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-10 16:57:19,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 549 [2018-04-10 16:57:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:19,100 INFO L225 Difference]: With dead ends: 755 [2018-04-10 16:57:19,100 INFO L226 Difference]: Without dead ends: 755 [2018-04-10 16:57:19,100 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-10 16:57:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-04-10 16:57:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 554. [2018-04-10 16:57:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-10 16:57:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-04-10 16:57:19,103 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 549 [2018-04-10 16:57:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:19,103 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-04-10 16:57:19,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-04-10 16:57:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-04-10 16:57:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-04-10 16:57:19,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:19,104 INFO L355 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:19,105 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1168804048, now seen corresponding path program 81 times [2018-04-10 16:57:19,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:19,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:19,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:19,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:19,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:19,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:21,280 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-10 16:57:21,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:21,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:21,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:57:21,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-04-10 16:57:21,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:21,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:21,522 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-10 16:57:21,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:21,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 46] total 87 [2018-04-10 16:57:21,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-10 16:57:21,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-10 16:57:21,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3827, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 16:57:21,523 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 87 states. [2018-04-10 16:57:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:22,946 INFO L93 Difference]: Finished difference Result 764 states and 803 transitions. [2018-04-10 16:57:22,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-10 16:57:22,946 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 553 [2018-04-10 16:57:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:22,947 INFO L225 Difference]: With dead ends: 764 [2018-04-10 16:57:22,947 INFO L226 Difference]: Without dead ends: 764 [2018-04-10 16:57:22,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=7353, Invalid=9417, Unknown=0, NotChecked=0, Total=16770 [2018-04-10 16:57:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-04-10 16:57:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 563. [2018-04-10 16:57:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-10 16:57:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 564 transitions. [2018-04-10 16:57:22,951 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 564 transitions. Word has length 553 [2018-04-10 16:57:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:22,951 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 564 transitions. [2018-04-10 16:57:22,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-10 16:57:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 564 transitions. [2018-04-10 16:57:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-04-10 16:57:22,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:22,952 INFO L355 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:22,952 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1993285643, now seen corresponding path program 82 times [2018-04-10 16:57:22,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:22,953 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:22,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:22,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:22,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:22,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:25,189 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-10 16:57:25,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:25,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:25,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:57:25,209 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:57:25,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:25,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:25,343 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-10 16:57:25,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:25,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-04-10 16:57:25,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 16:57:25,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 16:57:25,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 16:57:25,344 INFO L87 Difference]: Start difference. First operand 563 states and 564 transitions. Second operand 86 states. [2018-04-10 16:57:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:26,583 INFO L93 Difference]: Finished difference Result 773 states and 813 transitions. [2018-04-10 16:57:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-10 16:57:26,583 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 562 [2018-04-10 16:57:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:26,584 INFO L225 Difference]: With dead ends: 773 [2018-04-10 16:57:26,584 INFO L226 Difference]: Without dead ends: 773 [2018-04-10 16:57:26,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 16:57:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-10 16:57:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 567. [2018-04-10 16:57:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-04-10 16:57:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-04-10 16:57:26,587 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 562 [2018-04-10 16:57:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:26,587 INFO L459 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-04-10 16:57:26,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 16:57:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-04-10 16:57:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-04-10 16:57:26,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:26,589 INFO L355 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:26,589 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:26,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1654967122, now seen corresponding path program 83 times [2018-04-10 16:57:26,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:26,589 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:26,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:26,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:26,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:26,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:28,870 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-10 16:57:28,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:28,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:28,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:57:29,123 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-04-10 16:57:29,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:29,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:29,813 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-10 16:57:29,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:29,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 47] total 132 [2018-04-10 16:57:29,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-04-10 16:57:29,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-04-10 16:57:29,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6666, Invalid=10626, Unknown=0, NotChecked=0, Total=17292 [2018-04-10 16:57:29,815 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 132 states. [2018-04-10 16:57:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:34,000 INFO L93 Difference]: Finished difference Result 782 states and 822 transitions. [2018-04-10 16:57:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-10 16:57:34,001 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 566 [2018-04-10 16:57:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:34,002 INFO L225 Difference]: With dead ends: 782 [2018-04-10 16:57:34,002 INFO L226 Difference]: Without dead ends: 782 [2018-04-10 16:57:34,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=6666, Invalid=10626, Unknown=0, NotChecked=0, Total=17292 [2018-04-10 16:57:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-10 16:57:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 576. [2018-04-10 16:57:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-04-10 16:57:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 577 transitions. [2018-04-10 16:57:34,005 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 577 transitions. Word has length 566 [2018-04-10 16:57:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:34,005 INFO L459 AbstractCegarLoop]: Abstraction has 576 states and 577 transitions. [2018-04-10 16:57:34,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-04-10 16:57:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 577 transitions. [2018-04-10 16:57:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-04-10 16:57:34,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:34,007 INFO L355 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:34,007 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 164774149, now seen corresponding path program 84 times [2018-04-10 16:57:34,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:34,007 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:34,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:34,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:34,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:34,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:57:36,388 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-10 16:57:36,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:57:36,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:57:36,389 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:57:36,626 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-04-10 16:57:36,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:57:36,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:57:36,792 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-10 16:57:36,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:57:36,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 48] total 90 [2018-04-10 16:57:36,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-10 16:57:36,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-10 16:57:36,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3915, Invalid=4095, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 16:57:36,794 INFO L87 Difference]: Start difference. First operand 576 states and 577 transitions. Second operand 90 states. [2018-04-10 16:57:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:57:38,339 INFO L93 Difference]: Finished difference Result 791 states and 831 transitions. [2018-04-10 16:57:38,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-10 16:57:38,339 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 575 [2018-04-10 16:57:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:57:38,340 INFO L225 Difference]: With dead ends: 791 [2018-04-10 16:57:38,340 INFO L226 Difference]: Without dead ends: 791 [2018-04-10 16:57:38,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=7920, Invalid=10170, Unknown=0, NotChecked=0, Total=18090 [2018-04-10 16:57:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-04-10 16:57:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 585. [2018-04-10 16:57:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-04-10 16:57:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-04-10 16:57:38,344 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 575 [2018-04-10 16:57:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:57:38,344 INFO L459 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-04-10 16:57:38,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-10 16:57:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-04-10 16:57:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-04-10 16:57:38,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:57:38,346 INFO L355 BasicCegarLoop]: trace histogram [87, 86, 86, 86, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:57:38,346 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr1AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 16:57:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash -420519904, now seen corresponding path program 85 times [2018-04-10 16:57:38,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:57:38,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:57:38,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:38,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:57:38,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:57:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:57:38,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 16:57:40,564 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:57:40,566 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:57:40,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:57:40 BoogieIcfgContainer [2018-04-10 16:57:40,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:57:40,567 INFO L168 Benchmark]: Toolchain (without parser) took 176058.23 ms. Allocated memory was 386.4 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 326.8 MB in the beginning and 227.5 MB in the end (delta: 99.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-10 16:57:40,567 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 386.4 MB. Free memory is still 347.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:57:40,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.03 ms. Allocated memory is still 386.4 MB. Free memory was 326.8 MB in the beginning and 317.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-10 16:57:40,568 INFO L168 Benchmark]: Boogie Preprocessor took 15.83 ms. Allocated memory is still 386.4 MB. Free memory was 317.6 MB in the beginning and 316.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:57:40,568 INFO L168 Benchmark]: RCFGBuilder took 197.41 ms. Allocated memory was 386.4 MB in the beginning and 579.3 MB in the end (delta: 192.9 MB). Free memory was 316.2 MB in the beginning and 546.0 MB in the end (delta: -229.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:57:40,568 INFO L168 Benchmark]: TraceAbstraction took 175709.68 ms. Allocated memory was 579.3 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 546.0 MB in the beginning and 227.5 MB in the end (delta: 318.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-04-10 16:57:40,569 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 386.4 MB. Free memory is still 347.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 133.03 ms. Allocated memory is still 386.4 MB. Free memory was 326.8 MB in the beginning and 317.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 15.83 ms. Allocated memory is still 386.4 MB. Free memory was 317.6 MB in the beginning and 316.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 197.41 ms. Allocated memory was 386.4 MB in the beginning and 579.3 MB in the end (delta: 192.9 MB). Free memory was 316.2 MB in the beginning and 546.0 MB in the end (delta: -229.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175709.68 ms. Allocated memory was 579.3 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 546.0 MB in the beginning and 227.5 MB in the end (delta: 318.5 MB). Peak memory consumption was 2.1 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 analyzing trace of length 585 with TraceHistMax 87, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 585 with TraceHistMax 87, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 175.6s OverallTime, 87 OverallIterations, 87 TraceHistogramMax, 54.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1375 SDtfs, 39849 SDslu, 32997 SDs, 0 SdLazy, 93520 SolverSat, 11921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30126 GetRequests, 25255 SyntacticMatches, 1 SemanticMatches, 4870 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48143 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=585occurred in iteration=86, 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.2s AutomataMinimizationTime, 86 MinimizatonAttempts, 9225 StatesRemovedByMinimization, 85 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 38.7s SatisfiabilityAnalysisTime, 75.9s InterpolantComputationTime, 50436 NumberOfCodeBlocks, 49300 NumberOfCodeBlocksAsserted, 1790 NumberOfCheckSat, 49779 ConstructedInterpolants, 0 QuantifiedInterpolants, 41017739 SizeOfPredicates, 39 NumberOfNonLiveVariables, 44560 ConjunctsInSsa, 3162 ConjunctsInUnsatCore, 169 InterpolantComputations, 2 PerfectInterpolantSequences, 436617/1112157 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-10_16-57-40-575.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-10_16-57-40-575.csv Completed graceful shutdown