java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:27:47,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:27:47,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:27:47,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:27:47,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:27:47,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:27:47,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:27:47,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:27:47,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:27:47,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:27:47,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:27:47,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:27:47,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:27:47,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:27:47,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:27:47,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:27:47,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:27:47,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:27:47,340 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:27:47,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:27:47,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:27:47,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:27:47,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:27:47,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:27:47,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:27:47,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:27:47,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:27:47,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:27:47,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:27:47,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:27:47,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:27:47,348 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-11 15:27:47,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:27:47,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:27:47,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:27:47,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:27:47,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:27:47,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:27:47,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:27:47,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:27:47,372 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:27:47,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:27:47,372 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:27:47,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:27:47,405 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:27:47,407 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:27:47,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:27:47,408 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:27:47,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-04-11 15:27:47,679 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2a899951b [2018-04-11 15:27:47,786 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:27:47,786 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:27:47,787 INFO L168 CDTParser]: Scanning standard_strcpy_false-valid-deref_ground.i [2018-04-11 15:27:47,787 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:27:47,788 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:27:47,788 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:27:47,788 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_false-valid-deref_ground.i [2018-04-11 15:27:47,788 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_false-valid-deref_ground.i [2018-04-11 15:27:47,788 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:27:47,788 INFO L233 ultiparseSymbolTable]: [2018-04-11 15:27:47,799 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2a899951b [2018-04-11 15:27:47,802 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:27:47,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:27:47,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:27:47,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:27:47,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:27:47,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e0f4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47, skipping insertion in model container [2018-04-11 15:27:47,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,821 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:27:47,830 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:27:47,931 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:27:47,941 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:27:47,944 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-11 15:27:47,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47 WrapperNode [2018-04-11 15:27:47,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:27:47,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:27:47,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:27:47,950 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:27:47,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (1/1) ... [2018-04-11 15:27:47,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:27:47,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:27:47,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:27:47,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:27:47,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (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-11 15:27:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:27:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:27:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-11 15:27:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:27:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 15:27:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_false_valid_deref_ground_i____VERIFIER_assert [2018-04-11 15:27:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:27:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:27:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:27:48,155 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:27:48,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:27:48 BoogieIcfgContainer [2018-04-11 15:27:48,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:27:48,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:27:48,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:27:48,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:27:48,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:27:47" (1/3) ... [2018-04-11 15:27:48,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e5c640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:27:48, skipping insertion in model container [2018-04-11 15:27:48,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:27:47" (2/3) ... [2018-04-11 15:27:48,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e5c640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:27:48, skipping insertion in model container [2018-04-11 15:27:48,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:27:48" (3/3) ... [2018-04-11 15:27:48,159 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-04-11 15:27:48,165 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:27:48,169 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-04-11 15:27:48,190 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:27:48,191 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:27:48,191 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:27:48,191 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:27:48,191 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:27:48,191 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:27:48,191 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:27:48,191 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:27:48,191 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:27:48,192 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:27:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-04-11 15:27:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-11 15:27:48,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,205 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,205 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash -42208474, now seen corresponding path program 1 times [2018-04-11 15:27:48,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,209 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:48,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:27:48,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:27:48,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:27:48,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:27:48,307 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-04-11 15:27:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,362 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-04-11 15:27:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:27:48,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-11 15:27:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,369 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:27:48,369 INFO L226 Difference]: Without dead ends: 40 [2018-04-11 15:27:48,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:27:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-11 15:27:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-04-11 15:27:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-11 15:27:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-04-11 15:27:48,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-04-11 15:27:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,395 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-04-11 15:27:48,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:27:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-04-11 15:27:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 15:27:48,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,395 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,395 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 619915766, now seen corresponding path program 1 times [2018-04-11 15:27:48,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:27:48,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:27:48,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:27:48,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:27:48,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:27:48,431 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-04-11 15:27:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,483 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-04-11 15:27:48,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:27:48,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 15:27:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,484 INFO L225 Difference]: With dead ends: 34 [2018-04-11 15:27:48,484 INFO L226 Difference]: Without dead ends: 31 [2018-04-11 15:27:48,484 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:27:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-04-11 15:27:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-04-11 15:27:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-04-11 15:27:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-04-11 15:27:48,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-04-11 15:27:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,487 INFO L459 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-04-11 15:27:48,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:27:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-04-11 15:27:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 15:27:48,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,488 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,488 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 621575575, now seen corresponding path program 1 times [2018-04-11 15:27:48,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:48,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:48,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:48,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-11 15:27:48,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:27:48,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:27:48,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:27:48,561 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 4 states. [2018-04-11 15:27:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,615 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-04-11 15:27:48,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:27:48,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-11 15:27:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,616 INFO L225 Difference]: With dead ends: 45 [2018-04-11 15:27:48,616 INFO L226 Difference]: Without dead ends: 45 [2018-04-11 15:27:48,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:27:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-11 15:27:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-04-11 15:27:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:27:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:27:48,620 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-04-11 15:27:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,620 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:27:48,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:27:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:27:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:27:48,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,621 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,621 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1962704421, now seen corresponding path program 1 times [2018-04-11 15:27:48,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:48,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:27:48,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:27:48,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2018-04-11 15:27:48,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:48,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:48,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:48,680 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-11 15:27:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,721 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-11 15:27:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:48,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-11 15:27:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,722 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:27:48,723 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:27:48,723 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:27:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-04-11 15:27:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-11 15:27:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-04-11 15:27:48,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-04-11 15:27:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,728 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-04-11 15:27:48,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-04-11 15:27:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:27:48,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,728 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,728 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1964364230, now seen corresponding path program 2 times [2018-04-11 15:27:48,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:48,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:48,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:48,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:48,772 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:48,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:48,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:48,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-11 15:27:48,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:27:48,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:27:48,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:48,777 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 5 states. [2018-04-11 15:27:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,813 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-11 15:27:48,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:27:48,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 15:27:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,814 INFO L225 Difference]: With dead ends: 71 [2018-04-11 15:27:48,814 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:27:48,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:27:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:27:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2018-04-11 15:27:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 15:27:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-04-11 15:27:48,817 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-04-11 15:27:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,817 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-04-11 15:27:48,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:27:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-04-11 15:27:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:27:48,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,818 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,818 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1777648375, now seen corresponding path program 3 times [2018-04-11 15:27:48,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,818 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:48,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:48,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:48,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:48,890 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:27:48,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:48,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:48,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:48,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-11 15:27:48,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:27:48,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:27:48,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:48,901 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-04-11 15:27:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:48,981 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-04-11 15:27:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:48,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-11 15:27:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:48,982 INFO L225 Difference]: With dead ends: 89 [2018-04-11 15:27:48,982 INFO L226 Difference]: Without dead ends: 89 [2018-04-11 15:27:48,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:27:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-11 15:27:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-04-11 15:27:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:27:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-11 15:27:48,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-04-11 15:27:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:48,986 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-11 15:27:48,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:27:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-11 15:27:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:27:48,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:48,987 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:48,987 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash -788155134, now seen corresponding path program 1 times [2018-04-11 15:27:48,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:48,988 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:48,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:48,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:48,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-11 15:27:49,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:27:49,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:27:49,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:49,060 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-04-11 15:27:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:49,124 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-11 15:27:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:49,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-04-11 15:27:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:49,126 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:27:49,126 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:27:49,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:27:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:27:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:27:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:27:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-04-11 15:27:49,130 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-04-11 15:27:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:49,131 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-04-11 15:27:49,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:27:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-04-11 15:27:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:27:49,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:49,132 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:49,132 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:49,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1667360870, now seen corresponding path program 4 times [2018-04-11 15:27:49,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:49,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:49,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:49,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:27:49,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:27:49,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:49,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-11 15:27:49,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:27:49,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:27:49,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:49,218 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-04-11 15:27:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:49,312 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-04-11 15:27:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:27:49,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-11 15:27:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:49,314 INFO L225 Difference]: With dead ends: 94 [2018-04-11 15:27:49,314 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 15:27:49,314 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 15:27:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-04-11 15:27:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:27:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-11 15:27:49,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-04-11 15:27:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:49,319 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-11 15:27:49,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:27:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-11 15:27:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:27:49,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:49,320 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:49,320 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1804493581, now seen corresponding path program 2 times [2018-04-11 15:27:49,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:49,320 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:49,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:49,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-11 15:27:49,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:49,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:49,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:49,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-04-11 15:27:49,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-04-11 15:27:49,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:27:49,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:27:49,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:27:49,390 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-11 15:27:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:49,433 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-04-11 15:27:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:27:49,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-11 15:27:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:49,434 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:27:49,434 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:27:49,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:27:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:27:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-04-11 15:27:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-11 15:27:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-04-11 15:27:49,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-04-11 15:27:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:49,437 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-04-11 15:27:49,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:27:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-04-11 15:27:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:27:49,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:49,438 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:49,438 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash 651022423, now seen corresponding path program 5 times [2018-04-11 15:27:49,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:49,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:49,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:49,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,500 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:27:49,514 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:27:49,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:49,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-04-11 15:27:49,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:27:49,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:27:49,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:27:49,570 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-04-11 15:27:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:49,650 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-11 15:27:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:27:49,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-11 15:27:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:49,651 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:27:49,652 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:27:49,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:27:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:27:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-11 15:27:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:27:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-04-11 15:27:49,655 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-04-11 15:27:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:49,655 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-04-11 15:27:49,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:27:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-04-11 15:27:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:27:49,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:49,656 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:49,656 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:49,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1728432378, now seen corresponding path program 6 times [2018-04-11 15:27:49,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:49,656 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:49,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:49,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:27:49,728 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:27:49,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:49,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-11 15:27:49,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:27:49,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:27:49,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:27:49,763 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-04-11 15:27:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:49,863 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-04-11 15:27:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:27:49,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-11 15:27:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:49,863 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:27:49,863 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:27:49,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:27:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:27:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 15:27:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 15:27:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-04-11 15:27:49,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-04-11 15:27:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:49,865 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-04-11 15:27:49,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:27:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-04-11 15:27:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:27:49,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:49,866 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:49,866 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash -616716873, now seen corresponding path program 7 times [2018-04-11 15:27:49,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:49,866 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:49,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:49,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:49,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:49,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:49,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:49,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:49,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-11 15:27:49,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:27:49,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:27:49,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:27:49,933 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-04-11 15:27:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:50,006 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-11 15:27:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:27:50,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-11 15:27:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:50,006 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:27:50,006 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:27:50,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:27:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:27:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-04-11 15:27:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:27:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-04-11 15:27:50,009 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-04-11 15:27:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:50,009 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-04-11 15:27:50,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:27:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-04-11 15:27:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:27:50,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:50,010 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:50,010 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1845018022, now seen corresponding path program 8 times [2018-04-11 15:27:50,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:50,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:50,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:50,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:50,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:50,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:50,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:50,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:50,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:50,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:50,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-11 15:27:50,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:27:50,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:27:50,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:27:50,130 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-04-11 15:27:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:50,287 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-04-11 15:27:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:27:50,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-11 15:27:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:50,288 INFO L225 Difference]: With dead ends: 58 [2018-04-11 15:27:50,288 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:27:50,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:27:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:27:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-11 15:27:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:27:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-04-11 15:27:50,292 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-04-11 15:27:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:50,292 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-04-11 15:27:50,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:27:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-04-11 15:27:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:27:50,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:50,294 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:50,295 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash 795493143, now seen corresponding path program 9 times [2018-04-11 15:27:50,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:50,295 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:50,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:50,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:50,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:50,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:50,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:50,397 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:27:50,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:50,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:50,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-11 15:27:50,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:27:50,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:27:50,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:27:50,465 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-04-11 15:27:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:50,630 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-04-11 15:27:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:27:50,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-11 15:27:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:50,631 INFO L225 Difference]: With dead ends: 63 [2018-04-11 15:27:50,631 INFO L226 Difference]: Without dead ends: 63 [2018-04-11 15:27:50,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:27:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-11 15:27:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-11 15:27:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:27:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-04-11 15:27:50,634 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-04-11 15:27:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:50,634 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-04-11 15:27:50,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:27:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-04-11 15:27:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:27:50,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:50,635 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:50,635 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1643609158, now seen corresponding path program 10 times [2018-04-11 15:27:50,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:50,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:50,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:50,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:50,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:50,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:50,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:27:50,745 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:27:50,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:50,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:50,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-04-11 15:27:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:27:50,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:27:50,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:27:50,758 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-04-11 15:27:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:50,903 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-04-11 15:27:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:27:50,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-11 15:27:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:50,904 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:27:50,904 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:27:50,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:27:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:27:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-11 15:27:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:27:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-04-11 15:27:50,906 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-04-11 15:27:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:50,906 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-04-11 15:27:50,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:27:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-04-11 15:27:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:27:50,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:50,907 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:50,907 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:50,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1408870519, now seen corresponding path program 11 times [2018-04-11 15:27:50,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:50,907 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:50,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:50,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:50,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:50,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:50,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:27:51,016 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:27:51,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:51,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:51,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:51,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-04-11 15:27:51,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:27:51,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:27:51,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:27:51,115 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-04-11 15:27:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:51,510 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-04-11 15:27:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:27:51,510 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-11 15:27:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:51,510 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:27:51,511 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:27:51,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:27:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:27:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-11 15:27:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:27:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-04-11 15:27:51,513 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-04-11 15:27:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:51,514 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-04-11 15:27:51,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:27:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-04-11 15:27:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 15:27:51,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:51,515 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:51,515 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1139772698, now seen corresponding path program 12 times [2018-04-11 15:27:51,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:51,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:51,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:51,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:51,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:51,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:51,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:51,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:51,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:27:51,634 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:27:51,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:51,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:51,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:51,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-11 15:27:51,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:27:51,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:27:51,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:27:51,767 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2018-04-11 15:27:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:51,968 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-04-11 15:27:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:27:51,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-11 15:27:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:51,969 INFO L225 Difference]: With dead ends: 78 [2018-04-11 15:27:51,969 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:27:51,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:27:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:27:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-11 15:27:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:27:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-04-11 15:27:51,971 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-04-11 15:27:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:51,971 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-04-11 15:27:51,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:27:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-04-11 15:27:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 15:27:51,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:51,972 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:51,972 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1645336023, now seen corresponding path program 13 times [2018-04-11 15:27:51,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:51,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:51,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:51,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:51,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:51,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:52,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:52,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:52,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-04-11 15:27:52,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:27:52,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:27:52,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:27:52,083 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-04-11 15:27:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:52,288 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-04-11 15:27:52,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:27:52,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-11 15:27:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:52,289 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:27:52,289 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:27:52,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:27:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:27:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 15:27:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:27:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-04-11 15:27:52,292 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-04-11 15:27:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:52,292 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-04-11 15:27:52,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:27:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-04-11 15:27:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 15:27:52,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:52,293 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:52,293 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash 719167878, now seen corresponding path program 14 times [2018-04-11 15:27:52,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:52,294 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:52,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:52,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:52,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:52,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:52,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:52,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:52,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:52,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:52,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-11 15:27:52,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:27:52,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:27:52,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:27:52,470 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-04-11 15:27:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:52,672 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-04-11 15:27:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:27:52,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-11 15:27:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:52,672 INFO L225 Difference]: With dead ends: 88 [2018-04-11 15:27:52,672 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 15:27:52,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:27:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 15:27:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-11 15:27:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:27:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-04-11 15:27:52,674 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-04-11 15:27:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:52,675 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-04-11 15:27:52,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:27:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-04-11 15:27:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 15:27:52,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:52,676 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:52,676 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1151808713, now seen corresponding path program 15 times [2018-04-11 15:27:52,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:52,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:52,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:52,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:52,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:52,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:52,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:52,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:27:52,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:52,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:52,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:52,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-11 15:27:52,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:27:52,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:27:52,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:27:52,898 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 35 states. [2018-04-11 15:27:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:53,199 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-04-11 15:27:53,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:27:53,200 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-11 15:27:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:53,200 INFO L225 Difference]: With dead ends: 93 [2018-04-11 15:27:53,200 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 15:27:53,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:27:53,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 15:27:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-04-11 15:27:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:27:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-04-11 15:27:53,203 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-04-11 15:27:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:53,203 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-04-11 15:27:53,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:27:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-04-11 15:27:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 15:27:53,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:53,204 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:53,204 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1685653542, now seen corresponding path program 16 times [2018-04-11 15:27:53,204 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:53,204 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:53,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:53,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:53,205 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:53,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:53,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:53,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:53,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:27:53,383 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:27:53,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:53,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:53,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:53,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-11 15:27:53,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:27:53,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:27:53,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:27:53,406 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-04-11 15:27:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:53,770 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-04-11 15:27:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:27:53,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-11 15:27:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:53,771 INFO L225 Difference]: With dead ends: 98 [2018-04-11 15:27:53,771 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 15:27:53,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:27:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 15:27:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-04-11 15:27:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:27:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-04-11 15:27:53,773 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-04-11 15:27:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:53,773 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-04-11 15:27:53,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:27:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-04-11 15:27:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-11 15:27:53,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:53,774 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:53,774 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:53,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1777633431, now seen corresponding path program 17 times [2018-04-11 15:27:53,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:53,775 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:53,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:53,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:53,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:53,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:53,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:53,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:53,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:27:53,923 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:27:53,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:53,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:54,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:54,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-04-11 15:27:54,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:27:54,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:27:54,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:27:54,095 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-04-11 15:27:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:54,621 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-04-11 15:27:54,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:27:54,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 92 [2018-04-11 15:27:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:54,622 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:27:54,622 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 15:27:54,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:27:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 15:27:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-04-11 15:27:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 15:27:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-04-11 15:27:54,625 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-04-11 15:27:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:54,625 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-04-11 15:27:54,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:27:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-04-11 15:27:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-11 15:27:54,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:54,626 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:54,626 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -964909370, now seen corresponding path program 18 times [2018-04-11 15:27:54,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:54,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:54,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:54,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:54,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:54,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:54,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:54,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:54,831 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:27:54,843 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:27:54,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:54,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:55,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:55,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-11 15:27:55,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 15:27:55,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 15:27:55,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:27:55,053 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2018-04-11 15:27:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:55,439 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-04-11 15:27:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:27:55,439 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-04-11 15:27:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:55,440 INFO L225 Difference]: With dead ends: 108 [2018-04-11 15:27:55,440 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 15:27:55,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:27:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 15:27:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-11 15:27:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:27:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-04-11 15:27:55,443 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-04-11 15:27:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:55,443 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-04-11 15:27:55,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 15:27:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-04-11 15:27:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-11 15:27:55,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:55,444 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:55,444 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2138370569, now seen corresponding path program 19 times [2018-04-11 15:27:55,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:55,444 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:55,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:55,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:55,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:55,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:55,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:55,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:55,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:55,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:55,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-04-11 15:27:55,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:27:55,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:27:55,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:27:55,658 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-04-11 15:27:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:56,017 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-04-11 15:27:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:27:56,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-11 15:27:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:56,018 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:27:56,018 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:27:56,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:27:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:27:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-04-11 15:27:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:27:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-04-11 15:27:56,020 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-04-11 15:27:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:56,020 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-04-11 15:27:56,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:27:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-04-11 15:27:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-11 15:27:56,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:56,021 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:56,021 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash -167608986, now seen corresponding path program 20 times [2018-04-11 15:27:56,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:56,021 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:56,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:56,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:27:56,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:56,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:56,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:56,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:56,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:27:56,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:27:56,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:56,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:56,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:56,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-11 15:27:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:27:56,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:27:56,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:27:56,230 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-04-11 15:27:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:56,657 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-04-11 15:27:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:27:56,658 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-11 15:27:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:56,658 INFO L225 Difference]: With dead ends: 118 [2018-04-11 15:27:56,658 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 15:27:56,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:27:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 15:27:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-04-11 15:27:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:27:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-04-11 15:27:56,661 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-04-11 15:27:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:56,661 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-04-11 15:27:56,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:27:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-04-11 15:27:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-11 15:27:56,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:56,662 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:56,662 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2051169111, now seen corresponding path program 21 times [2018-04-11 15:27:56,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:56,663 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:56,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:56,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:56,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:56,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:56,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:56,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:56,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:27:56,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:27:56,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:56,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:56,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:56,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-11 15:27:56,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:27:56,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:27:56,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:27:56,900 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-04-11 15:27:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:57,206 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-04-11 15:27:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:27:57,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-11 15:27:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:57,207 INFO L225 Difference]: With dead ends: 123 [2018-04-11 15:27:57,207 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 15:27:57,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:27:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 15:27:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-11 15:27:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 15:27:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-04-11 15:27:57,209 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-04-11 15:27:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:57,210 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-04-11 15:27:57,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:27:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-04-11 15:27:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-11 15:27:57,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:57,210 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:57,210 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2141490182, now seen corresponding path program 22 times [2018-04-11 15:27:57,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:57,211 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:57,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:57,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:57,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:57,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:57,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:57,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:57,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:27:57,489 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:27:57,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:57,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:57,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:57,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-04-11 15:27:57,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:27:57,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:27:57,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:27:57,513 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-04-11 15:27:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:57,877 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-04-11 15:27:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:27:57,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-11 15:27:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:57,878 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:27:57,878 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 15:27:57,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:27:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 15:27:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-11 15:27:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:27:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-04-11 15:27:57,881 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-04-11 15:27:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:57,881 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-04-11 15:27:57,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:27:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-04-11 15:27:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-11 15:27:57,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:57,882 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:57,882 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1698664265, now seen corresponding path program 23 times [2018-04-11 15:27:57,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:57,882 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:57,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:57,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:57,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:57,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:58,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:58,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:58,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:27:58,116 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:27:58,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:58,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:58,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:58,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-04-11 15:27:58,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:27:58,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:27:58,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=1729, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:27:58,391 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-04-11 15:27:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:27:59,241 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-04-11 15:27:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:27:59,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 122 [2018-04-11 15:27:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:27:59,242 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:27:59,242 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:27:59,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1033, Invalid=4079, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:27:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:27:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-04-11 15:27:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 15:27:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-04-11 15:27:59,245 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-04-11 15:27:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:27:59,245 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-04-11 15:27:59,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:27:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-04-11 15:27:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-11 15:27:59,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:27:59,245 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-11 15:27:59,245 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:27:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2004669094, now seen corresponding path program 24 times [2018-04-11 15:27:59,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:27:59,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:27:59,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:59,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:27:59,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:27:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:27:59,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:27:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:59,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:27:59,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:27:59,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:27:59,466 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:27:59,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:27:59,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:27:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:27:59,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:27:59,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-04-11 15:27:59,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:27:59,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:27:59,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:27:59,634 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 37 states. [2018-04-11 15:28:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:00,196 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-04-11 15:28:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:28:00,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-04-11 15:28:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:00,197 INFO L225 Difference]: With dead ends: 138 [2018-04-11 15:28:00,197 INFO L226 Difference]: Without dead ends: 138 [2018-04-11 15:28:00,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:28:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-11 15:28:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-04-11 15:28:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:28:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-04-11 15:28:00,199 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-04-11 15:28:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:00,199 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-04-11 15:28:00,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:28:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-04-11 15:28:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-11 15:28:00,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:00,200 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:00,200 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460887, now seen corresponding path program 25 times [2018-04-11 15:28:00,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:00,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:00,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:00,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:00,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:00,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:00,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:00,468 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:00,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:00,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:00,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-11 15:28:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:28:00,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:28:00,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:28:00,503 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-04-11 15:28:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:00,849 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-04-11 15:28:00,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:28:00,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-11 15:28:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:00,850 INFO L225 Difference]: With dead ends: 143 [2018-04-11 15:28:00,850 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 15:28:00,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:28:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 15:28:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-11 15:28:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:28:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-04-11 15:28:00,852 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-04-11 15:28:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:00,852 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-04-11 15:28:00,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:28:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-04-11 15:28:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-11 15:28:00,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:00,853 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:00,853 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:00,853 INFO L82 PathProgramCache]: Analyzing trace with hash 421876038, now seen corresponding path program 26 times [2018-04-11 15:28:00,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:00,853 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:00,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:00,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:00,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:00,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:01,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:01,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:01,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:28:01,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:28:01,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:01,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:01,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:01,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-11 15:28:01,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:28:01,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:28:01,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:28:01,122 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-04-11 15:28:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:01,516 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-04-11 15:28:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:28:01,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-11 15:28:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:01,517 INFO L225 Difference]: With dead ends: 148 [2018-04-11 15:28:01,517 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 15:28:01,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:28:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 15:28:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-04-11 15:28:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:28:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-04-11 15:28:01,520 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-04-11 15:28:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:01,520 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-04-11 15:28:01,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:28:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-04-11 15:28:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-11 15:28:01,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:01,521 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:01,521 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1993804937, now seen corresponding path program 27 times [2018-04-11 15:28:01,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:01,521 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:01,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:01,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:01,522 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:01,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:01,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:01,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:28:02,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:28:02,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:02,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:02,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:02,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-11 15:28:02,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:28:02,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:28:02,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:28:02,026 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-04-11 15:28:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:02,475 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-04-11 15:28:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:28:02,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-11 15:28:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:02,476 INFO L225 Difference]: With dead ends: 153 [2018-04-11 15:28:02,476 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 15:28:02,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:28:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 15:28:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-11 15:28:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:28:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-04-11 15:28:02,479 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-04-11 15:28:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:02,479 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-04-11 15:28:02,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:28:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-04-11 15:28:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-11 15:28:02,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:02,480 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:02,480 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1740113894, now seen corresponding path program 28 times [2018-04-11 15:28:02,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:02,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:02,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:02,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:02,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:02,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:02,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:02,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:02,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:28:02,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:28:02,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:02,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:03,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:03,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-04-11 15:28:03,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 15:28:03,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 15:28:03,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:28:03,020 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 61 states. [2018-04-11 15:28:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:03,750 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-04-11 15:28:03,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:28:03,750 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-04-11 15:28:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:03,751 INFO L225 Difference]: With dead ends: 158 [2018-04-11 15:28:03,751 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 15:28:03,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:28:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 15:28:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-04-11 15:28:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:28:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-04-11 15:28:03,755 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-04-11 15:28:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:03,755 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-04-11 15:28:03,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 15:28:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-04-11 15:28:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-11 15:28:03,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:03,756 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:03,756 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash 685727959, now seen corresponding path program 29 times [2018-04-11 15:28:03,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:03,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:03,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:03,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:03,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:03,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:04,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:04,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:28:04,072 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:28:04,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:04,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:04,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:04,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-04-11 15:28:04,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 15:28:04,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 15:28:04,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:28:04,396 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-04-11 15:28:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:05,729 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-04-11 15:28:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:28:05,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2018-04-11 15:28:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:05,730 INFO L225 Difference]: With dead ends: 163 [2018-04-11 15:28:05,730 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 15:28:05,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1564, Invalid=6446, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 15:28:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 15:28:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-11 15:28:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 15:28:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-04-11 15:28:05,733 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-04-11 15:28:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:05,733 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-04-11 15:28:05,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 15:28:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-04-11 15:28:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-11 15:28:05,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:05,734 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:05,734 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash -842074490, now seen corresponding path program 30 times [2018-04-11 15:28:05,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:05,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:05,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:05,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:05,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:05,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:06,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:06,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:06,066 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:28:06,079 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:28:06,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:06,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:06,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:06,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-04-11 15:28:06,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:28:06,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:28:06,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:28:06,143 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-04-11 15:28:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:06,620 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-04-11 15:28:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:28:06,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-04-11 15:28:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:06,620 INFO L225 Difference]: With dead ends: 168 [2018-04-11 15:28:06,621 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 15:28:06,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:28:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 15:28:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-11 15:28:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:28:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-04-11 15:28:06,624 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-04-11 15:28:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:06,624 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-04-11 15:28:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:28:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-04-11 15:28:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-11 15:28:06,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:06,625 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:06,625 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760951, now seen corresponding path program 31 times [2018-04-11 15:28:06,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:06,626 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:06,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:06,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:06,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:06,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:06,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:06,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:06,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:06,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:07,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:07,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-11 15:28:07,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:28:07,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:28:07,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:28:07,003 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-04-11 15:28:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:07,528 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-04-11 15:28:07,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:28:07,529 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-11 15:28:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:07,530 INFO L225 Difference]: With dead ends: 173 [2018-04-11 15:28:07,530 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 15:28:07,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:28:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 15:28:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-04-11 15:28:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 15:28:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-04-11 15:28:07,533 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-04-11 15:28:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:07,533 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-04-11 15:28:07,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:28:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-04-11 15:28:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-11 15:28:07,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:07,535 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:07,535 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1115415258, now seen corresponding path program 32 times [2018-04-11 15:28:07,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:07,535 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:07,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:07,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:07,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:08,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:08,052 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:08,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:28:08,058 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:28:08,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:08,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:08,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:08,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-11 15:28:08,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:28:08,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:28:08,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:28:08,090 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-04-11 15:28:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:09,172 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-04-11 15:28:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:28:09,173 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-11 15:28:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:09,173 INFO L225 Difference]: With dead ends: 178 [2018-04-11 15:28:09,173 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 15:28:09,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:28:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 15:28:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-04-11 15:28:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:28:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-04-11 15:28:09,175 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-04-11 15:28:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:09,176 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-04-11 15:28:09,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:28:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-04-11 15:28:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-11 15:28:09,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:09,176 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:09,176 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash -712076393, now seen corresponding path program 33 times [2018-04-11 15:28:09,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:09,176 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:09,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:09,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:09,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:09,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:09,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:09,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:09,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:28:09,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:28:09,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:09,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:09,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:09,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-11 15:28:09,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:28:09,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:28:09,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:28:09,587 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-04-11 15:28:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:10,142 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-04-11 15:28:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:28:10,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-11 15:28:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:10,143 INFO L225 Difference]: With dead ends: 183 [2018-04-11 15:28:10,143 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 15:28:10,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 15:28:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 15:28:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-11 15:28:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:28:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-04-11 15:28:10,147 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-04-11 15:28:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:10,147 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-04-11 15:28:10,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:28:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-04-11 15:28:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-11 15:28:10,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:10,148 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:10,148 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1349614534, now seen corresponding path program 34 times [2018-04-11 15:28:10,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:10,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:10,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:10,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:10,149 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:10,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:10,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:10,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:28:10,677 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:28:10,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:10,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:10,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:10,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-04-11 15:28:10,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:28:10,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:28:10,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:28:10,716 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-04-11 15:28:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:11,339 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-04-11 15:28:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:28:11,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-11 15:28:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:11,340 INFO L225 Difference]: With dead ends: 188 [2018-04-11 15:28:11,340 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 15:28:11,341 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:28:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 15:28:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-04-11 15:28:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 15:28:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-04-11 15:28:11,343 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-04-11 15:28:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:11,343 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-04-11 15:28:11,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:28:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-04-11 15:28:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-11 15:28:11,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:11,343 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:11,343 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2024580873, now seen corresponding path program 35 times [2018-04-11 15:28:11,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:11,344 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:11,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:11,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:11,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:11,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:11,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:11,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:11,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:28:11,814 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:28:11,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:11,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:12,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:12,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-04-11 15:28:12,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-11 15:28:12,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-11 15:28:12,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1367, Invalid=3889, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:28:12,405 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-04-11 15:28:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:14,269 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-04-11 15:28:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:28:14,270 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 182 [2018-04-11 15:28:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:14,270 INFO L225 Difference]: With dead ends: 193 [2018-04-11 15:28:14,270 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 15:28:14,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=9353, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:28:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 15:28:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-04-11 15:28:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 15:28:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-04-11 15:28:14,273 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-04-11 15:28:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:14,273 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-04-11 15:28:14,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-11 15:28:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-04-11 15:28:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-11 15:28:14,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:14,274 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:14,274 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash -407825818, now seen corresponding path program 36 times [2018-04-11 15:28:14,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:14,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:14,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:14,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:14,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:14,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:14,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:14,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:14,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:28:14,700 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:28:14,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:14,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:14,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:14,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-04-11 15:28:14,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:28:14,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:28:14,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:28:14,852 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 45 states. [2018-04-11 15:28:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:15,530 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-04-11 15:28:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:28:15,530 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-04-11 15:28:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:15,531 INFO L225 Difference]: With dead ends: 198 [2018-04-11 15:28:15,531 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 15:28:15,531 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 15:28:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 15:28:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-04-11 15:28:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 15:28:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-04-11 15:28:15,533 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-04-11 15:28:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:15,533 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-04-11 15:28:15,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:28:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-04-11 15:28:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-11 15:28:15,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:15,534 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:15,534 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1486297513, now seen corresponding path program 37 times [2018-04-11 15:28:15,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:15,534 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:15,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:15,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:15,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:15,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:15,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:15,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:15,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:15,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:15,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:15,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-11 15:28:15,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 15:28:15,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 15:28:15,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:28:15,967 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-04-11 15:28:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:16,573 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-04-11 15:28:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:28:16,573 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-11 15:28:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:16,574 INFO L225 Difference]: With dead ends: 203 [2018-04-11 15:28:16,574 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 15:28:16,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:28:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 15:28:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-04-11 15:28:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 15:28:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-04-11 15:28:16,576 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-04-11 15:28:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:16,576 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-04-11 15:28:16,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 15:28:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-04-11 15:28:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-11 15:28:16,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:16,577 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:16,577 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash -874716922, now seen corresponding path program 38 times [2018-04-11 15:28:16,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:16,577 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:16,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:16,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:16,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:16,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:16,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:16,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:28:17,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:28:17,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:17,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:17,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:17,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-11 15:28:17,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:28:17,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:28:17,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:28:17,027 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-04-11 15:28:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:17,671 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-04-11 15:28:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:28:17,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-11 15:28:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:17,672 INFO L225 Difference]: With dead ends: 208 [2018-04-11 15:28:17,672 INFO L226 Difference]: Without dead ends: 208 [2018-04-11 15:28:17,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:28:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-11 15:28:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-04-11 15:28:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-11 15:28:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-04-11 15:28:17,674 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-04-11 15:28:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:17,674 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-04-11 15:28:17,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:28:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-04-11 15:28:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-11 15:28:17,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:17,675 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:17,675 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093175, now seen corresponding path program 39 times [2018-04-11 15:28:17,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:17,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:17,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:17,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:17,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:17,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:18,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:18,228 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:28:18,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:28:18,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:18,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:18,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:18,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-04-11 15:28:18,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 15:28:18,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 15:28:18,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:28:18,277 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-04-11 15:28:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:18,916 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-04-11 15:28:18,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:28:18,917 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-11 15:28:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:18,917 INFO L225 Difference]: With dead ends: 213 [2018-04-11 15:28:18,917 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 15:28:18,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 15:28:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 15:28:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-04-11 15:28:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 15:28:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-04-11 15:28:18,919 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-04-11 15:28:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:18,919 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-04-11 15:28:18,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-11 15:28:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-04-11 15:28:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-11 15:28:18,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:18,920 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:18,920 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:18,920 INFO L82 PathProgramCache]: Analyzing trace with hash -854661210, now seen corresponding path program 40 times [2018-04-11 15:28:18,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:18,921 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:18,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:18,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:18,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:18,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:19,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:19,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:19,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:28:19,400 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:28:19,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:19,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:19,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:19,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-04-11 15:28:19,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:28:19,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:28:19,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:28:19,430 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-04-11 15:28:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:20,597 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-04-11 15:28:20,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 15:28:20,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-11 15:28:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:20,598 INFO L225 Difference]: With dead ends: 218 [2018-04-11 15:28:20,598 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 15:28:20,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 15:28:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 15:28:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-04-11 15:28:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 15:28:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-04-11 15:28:20,600 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-04-11 15:28:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:20,601 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-04-11 15:28:20,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:28:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-04-11 15:28:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-11 15:28:20,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:20,601 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:20,601 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2040420631, now seen corresponding path program 41 times [2018-04-11 15:28:20,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:20,602 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:20,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:20,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:20,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:20,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:21,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:21,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:21,125 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:28:21,139 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:28:21,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:21,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:21,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:21,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-04-11 15:28:21,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-11 15:28:21,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-11 15:28:21,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 15:28:21,710 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-04-11 15:28:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:24,355 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-04-11 15:28:24,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:28:24,355 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 212 [2018-04-11 15:28:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:24,355 INFO L225 Difference]: With dead ends: 223 [2018-04-11 15:28:24,356 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 15:28:24,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2950, Invalid=12800, Unknown=0, NotChecked=0, Total=15750 [2018-04-11 15:28:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 15:28:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-04-11 15:28:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 15:28:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-04-11 15:28:24,358 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-04-11 15:28:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:24,359 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-04-11 15:28:24,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-11 15:28:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-04-11 15:28:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-11 15:28:24,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:24,359 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:24,360 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -488561082, now seen corresponding path program 42 times [2018-04-11 15:28:24,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:24,360 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:24,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:24,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:24,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:24,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:24,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:24,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:28:24,868 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:28:24,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:24,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:24,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:24,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-04-11 15:28:24,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:28:24,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:28:24,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:28:24,968 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 49 states. [2018-04-11 15:28:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:25,714 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-04-11 15:28:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:28:25,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-04-11 15:28:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:25,750 INFO L225 Difference]: With dead ends: 228 [2018-04-11 15:28:25,750 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 15:28:25,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-04-11 15:28:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 15:28:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-04-11 15:28:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 15:28:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-04-11 15:28:25,753 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-04-11 15:28:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:25,753 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-04-11 15:28:25,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:28:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-04-11 15:28:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-11 15:28:25,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:25,754 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:25,754 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 344604279, now seen corresponding path program 43 times [2018-04-11 15:28:25,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:25,755 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:25,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:25,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:25,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:25,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:26,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:26,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:26,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:26,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:26,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:26,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-04-11 15:28:26,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:28:26,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:28:26,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:28:26,328 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-04-11 15:28:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:27,064 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-04-11 15:28:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:28:27,065 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-11 15:28:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:27,065 INFO L225 Difference]: With dead ends: 233 [2018-04-11 15:28:27,065 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 15:28:27,066 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 15:28:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 15:28:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-04-11 15:28:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 15:28:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-04-11 15:28:27,069 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-04-11 15:28:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:27,069 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-04-11 15:28:27,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:28:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-04-11 15:28:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-11 15:28:27,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:27,070 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:27,070 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash -865231642, now seen corresponding path program 44 times [2018-04-11 15:28:27,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:27,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:27,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:27,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:27,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:27,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:27,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:27,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:28:27,641 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:28:27,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:27,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:27,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:27,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-04-11 15:28:27,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:28:27,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:28:27,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:28:27,766 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 55 states. [2018-04-11 15:28:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:28,828 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-04-11 15:28:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 15:28:28,828 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-04-11 15:28:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:28,829 INFO L225 Difference]: With dead ends: 238 [2018-04-11 15:28:28,829 INFO L226 Difference]: Without dead ends: 238 [2018-04-11 15:28:28,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-04-11 15:28:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-11 15:28:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-04-11 15:28:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-11 15:28:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-04-11 15:28:28,832 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-04-11 15:28:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:28,832 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-04-11 15:28:28,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:28:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-04-11 15:28:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-11 15:28:28,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:28,833 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:28,833 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1352733737, now seen corresponding path program 45 times [2018-04-11 15:28:28,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:28,834 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:28,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:28,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:28,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:28,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:29,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:29,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:29,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:28:29,468 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:28:29,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:29,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:29,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:29,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-11 15:28:29,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 15:28:29,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 15:28:29,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:28:29,500 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-04-11 15:28:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:30,299 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-04-11 15:28:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:28:30,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-11 15:28:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:30,300 INFO L225 Difference]: With dead ends: 243 [2018-04-11 15:28:30,300 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 15:28:30,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-11 15:28:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 15:28:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-04-11 15:28:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 15:28:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-04-11 15:28:30,302 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-04-11 15:28:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:30,302 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-04-11 15:28:30,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 15:28:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-04-11 15:28:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-11 15:28:30,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:30,303 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:30,303 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1337046138, now seen corresponding path program 46 times [2018-04-11 15:28:30,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:30,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:30,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:30,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:30,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:30,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:30,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:30,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:30,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:28:30,948 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:28:30,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:30,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:30,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:30,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-04-11 15:28:30,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:28:30,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:28:30,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:28:30,982 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-04-11 15:28:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:31,982 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-04-11 15:28:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 15:28:31,982 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-11 15:28:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:31,983 INFO L225 Difference]: With dead ends: 248 [2018-04-11 15:28:31,983 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 15:28:31,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 15:28:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 15:28:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-04-11 15:28:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 15:28:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-04-11 15:28:31,985 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-04-11 15:28:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:31,985 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-04-11 15:28:31,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:28:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-04-11 15:28:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-11 15:28:31,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:31,986 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:31,986 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 868376887, now seen corresponding path program 47 times [2018-04-11 15:28:31,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:31,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:31,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:31,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:31,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:31,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:32,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:32,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:32,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:28:32,662 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:28:32,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:32,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:33,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:33,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-04-11 15:28:33,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-11 15:28:33,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-11 15:28:33,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2399, Invalid=6913, Unknown=0, NotChecked=0, Total=9312 [2018-04-11 15:28:33,371 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-04-11 15:28:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:37,011 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-04-11 15:28:37,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:28:37,011 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 242 [2018-04-11 15:28:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:37,012 INFO L225 Difference]: With dead ends: 253 [2018-04-11 15:28:37,012 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 15:28:37,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3805, Invalid=16787, Unknown=0, NotChecked=0, Total=20592 [2018-04-11 15:28:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 15:28:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-04-11 15:28:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-11 15:28:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-04-11 15:28:37,016 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-04-11 15:28:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:37,016 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-04-11 15:28:37,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-11 15:28:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-04-11 15:28:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-11 15:28:37,017 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:37,017 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:37,017 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1130548698, now seen corresponding path program 48 times [2018-04-11 15:28:37,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:37,017 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:37,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:37,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:37,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:37,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:37,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:37,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:28:37,711 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-11 15:28:37,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:37,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:38,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:38,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-04-11 15:28:38,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-11 15:28:38,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-11 15:28:38,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:28:38,174 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-04-11 15:28:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:40,083 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-04-11 15:28:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 15:28:40,083 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-04-11 15:28:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:40,084 INFO L225 Difference]: With dead ends: 258 [2018-04-11 15:28:40,084 INFO L226 Difference]: Without dead ends: 258 [2018-04-11 15:28:40,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-04-11 15:28:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-11 15:28:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-04-11 15:28:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-11 15:28:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-04-11 15:28:40,086 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-04-11 15:28:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:40,087 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-04-11 15:28:40,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-11 15:28:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-04-11 15:28:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-11 15:28:40,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:40,088 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:40,088 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 869965463, now seen corresponding path program 49 times [2018-04-11 15:28:40,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:40,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:40,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:40,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:40,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:40,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:40,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:40,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:40,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:40,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:40,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-11 15:28:40,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:28:40,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:28:40,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:28:40,911 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-04-11 15:28:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:41,867 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-04-11 15:28:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 15:28:41,868 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-11 15:28:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:41,868 INFO L225 Difference]: With dead ends: 263 [2018-04-11 15:28:41,868 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 15:28:41,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 15:28:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 15:28:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-11 15:28:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 15:28:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-04-11 15:28:41,870 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-04-11 15:28:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:41,870 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-04-11 15:28:41,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:28:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-04-11 15:28:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-11 15:28:41,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:41,872 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:41,872 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:41,872 INFO L82 PathProgramCache]: Analyzing trace with hash -957067066, now seen corresponding path program 50 times [2018-04-11 15:28:41,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:41,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:41,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:41,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:41,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:42,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:42,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:28:42,655 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:28:42,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:42,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:42,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:42,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-04-11 15:28:42,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:28:42,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:28:42,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:28:42,758 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 58 states. [2018-04-11 15:28:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:43,844 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-04-11 15:28:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:28:43,844 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-04-11 15:28:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:43,845 INFO L225 Difference]: With dead ends: 268 [2018-04-11 15:28:43,845 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 15:28:43,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-04-11 15:28:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 15:28:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-11 15:28:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 15:28:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-04-11 15:28:43,847 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-04-11 15:28:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:43,848 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-04-11 15:28:43,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:28:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-04-11 15:28:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-11 15:28:43,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:43,848 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:43,849 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1246602231, now seen corresponding path program 51 times [2018-04-11 15:28:43,849 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:43,849 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:43,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:43,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:43,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:43,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:44,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:44,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:44,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:28:44,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-11 15:28:44,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:44,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:44,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:44,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-04-11 15:28:44,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:28:44,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:28:44,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:28:44,760 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-04-11 15:28:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:45,742 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-04-11 15:28:45,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 15:28:45,743 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-11 15:28:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:45,743 INFO L225 Difference]: With dead ends: 273 [2018-04-11 15:28:45,743 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 15:28:45,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 15:28:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 15:28:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-04-11 15:28:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-11 15:28:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-04-11 15:28:45,746 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-04-11 15:28:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:45,747 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-04-11 15:28:45,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:28:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-04-11 15:28:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-11 15:28:45,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:45,748 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:45,748 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -328358042, now seen corresponding path program 52 times [2018-04-11 15:28:45,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:45,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:45,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:45,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:45,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:45,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:46,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:46,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:46,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:28:46,590 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:28:46,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:46,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:47,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:47,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-11 15:28:47,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-11 15:28:47,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-11 15:28:47,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:28:47,395 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 109 states. [2018-04-11 15:28:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:50,336 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-04-11 15:28:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:28:50,336 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-04-11 15:28:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:50,337 INFO L225 Difference]: With dead ends: 278 [2018-04-11 15:28:50,337 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 15:28:50,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:28:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 15:28:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-04-11 15:28:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-11 15:28:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-04-11 15:28:50,340 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-04-11 15:28:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:50,340 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-04-11 15:28:50,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-11 15:28:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-04-11 15:28:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-11 15:28:50,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:50,341 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:50,341 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2051109207, now seen corresponding path program 53 times [2018-04-11 15:28:50,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:50,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:50,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:50,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:50,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:50,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:51,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:51,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:51,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:28:51,185 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-11 15:28:51,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:51,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:52,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:52,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-04-11 15:28:52,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-11 15:28:52,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-11 15:28:52,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=8749, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 15:28:52,121 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-04-11 15:28:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:55,943 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-04-11 15:28:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-11 15:28:55,944 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 272 [2018-04-11 15:28:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:55,944 INFO L225 Difference]: With dead ends: 283 [2018-04-11 15:28:55,944 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 15:28:55,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4768, Invalid=21314, Unknown=0, NotChecked=0, Total=26082 [2018-04-11 15:28:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 15:28:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-04-11 15:28:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-11 15:28:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-04-11 15:28:55,947 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-04-11 15:28:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:55,947 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-04-11 15:28:55,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-11 15:28:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-04-11 15:28:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-11 15:28:55,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:55,947 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:55,948 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 832779782, now seen corresponding path program 54 times [2018-04-11 15:28:55,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:55,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:55,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:55,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:55,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:55,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:56,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:56,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:56,782 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:28:56,806 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-11 15:28:56,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:28:56,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:57,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:57,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-04-11 15:28:57,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 15:28:57,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 15:28:57,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:28:57,026 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 61 states. [2018-04-11 15:28:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:28:58,178 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-04-11 15:28:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 15:28:58,178 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-04-11 15:28:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:28:58,179 INFO L225 Difference]: With dead ends: 288 [2018-04-11 15:28:58,179 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 15:28:58,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 15:28:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 15:28:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-04-11 15:28:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-11 15:28:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-04-11 15:28:58,182 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-04-11 15:28:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:28:58,182 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-04-11 15:28:58,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-11 15:28:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-04-11 15:28:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-11 15:28:58,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:28:58,183 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-11 15:28:58,183 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:28:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1889794377, now seen corresponding path program 55 times [2018-04-11 15:28:58,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:28:58,183 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:28:58,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:58,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:28:58,183 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:28:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:58,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:28:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:59,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:28:59,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:28:59,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:28:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:28:59,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:28:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:28:59,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:28:59,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-04-11 15:28:59,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:28:59,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:28:59,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:28:59,158 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-04-11 15:29:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:00,248 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-04-11 15:29:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:29:00,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-11 15:29:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:00,249 INFO L225 Difference]: With dead ends: 293 [2018-04-11 15:29:00,249 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 15:29:00,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 15:29:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 15:29:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-04-11 15:29:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 15:29:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-04-11 15:29:00,252 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-04-11 15:29:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:00,253 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-04-11 15:29:00,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:29:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-04-11 15:29:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-11 15:29:00,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:00,254 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:00,254 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 581893286, now seen corresponding path program 56 times [2018-04-11 15:29:00,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:00,255 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:00,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:29:00,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:00,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:01,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:01,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:29:01,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:29:01,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:01,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:01,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:01,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-11 15:29:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-11 15:29:01,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-11 15:29:01,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:29:01,220 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-04-11 15:29:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:03,254 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-04-11 15:29:03,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:29:03,254 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-11 15:29:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:03,255 INFO L225 Difference]: With dead ends: 298 [2018-04-11 15:29:03,255 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 15:29:03,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-11 15:29:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 15:29:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-04-11 15:29:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-11 15:29:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-04-11 15:29:03,258 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-04-11 15:29:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:03,258 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-04-11 15:29:03,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-11 15:29:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-04-11 15:29:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-11 15:29:03,259 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:03,259 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:03,259 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2109957143, now seen corresponding path program 57 times [2018-04-11 15:29:03,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:03,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:03,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:03,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:03,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:03,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:04,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:04,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:04,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:29:04,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-11 15:29:04,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:04,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:05,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:05,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-04-11 15:29:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-11 15:29:05,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-11 15:29:05,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 15:29:05,088 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 119 states. [2018-04-11 15:29:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:08,182 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-04-11 15:29:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 15:29:08,182 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-04-11 15:29:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:08,183 INFO L225 Difference]: With dead ends: 303 [2018-04-11 15:29:08,183 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 15:29:08,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 15:29:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 15:29:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-04-11 15:29:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-11 15:29:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-04-11 15:29:08,185 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-04-11 15:29:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:08,185 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-04-11 15:29:08,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-11 15:29:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-04-11 15:29:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-11 15:29:08,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:08,186 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:08,186 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1932196678, now seen corresponding path program 58 times [2018-04-11 15:29:08,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:08,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:08,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:08,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:08,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:08,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:09,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:09,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:29:09,145 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:29:09,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:09,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:09,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:09,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-04-11 15:29:09,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-11 15:29:09,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-11 15:29:09,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:29:09,337 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 67 states. [2018-04-11 15:29:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:10,985 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-04-11 15:29:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 15:29:10,985 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-04-11 15:29:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:10,986 INFO L225 Difference]: With dead ends: 308 [2018-04-11 15:29:10,986 INFO L226 Difference]: Without dead ends: 308 [2018-04-11 15:29:10,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-04-11 15:29:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-11 15:29:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-04-11 15:29:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-11 15:29:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-04-11 15:29:10,989 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-04-11 15:29:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:10,989 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-04-11 15:29:10,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-11 15:29:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-04-11 15:29:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-11 15:29:10,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:10,990 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:10,990 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1038251657, now seen corresponding path program 59 times [2018-04-11 15:29:10,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:10,991 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:10,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:10,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:10,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:10,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:12,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:12,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:12,017 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:29:12,037 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-11 15:29:12,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:12,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:13,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:13,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 120 [2018-04-11 15:29:13,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-11 15:29:13,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-11 15:29:13,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3719, Invalid=10801, Unknown=0, NotChecked=0, Total=14520 [2018-04-11 15:29:13,091 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 121 states. [2018-04-11 15:29:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:17,612 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-04-11 15:29:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 15:29:17,612 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2018-04-11 15:29:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:17,613 INFO L225 Difference]: With dead ends: 313 [2018-04-11 15:29:17,613 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 15:29:17,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11636 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5839, Invalid=26381, Unknown=0, NotChecked=0, Total=32220 [2018-04-11 15:29:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 15:29:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-04-11 15:29:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-11 15:29:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-04-11 15:29:17,616 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-04-11 15:29:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:17,616 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-04-11 15:29:17,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-11 15:29:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-04-11 15:29:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-11 15:29:17,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:17,617 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:17,617 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1640943130, now seen corresponding path program 60 times [2018-04-11 15:29:17,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:17,617 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:17,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:17,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:17,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:17,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:18,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:18,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:29:18,674 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-11 15:29:18,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:18,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:19,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:19,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 117 [2018-04-11 15:29:19,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-04-11 15:29:19,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-04-11 15:29:19,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=10447, Unknown=0, NotChecked=0, Total=13806 [2018-04-11 15:29:19,766 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 118 states. [2018-04-11 15:29:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:23,759 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-04-11 15:29:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-11 15:29:23,759 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 307 [2018-04-11 15:29:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:23,760 INFO L225 Difference]: With dead ends: 318 [2018-04-11 15:29:23,760 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 15:29:23,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10275 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5808, Invalid=25698, Unknown=0, NotChecked=0, Total=31506 [2018-04-11 15:29:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 15:29:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-11 15:29:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-11 15:29:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-04-11 15:29:23,763 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-04-11 15:29:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:23,763 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-04-11 15:29:23,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-04-11 15:29:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-04-11 15:29:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-11 15:29:23,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:23,764 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:23,764 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1047497001, now seen corresponding path program 61 times [2018-04-11 15:29:23,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:23,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:23,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:23,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:23,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:23,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:24,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:24,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:24,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:29:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:24,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:24,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:24,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-04-11 15:29:24,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 15:29:24,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 15:29:24,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:29:24,934 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-04-11 15:29:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:26,247 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-04-11 15:29:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-11 15:29:26,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-11 15:29:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:26,248 INFO L225 Difference]: With dead ends: 323 [2018-04-11 15:29:26,248 INFO L226 Difference]: Without dead ends: 323 [2018-04-11 15:29:26,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-11 15:29:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-11 15:29:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-04-11 15:29:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-11 15:29:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-04-11 15:29:26,251 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-04-11 15:29:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:26,251 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-04-11 15:29:26,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 15:29:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-04-11 15:29:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-11 15:29:26,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:26,253 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:26,253 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2040815482, now seen corresponding path program 62 times [2018-04-11 15:29:26,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:26,253 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:26,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:26,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:29:26,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:26,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:27,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:27,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:29:27,439 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:29:27,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:27,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:27,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:27,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-11 15:29:27,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-11 15:29:27,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-11 15:29:27,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:29:27,493 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-04-11 15:29:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:28,951 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-04-11 15:29:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 15:29:28,963 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-11 15:29:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:28,964 INFO L225 Difference]: With dead ends: 328 [2018-04-11 15:29:28,964 INFO L226 Difference]: Without dead ends: 328 [2018-04-11 15:29:28,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-11 15:29:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-11 15:29:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-04-11 15:29:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-11 15:29:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-04-11 15:29:28,966 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-04-11 15:29:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:28,966 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-04-11 15:29:28,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-11 15:29:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-04-11 15:29:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-11 15:29:28,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:28,967 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:28,967 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:28,967 INFO L82 PathProgramCache]: Analyzing trace with hash 700591159, now seen corresponding path program 63 times [2018-04-11 15:29:28,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:28,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:28,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:28,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:28,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:28,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:30,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:30,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:29:30,125 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-11 15:29:30,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:30,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:31,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:31,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-04-11 15:29:31,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-11 15:29:31,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-11 15:29:31,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-11 15:29:31,256 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 131 states. [2018-04-11 15:29:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:34,503 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-04-11 15:29:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-11 15:29:34,503 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-04-11 15:29:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:34,504 INFO L225 Difference]: With dead ends: 333 [2018-04-11 15:29:34,504 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 15:29:34,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-11 15:29:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 15:29:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-04-11 15:29:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-04-11 15:29:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-04-11 15:29:34,506 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-04-11 15:29:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:34,506 INFO L459 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-04-11 15:29:34,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-11 15:29:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-04-11 15:29:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-11 15:29:34,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:34,507 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:34,507 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 365184806, now seen corresponding path program 64 times [2018-04-11 15:29:34,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:34,508 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:34,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:34,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:34,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:34,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:36,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:36,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:36,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:29:36,156 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:29:36,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:36,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:36,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:36,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-04-11 15:29:36,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-11 15:29:36,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-11 15:29:36,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:29:36,247 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-04-11 15:29:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:40,269 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-04-11 15:29:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 15:29:40,269 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-11 15:29:40,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:40,270 INFO L225 Difference]: With dead ends: 338 [2018-04-11 15:29:40,270 INFO L226 Difference]: Without dead ends: 338 [2018-04-11 15:29:40,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:29:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-11 15:29:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-11 15:29:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-11 15:29:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-04-11 15:29:40,272 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-04-11 15:29:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:40,273 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-04-11 15:29:40,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-11 15:29:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-04-11 15:29:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-11 15:29:40,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:40,274 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:40,274 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1356376471, now seen corresponding path program 65 times [2018-04-11 15:29:40,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:40,275 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:40,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:40,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:40,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:40,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:41,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:41,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:29:41,501 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-11 15:29:41,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:41,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:42,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:42,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-04-11 15:29:42,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-04-11 15:29:42,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-04-11 15:29:42,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4487, Invalid=13069, Unknown=0, NotChecked=0, Total=17556 [2018-04-11 15:29:42,766 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 133 states. [2018-04-11 15:29:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:49,024 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-04-11 15:29:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 15:29:49,025 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 332 [2018-04-11 15:29:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:49,025 INFO L225 Difference]: With dead ends: 343 [2018-04-11 15:29:49,026 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 15:29:49,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14183 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7018, Invalid=31988, Unknown=0, NotChecked=0, Total=39006 [2018-04-11 15:29:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 15:29:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-11 15:29:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-11 15:29:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-04-11 15:29:49,029 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-04-11 15:29:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:49,029 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-04-11 15:29:49,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-04-11 15:29:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-04-11 15:29:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-11 15:29:49,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:49,030 INFO L355 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:49,030 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:49,030 INFO L82 PathProgramCache]: Analyzing trace with hash -570087994, now seen corresponding path program 66 times [2018-04-11 15:29:49,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:49,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:49,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:49,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:49,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:49,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:50,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:50,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:29:50,360 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-11 15:29:50,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:50,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:51,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:51,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 136 [2018-04-11 15:29:51,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-11 15:29:51,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-11 15:29:51,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-11 15:29:51,506 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 137 states. [2018-04-11 15:29:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:55,328 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-04-11 15:29:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 15:29:55,328 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 337 [2018-04-11 15:29:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:55,329 INFO L225 Difference]: With dead ends: 348 [2018-04-11 15:29:55,329 INFO L226 Difference]: Without dead ends: 348 [2018-04-11 15:29:55,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8775 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-04-11 15:29:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-11 15:29:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-04-11 15:29:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-11 15:29:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-04-11 15:29:55,331 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-04-11 15:29:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:55,331 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-04-11 15:29:55,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-11 15:29:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-04-11 15:29:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-04-11 15:29:55,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:55,332 INFO L355 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:55,332 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1787171081, now seen corresponding path program 67 times [2018-04-11 15:29:55,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:55,333 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:55,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:55,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:29:55,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:55,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:56,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:56,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:29:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:56,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:56,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:56,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-04-11 15:29:56,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-11 15:29:56,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-11 15:29:56,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:29:56,714 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-04-11 15:29:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:29:58,201 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-04-11 15:29:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-11 15:29:58,201 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-04-11 15:29:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:29:58,202 INFO L225 Difference]: With dead ends: 353 [2018-04-11 15:29:58,202 INFO L226 Difference]: Without dead ends: 353 [2018-04-11 15:29:58,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-04-11 15:29:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-11 15:29:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-04-11 15:29:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-04-11 15:29:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-04-11 15:29:58,205 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-04-11 15:29:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:29:58,205 INFO L459 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-04-11 15:29:58,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-11 15:29:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-04-11 15:29:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-04-11 15:29:58,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:29:58,206 INFO L355 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-04-11 15:29:58,206 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:29:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1204274074, now seen corresponding path program 68 times [2018-04-11 15:29:58,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:29:58,206 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:29:58,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:29:58,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:29:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:29:58,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:29:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:59,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:29:59,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:29:59,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:29:59,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:29:59,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:29:59,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:29:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:29:59,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:29:59,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-04-11 15:29:59,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 15:29:59,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 15:29:59,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:29:59,622 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-04-11 15:30:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:01,641 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-04-11 15:30:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 15:30:01,641 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-04-11 15:30:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:01,642 INFO L225 Difference]: With dead ends: 358 [2018-04-11 15:30:01,642 INFO L226 Difference]: Without dead ends: 358 [2018-04-11 15:30:01,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-04-11 15:30:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-11 15:30:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-04-11 15:30:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-04-11 15:30:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-04-11 15:30:01,645 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-04-11 15:30:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:01,645 INFO L459 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-04-11 15:30:01,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 15:30:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-04-11 15:30:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-11 15:30:01,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:01,647 INFO L355 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:01,647 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1093927849, now seen corresponding path program 69 times [2018-04-11 15:30:01,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:01,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:01,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:01,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:01,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:01,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:03,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:03,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:03,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:30:03,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-11 15:30:03,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:03,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:03,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:03,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-11 15:30:03,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-11 15:30:03,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-11 15:30:03,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:30:03,183 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-04-11 15:30:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:04,751 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-04-11 15:30:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-11 15:30:04,751 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-04-11 15:30:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:04,752 INFO L225 Difference]: With dead ends: 363 [2018-04-11 15:30:04,752 INFO L226 Difference]: Without dead ends: 363 [2018-04-11 15:30:04,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-04-11 15:30:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-11 15:30:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-04-11 15:30:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 15:30:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-04-11 15:30:04,755 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-04-11 15:30:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:04,755 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-04-11 15:30:04,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-11 15:30:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-04-11 15:30:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-04-11 15:30:04,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:04,756 INFO L355 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:04,756 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1693944582, now seen corresponding path program 70 times [2018-04-11 15:30:04,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:04,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:04,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:04,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:04,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:04,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:06,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:06,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:30:06,188 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:30:06,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:06,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:06,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:06,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-04-11 15:30:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 15:30:06,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 15:30:06,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:30:06,253 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-04-11 15:30:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:07,965 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-04-11 15:30:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-11 15:30:07,965 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-04-11 15:30:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:07,966 INFO L225 Difference]: With dead ends: 368 [2018-04-11 15:30:07,966 INFO L226 Difference]: Without dead ends: 368 [2018-04-11 15:30:07,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-04-11 15:30:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-11 15:30:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-04-11 15:30:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-11 15:30:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-04-11 15:30:07,969 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-04-11 15:30:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:07,969 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-04-11 15:30:07,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 15:30:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-04-11 15:30:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-04-11 15:30:07,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:07,970 INFO L355 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:07,970 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1551159735, now seen corresponding path program 71 times [2018-04-11 15:30:07,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:07,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:07,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:07,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:07,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:07,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:09,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:09,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:09,468 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:30:09,501 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-11 15:30:09,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:09,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:11,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:11,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 144 [2018-04-11 15:30:11,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-04-11 15:30:11,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-04-11 15:30:11,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5327, Invalid=15553, Unknown=0, NotChecked=0, Total=20880 [2018-04-11 15:30:11,037 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 145 states. [2018-04-11 15:30:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:16,569 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-04-11 15:30:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 15:30:16,570 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 362 [2018-04-11 15:30:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:16,570 INFO L225 Difference]: With dead ends: 373 [2018-04-11 15:30:16,571 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 15:30:16,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16982 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8305, Invalid=38135, Unknown=0, NotChecked=0, Total=46440 [2018-04-11 15:30:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 15:30:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-04-11 15:30:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-04-11 15:30:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-04-11 15:30:16,574 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-04-11 15:30:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:16,575 INFO L459 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-04-11 15:30:16,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-04-11 15:30:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-04-11 15:30:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-04-11 15:30:16,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:16,576 INFO L355 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:16,576 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 744296870, now seen corresponding path program 72 times [2018-04-11 15:30:16,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:16,576 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:16,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:16,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:16,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:16,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:18,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:18,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:18,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:30:18,056 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-11 15:30:18,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:18,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:18,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:18,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 84 [2018-04-11 15:30:18,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-11 15:30:18,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-11 15:30:18,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=4364, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 15:30:18,377 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 85 states. [2018-04-11 15:30:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:21,027 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-04-11 15:30:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-11 15:30:21,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 367 [2018-04-11 15:30:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:21,029 INFO L225 Difference]: With dead ends: 378 [2018-04-11 15:30:21,029 INFO L226 Difference]: Without dead ends: 378 [2018-04-11 15:30:21,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8291, Invalid=16201, Unknown=0, NotChecked=0, Total=24492 [2018-04-11 15:30:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-11 15:30:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-04-11 15:30:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-11 15:30:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-04-11 15:30:21,031 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-04-11 15:30:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:21,032 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-04-11 15:30:21,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-11 15:30:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-04-11 15:30:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-11 15:30:21,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:21,033 INFO L355 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:21,033 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash 647655191, now seen corresponding path program 73 times [2018-04-11 15:30:21,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:21,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:21,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:21,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:21,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:21,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:22,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:22,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:22,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:22,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:22,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:22,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-04-11 15:30:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-11 15:30:22,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-11 15:30:22,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:30:22,687 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-04-11 15:30:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:24,462 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-04-11 15:30:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-11 15:30:24,462 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-04-11 15:30:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:24,463 INFO L225 Difference]: With dead ends: 383 [2018-04-11 15:30:24,463 INFO L226 Difference]: Without dead ends: 383 [2018-04-11 15:30:24,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-04-11 15:30:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-11 15:30:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-04-11 15:30:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-04-11 15:30:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-04-11 15:30:24,466 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-04-11 15:30:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:24,466 INFO L459 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-04-11 15:30:24,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-11 15:30:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-04-11 15:30:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-04-11 15:30:24,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:24,467 INFO L355 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:24,467 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:24,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2114113606, now seen corresponding path program 74 times [2018-04-11 15:30:24,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:24,467 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:24,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:24,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:30:24,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:24,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:26,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:26,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:30:26,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:30:26,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:26,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:26,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:26,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-04-11 15:30:26,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 15:30:26,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 15:30:26,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:30:26,186 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-04-11 15:30:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:28,170 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-04-11 15:30:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 15:30:28,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-04-11 15:30:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:28,172 INFO L225 Difference]: With dead ends: 388 [2018-04-11 15:30:28,172 INFO L226 Difference]: Without dead ends: 388 [2018-04-11 15:30:28,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-04-11 15:30:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-11 15:30:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-04-11 15:30:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-11 15:30:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-04-11 15:30:28,174 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-04-11 15:30:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:28,175 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-04-11 15:30:28,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 15:30:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-04-11 15:30:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-04-11 15:30:28,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:28,176 INFO L355 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:28,176 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1575146615, now seen corresponding path program 75 times [2018-04-11 15:30:28,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:28,176 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:28,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:28,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:28,177 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:28,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:29,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:29,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:29,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:30:29,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-11 15:30:29,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:29,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:29,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:29,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-04-11 15:30:29,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-11 15:30:29,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-11 15:30:29,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-04-11 15:30:29,975 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-04-11 15:30:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:31,852 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-04-11 15:30:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-11 15:30:31,852 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-04-11 15:30:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:31,853 INFO L225 Difference]: With dead ends: 393 [2018-04-11 15:30:31,853 INFO L226 Difference]: Without dead ends: 393 [2018-04-11 15:30:31,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-04-11 15:30:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-11 15:30:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-04-11 15:30:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-11 15:30:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-04-11 15:30:31,855 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-04-11 15:30:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:31,856 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-04-11 15:30:31,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-11 15:30:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-04-11 15:30:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-04-11 15:30:31,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:31,857 INFO L355 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:31,857 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1862088986, now seen corresponding path program 76 times [2018-04-11 15:30:31,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:31,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:31,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:31,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:31,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:31,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:33,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:33,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:30:33,510 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:30:33,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:33,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:33,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:33,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-04-11 15:30:33,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-11 15:30:33,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-11 15:30:33,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:30:33,592 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-04-11 15:30:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:35,917 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-04-11 15:30:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-11 15:30:35,917 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-04-11 15:30:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:35,918 INFO L225 Difference]: With dead ends: 398 [2018-04-11 15:30:35,918 INFO L226 Difference]: Without dead ends: 398 [2018-04-11 15:30:35,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-04-11 15:30:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-04-11 15:30:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-04-11 15:30:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 15:30:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-04-11 15:30:35,921 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-04-11 15:30:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:35,921 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-04-11 15:30:35,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-11 15:30:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-04-11 15:30:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-11 15:30:35,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:35,922 INFO L355 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:35,922 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 729022935, now seen corresponding path program 77 times [2018-04-11 15:30:35,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:35,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:35,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:35,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:35,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:35,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:30:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:37,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:30:37,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:30:37,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:30:37,757 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-11 15:30:37,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:30:37,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:30:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:30:39,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:30:39,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-04-11 15:30:39,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-04-11 15:30:39,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-04-11 15:30:39,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6239, Invalid=18253, Unknown=0, NotChecked=0, Total=24492 [2018-04-11 15:30:39,609 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 157 states. [2018-04-11 15:30:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:30:45,946 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-04-11 15:30:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-11 15:30:45,946 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 392 [2018-04-11 15:30:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:30:45,947 INFO L225 Difference]: With dead ends: 403 [2018-04-11 15:30:45,947 INFO L226 Difference]: Without dead ends: 403 [2018-04-11 15:30:45,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9700, Invalid=44822, Unknown=0, NotChecked=0, Total=54522 [2018-04-11 15:30:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-11 15:30:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-04-11 15:30:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-11 15:30:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-04-11 15:30:45,950 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-04-11 15:30:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:30:45,951 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-04-11 15:30:45,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-04-11 15:30:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-04-11 15:30:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-04-11 15:30:45,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:30:45,952 INFO L355 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-04-11 15:30:45,952 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-11 15:30:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash 66516358, now seen corresponding path program 78 times [2018-04-11 15:30:45,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:30:45,952 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:30:45,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:45,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:30:45,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:30:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:30:45,962 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-11 15:30:46,185 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-11 15:30:46,188 INFO L168 Benchmark]: Toolchain (without parser) took 178384.92 ms. Allocated memory was 399.5 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 336.9 MB in the beginning and 972.3 MB in the end (delta: -635.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-04-11 15:30:46,189 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:30:46,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.42 ms. Allocated memory is still 399.5 MB. Free memory was 336.2 MB in the beginning and 328.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:30:46,189 INFO L168 Benchmark]: Boogie Preprocessor took 18.68 ms. Allocated memory is still 399.5 MB. Free memory was 328.3 MB in the beginning and 325.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:30:46,189 INFO L168 Benchmark]: RCFGBuilder took 186.21 ms. Allocated memory was 399.5 MB in the beginning and 612.4 MB in the end (delta: 212.9 MB). Free memory was 325.7 MB in the beginning and 577.3 MB in the end (delta: -251.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:30:46,190 INFO L168 Benchmark]: TraceAbstraction took 178031.86 ms. Allocated memory was 612.4 MB in the beginning and 2.2 GB in the end (delta: 1.6 GB). Free memory was 577.3 MB in the beginning and 972.3 MB in the end (delta: -395.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-04-11 15:30:46,190 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.42 ms. Allocated memory is still 399.5 MB. Free memory was 336.2 MB in the beginning and 328.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.68 ms. Allocated memory is still 399.5 MB. Free memory was 328.3 MB in the beginning and 325.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 186.21 ms. Allocated memory was 399.5 MB in the beginning and 612.4 MB in the end (delta: 212.9 MB). Free memory was 325.7 MB in the beginning and 577.3 MB in the end (delta: -251.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 178031.86 ms. Allocated memory was 612.4 MB in the beginning and 2.2 GB in the end (delta: 1.6 GB). Free memory was 577.3 MB in the beginning and 972.3 MB in the end (delta: -395.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-30-46-195.csv Completed graceful shutdown