java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:51:30,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:51:30,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:51:30,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:51:30,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:51:30,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:51:30,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:51:30,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:51:30,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:51:30,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:51:30,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:51:30,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:51:30,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:51:30,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:51:30,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:51:30,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:51:30,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:51:30,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:51:30,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:51:30,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:51:30,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:51:30,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:51:30,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:51:30,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:51:30,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:51:30,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:51:30,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:51:30,449 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:51:30,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:51:30,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:51:30,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:51:30,450 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 15:51:30,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:51:30,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:51:30,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:51:30,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:51:30,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:51:30,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:51:30,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:51:30,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:51:30,469 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:51:30,470 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:51:30,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:51:30,506 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:51:30,508 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:51:30,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:51:30,510 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:51:30,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-04-10 15:51:30,864 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06b6e9b4d [2018-04-10 15:51:30,945 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:51:30,945 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:51:30,946 INFO L168 CDTParser]: Scanning standard_strcpy_original_false-valid-deref.i [2018-04-10 15:51:30,946 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:51:30,946 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:51:30,946 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:51:30,947 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in standard_strcpy_original_false-valid-deref.i [2018-04-10 15:51:30,947 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert ('__VERIFIER_assert') in standard_strcpy_original_false-valid-deref.i [2018-04-10 15:51:30,947 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:51:30,947 INFO L233 ultiparseSymbolTable]: [2018-04-10 15:51:30,981 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06b6e9b4d [2018-04-10 15:51:30,985 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:51:30,986 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:51:30,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:51:30,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:51:30,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:51:30,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:51:30" (1/1) ... [2018-04-10 15:51:30,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201e20c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:30, skipping insertion in model container [2018-04-10 15:51:30,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:51:30" (1/1) ... [2018-04-10 15:51:31,008 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:51:31,019 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:51:31,129 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:51:31,145 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:51:31,149 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 5 non ball SCCs. Number of states in SCCs 5. [2018-04-10 15:51:31,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31 WrapperNode [2018-04-10 15:51:31,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:51:31,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:51:31,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:51:31,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:51:31,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... [2018-04-10 15:51:31,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:51:31,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:51:31,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:51:31,179 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:51:31,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:51:31,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:51:31,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:51:31,220 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-10 15:51:31,220 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:51:31,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:51:31,220 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fstandard_strcpy_original_false_valid_deref_i____VERIFIER_assert [2018-04-10 15:51:31,220 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:51:31,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:51:31,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:51:31,360 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:51:31,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:51:31 BoogieIcfgContainer [2018-04-10 15:51:31,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:51:31,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:51:31,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:51:31,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:51:31,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:51:30" (1/3) ... [2018-04-10 15:51:31,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a81af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:51:31, skipping insertion in model container [2018-04-10 15:51:31,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:51:31" (2/3) ... [2018-04-10 15:51:31,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a81af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:51:31, skipping insertion in model container [2018-04-10 15:51:31,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:51:31" (3/3) ... [2018-04-10 15:51:31,365 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-04-10 15:51:31,371 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:51:31,375 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 15:51:31,397 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:51:31,398 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:51:31,398 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:51:31,398 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:51:31,398 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:51:31,398 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:51:31,398 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:51:31,398 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:51:31,398 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:51:31,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:51:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-04-10 15:51:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-04-10 15:51:31,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:31,412 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:31,412 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1734705512, now seen corresponding path program 1 times [2018-04-10 15:51:31,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:31,416 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:31,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:31,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:31,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:51:31,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:51:31,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:51:31,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:51:31,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:51:31,508 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-04-10 15:51:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:31,579 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-10 15:51:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:51:31,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-04-10 15:51:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:31,586 INFO L225 Difference]: With dead ends: 50 [2018-04-10 15:51:31,586 INFO L226 Difference]: Without dead ends: 41 [2018-04-10 15:51:31,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:51:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-10 15:51:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-04-10 15:51:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-10 15:51:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-04-10 15:51:31,611 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 7 [2018-04-10 15:51:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:31,611 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-04-10 15:51:31,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:51:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-04-10 15:51:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 15:51:31,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:31,612 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:31,612 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1166772373, now seen corresponding path program 1 times [2018-04-10 15:51:31,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:31,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:31,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:31,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:31,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:31,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:31,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:31,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-10 15:51:31,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:51:31,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:51:31,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:51:31,710 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2018-04-10 15:51:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:31,800 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-10 15:51:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:51:31,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 15:51:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:31,801 INFO L225 Difference]: With dead ends: 54 [2018-04-10 15:51:31,801 INFO L226 Difference]: Without dead ends: 54 [2018-04-10 15:51:31,802 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-10 15:51:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-10 15:51:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-04-10 15:51:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 15:51:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 15:51:31,808 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2018-04-10 15:51:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:31,808 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 15:51:31,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:51:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 15:51:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 15:51:31,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:31,810 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:31,810 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1914964600, now seen corresponding path program 2 times [2018-04-10 15:51:31,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:31,811 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:31,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:31,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:31,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:31,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:31,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:31,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:31,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:31,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:31,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:31,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-04-10 15:51:31,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:51:31,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:51:31,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:51:31,885 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-04-10 15:51:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:31,984 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-04-10 15:51:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:51:31,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 15:51:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:31,986 INFO L225 Difference]: With dead ends: 67 [2018-04-10 15:51:31,986 INFO L226 Difference]: Without dead ends: 67 [2018-04-10 15:51:31,987 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-10 15:51:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-10 15:51:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-04-10 15:51:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-10 15:51:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-10 15:51:31,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 17 [2018-04-10 15:51:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:31,994 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-10 15:51:31,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:51:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-10 15:51:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 15:51:31,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:31,995 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:31,995 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -510089099, now seen corresponding path program 3 times [2018-04-10 15:51:31,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:31,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:31,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:31,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:31,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:32,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:32,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:32,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:32,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 15:51:32,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:32,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:32,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-10 15:51:32,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:51:32,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:51:32,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:51:32,058 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2018-04-10 15:51:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:32,185 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-04-10 15:51:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:51:32,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-04-10 15:51:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:32,186 INFO L225 Difference]: With dead ends: 80 [2018-04-10 15:51:32,187 INFO L226 Difference]: Without dead ends: 80 [2018-04-10 15:51:32,187 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-10 15:51:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-10 15:51:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-04-10 15:51:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-10 15:51:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-10 15:51:32,193 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 22 [2018-04-10 15:51:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:32,193 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-10 15:51:32,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:51:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-10 15:51:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 15:51:32,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:32,194 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:32,194 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -697843288, now seen corresponding path program 4 times [2018-04-10 15:51:32,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:32,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:32,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:32,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:32,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:32,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:32,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:32,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:32,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:32,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-10 15:51:32,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:51:32,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:51:32,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:51:32,292 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 7 states. [2018-04-10 15:51:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:32,469 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-04-10 15:51:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:51:32,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-10 15:51:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:32,470 INFO L225 Difference]: With dead ends: 93 [2018-04-10 15:51:32,470 INFO L226 Difference]: Without dead ends: 93 [2018-04-10 15:51:32,471 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-10 15:51:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-10 15:51:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-04-10 15:51:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-10 15:51:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-10 15:51:32,475 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 27 [2018-04-10 15:51:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:32,475 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-10 15:51:32,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:51:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-10 15:51:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:51:32,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:32,476 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:32,476 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1960349611, now seen corresponding path program 5 times [2018-04-10 15:51:32,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:32,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:32,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:32,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:32,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:32,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:32,537 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:32,548 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-10 15:51:32,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:32,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:32,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-04-10 15:51:32,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:51:32,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:51:32,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:51:32,597 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 14 states. [2018-04-10 15:51:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:32,848 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-04-10 15:51:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:51:32,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-10 15:51:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:32,850 INFO L225 Difference]: With dead ends: 106 [2018-04-10 15:51:32,850 INFO L226 Difference]: Without dead ends: 106 [2018-04-10 15:51:32,850 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-10 15:51:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-10 15:51:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2018-04-10 15:51:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-10 15:51:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-04-10 15:51:32,855 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 32 [2018-04-10 15:51:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:32,856 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-04-10 15:51:32,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:51:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-04-10 15:51:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 15:51:32,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:32,857 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:32,857 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash 138077640, now seen corresponding path program 6 times [2018-04-10 15:51:32,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:32,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:32,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:32,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:32,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:32,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:32,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:32,925 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-10 15:51:32,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:32,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:32,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:32,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-10 15:51:32,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:51:32,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:51:32,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:51:32,956 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 13 states. [2018-04-10 15:51:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:33,116 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2018-04-10 15:51:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:51:33,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-04-10 15:51:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:33,117 INFO L225 Difference]: With dead ends: 119 [2018-04-10 15:51:33,117 INFO L226 Difference]: Without dead ends: 119 [2018-04-10 15:51:33,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:51:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-10 15:51:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2018-04-10 15:51:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-10 15:51:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-04-10 15:51:33,122 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 37 [2018-04-10 15:51:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:33,122 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-04-10 15:51:33,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:51:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-04-10 15:51:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 15:51:33,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:33,123 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:33,123 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 709222453, now seen corresponding path program 7 times [2018-04-10 15:51:33,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:33,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:33,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:33,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:33,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:33,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:33,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:33,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:33,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:33,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:33,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:51:33,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:51:33,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:51:33,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:51:33,204 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 11 states. [2018-04-10 15:51:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:33,360 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-04-10 15:51:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:51:33,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-04-10 15:51:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:33,361 INFO L225 Difference]: With dead ends: 132 [2018-04-10 15:51:33,361 INFO L226 Difference]: Without dead ends: 132 [2018-04-10 15:51:33,362 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-10 15:51:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-10 15:51:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-04-10 15:51:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-10 15:51:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-04-10 15:51:33,366 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2018-04-10 15:51:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:33,366 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-04-10 15:51:33,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:51:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-04-10 15:51:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 15:51:33,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:33,368 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:33,370 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 336028136, now seen corresponding path program 8 times [2018-04-10 15:51:33,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:33,370 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:33,371 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:33,371 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:33,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:33,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:33,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:33,468 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:33,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:33,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:33,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:33,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 15:51:33,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:51:33,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:51:33,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:51:33,486 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 11 states. [2018-04-10 15:51:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:33,883 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2018-04-10 15:51:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:51:33,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-10 15:51:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:33,884 INFO L225 Difference]: With dead ends: 145 [2018-04-10 15:51:33,884 INFO L226 Difference]: Without dead ends: 145 [2018-04-10 15:51:33,884 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-10 15:51:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-10 15:51:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2018-04-10 15:51:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 15:51:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2018-04-10 15:51:33,889 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 47 [2018-04-10 15:51:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:33,890 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2018-04-10 15:51:33,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:51:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2018-04-10 15:51:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 15:51:33,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:33,891 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:33,891 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1837234197, now seen corresponding path program 9 times [2018-04-10 15:51:33,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:33,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:33,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:33,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:33,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:33,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:33,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:33,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:34,007 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-10 15:51:34,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:34,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:34,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:34,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-10 15:51:34,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:51:34,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:51:34,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:51:34,072 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 23 states. [2018-04-10 15:51:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:34,520 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2018-04-10 15:51:34,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:51:34,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-10 15:51:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:34,521 INFO L225 Difference]: With dead ends: 158 [2018-04-10 15:51:34,521 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 15:51:34,522 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-10 15:51:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 15:51:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2018-04-10 15:51:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 15:51:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2018-04-10 15:51:34,527 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 52 [2018-04-10 15:51:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:34,527 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2018-04-10 15:51:34,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:51:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-04-10 15:51:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 15:51:34,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:34,529 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:34,529 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash 872363528, now seen corresponding path program 10 times [2018-04-10 15:51:34,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:34,529 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:34,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:34,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:34,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:34,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:34,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:34,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:34,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:34,666 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:34,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:34,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:34,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:34,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-04-10 15:51:34,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:51:34,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:51:34,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:51:34,680 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 14 states. [2018-04-10 15:51:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:34,924 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-04-10 15:51:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:51:34,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-04-10 15:51:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:34,925 INFO L225 Difference]: With dead ends: 171 [2018-04-10 15:51:34,925 INFO L226 Difference]: Without dead ends: 171 [2018-04-10 15:51:34,926 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-10 15:51:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-10 15:51:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2018-04-10 15:51:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 15:51:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-04-10 15:51:34,929 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 57 [2018-04-10 15:51:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:34,929 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-04-10 15:51:34,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:51:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-04-10 15:51:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 15:51:34,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:34,930 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:34,930 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1444300811, now seen corresponding path program 11 times [2018-04-10 15:51:34,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:34,931 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:34,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:34,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:34,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:34,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:35,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:35,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:35,006 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:35,018 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-10 15:51:35,018 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:35,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:35,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:35,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-04-10 15:51:35,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:51:35,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:51:35,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:51:35,160 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 26 states. [2018-04-10 15:51:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:35,809 INFO L93 Difference]: Finished difference Result 184 states and 209 transitions. [2018-04-10 15:51:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:51:35,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-04-10 15:51:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:35,810 INFO L225 Difference]: With dead ends: 184 [2018-04-10 15:51:35,810 INFO L226 Difference]: Without dead ends: 184 [2018-04-10 15:51:35,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:51:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-10 15:51:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-04-10 15:51:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-10 15:51:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2018-04-10 15:51:35,815 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 62 [2018-04-10 15:51:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:35,815 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2018-04-10 15:51:35,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:51:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2018-04-10 15:51:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 15:51:35,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:35,817 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:35,817 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 198468136, now seen corresponding path program 12 times [2018-04-10 15:51:35,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:35,817 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:35,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:35,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:35,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:35,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:35,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:35,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:35,930 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:35,940 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-10 15:51:35,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:35,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:36,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:36,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-04-10 15:51:36,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:51:36,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:51:36,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:51:36,026 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand 29 states. [2018-04-10 15:51:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:36,376 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-04-10 15:51:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:51:36,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-04-10 15:51:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:36,377 INFO L225 Difference]: With dead ends: 197 [2018-04-10 15:51:36,377 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 15:51:36,378 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-10 15:51:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 15:51:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 182. [2018-04-10 15:51:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 15:51:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2018-04-10 15:51:36,382 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 67 [2018-04-10 15:51:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:36,382 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2018-04-10 15:51:36,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:51:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2018-04-10 15:51:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-10 15:51:36,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:36,383 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:36,383 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1156898859, now seen corresponding path program 13 times [2018-04-10 15:51:36,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:36,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:36,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:36,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:36,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:36,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:36,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:36,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:36,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:36,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:36,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:36,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-04-10 15:51:36,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:51:36,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:51:36,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:51:36,524 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 17 states. [2018-04-10 15:51:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:36,757 INFO L93 Difference]: Finished difference Result 210 states and 239 transitions. [2018-04-10 15:51:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:51:36,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-04-10 15:51:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:36,758 INFO L225 Difference]: With dead ends: 210 [2018-04-10 15:51:36,758 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 15:51:36,758 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-10 15:51:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 15:51:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 194. [2018-04-10 15:51:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 15:51:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-04-10 15:51:36,762 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 72 [2018-04-10 15:51:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:36,762 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-04-10 15:51:36,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:51:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-04-10 15:51:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 15:51:36,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:36,763 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:36,763 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -927406520, now seen corresponding path program 14 times [2018-04-10 15:51:36,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:36,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:36,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:36,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:36,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:36,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:36,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:36,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:36,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:36,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:36,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:36,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-04-10 15:51:36,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:51:36,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:51:36,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:51:36,915 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 18 states. [2018-04-10 15:51:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:37,250 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-04-10 15:51:37,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:51:37,250 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-04-10 15:51:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:37,251 INFO L225 Difference]: With dead ends: 223 [2018-04-10 15:51:37,251 INFO L226 Difference]: Without dead ends: 223 [2018-04-10 15:51:37,251 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-10 15:51:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-10 15:51:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2018-04-10 15:51:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-10 15:51:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2018-04-10 15:51:37,254 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 77 [2018-04-10 15:51:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:37,254 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2018-04-10 15:51:37,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:51:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2018-04-10 15:51:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-10 15:51:37,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:37,255 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:37,255 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -487313483, now seen corresponding path program 15 times [2018-04-10 15:51:37,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:37,255 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:37,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:37,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:37,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:37,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:37,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:37,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:37,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:37,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-10 15:51:37,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:37,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:37,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:37,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-04-10 15:51:37,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:51:37,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:51:37,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:51:37,458 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand 35 states. [2018-04-10 15:51:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:38,336 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2018-04-10 15:51:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:51:38,336 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-10 15:51:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:38,337 INFO L225 Difference]: With dead ends: 236 [2018-04-10 15:51:38,337 INFO L226 Difference]: Without dead ends: 236 [2018-04-10 15:51:38,338 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-10 15:51:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-10 15:51:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-10 15:51:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-10 15:51:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 250 transitions. [2018-04-10 15:51:38,341 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 250 transitions. Word has length 82 [2018-04-10 15:51:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:38,341 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 250 transitions. [2018-04-10 15:51:38,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:51:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 250 transitions. [2018-04-10 15:51:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-10 15:51:38,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:38,342 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:38,342 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1096729192, now seen corresponding path program 16 times [2018-04-10 15:51:38,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:38,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:38,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:38,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:38,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:38,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:38,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:38,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:38,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:38,506 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:38,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:38,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:38,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:38,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-10 15:51:38,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:51:38,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:51:38,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:51:38,529 INFO L87 Difference]: Start difference. First operand 218 states and 250 transitions. Second operand 19 states. [2018-04-10 15:51:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:39,432 INFO L93 Difference]: Finished difference Result 249 states and 284 transitions. [2018-04-10 15:51:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:51:39,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-04-10 15:51:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:39,433 INFO L225 Difference]: With dead ends: 249 [2018-04-10 15:51:39,433 INFO L226 Difference]: Without dead ends: 249 [2018-04-10 15:51:39,433 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-10 15:51:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-10 15:51:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 230. [2018-04-10 15:51:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 15:51:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 264 transitions. [2018-04-10 15:51:39,436 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 264 transitions. Word has length 87 [2018-04-10 15:51:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:39,436 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 264 transitions. [2018-04-10 15:51:39,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:51:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 264 transitions. [2018-04-10 15:51:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-10 15:51:39,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:39,437 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:39,437 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1439504491, now seen corresponding path program 17 times [2018-04-10 15:51:39,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:39,437 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:39,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:39,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:39,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:39,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:39,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:39,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:39,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:39,564 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-10 15:51:39,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:39,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:39,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:39,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2018-04-10 15:51:39,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:51:39,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:51:39,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:51:39,733 INFO L87 Difference]: Start difference. First operand 230 states and 264 transitions. Second operand 38 states. [2018-04-10 15:51:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:40,691 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2018-04-10 15:51:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:51:40,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-04-10 15:51:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:40,693 INFO L225 Difference]: With dead ends: 262 [2018-04-10 15:51:40,693 INFO L226 Difference]: Without dead ends: 262 [2018-04-10 15:51:40,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:51:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-10 15:51:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2018-04-10 15:51:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 15:51:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-04-10 15:51:40,698 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 92 [2018-04-10 15:51:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:40,698 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-04-10 15:51:40,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:51:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-04-10 15:51:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-10 15:51:40,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:40,699 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:40,700 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 368572040, now seen corresponding path program 18 times [2018-04-10 15:51:40,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:40,700 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:40,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:40,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:40,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:40,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:40,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:40,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:40,928 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-10 15:51:40,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:40,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:41,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:41,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-10 15:51:41,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:51:41,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:51:41,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:51:41,102 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 41 states. [2018-04-10 15:51:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:42,514 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2018-04-10 15:51:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:51:42,514 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-04-10 15:51:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:42,515 INFO L225 Difference]: With dead ends: 275 [2018-04-10 15:51:42,515 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 15:51:42,516 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-10 15:51:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 15:51:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2018-04-10 15:51:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-10 15:51:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2018-04-10 15:51:42,528 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 97 [2018-04-10 15:51:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:42,529 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2018-04-10 15:51:42,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:51:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2018-04-10 15:51:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-04-10 15:51:42,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:42,530 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:42,530 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1076541579, now seen corresponding path program 19 times [2018-04-10 15:51:42,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:42,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:42,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:42,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:42,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:42,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:42,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:42,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:42,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:42,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:42,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:42,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-04-10 15:51:42,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:51:42,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:51:42,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:51:42,754 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 23 states. [2018-04-10 15:51:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:43,369 INFO L93 Difference]: Finished difference Result 288 states and 329 transitions. [2018-04-10 15:51:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:51:43,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-04-10 15:51:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:43,370 INFO L225 Difference]: With dead ends: 288 [2018-04-10 15:51:43,371 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 15:51:43,371 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-10 15:51:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 15:51:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2018-04-10 15:51:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 15:51:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-10 15:51:43,374 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 102 [2018-04-10 15:51:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:43,375 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-10 15:51:43,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:51:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-10 15:51:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-04-10 15:51:43,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:43,376 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:43,376 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash -801733976, now seen corresponding path program 20 times [2018-04-10 15:51:43,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:43,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:43,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:43,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:43,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:43,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:43,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:43,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:43,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:43,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:43,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:43,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:43,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-04-10 15:51:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:51:43,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:51:43,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:51:43,592 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 24 states. [2018-04-10 15:51:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:44,172 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2018-04-10 15:51:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:51:44,173 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-04-10 15:51:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:44,173 INFO L225 Difference]: With dead ends: 301 [2018-04-10 15:51:44,173 INFO L226 Difference]: Without dead ends: 301 [2018-04-10 15:51:44,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:51:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-10 15:51:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 278. [2018-04-10 15:51:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-10 15:51:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 320 transitions. [2018-04-10 15:51:44,177 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 320 transitions. Word has length 107 [2018-04-10 15:51:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:44,177 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 320 transitions. [2018-04-10 15:51:44,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:51:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 320 transitions. [2018-04-10 15:51:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-04-10 15:51:44,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:44,178 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:44,178 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -647409835, now seen corresponding path program 21 times [2018-04-10 15:51:44,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:44,179 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:44,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:44,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:44,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:44,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:44,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:44,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:44,459 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-10 15:51:44,459 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:44,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:44,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:44,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-04-10 15:51:44,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:51:44,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:51:44,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:51:44,480 INFO L87 Difference]: Start difference. First operand 278 states and 320 transitions. Second operand 25 states. [2018-04-10 15:51:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:45,019 INFO L93 Difference]: Finished difference Result 314 states and 359 transitions. [2018-04-10 15:51:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:51:45,021 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-04-10 15:51:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:45,023 INFO L225 Difference]: With dead ends: 314 [2018-04-10 15:51:45,023 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 15:51:45,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:51:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 15:51:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 290. [2018-04-10 15:51:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-10 15:51:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2018-04-10 15:51:45,030 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 112 [2018-04-10 15:51:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:45,033 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2018-04-10 15:51:45,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:51:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2018-04-10 15:51:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-04-10 15:51:45,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:45,034 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:45,034 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash 55338696, now seen corresponding path program 22 times [2018-04-10 15:51:45,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:45,035 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:45,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:45,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:45,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:45,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:45,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:45,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:45,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:45,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:45,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:45,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:45,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:45,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-04-10 15:51:45,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:51:45,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:51:45,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:51:45,319 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand 26 states. [2018-04-10 15:51:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:45,905 INFO L93 Difference]: Finished difference Result 327 states and 374 transitions. [2018-04-10 15:51:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:51:45,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-04-10 15:51:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:45,907 INFO L225 Difference]: With dead ends: 327 [2018-04-10 15:51:45,907 INFO L226 Difference]: Without dead ends: 327 [2018-04-10 15:51:45,907 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-10 15:51:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-10 15:51:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-10 15:51:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-10 15:51:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 348 transitions. [2018-04-10 15:51:45,912 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 348 transitions. Word has length 117 [2018-04-10 15:51:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:45,912 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 348 transitions. [2018-04-10 15:51:45,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:51:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 348 transitions. [2018-04-10 15:51:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-04-10 15:51:45,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:45,913 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:45,913 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1828913355, now seen corresponding path program 23 times [2018-04-10 15:51:45,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:45,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:45,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:45,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:45,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:45,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:46,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:46,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:46,143 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-10 15:51:46,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:46,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:46,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:46,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2018-04-10 15:51:46,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:51:46,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:51:46,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:51:46,389 INFO L87 Difference]: Start difference. First operand 302 states and 348 transitions. Second operand 50 states. [2018-04-10 15:51:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:48,648 INFO L93 Difference]: Finished difference Result 340 states and 389 transitions. [2018-04-10 15:51:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:51:48,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-04-10 15:51:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:48,649 INFO L225 Difference]: With dead ends: 340 [2018-04-10 15:51:48,649 INFO L226 Difference]: Without dead ends: 340 [2018-04-10 15:51:48,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:51:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-10 15:51:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2018-04-10 15:51:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-10 15:51:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-04-10 15:51:48,654 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 122 [2018-04-10 15:51:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:48,655 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-04-10 15:51:48,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:51:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-04-10 15:51:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-04-10 15:51:48,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:48,656 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:48,656 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1810604776, now seen corresponding path program 24 times [2018-04-10 15:51:48,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:48,656 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:48,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:48,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:48,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:48,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:48,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:48,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:48,942 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:51:48,952 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-10 15:51:48,952 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:48,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:49,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:49,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-04-10 15:51:49,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:51:49,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:51:49,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:51:49,205 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 37 states. [2018-04-10 15:51:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:50,178 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2018-04-10 15:51:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:51:50,178 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-04-10 15:51:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:50,179 INFO L225 Difference]: With dead ends: 353 [2018-04-10 15:51:50,179 INFO L226 Difference]: Without dead ends: 353 [2018-04-10 15:51:50,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:51:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-10 15:51:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 326. [2018-04-10 15:51:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-10 15:51:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 376 transitions. [2018-04-10 15:51:50,183 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 376 transitions. Word has length 127 [2018-04-10 15:51:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:50,183 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 376 transitions. [2018-04-10 15:51:50,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:51:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 376 transitions. [2018-04-10 15:51:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-10 15:51:50,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:50,183 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:50,184 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1327388437, now seen corresponding path program 25 times [2018-04-10 15:51:50,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:50,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:50,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:50,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:50,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:50,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:50,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:50,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:50,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:50,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:50,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-10 15:51:50,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:51:50,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:51:50,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:51:50,465 INFO L87 Difference]: Start difference. First operand 326 states and 376 transitions. Second operand 29 states. [2018-04-10 15:51:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:51,134 INFO L93 Difference]: Finished difference Result 366 states and 419 transitions. [2018-04-10 15:51:51,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:51:51,134 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-04-10 15:51:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:51,135 INFO L225 Difference]: With dead ends: 366 [2018-04-10 15:51:51,136 INFO L226 Difference]: Without dead ends: 366 [2018-04-10 15:51:51,136 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-10 15:51:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-10 15:51:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2018-04-10 15:51:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-10 15:51:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 390 transitions. [2018-04-10 15:51:51,144 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 390 transitions. Word has length 132 [2018-04-10 15:51:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:51,145 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 390 transitions. [2018-04-10 15:51:51,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:51:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 390 transitions. [2018-04-10 15:51:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 15:51:51,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:51,146 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:51,146 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 273037064, now seen corresponding path program 26 times [2018-04-10 15:51:51,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:51,147 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:51,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:51:51,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:51,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:51,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:51,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:51,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:51:51,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:51:51,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:51,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:51,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:51,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-04-10 15:51:51,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:51:51,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:51:51,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:51:51,449 INFO L87 Difference]: Start difference. First operand 338 states and 390 transitions. Second operand 30 states. [2018-04-10 15:51:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:52,178 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-10 15:51:52,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:51:52,178 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-04-10 15:51:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:52,180 INFO L225 Difference]: With dead ends: 379 [2018-04-10 15:51:52,180 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 15:51:52,180 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:51:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 15:51:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2018-04-10 15:51:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-10 15:51:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 404 transitions. [2018-04-10 15:51:52,184 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 404 transitions. Word has length 137 [2018-04-10 15:51:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:52,184 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 404 transitions. [2018-04-10 15:51:52,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:51:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 404 transitions. [2018-04-10 15:51:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-10 15:51:52,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:52,185 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:52,185 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 383473397, now seen corresponding path program 27 times [2018-04-10 15:51:52,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:52,185 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:52,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:52,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:52,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:52,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:52,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:52,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:52,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:51:52,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-10 15:51:52,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:52,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:52,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:52,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-10 15:51:52,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 15:51:52,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 15:51:52,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:51:52,532 INFO L87 Difference]: Start difference. First operand 350 states and 404 transitions. Second operand 31 states. [2018-04-10 15:51:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:53,348 INFO L93 Difference]: Finished difference Result 392 states and 449 transitions. [2018-04-10 15:51:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:51:53,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-04-10 15:51:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:53,350 INFO L225 Difference]: With dead ends: 392 [2018-04-10 15:51:53,350 INFO L226 Difference]: Without dead ends: 392 [2018-04-10 15:51:53,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:51:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-10 15:51:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2018-04-10 15:51:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-10 15:51:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 418 transitions. [2018-04-10 15:51:53,353 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 418 transitions. Word has length 142 [2018-04-10 15:51:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:53,354 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 418 transitions. [2018-04-10 15:51:53,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 15:51:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 418 transitions. [2018-04-10 15:51:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-04-10 15:51:53,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:53,355 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:53,355 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1611539240, now seen corresponding path program 28 times [2018-04-10 15:51:53,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:53,355 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:53,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:53,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:53,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:53,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:53,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:53,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:53,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:51:53,706 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:51:53,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:53,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:54,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:54,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-04-10 15:51:54,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:51:54,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:51:54,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:51:54,030 INFO L87 Difference]: Start difference. First operand 362 states and 418 transitions. Second operand 61 states. [2018-04-10 15:51:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:56,322 INFO L93 Difference]: Finished difference Result 405 states and 464 transitions. [2018-04-10 15:51:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:51:56,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-04-10 15:51:56,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:56,323 INFO L225 Difference]: With dead ends: 405 [2018-04-10 15:51:56,323 INFO L226 Difference]: Without dead ends: 405 [2018-04-10 15:51:56,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:51:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-10 15:51:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2018-04-10 15:51:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-10 15:51:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 432 transitions. [2018-04-10 15:51:56,329 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 432 transitions. Word has length 147 [2018-04-10 15:51:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:56,329 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 432 transitions. [2018-04-10 15:51:56,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:51:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 432 transitions. [2018-04-10 15:51:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-04-10 15:51:56,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:56,331 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:56,331 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2042756821, now seen corresponding path program 29 times [2018-04-10 15:51:56,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:56,331 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:56,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:56,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:56,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:56,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:51:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:56,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:51:56,636 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:51:56,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:51:56,649 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-10 15:51:56,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:51:56,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:51:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:51:57,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:51:57,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-04-10 15:51:57,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 15:51:57,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 15:51:57,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 15:51:57,001 INFO L87 Difference]: Start difference. First operand 374 states and 432 transitions. Second operand 62 states. [2018-04-10 15:51:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:51:59,723 INFO L93 Difference]: Finished difference Result 418 states and 479 transitions. [2018-04-10 15:51:59,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:51:59,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-04-10 15:51:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:51:59,725 INFO L225 Difference]: With dead ends: 418 [2018-04-10 15:51:59,725 INFO L226 Difference]: Without dead ends: 418 [2018-04-10 15:51:59,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:51:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-10 15:51:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 386. [2018-04-10 15:51:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-04-10 15:51:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 446 transitions. [2018-04-10 15:51:59,729 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 446 transitions. Word has length 152 [2018-04-10 15:51:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:51:59,729 INFO L459 AbstractCegarLoop]: Abstraction has 386 states and 446 transitions. [2018-04-10 15:51:59,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 15:51:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 446 transitions. [2018-04-10 15:51:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-04-10 15:51:59,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:51:59,730 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-04-10 15:51:59,730 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:51:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1416980296, now seen corresponding path program 30 times [2018-04-10 15:51:59,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:51:59,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:51:59,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:59,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:51:59,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:51:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:51:59,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:00,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:00,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:52:00,151 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-10 15:52:00,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:00,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:00,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:00,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-04-10 15:52:00,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:52:00,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:52:00,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:52:00,225 INFO L87 Difference]: Start difference. First operand 386 states and 446 transitions. Second operand 37 states. [2018-04-10 15:52:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:01,050 INFO L93 Difference]: Finished difference Result 431 states and 494 transitions. [2018-04-10 15:52:01,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:52:01,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-04-10 15:52:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:01,052 INFO L225 Difference]: With dead ends: 431 [2018-04-10 15:52:01,052 INFO L226 Difference]: Without dead ends: 431 [2018-04-10 15:52:01,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:52:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-10 15:52:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 398. [2018-04-10 15:52:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-10 15:52:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2018-04-10 15:52:01,057 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 157 [2018-04-10 15:52:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:01,057 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2018-04-10 15:52:01,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:52:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2018-04-10 15:52:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-10 15:52:01,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:01,059 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:01,059 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1843416757, now seen corresponding path program 31 times [2018-04-10 15:52:01,059 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:01,059 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:01,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:01,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:01,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:01,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:01,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:01,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:01,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:01,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:01,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:01,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:52:01,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:52:01,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:52:01,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:52:01,711 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand 35 states. [2018-04-10 15:52:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:02,722 INFO L93 Difference]: Finished difference Result 444 states and 509 transitions. [2018-04-10 15:52:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:52:02,722 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-04-10 15:52:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:02,724 INFO L225 Difference]: With dead ends: 444 [2018-04-10 15:52:02,724 INFO L226 Difference]: Without dead ends: 444 [2018-04-10 15:52:02,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:52:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-10 15:52:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2018-04-10 15:52:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-10 15:52:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 474 transitions. [2018-04-10 15:52:02,728 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 474 transitions. Word has length 162 [2018-04-10 15:52:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:02,729 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 474 transitions. [2018-04-10 15:52:02,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:52:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 474 transitions. [2018-04-10 15:52:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-04-10 15:52:02,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:02,730 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:02,730 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1876032664, now seen corresponding path program 32 times [2018-04-10 15:52:02,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:02,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:02,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:02,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:02,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:03,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:03,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:03,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:52:03,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:52:03,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:03,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:03,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:03,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-10 15:52:03,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:52:03,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:52:03,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:52:03,253 INFO L87 Difference]: Start difference. First operand 410 states and 474 transitions. Second operand 35 states. [2018-04-10 15:52:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:06,578 INFO L93 Difference]: Finished difference Result 457 states and 524 transitions. [2018-04-10 15:52:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:52:06,578 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-04-10 15:52:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:06,579 INFO L225 Difference]: With dead ends: 457 [2018-04-10 15:52:06,579 INFO L226 Difference]: Without dead ends: 457 [2018-04-10 15:52:06,579 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-10 15:52:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-10 15:52:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-04-10 15:52:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-10 15:52:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 488 transitions. [2018-04-10 15:52:06,582 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 488 transitions. Word has length 167 [2018-04-10 15:52:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:06,583 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 488 transitions. [2018-04-10 15:52:06,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:52:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 488 transitions. [2018-04-10 15:52:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 15:52:06,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:06,584 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:06,584 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash 801392277, now seen corresponding path program 33 times [2018-04-10 15:52:06,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:06,584 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:06,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:06,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:06,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:06,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:06,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:06,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:06,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:52:07,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-10 15:52:07,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:07,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:07,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:07,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-10 15:52:07,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:52:07,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:52:07,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:52:07,034 INFO L87 Difference]: Start difference. First operand 422 states and 488 transitions. Second operand 37 states. [2018-04-10 15:52:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:07,913 INFO L93 Difference]: Finished difference Result 470 states and 539 transitions. [2018-04-10 15:52:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:52:07,913 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-04-10 15:52:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:07,914 INFO L225 Difference]: With dead ends: 470 [2018-04-10 15:52:07,914 INFO L226 Difference]: Without dead ends: 470 [2018-04-10 15:52:07,914 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-10 15:52:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-10 15:52:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2018-04-10 15:52:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 15:52:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-04-10 15:52:07,918 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 172 [2018-04-10 15:52:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:07,918 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-04-10 15:52:07,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:52:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-04-10 15:52:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-10 15:52:07,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:07,919 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:07,919 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2137651080, now seen corresponding path program 34 times [2018-04-10 15:52:07,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:07,920 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:07,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:07,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:07,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:07,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:08,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:08,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:08,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:52:08,452 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:52:08,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:08,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:08,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:08,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-04-10 15:52:08,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:52:08,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:52:08,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:52:08,493 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 38 states. [2018-04-10 15:52:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:09,517 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2018-04-10 15:52:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:52:09,517 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-04-10 15:52:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:09,518 INFO L225 Difference]: With dead ends: 483 [2018-04-10 15:52:09,518 INFO L226 Difference]: Without dead ends: 483 [2018-04-10 15:52:09,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:52:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-10 15:52:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 446. [2018-04-10 15:52:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-10 15:52:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 516 transitions. [2018-04-10 15:52:09,522 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 516 transitions. Word has length 177 [2018-04-10 15:52:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:09,522 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 516 transitions. [2018-04-10 15:52:09,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:52:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 516 transitions. [2018-04-10 15:52:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-04-10 15:52:09,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:09,523 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:09,523 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 578545269, now seen corresponding path program 35 times [2018-04-10 15:52:09,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:09,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:09,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:09,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:09,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:09,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:10,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:10,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:52:10,099 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-10 15:52:10,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:10,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:10,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:10,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 73 [2018-04-10 15:52:10,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 15:52:10,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 15:52:10,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:52:10,710 INFO L87 Difference]: Start difference. First operand 446 states and 516 transitions. Second operand 74 states. [2018-04-10 15:52:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:16,127 INFO L93 Difference]: Finished difference Result 496 states and 569 transitions. [2018-04-10 15:52:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:52:16,128 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-04-10 15:52:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:16,129 INFO L225 Difference]: With dead ends: 496 [2018-04-10 15:52:16,129 INFO L226 Difference]: Without dead ends: 496 [2018-04-10 15:52:16,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:52:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-04-10 15:52:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 458. [2018-04-10 15:52:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-10 15:52:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 530 transitions. [2018-04-10 15:52:16,133 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 530 transitions. Word has length 182 [2018-04-10 15:52:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:16,133 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 530 transitions. [2018-04-10 15:52:16,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 15:52:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 530 transitions. [2018-04-10 15:52:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-04-10 15:52:16,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:16,134 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:16,134 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2010858408, now seen corresponding path program 36 times [2018-04-10 15:52:16,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:16,135 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:16,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:16,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:16,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:16,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:16,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:16,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:52:16,626 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-10 15:52:16,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:16,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:16,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:16,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-04-10 15:52:16,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 15:52:16,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 15:52:16,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:52:16,755 INFO L87 Difference]: Start difference. First operand 458 states and 530 transitions. Second operand 45 states. [2018-04-10 15:52:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:18,023 INFO L93 Difference]: Finished difference Result 509 states and 584 transitions. [2018-04-10 15:52:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:52:18,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-04-10 15:52:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:18,024 INFO L225 Difference]: With dead ends: 509 [2018-04-10 15:52:18,024 INFO L226 Difference]: Without dead ends: 509 [2018-04-10 15:52:18,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:52:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-04-10 15:52:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 470. [2018-04-10 15:52:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-04-10 15:52:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 544 transitions. [2018-04-10 15:52:18,029 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 544 transitions. Word has length 187 [2018-04-10 15:52:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:18,029 INFO L459 AbstractCegarLoop]: Abstraction has 470 states and 544 transitions. [2018-04-10 15:52:18,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 15:52:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 544 transitions. [2018-04-10 15:52:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-04-10 15:52:18,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:18,030 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:18,030 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:18,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1349177771, now seen corresponding path program 37 times [2018-04-10 15:52:18,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:18,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:18,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:18,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:18,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:18,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:18,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:18,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:18,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:18,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:18,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:18,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-10 15:52:18,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:52:18,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:52:18,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:52:18,505 INFO L87 Difference]: Start difference. First operand 470 states and 544 transitions. Second operand 41 states. [2018-04-10 15:52:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:19,494 INFO L93 Difference]: Finished difference Result 522 states and 599 transitions. [2018-04-10 15:52:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:52:19,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-04-10 15:52:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:19,496 INFO L225 Difference]: With dead ends: 522 [2018-04-10 15:52:19,496 INFO L226 Difference]: Without dead ends: 522 [2018-04-10 15:52:19,496 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-10 15:52:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-04-10 15:52:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2018-04-10 15:52:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-04-10 15:52:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 558 transitions. [2018-04-10 15:52:19,499 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 558 transitions. Word has length 192 [2018-04-10 15:52:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:19,499 INFO L459 AbstractCegarLoop]: Abstraction has 482 states and 558 transitions. [2018-04-10 15:52:19,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:52:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 558 transitions. [2018-04-10 15:52:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-10 15:52:19,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:19,501 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:19,501 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash -659298360, now seen corresponding path program 38 times [2018-04-10 15:52:19,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:19,501 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:19,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:19,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:19,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:19,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:19,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:19,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:52:19,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:52:19,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:19,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:19,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:19,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-04-10 15:52:19,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 15:52:19,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 15:52:19,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:52:19,974 INFO L87 Difference]: Start difference. First operand 482 states and 558 transitions. Second operand 42 states. [2018-04-10 15:52:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:21,275 INFO L93 Difference]: Finished difference Result 535 states and 614 transitions. [2018-04-10 15:52:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:52:21,276 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-04-10 15:52:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:21,277 INFO L225 Difference]: With dead ends: 535 [2018-04-10 15:52:21,277 INFO L226 Difference]: Without dead ends: 535 [2018-04-10 15:52:21,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:52:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-10 15:52:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 494. [2018-04-10 15:52:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-04-10 15:52:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 572 transitions. [2018-04-10 15:52:21,282 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 572 transitions. Word has length 197 [2018-04-10 15:52:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:21,283 INFO L459 AbstractCegarLoop]: Abstraction has 494 states and 572 transitions. [2018-04-10 15:52:21,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 15:52:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 572 transitions. [2018-04-10 15:52:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-04-10 15:52:21,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:21,284 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:21,284 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 656285237, now seen corresponding path program 39 times [2018-04-10 15:52:21,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:21,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:21,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:21,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:21,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:21,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:21,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:21,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:52:21,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-10 15:52:21,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:21,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:21,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:21,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-04-10 15:52:21,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 15:52:21,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 15:52:21,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:52:21,809 INFO L87 Difference]: Start difference. First operand 494 states and 572 transitions. Second operand 43 states. [2018-04-10 15:52:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:23,034 INFO L93 Difference]: Finished difference Result 548 states and 629 transitions. [2018-04-10 15:52:23,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:52:23,034 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-04-10 15:52:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:23,035 INFO L225 Difference]: With dead ends: 548 [2018-04-10 15:52:23,035 INFO L226 Difference]: Without dead ends: 548 [2018-04-10 15:52:23,036 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-10 15:52:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-10 15:52:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 506. [2018-04-10 15:52:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-10 15:52:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 586 transitions. [2018-04-10 15:52:23,039 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 586 transitions. Word has length 202 [2018-04-10 15:52:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:23,039 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 586 transitions. [2018-04-10 15:52:23,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 15:52:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 586 transitions. [2018-04-10 15:52:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 15:52:23,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:23,041 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:23,041 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash 715514856, now seen corresponding path program 40 times [2018-04-10 15:52:23,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:23,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:23,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:23,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:23,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:23,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:23,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:23,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:52:23,588 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:52:23,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:23,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:23,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:23,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-04-10 15:52:23,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 15:52:23,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 15:52:23,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:52:23,620 INFO L87 Difference]: Start difference. First operand 506 states and 586 transitions. Second operand 44 states. [2018-04-10 15:52:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:25,476 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2018-04-10 15:52:25,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:52:25,477 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-04-10 15:52:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:25,478 INFO L225 Difference]: With dead ends: 561 [2018-04-10 15:52:25,478 INFO L226 Difference]: Without dead ends: 561 [2018-04-10 15:52:25,478 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-10 15:52:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-04-10 15:52:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 518. [2018-04-10 15:52:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-10 15:52:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 600 transitions. [2018-04-10 15:52:25,481 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 600 transitions. Word has length 207 [2018-04-10 15:52:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:25,481 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 600 transitions. [2018-04-10 15:52:25,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 15:52:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 600 transitions. [2018-04-10 15:52:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-10 15:52:25,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:25,482 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:25,482 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1616595435, now seen corresponding path program 41 times [2018-04-10 15:52:25,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:25,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:25,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:25,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:25,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:25,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:25,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:25,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:25,985 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:52:25,998 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-10 15:52:25,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:26,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:26,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:26,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 85 [2018-04-10 15:52:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 15:52:26,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 15:52:26,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 15:52:26,663 INFO L87 Difference]: Start difference. First operand 518 states and 600 transitions. Second operand 86 states. [2018-04-10 15:52:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:32,319 INFO L93 Difference]: Finished difference Result 574 states and 659 transitions. [2018-04-10 15:52:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:52:32,319 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-04-10 15:52:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:32,321 INFO L225 Difference]: With dead ends: 574 [2018-04-10 15:52:32,321 INFO L226 Difference]: Without dead ends: 574 [2018-04-10 15:52:32,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 15:52:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-04-10 15:52:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 530. [2018-04-10 15:52:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-10 15:52:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 614 transitions. [2018-04-10 15:52:32,324 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 614 transitions. Word has length 212 [2018-04-10 15:52:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:32,325 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 614 transitions. [2018-04-10 15:52:32,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 15:52:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 614 transitions. [2018-04-10 15:52:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-04-10 15:52:32,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:32,325 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:32,325 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1071855624, now seen corresponding path program 42 times [2018-04-10 15:52:32,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:32,326 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:32,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:32,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:32,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:32,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:32,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:32,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:32,859 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:52:32,874 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-10 15:52:32,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:32,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:33,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:33,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-04-10 15:52:33,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:52:33,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:52:33,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:52:33,001 INFO L87 Difference]: Start difference. First operand 530 states and 614 transitions. Second operand 49 states. [2018-04-10 15:52:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:34,467 INFO L93 Difference]: Finished difference Result 587 states and 674 transitions. [2018-04-10 15:52:34,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:52:34,468 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-04-10 15:52:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:34,469 INFO L225 Difference]: With dead ends: 587 [2018-04-10 15:52:34,469 INFO L226 Difference]: Without dead ends: 587 [2018-04-10 15:52:34,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-04-10 15:52:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-04-10 15:52:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 542. [2018-04-10 15:52:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-04-10 15:52:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 628 transitions. [2018-04-10 15:52:34,473 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 628 transitions. Word has length 217 [2018-04-10 15:52:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:34,473 INFO L459 AbstractCegarLoop]: Abstraction has 542 states and 628 transitions. [2018-04-10 15:52:34,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:52:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 628 transitions. [2018-04-10 15:52:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-04-10 15:52:34,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:34,474 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:34,474 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash -701041163, now seen corresponding path program 43 times [2018-04-10 15:52:34,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:34,474 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:34,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:34,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:34,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:34,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:35,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:35,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:35,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:35,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:35,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:35,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-04-10 15:52:35,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:52:35,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:52:35,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:52:35,157 INFO L87 Difference]: Start difference. First operand 542 states and 628 transitions. Second operand 47 states. [2018-04-10 15:52:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:36,435 INFO L93 Difference]: Finished difference Result 600 states and 689 transitions. [2018-04-10 15:52:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:52:36,435 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-04-10 15:52:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:36,437 INFO L225 Difference]: With dead ends: 600 [2018-04-10 15:52:36,437 INFO L226 Difference]: Without dead ends: 600 [2018-04-10 15:52:36,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-04-10 15:52:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-10 15:52:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 554. [2018-04-10 15:52:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-04-10 15:52:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 642 transitions. [2018-04-10 15:52:36,441 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 642 transitions. Word has length 222 [2018-04-10 15:52:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:36,441 INFO L459 AbstractCegarLoop]: Abstraction has 554 states and 642 transitions. [2018-04-10 15:52:36,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:52:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 642 transitions. [2018-04-10 15:52:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 15:52:36,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:36,442 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:36,442 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1411245096, now seen corresponding path program 44 times [2018-04-10 15:52:36,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:36,443 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:36,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:36,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:36,443 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:36,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:36,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:36,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:52:37,001 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:52:37,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:37,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:37,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:37,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-04-10 15:52:37,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:52:37,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:52:37,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:52:37,145 INFO L87 Difference]: Start difference. First operand 554 states and 642 transitions. Second operand 55 states. [2018-04-10 15:52:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:39,039 INFO L93 Difference]: Finished difference Result 613 states and 704 transitions. [2018-04-10 15:52:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:52:39,040 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-04-10 15:52:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:39,042 INFO L225 Difference]: With dead ends: 613 [2018-04-10 15:52:39,042 INFO L226 Difference]: Without dead ends: 613 [2018-04-10 15:52:39,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:52:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-10 15:52:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 566. [2018-04-10 15:52:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-04-10 15:52:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 656 transitions. [2018-04-10 15:52:39,049 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 656 transitions. Word has length 227 [2018-04-10 15:52:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:39,049 INFO L459 AbstractCegarLoop]: Abstraction has 566 states and 656 transitions. [2018-04-10 15:52:39,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:52:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 656 transitions. [2018-04-10 15:52:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 15:52:39,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:39,050 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:39,050 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:39,051 INFO L82 PathProgramCache]: Analyzing trace with hash 241360341, now seen corresponding path program 45 times [2018-04-10 15:52:39,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:39,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:39,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:39,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:39,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:39,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:39,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:39,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:52:39,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-10 15:52:39,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:39,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:39,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:39,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-10 15:52:39,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:52:39,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:52:39,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:52:39,705 INFO L87 Difference]: Start difference. First operand 566 states and 656 transitions. Second operand 49 states. [2018-04-10 15:52:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:41,119 INFO L93 Difference]: Finished difference Result 626 states and 719 transitions. [2018-04-10 15:52:41,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:52:41,119 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-04-10 15:52:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:41,121 INFO L225 Difference]: With dead ends: 626 [2018-04-10 15:52:41,121 INFO L226 Difference]: Without dead ends: 626 [2018-04-10 15:52:41,121 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-04-10 15:52:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-10 15:52:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 578. [2018-04-10 15:52:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-04-10 15:52:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 670 transitions. [2018-04-10 15:52:41,124 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 670 transitions. Word has length 232 [2018-04-10 15:52:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:41,124 INFO L459 AbstractCegarLoop]: Abstraction has 578 states and 670 transitions. [2018-04-10 15:52:41,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:52:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 670 transitions. [2018-04-10 15:52:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-04-10 15:52:41,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:41,125 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:41,125 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 747104328, now seen corresponding path program 46 times [2018-04-10 15:52:41,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:41,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:41,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:41,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:41,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:41,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:41,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:41,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:41,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:52:41,772 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:52:41,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:41,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:41,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:41,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-04-10 15:52:41,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:52:41,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:52:41,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:52:41,829 INFO L87 Difference]: Start difference. First operand 578 states and 670 transitions. Second operand 50 states. [2018-04-10 15:52:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:43,349 INFO L93 Difference]: Finished difference Result 639 states and 734 transitions. [2018-04-10 15:52:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:52:43,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-04-10 15:52:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:43,351 INFO L225 Difference]: With dead ends: 639 [2018-04-10 15:52:43,351 INFO L226 Difference]: Without dead ends: 639 [2018-04-10 15:52:43,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-04-10 15:52:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-04-10 15:52:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 590. [2018-04-10 15:52:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-10 15:52:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 684 transitions. [2018-04-10 15:52:43,355 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 684 transitions. Word has length 237 [2018-04-10 15:52:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:43,355 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 684 transitions. [2018-04-10 15:52:43,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:52:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 684 transitions. [2018-04-10 15:52:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-04-10 15:52:43,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:43,356 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:43,356 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash -231313995, now seen corresponding path program 47 times [2018-04-10 15:52:43,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:43,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:43,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:43,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:43,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:43,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:44,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:44,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:44,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:52:44,047 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-10 15:52:44,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:44,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:44,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:44,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 97 [2018-04-10 15:52:44,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-10 15:52:44,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-10 15:52:44,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-04-10 15:52:44,875 INFO L87 Difference]: Start difference. First operand 590 states and 684 transitions. Second operand 98 states. [2018-04-10 15:52:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:50,737 INFO L93 Difference]: Finished difference Result 652 states and 749 transitions. [2018-04-10 15:52:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:52:50,737 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-04-10 15:52:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:50,738 INFO L225 Difference]: With dead ends: 652 [2018-04-10 15:52:50,738 INFO L226 Difference]: Without dead ends: 652 [2018-04-10 15:52:50,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 15:52:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-10 15:52:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 602. [2018-04-10 15:52:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-10 15:52:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 698 transitions. [2018-04-10 15:52:50,742 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 698 transitions. Word has length 242 [2018-04-10 15:52:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:50,742 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 698 transitions. [2018-04-10 15:52:50,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-10 15:52:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 698 transitions. [2018-04-10 15:52:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-04-10 15:52:50,743 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:50,743 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:50,743 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash 936592488, now seen corresponding path program 48 times [2018-04-10 15:52:50,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:50,744 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:50,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:50,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:50,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:50,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:51,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:51,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:51,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:52:51,410 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-10 15:52:51,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:51,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:51,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:51,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-04-10 15:52:51,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 15:52:51,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 15:52:51,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:52:51,839 INFO L87 Difference]: Start difference. First operand 602 states and 698 transitions. Second operand 69 states. [2018-04-10 15:52:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:55,036 INFO L93 Difference]: Finished difference Result 665 states and 764 transitions. [2018-04-10 15:52:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:52:55,037 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-04-10 15:52:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:55,038 INFO L225 Difference]: With dead ends: 665 [2018-04-10 15:52:55,038 INFO L226 Difference]: Without dead ends: 665 [2018-04-10 15:52:55,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-04-10 15:52:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-10 15:52:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 614. [2018-04-10 15:52:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-10 15:52:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 712 transitions. [2018-04-10 15:52:55,043 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 712 transitions. Word has length 247 [2018-04-10 15:52:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:55,043 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 712 transitions. [2018-04-10 15:52:55,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 15:52:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 712 transitions. [2018-04-10 15:52:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-10 15:52:55,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:55,044 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:55,044 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1916773781, now seen corresponding path program 49 times [2018-04-10 15:52:55,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:55,044 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:55,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:55,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:52:55,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:55,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:55,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:55,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:55,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:55,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:55,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:55,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-10 15:52:55,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:52:55,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:52:55,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:52:55,828 INFO L87 Difference]: Start difference. First operand 614 states and 712 transitions. Second operand 53 states. [2018-04-10 15:52:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:52:57,587 INFO L93 Difference]: Finished difference Result 678 states and 779 transitions. [2018-04-10 15:52:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:52:57,587 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-04-10 15:52:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:52:57,589 INFO L225 Difference]: With dead ends: 678 [2018-04-10 15:52:57,589 INFO L226 Difference]: Without dead ends: 678 [2018-04-10 15:52:57,590 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-10 15:52:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-04-10 15:52:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2018-04-10 15:52:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-04-10 15:52:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 726 transitions. [2018-04-10 15:52:57,597 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 726 transitions. Word has length 252 [2018-04-10 15:52:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:52:57,597 INFO L459 AbstractCegarLoop]: Abstraction has 626 states and 726 transitions. [2018-04-10 15:52:57,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:52:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 726 transitions. [2018-04-10 15:52:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-04-10 15:52:57,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:52:57,598 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-04-10 15:52:57,598 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:52:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1372456824, now seen corresponding path program 50 times [2018-04-10 15:52:57,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:52:57,599 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:52:57,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:57,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:52:57,599 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:52:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:52:57,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:52:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:58,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:52:58,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:52:58,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:52:58,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:52:58,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:52:58,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:52:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:52:58,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:52:58,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-04-10 15:52:58,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 15:52:58,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 15:52:58,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:52:58,483 INFO L87 Difference]: Start difference. First operand 626 states and 726 transitions. Second operand 58 states. [2018-04-10 15:53:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:00,527 INFO L93 Difference]: Finished difference Result 691 states and 794 transitions. [2018-04-10 15:53:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 15:53:00,527 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-04-10 15:53:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:00,529 INFO L225 Difference]: With dead ends: 691 [2018-04-10 15:53:00,529 INFO L226 Difference]: Without dead ends: 691 [2018-04-10 15:53:00,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-04-10 15:53:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-04-10 15:53:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 638. [2018-04-10 15:53:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-10 15:53:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 740 transitions. [2018-04-10 15:53:00,534 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 740 transitions. Word has length 257 [2018-04-10 15:53:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:00,534 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 740 transitions. [2018-04-10 15:53:00,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 15:53:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 740 transitions. [2018-04-10 15:53:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-10 15:53:00,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:00,536 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:00,536 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1517517451, now seen corresponding path program 51 times [2018-04-10 15:53:00,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:00,536 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:00,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:00,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:00,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:00,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:01,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:01,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:01,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:53:01,497 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-10 15:53:01,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:01,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:01,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:01,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-04-10 15:53:01,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:53:01,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:53:01,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:53:01,573 INFO L87 Difference]: Start difference. First operand 638 states and 740 transitions. Second operand 55 states. [2018-04-10 15:53:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:03,536 INFO L93 Difference]: Finished difference Result 704 states and 809 transitions. [2018-04-10 15:53:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 15:53:03,536 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-04-10 15:53:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:03,538 INFO L225 Difference]: With dead ends: 704 [2018-04-10 15:53:03,538 INFO L226 Difference]: Without dead ends: 704 [2018-04-10 15:53:03,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 15:53:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-04-10 15:53:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 650. [2018-04-10 15:53:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-04-10 15:53:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 754 transitions. [2018-04-10 15:53:03,543 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 754 transitions. Word has length 262 [2018-04-10 15:53:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:03,543 INFO L459 AbstractCegarLoop]: Abstraction has 650 states and 754 transitions. [2018-04-10 15:53:03,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:53:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 754 transitions. [2018-04-10 15:53:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-04-10 15:53:03,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:03,544 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:03,544 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1319762776, now seen corresponding path program 52 times [2018-04-10 15:53:03,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:03,544 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:03,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:03,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:03,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:03,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:04,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:04,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:04,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:53:04,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:53:04,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:04,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:05,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:05,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-04-10 15:53:05,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-10 15:53:05,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-10 15:53:05,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 15:53:05,199 INFO L87 Difference]: Start difference. First operand 650 states and 754 transitions. Second operand 109 states. [2018-04-10 15:53:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:11,659 INFO L93 Difference]: Finished difference Result 717 states and 824 transitions. [2018-04-10 15:53:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 15:53:11,659 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-04-10 15:53:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:11,660 INFO L225 Difference]: With dead ends: 717 [2018-04-10 15:53:11,661 INFO L226 Difference]: Without dead ends: 717 [2018-04-10 15:53:11,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 15:53:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-04-10 15:53:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 662. [2018-04-10 15:53:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-10 15:53:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 768 transitions. [2018-04-10 15:53:11,665 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 768 transitions. Word has length 267 [2018-04-10 15:53:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:11,665 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 768 transitions. [2018-04-10 15:53:11,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-10 15:53:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 768 transitions. [2018-04-10 15:53:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 15:53:11,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:11,666 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:11,666 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1448407723, now seen corresponding path program 53 times [2018-04-10 15:53:11,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:11,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:11,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:11,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:11,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:11,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:12,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:12,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:12,483 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:53:12,509 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-10 15:53:12,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:12,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:13,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:13,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 109 [2018-04-10 15:53:13,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-04-10 15:53:13,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-04-10 15:53:13,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-04-10 15:53:13,456 INFO L87 Difference]: Start difference. First operand 662 states and 768 transitions. Second operand 110 states. [2018-04-10 15:53:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:20,432 INFO L93 Difference]: Finished difference Result 730 states and 839 transitions. [2018-04-10 15:53:20,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 15:53:20,433 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-04-10 15:53:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:20,434 INFO L225 Difference]: With dead ends: 730 [2018-04-10 15:53:20,434 INFO L226 Difference]: Without dead ends: 730 [2018-04-10 15:53:20,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5619 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-04-10 15:53:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-04-10 15:53:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 674. [2018-04-10 15:53:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-04-10 15:53:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 782 transitions. [2018-04-10 15:53:20,438 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 782 transitions. Word has length 272 [2018-04-10 15:53:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:20,438 INFO L459 AbstractCegarLoop]: Abstraction has 674 states and 782 transitions. [2018-04-10 15:53:20,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-04-10 15:53:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 782 transitions. [2018-04-10 15:53:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-04-10 15:53:20,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:20,440 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:20,440 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1819371720, now seen corresponding path program 54 times [2018-04-10 15:53:20,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:20,441 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:20,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:20,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:20,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:20,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:21,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:21,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:53:21,355 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-10 15:53:21,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:21,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:21,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:21,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-04-10 15:53:21,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:53:21,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:53:21,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:53:21,542 INFO L87 Difference]: Start difference. First operand 674 states and 782 transitions. Second operand 61 states. [2018-04-10 15:53:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:23,589 INFO L93 Difference]: Finished difference Result 743 states and 854 transitions. [2018-04-10 15:53:23,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 15:53:23,589 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-04-10 15:53:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:23,591 INFO L225 Difference]: With dead ends: 743 [2018-04-10 15:53:23,591 INFO L226 Difference]: Without dead ends: 743 [2018-04-10 15:53:23,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-04-10 15:53:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-04-10 15:53:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 686. [2018-04-10 15:53:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-10 15:53:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 796 transitions. [2018-04-10 15:53:23,596 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 796 transitions. Word has length 277 [2018-04-10 15:53:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:23,596 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 796 transitions. [2018-04-10 15:53:23,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:53:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 796 transitions. [2018-04-10 15:53:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-04-10 15:53:23,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:23,597 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:23,597 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2102837963, now seen corresponding path program 55 times [2018-04-10 15:53:23,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:23,597 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:23,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:23,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:23,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:23,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:24,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:24,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:53:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:24,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:24,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:24,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-04-10 15:53:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 15:53:24,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 15:53:24,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:53:24,606 INFO L87 Difference]: Start difference. First operand 686 states and 796 transitions. Second operand 59 states. [2018-04-10 15:53:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:26,532 INFO L93 Difference]: Finished difference Result 756 states and 869 transitions. [2018-04-10 15:53:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 15:53:26,532 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-04-10 15:53:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:26,534 INFO L225 Difference]: With dead ends: 756 [2018-04-10 15:53:26,534 INFO L226 Difference]: Without dead ends: 756 [2018-04-10 15:53:26,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-04-10 15:53:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-04-10 15:53:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 698. [2018-04-10 15:53:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-10 15:53:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 810 transitions. [2018-04-10 15:53:26,539 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 810 transitions. Word has length 282 [2018-04-10 15:53:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:26,539 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 810 transitions. [2018-04-10 15:53:26,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 15:53:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 810 transitions. [2018-04-10 15:53:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 15:53:26,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:26,540 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:26,540 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash 875963624, now seen corresponding path program 56 times [2018-04-10 15:53:26,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:26,540 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:26,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:26,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:53:26,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:26,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:27,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:27,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:27,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:53:27,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:53:27,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:27,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:27,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:27,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-04-10 15:53:27,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 15:53:27,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 15:53:27,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:53:27,433 INFO L87 Difference]: Start difference. First operand 698 states and 810 transitions. Second operand 60 states. [2018-04-10 15:53:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:30,032 INFO L93 Difference]: Finished difference Result 769 states and 884 transitions. [2018-04-10 15:53:30,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 15:53:30,032 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-04-10 15:53:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:30,034 INFO L225 Difference]: With dead ends: 769 [2018-04-10 15:53:30,034 INFO L226 Difference]: Without dead ends: 769 [2018-04-10 15:53:30,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-04-10 15:53:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-04-10 15:53:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 710. [2018-04-10 15:53:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-04-10 15:53:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 824 transitions. [2018-04-10 15:53:30,039 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 824 transitions. Word has length 287 [2018-04-10 15:53:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:30,039 INFO L459 AbstractCegarLoop]: Abstraction has 710 states and 824 transitions. [2018-04-10 15:53:30,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 15:53:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 824 transitions. [2018-04-10 15:53:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 15:53:30,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:30,041 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:30,041 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash -82504427, now seen corresponding path program 57 times [2018-04-10 15:53:30,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:30,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:30,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:30,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:30,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:30,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:30,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:30,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:53:30,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-10 15:53:30,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:31,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:31,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:31,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-04-10 15:53:31,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-10 15:53:31,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-10 15:53:31,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-04-10 15:53:31,882 INFO L87 Difference]: Start difference. First operand 710 states and 824 transitions. Second operand 119 states. [2018-04-10 15:53:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:37,321 INFO L93 Difference]: Finished difference Result 782 states and 899 transitions. [2018-04-10 15:53:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 15:53:37,321 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-04-10 15:53:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:37,322 INFO L225 Difference]: With dead ends: 782 [2018-04-10 15:53:37,322 INFO L226 Difference]: Without dead ends: 782 [2018-04-10 15:53:37,323 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-10 15:53:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-04-10 15:53:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 722. [2018-04-10 15:53:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-04-10 15:53:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 838 transitions. [2018-04-10 15:53:37,327 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 838 transitions. Word has length 292 [2018-04-10 15:53:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:37,327 INFO L459 AbstractCegarLoop]: Abstraction has 722 states and 838 transitions. [2018-04-10 15:53:37,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-10 15:53:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 838 transitions. [2018-04-10 15:53:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-04-10 15:53:37,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:37,329 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:37,329 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1495910136, now seen corresponding path program 58 times [2018-04-10 15:53:37,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:37,329 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:37,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:37,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:37,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:37,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:38,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:38,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:38,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:53:38,314 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:53:38,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:38,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:38,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:38,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-04-10 15:53:38,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:53:38,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:53:38,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:53:38,440 INFO L87 Difference]: Start difference. First operand 722 states and 838 transitions. Second operand 67 states. [2018-04-10 15:53:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:40,757 INFO L93 Difference]: Finished difference Result 795 states and 914 transitions. [2018-04-10 15:53:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 15:53:40,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-04-10 15:53:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:40,792 INFO L225 Difference]: With dead ends: 795 [2018-04-10 15:53:40,792 INFO L226 Difference]: Without dead ends: 795 [2018-04-10 15:53:40,792 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-04-10 15:53:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-04-10 15:53:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 734. [2018-04-10 15:53:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-04-10 15:53:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2018-04-10 15:53:40,796 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 297 [2018-04-10 15:53:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:40,796 INFO L459 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2018-04-10 15:53:40,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:53:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2018-04-10 15:53:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-10 15:53:40,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:40,797 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:40,798 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2080598795, now seen corresponding path program 59 times [2018-04-10 15:53:40,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:40,798 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:40,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:40,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:40,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:40,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:41,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:41,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 15:53:41,765 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-10 15:53:41,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:41,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:42,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:42,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 121 [2018-04-10 15:53:42,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-10 15:53:42,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-10 15:53:42,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-04-10 15:53:42,837 INFO L87 Difference]: Start difference. First operand 734 states and 852 transitions. Second operand 122 states. [2018-04-10 15:53:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:53:51,279 INFO L93 Difference]: Finished difference Result 808 states and 929 transitions. [2018-04-10 15:53:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 15:53:51,279 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 302 [2018-04-10 15:53:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:53:51,281 INFO L225 Difference]: With dead ends: 808 [2018-04-10 15:53:51,282 INFO L226 Difference]: Without dead ends: 808 [2018-04-10 15:53:51,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6963 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-04-10 15:53:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-10 15:53:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 746. [2018-04-10 15:53:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-04-10 15:53:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 866 transitions. [2018-04-10 15:53:51,288 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 866 transitions. Word has length 302 [2018-04-10 15:53:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:53:51,288 INFO L459 AbstractCegarLoop]: Abstraction has 746 states and 866 transitions. [2018-04-10 15:53:51,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-10 15:53:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 866 transitions. [2018-04-10 15:53:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-04-10 15:53:51,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:53:51,289 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-04-10 15:53:51,289 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:53:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash -872176344, now seen corresponding path program 60 times [2018-04-10 15:53:51,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:53:51,289 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:53:51,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:51,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:53:51,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:53:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:53:51,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:53:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:52,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:53:52,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:53:52,323 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 15:53:52,342 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-10 15:53:52,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:53:52,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:53:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:53:53,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:53:53,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 120 [2018-04-10 15:53:53,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-10 15:53:53,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-10 15:53:53,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3548, Invalid=10972, Unknown=0, NotChecked=0, Total=14520 [2018-04-10 15:53:53,420 INFO L87 Difference]: Start difference. First operand 746 states and 866 transitions. Second operand 121 states. [2018-04-10 15:54:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:00,671 INFO L93 Difference]: Finished difference Result 821 states and 944 transitions. [2018-04-10 15:54:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 15:54:00,714 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 307 [2018-04-10 15:54:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:00,716 INFO L225 Difference]: With dead ends: 821 [2018-04-10 15:54:00,716 INFO L226 Difference]: Without dead ends: 821 [2018-04-10 15:54:00,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10577 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5803, Invalid=25349, Unknown=0, NotChecked=0, Total=31152 [2018-04-10 15:54:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-04-10 15:54:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 758. [2018-04-10 15:54:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-10 15:54:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 880 transitions. [2018-04-10 15:54:00,721 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 880 transitions. Word has length 307 [2018-04-10 15:54:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:00,721 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 880 transitions. [2018-04-10 15:54:00,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-10 15:54:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 880 transitions. [2018-04-10 15:54:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-04-10 15:54:00,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:00,722 INFO L355 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:00,722 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:54:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 351124693, now seen corresponding path program 61 times [2018-04-10 15:54:00,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:00,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:00,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:00,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:00,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:00,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:02,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:02,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:02,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:02,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:02,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-04-10 15:54:02,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 15:54:02,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 15:54:02,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:54:02,117 INFO L87 Difference]: Start difference. First operand 758 states and 880 transitions. Second operand 65 states. [2018-04-10 15:54:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:04,252 INFO L93 Difference]: Finished difference Result 834 states and 959 transitions. [2018-04-10 15:54:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 15:54:04,252 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-04-10 15:54:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:04,253 INFO L225 Difference]: With dead ends: 834 [2018-04-10 15:54:04,253 INFO L226 Difference]: Without dead ends: 834 [2018-04-10 15:54:04,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-04-10 15:54:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-04-10 15:54:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 770. [2018-04-10 15:54:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-04-10 15:54:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 894 transitions. [2018-04-10 15:54:04,259 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 894 transitions. Word has length 312 [2018-04-10 15:54:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:04,259 INFO L459 AbstractCegarLoop]: Abstraction has 770 states and 894 transitions. [2018-04-10 15:54:04,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 15:54:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 894 transitions. [2018-04-10 15:54:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-04-10 15:54:04,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:04,260 INFO L355 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:04,260 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:54:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash 888170824, now seen corresponding path program 62 times [2018-04-10 15:54:04,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:04,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:04,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:54:04,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:04,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:05,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:05,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 15:54:05,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 15:54:05,362 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:05,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:05,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:05,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-10 15:54:05,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 15:54:05,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 15:54:05,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:54:05,417 INFO L87 Difference]: Start difference. First operand 770 states and 894 transitions. Second operand 66 states. [2018-04-10 15:54:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:07,813 INFO L93 Difference]: Finished difference Result 847 states and 974 transitions. [2018-04-10 15:54:07,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 15:54:07,813 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-04-10 15:54:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:07,815 INFO L225 Difference]: With dead ends: 847 [2018-04-10 15:54:07,815 INFO L226 Difference]: Without dead ends: 847 [2018-04-10 15:54:07,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-04-10 15:54:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-04-10 15:54:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 782. [2018-04-10 15:54:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-10 15:54:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 908 transitions. [2018-04-10 15:54:07,821 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 908 transitions. Word has length 317 [2018-04-10 15:54:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:07,822 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 908 transitions. [2018-04-10 15:54:07,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 15:54:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 908 transitions. [2018-04-10 15:54:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-10 15:54:07,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:07,824 INFO L355 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:07,824 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:54:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash 200707253, now seen corresponding path program 63 times [2018-04-10 15:54:07,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:07,824 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:07,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:07,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:07,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:07,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:08,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:08,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:08,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 15:54:08,995 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-10 15:54:08,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:09,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:09,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:09,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-04-10 15:54:09,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-10 15:54:09,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-10 15:54:09,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 15:54:09,982 INFO L87 Difference]: Start difference. First operand 782 states and 908 transitions. Second operand 131 states. [2018-04-10 15:54:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:17,265 INFO L93 Difference]: Finished difference Result 860 states and 989 transitions. [2018-04-10 15:54:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 15:54:17,266 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-04-10 15:54:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:17,268 INFO L225 Difference]: With dead ends: 860 [2018-04-10 15:54:17,268 INFO L226 Difference]: Without dead ends: 860 [2018-04-10 15:54:17,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 15:54:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-10 15:54:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 794. [2018-04-10 15:54:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-04-10 15:54:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 922 transitions. [2018-04-10 15:54:17,276 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 922 transitions. Word has length 322 [2018-04-10 15:54:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:17,276 INFO L459 AbstractCegarLoop]: Abstraction has 794 states and 922 transitions. [2018-04-10 15:54:17,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-10 15:54:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 922 transitions. [2018-04-10 15:54:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-04-10 15:54:17,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:17,278 INFO L355 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:17,278 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:54:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 474908008, now seen corresponding path program 64 times [2018-04-10 15:54:17,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:17,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:17,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:17,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:17,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:17,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:54:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:18,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:54:18,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:54:18,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 15:54:18,841 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 15:54:18,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 15:54:18,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:54:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:54:18,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 15:54:18,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-04-10 15:54:18,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:54:18,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:54:18,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:54:18,934 INFO L87 Difference]: Start difference. First operand 794 states and 922 transitions. Second operand 67 states. [2018-04-10 15:54:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:54:30,483 INFO L93 Difference]: Finished difference Result 873 states and 1004 transitions. [2018-04-10 15:54:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 15:54:30,483 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-04-10 15:54:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:54:30,485 INFO L225 Difference]: With dead ends: 873 [2018-04-10 15:54:30,485 INFO L226 Difference]: Without dead ends: 873 [2018-04-10 15:54:30,485 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-10 15:54:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-04-10 15:54:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 806. [2018-04-10 15:54:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-04-10 15:54:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 936 transitions. [2018-04-10 15:54:30,490 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 936 transitions. Word has length 327 [2018-04-10 15:54:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:54:30,490 INFO L459 AbstractCegarLoop]: Abstraction has 806 states and 936 transitions. [2018-04-10 15:54:30,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:54:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 936 transitions. [2018-04-10 15:54:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-10 15:54:30,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:54:30,491 INFO L355 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-04-10 15:54:30,491 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3AssertViolationARRAY_INDEX, mainErr4AssertViolationARRAY_INDEX, mainErr5AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2AssertViolationARRAY_INDEX, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:54:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash 228918421, now seen corresponding path program 65 times [2018-04-10 15:54:30,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:54:30,491 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:54:30,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:30,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 15:54:30,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:54:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:54:30,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 15:54:31,051 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 15:54:31,053 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 15:54:31,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:54:31 BoogieIcfgContainer [2018-04-10 15:54:31,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:54:31,054 INFO L168 Benchmark]: Toolchain (without parser) took 180068.86 ms. Allocated memory was 406.3 MB in the beginning and 1.2 GB in the end (delta: 766.0 MB). Free memory was 347.4 MB in the beginning and 765.0 MB in the end (delta: -417.7 MB). Peak memory consumption was 348.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:54:31,055 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 406.3 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:54:31,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.78 ms. Allocated memory is still 406.3 MB. Free memory was 346.9 MB in the beginning and 337.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-04-10 15:54:31,055 INFO L168 Benchmark]: Boogie Preprocessor took 23.02 ms. Allocated memory is still 406.3 MB. Free memory was 337.6 MB in the beginning and 336.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:54:31,055 INFO L168 Benchmark]: RCFGBuilder took 182.07 ms. Allocated memory was 406.3 MB in the beginning and 616.6 MB in the end (delta: 210.2 MB). Free memory was 336.3 MB in the beginning and 582.2 MB in the end (delta: -245.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-10 15:54:31,056 INFO L168 Benchmark]: TraceAbstraction took 179692.63 ms. Allocated memory was 616.6 MB in the beginning and 1.2 GB in the end (delta: 555.7 MB). Free memory was 582.2 MB in the beginning and 765.0 MB in the end (delta: -182.9 MB). Peak memory consumption was 372.9 MB. Max. memory is 5.3 GB. [2018-04-10 15:54:31,057 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.10 ms. Allocated memory is still 406.3 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.78 ms. Allocated memory is still 406.3 MB. Free memory was 346.9 MB in the beginning and 337.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.02 ms. Allocated memory is still 406.3 MB. Free memory was 337.6 MB in the beginning and 336.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 182.07 ms. Allocated memory was 406.3 MB in the beginning and 616.6 MB in the end (delta: 210.2 MB). Free memory was 336.3 MB in the beginning and 582.2 MB in the end (delta: -245.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 179692.63 ms. Allocated memory was 616.6 MB in the beginning and 1.2 GB in the end (delta: 555.7 MB). Free memory was 582.2 MB in the beginning and 765.0 MB in the end (delta: -182.9 MB). Peak memory consumption was 372.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 12). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was analyzing trace of length 333 with TraceHistMax 66, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 36 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 6 error locations. TIMEOUT Result, 179.6s OverallTime, 66 OverallIterations, 66 TraceHistogramMax, 134.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6809 SDtfs, 71245 SDslu, 107898 SDs, 0 SdLazy, 412117 SolverSat, 26525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14436 GetRequests, 10144 SyntacticMatches, 7 SemanticMatches, 4285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93219 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 65 MinimizatonAttempts, 2275 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 21703 NumberOfCodeBlocks, 21703 NumberOfCodeBlocksAsserted, 1164 NumberOfCheckSat, 21574 ConstructedInterpolants, 0 QuantifiedInterpolants, 17579212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 23776 ConjunctsInSsa, 3103 ConjunctsInUnsatCore, 129 InterpolantComputations, 1 PerfectInterpolantSequences, 0/445120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-54-31-062.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_original_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-54-31-062.csv Completed graceful shutdown