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/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:11:12,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:11:12,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:11:12,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:11:12,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:11:12,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:11:12,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:11:12,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:11:12,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:11:12,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:11:12,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:11:12,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:11:12,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:11:12,246 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:11:12,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:11:12,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:11:12,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:11:12,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:11:12,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:11:12,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:11:12,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:11:12,255 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:11:12,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:11:12,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:11:12,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:11:12,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:11:12,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:11:12,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:11:12,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:11:12,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:11:12,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:11:12,259 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:11:12,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:11:12,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:11:12,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:11:12,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:11:12,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:11:12,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:11:12,279 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:11:12,279 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:11:12,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:11:12,279 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:11:12,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:11:12,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:11:12,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:11:12,281 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:11:12,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:11:12,317 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:11:12,321 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:11:12,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:11:12,322 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:11:12,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 16:11:12,620 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a0a680ea [2018-04-10 16:11:12,748 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:11:12,748 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:11:12,748 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 16:11:12,749 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:11:12,749 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:11:12,749 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:11:12,749 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 16:11:12,749 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 16:11:12,750 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:11:12,750 INFO L233 ultiparseSymbolTable]: [2018-04-10 16:11:12,761 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8a0a680ea [2018-04-10 16:11:12,764 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:11:12,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:11:12,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:11:12,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:11:12,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:11:12,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182d2445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12, skipping insertion in model container [2018-04-10 16:11:12,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,784 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:11:12,795 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:11:12,892 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:11:12,910 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:11:12,914 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 16:11:12,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12 WrapperNode [2018-04-10 16:11:12,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:11:12,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:11:12,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:11:12,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:11:12,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... [2018-04-10 16:11:12,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:11:12,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:11:12,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:11:12,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:11:12,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:11:12,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:11:12,985 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:11:12,985 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-10 16:11:12,986 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:11:12,986 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:11:13,172 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:11:13,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:11:13 BoogieIcfgContainer [2018-04-10 16:11:13,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:11:13,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:11:13,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:11:13,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:11:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:11:12" (1/3) ... [2018-04-10 16:11:13,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412b6870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:11:13, skipping insertion in model container [2018-04-10 16:11:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:11:12" (2/3) ... [2018-04-10 16:11:13,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412b6870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:11:13, skipping insertion in model container [2018-04-10 16:11:13,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:11:13" (3/3) ... [2018-04-10 16:11:13,177 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-10 16:11:13,182 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:11:13,187 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 16:11:13,216 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:11:13,217 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:11:13,217 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:11:13,217 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:11:13,217 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:11:13,217 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:11:13,217 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:11:13,218 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:11:13,218 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:11:13,219 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:11:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 16:11:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 16:11:13,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,238 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,238 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash -895474378, now seen corresponding path program 1 times [2018-04-10 16:11:13,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,245 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:13,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:11:13,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:11:13,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:11:13,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:11:13,370 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 16:11:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,415 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 16:11:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:11:13,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 16:11:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,425 INFO L225 Difference]: With dead ends: 63 [2018-04-10 16:11:13,425 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 16:11:13,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 16:11:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 16:11:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 16:11:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 16:11:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 16:11:13,459 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 16:11:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,459 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 16:11:13,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:11:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 16:11:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:11:13,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,460 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,460 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1597342241, now seen corresponding path program 1 times [2018-04-10 16:11:13,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:13,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 16:11:13,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:11:13,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:11:13,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:11:13,508 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-10 16:11:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,536 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 16:11:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:11:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-10 16:11:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,539 INFO L225 Difference]: With dead ends: 60 [2018-04-10 16:11:13,539 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 16:11:13,539 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 16:11:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 16:11:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-10 16:11:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 16:11:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-10 16:11:13,544 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-10 16:11:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,545 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-10 16:11:13,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:11:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-10 16:11:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:11:13,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,546 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,546 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997981, now seen corresponding path program 1 times [2018-04-10 16:11:13,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:13,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:11:13,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:11:13,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:11:13,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:11:13,595 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-04-10 16:11:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,659 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-10 16:11:13,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:11:13,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 16:11:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,660 INFO L225 Difference]: With dead ends: 51 [2018-04-10 16:11:13,661 INFO L226 Difference]: Without dead ends: 51 [2018-04-10 16:11:13,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:11:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-10 16:11:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-10 16:11:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-10 16:11:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-10 16:11:13,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-04-10 16:11:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,666 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-10 16:11:13,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:11:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-10 16:11:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 16:11:13,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,667 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,667 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997980, now seen corresponding path program 1 times [2018-04-10 16:11:13,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:13,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:11:13,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:11:13,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:11:13,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:11:13,739 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-10 16:11:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,808 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-04-10 16:11:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:11:13,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-10 16:11:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,809 INFO L225 Difference]: With dead ends: 53 [2018-04-10 16:11:13,809 INFO L226 Difference]: Without dead ends: 53 [2018-04-10 16:11:13,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:11:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-10 16:11:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-10 16:11:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-10 16:11:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-10 16:11:13,812 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-04-10 16:11:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,812 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-10 16:11:13,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:11:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-10 16:11:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:11:13,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,812 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,812 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash -869005287, now seen corresponding path program 1 times [2018-04-10 16:11:13,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,813 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:13,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:13,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:13,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-10 16:11:13,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:11:13,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:11:13,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:11:13,881 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-04-10 16:11:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,905 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-10 16:11:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:11:13,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-10 16:11:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,906 INFO L225 Difference]: With dead ends: 65 [2018-04-10 16:11:13,907 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 16:11:13,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 2 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 16:11:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 16:11:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-10 16:11:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-10 16:11:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-04-10 16:11:13,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-04-10 16:11:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,910 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-04-10 16:11:13,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:11:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-04-10 16:11:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-10 16:11:13,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,911 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:13,911 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash -994035242, now seen corresponding path program 1 times [2018-04-10 16:11:13,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:13,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:13,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:13,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:13,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:13,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:13,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:11:13,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:11:13,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:11:13,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:11:13,945 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-04-10 16:11:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:13,993 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-10 16:11:13,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:11:13,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-10 16:11:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:13,994 INFO L225 Difference]: With dead ends: 66 [2018-04-10 16:11:13,994 INFO L226 Difference]: Without dead ends: 66 [2018-04-10 16:11:13,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:11:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-10 16:11:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-04-10 16:11:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 16:11:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-10 16:11:13,998 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-04-10 16:11:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:13,998 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-10 16:11:13,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:11:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-10 16:11:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:11:13,999 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:13,999 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,000 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -561761263, now seen corresponding path program 2 times [2018-04-10 16:11:14,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,000 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:14,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:14,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:14,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:14,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:14,069 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:14,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:14,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:11:14,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:11:14,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-04-10 16:11:14,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:11:14,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:11:14,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:11:14,125 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2018-04-10 16:11:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:14,253 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-04-10 16:11:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:11:14,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-04-10 16:11:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:14,254 INFO L225 Difference]: With dead ends: 88 [2018-04-10 16:11:14,254 INFO L226 Difference]: Without dead ends: 88 [2018-04-10 16:11:14,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-10 16:11:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-04-10 16:11:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-10 16:11:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-04-10 16:11:14,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-04-10 16:11:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:14,257 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-04-10 16:11:14,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:11:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-04-10 16:11:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:11:14,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:14,258 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,258 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 701046357, now seen corresponding path program 1 times [2018-04-10 16:11:14,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:14,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:14,300 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 16:11:14,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:14,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:14,321 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 16:11:14,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:14,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-10 16:11:14,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:11:14,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:11:14,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:11:14,323 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 5 states. [2018-04-10 16:11:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:14,359 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-10 16:11:14,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:11:14,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 16:11:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:14,360 INFO L225 Difference]: With dead ends: 98 [2018-04-10 16:11:14,360 INFO L226 Difference]: Without dead ends: 98 [2018-04-10 16:11:14,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:11:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-10 16:11:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-04-10 16:11:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 16:11:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-04-10 16:11:14,364 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-04-10 16:11:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:14,364 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-04-10 16:11:14,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:11:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-04-10 16:11:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:11:14,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:14,365 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,365 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1455688847, now seen corresponding path program 1 times [2018-04-10 16:11:14,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:14,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:11:14,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:11:14,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:11:14,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:11:14,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:11:14,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:11:14,415 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-04-10 16:11:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:14,475 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-10 16:11:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:11:14,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-10 16:11:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:14,476 INFO L225 Difference]: With dead ends: 87 [2018-04-10 16:11:14,476 INFO L226 Difference]: Without dead ends: 81 [2018-04-10 16:11:14,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:11:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-10 16:11:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-10 16:11:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 16:11:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-10 16:11:14,480 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-04-10 16:11:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:14,481 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-10 16:11:14,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:11:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-10 16:11:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:11:14,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:14,482 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,482 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1559883415, now seen corresponding path program 2 times [2018-04-10 16:11:14,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:14,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:11:14,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:14,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:14,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:14,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:14,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:14,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:11:14,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:14,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-10 16:11:14,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:11:14,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:11:14,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:11:14,581 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2018-04-10 16:11:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:14,643 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-10 16:11:14,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:11:14,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 16:11:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:14,644 INFO L225 Difference]: With dead ends: 90 [2018-04-10 16:11:14,644 INFO L226 Difference]: Without dead ends: 84 [2018-04-10 16:11:14,644 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:11:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-10 16:11:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-04-10 16:11:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-10 16:11:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-10 16:11:14,646 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-04-10 16:11:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:14,646 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-10 16:11:14,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:11:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-10 16:11:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 16:11:14,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:14,647 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,647 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -250620575, now seen corresponding path program 3 times [2018-04-10 16:11:14,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,647 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:14,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 16:11:14,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:14,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:14,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:14,697 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-10 16:11:14,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:14,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:11:14,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:14,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 11 [2018-04-10 16:11:14,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 16:11:14,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 16:11:14,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:11:14,757 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-04-10 16:11:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:14,962 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-10 16:11:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:11:14,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-04-10 16:11:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:14,964 INFO L225 Difference]: With dead ends: 150 [2018-04-10 16:11:14,964 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 16:11:14,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:11:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 16:11:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2018-04-10 16:11:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-10 16:11:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-04-10 16:11:14,969 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 52 [2018-04-10 16:11:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:14,970 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-04-10 16:11:14,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 16:11:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-04-10 16:11:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 16:11:14,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:14,971 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:14,971 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash 404087573, now seen corresponding path program 1 times [2018-04-10 16:11:14,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:14,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:14,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:14,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:14,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-10 16:11:15,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:15,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:15,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:15,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-04-10 16:11:15,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:15,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-04-10 16:11:15,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:11:15,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:11:15,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:11:15,089 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2018-04-10 16:11:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:15,224 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-10 16:11:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:11:15,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-10 16:11:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:15,226 INFO L225 Difference]: With dead ends: 133 [2018-04-10 16:11:15,227 INFO L226 Difference]: Without dead ends: 133 [2018-04-10 16:11:15,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:11:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-10 16:11:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2018-04-10 16:11:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-10 16:11:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-04-10 16:11:15,233 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 67 [2018-04-10 16:11:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:15,233 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-04-10 16:11:15,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:11:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-04-10 16:11:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-10 16:11:15,235 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:15,235 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:15,235 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 784130209, now seen corresponding path program 4 times [2018-04-10 16:11:15,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:15,236 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:15,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:15,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:15,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:15,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 181 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-04-10 16:11:15,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:15,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:15,328 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:15,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:15,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-04-10 16:11:15,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:15,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-04-10 16:11:15,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:11:15,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:11:15,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:15,428 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 17 states. [2018-04-10 16:11:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:15,772 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-04-10 16:11:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:11:15,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-04-10 16:11:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:15,773 INFO L225 Difference]: With dead ends: 157 [2018-04-10 16:11:15,773 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 16:11:15,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:11:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 16:11:15,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-04-10 16:11:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-10 16:11:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-04-10 16:11:15,779 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 88 [2018-04-10 16:11:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:15,779 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-04-10 16:11:15,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:11:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-04-10 16:11:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-10 16:11:15,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:15,781 INFO L355 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:15,781 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1650581535, now seen corresponding path program 5 times [2018-04-10 16:11:15,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:15,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:15,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:15,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:15,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:15,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-10 16:11:15,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:15,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:15,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:15,948 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-10 16:11:15,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:15,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-10 16:11:16,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:16,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-04-10 16:11:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 16:11:16,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 16:11:16,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:11:16,022 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 14 states. [2018-04-10 16:11:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:16,114 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-04-10 16:11:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:11:16,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-04-10 16:11:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:16,115 INFO L225 Difference]: With dead ends: 152 [2018-04-10 16:11:16,115 INFO L226 Difference]: Without dead ends: 146 [2018-04-10 16:11:16,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:11:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-10 16:11:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-04-10 16:11:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-10 16:11:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-04-10 16:11:16,118 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 124 [2018-04-10 16:11:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:16,118 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-04-10 16:11:16,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 16:11:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-04-10 16:11:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-10 16:11:16,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:16,119 INFO L355 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:16,119 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1018374617, now seen corresponding path program 6 times [2018-04-10 16:11:16,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:16,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:16,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:16,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:16,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-10 16:11:16,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:16,182 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:16,182 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:16,214 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-10 16:11:16,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:16,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 276 proven. 48 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-04-10 16:11:16,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:16,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2018-04-10 16:11:16,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:11:16,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:11:16,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:16,321 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 17 states. [2018-04-10 16:11:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:16,640 INFO L93 Difference]: Finished difference Result 206 states and 211 transitions. [2018-04-10 16:11:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:11:16,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-04-10 16:11:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:16,642 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:11:16,642 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:11:16,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:11:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:11:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2018-04-10 16:11:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 16:11:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-04-10 16:11:16,647 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 130 [2018-04-10 16:11:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:16,647 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-04-10 16:11:16,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:11:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-04-10 16:11:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-10 16:11:16,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:16,649 INFO L355 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:16,649 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1774140143, now seen corresponding path program 7 times [2018-04-10 16:11:16,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:16,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:16,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:16,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-10 16:11:16,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:16,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:16,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-10 16:11:16,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:16,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-04-10 16:11:16,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:11:16,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:11:16,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:16,892 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 17 states. [2018-04-10 16:11:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:17,055 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-04-10 16:11:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:11:17,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-04-10 16:11:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:17,056 INFO L225 Difference]: With dead ends: 204 [2018-04-10 16:11:17,056 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 16:11:17,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:11:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 16:11:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-04-10 16:11:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 16:11:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2018-04-10 16:11:17,060 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 172 [2018-04-10 16:11:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:17,060 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 191 transitions. [2018-04-10 16:11:17,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:11:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 191 transitions. [2018-04-10 16:11:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-10 16:11:17,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:17,062 INFO L355 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:17,062 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1375873801, now seen corresponding path program 8 times [2018-04-10 16:11:17,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:17,062 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:17,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:17,062 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:17,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-10 16:11:17,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:17,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:17,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:17,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:17,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:17,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-10 16:11:17,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:17,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-10 16:11:17,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:11:17,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:11:17,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:11:17,231 INFO L87 Difference]: Start difference. First operand 188 states and 191 transitions. Second operand 10 states. [2018-04-10 16:11:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:17,289 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2018-04-10 16:11:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:11:17,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-04-10 16:11:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:17,290 INFO L225 Difference]: With dead ends: 216 [2018-04-10 16:11:17,290 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 16:11:17,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:11:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 16:11:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2018-04-10 16:11:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-10 16:11:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-04-10 16:11:17,294 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 178 [2018-04-10 16:11:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:17,294 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-04-10 16:11:17,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:11:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-04-10 16:11:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-10 16:11:17,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:17,295 INFO L355 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:17,296 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2106090241, now seen corresponding path program 9 times [2018-04-10 16:11:17,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:17,296 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:17,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-04-10 16:11:17,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:17,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:17,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:17,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-10 16:11:17,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:17,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 633 proven. 58 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-04-10 16:11:17,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:17,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 20 [2018-04-10 16:11:17,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:11:17,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:11:17,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:11:17,568 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 20 states. [2018-04-10 16:11:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:17,807 INFO L93 Difference]: Finished difference Result 250 states and 255 transitions. [2018-04-10 16:11:17,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:11:17,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2018-04-10 16:11:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:17,808 INFO L225 Difference]: With dead ends: 250 [2018-04-10 16:11:17,808 INFO L226 Difference]: Without dead ends: 250 [2018-04-10 16:11:17,808 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:11:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-10 16:11:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-04-10 16:11:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 16:11:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 253 transitions. [2018-04-10 16:11:17,811 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 253 transitions. Word has length 184 [2018-04-10 16:11:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:17,811 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 253 transitions. [2018-04-10 16:11:17,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:11:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2018-04-10 16:11:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-04-10 16:11:17,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:17,813 INFO L355 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:17,813 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1356019769, now seen corresponding path program 10 times [2018-04-10 16:11:17,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:17,813 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:17,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:17,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:17,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-04-10 16:11:18,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:18,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:18,031 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:18,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:18,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1256 proven. 274 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-10 16:11:18,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:18,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2018-04-10 16:11:18,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:11:18,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:11:18,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:11:18,316 INFO L87 Difference]: Start difference. First operand 248 states and 253 transitions. Second operand 30 states. [2018-04-10 16:11:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:18,800 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-04-10 16:11:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 16:11:18,800 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-04-10 16:11:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:18,802 INFO L225 Difference]: With dead ends: 316 [2018-04-10 16:11:18,802 INFO L226 Difference]: Without dead ends: 307 [2018-04-10 16:11:18,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 16:11:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-10 16:11:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 248. [2018-04-10 16:11:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-10 16:11:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2018-04-10 16:11:18,807 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 226 [2018-04-10 16:11:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:18,808 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2018-04-10 16:11:18,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:11:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2018-04-10 16:11:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-10 16:11:18,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:18,809 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:18,810 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 901554225, now seen corresponding path program 11 times [2018-04-10 16:11:18,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:18,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:18,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:18,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:18,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:18,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-10 16:11:18,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:18,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:18,957 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:19,065 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-10 16:11:19,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:19,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 1009 proven. 285 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-04-10 16:11:19,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:19,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-10 16:11:19,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:11:19,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:11:19,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:19,185 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand 17 states. [2018-04-10 16:11:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:19,360 INFO L93 Difference]: Finished difference Result 266 states and 270 transitions. [2018-04-10 16:11:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:11:19,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 232 [2018-04-10 16:11:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:19,362 INFO L225 Difference]: With dead ends: 266 [2018-04-10 16:11:19,362 INFO L226 Difference]: Without dead ends: 266 [2018-04-10 16:11:19,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-10 16:11:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2018-04-10 16:11:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-10 16:11:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 258 transitions. [2018-04-10 16:11:19,369 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 258 transitions. Word has length 232 [2018-04-10 16:11:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:19,369 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 258 transitions. [2018-04-10 16:11:19,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:11:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 258 transitions. [2018-04-10 16:11:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-10 16:11:19,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:19,371 INFO L355 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:19,371 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1429186007, now seen corresponding path program 12 times [2018-04-10 16:11:19,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:19,371 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:19,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:19,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:19,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:19,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-04-10 16:11:19,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:19,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:19,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:19,733 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-10 16:11:19,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:19,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 980 proven. 147 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-10 16:11:19,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:19,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-04-10 16:11:19,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:11:19,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:11:19,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:11:19,908 INFO L87 Difference]: Start difference. First operand 254 states and 258 transitions. Second operand 27 states. [2018-04-10 16:11:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:20,423 INFO L93 Difference]: Finished difference Result 334 states and 340 transitions. [2018-04-10 16:11:20,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 16:11:20,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 238 [2018-04-10 16:11:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:20,424 INFO L225 Difference]: With dead ends: 334 [2018-04-10 16:11:20,424 INFO L226 Difference]: Without dead ends: 334 [2018-04-10 16:11:20,425 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 16:11:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-10 16:11:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 314. [2018-04-10 16:11:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-10 16:11:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 320 transitions. [2018-04-10 16:11:20,431 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 320 transitions. Word has length 238 [2018-04-10 16:11:20,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:20,431 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 320 transitions. [2018-04-10 16:11:20,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:11:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 320 transitions. [2018-04-10 16:11:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-10 16:11:20,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:20,433 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:20,433 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1258320047, now seen corresponding path program 13 times [2018-04-10 16:11:20,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:20,434 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:20,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:20,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:20,434 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:20,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 2399 proven. 102 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-04-10 16:11:20,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:20,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:20,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1632 proven. 114 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-04-10 16:11:21,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:21,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-04-10 16:11:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 16:11:21,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 16:11:21,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 16:11:21,112 INFO L87 Difference]: Start difference. First operand 314 states and 320 transitions. Second operand 33 states. [2018-04-10 16:11:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:21,772 INFO L93 Difference]: Finished difference Result 394 states and 399 transitions. [2018-04-10 16:11:21,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 16:11:21,773 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 292 [2018-04-10 16:11:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:21,774 INFO L225 Difference]: With dead ends: 394 [2018-04-10 16:11:21,774 INFO L226 Difference]: Without dead ends: 385 [2018-04-10 16:11:21,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=431, Invalid=2761, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 16:11:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-04-10 16:11:21,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 374. [2018-04-10 16:11:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-10 16:11:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 379 transitions. [2018-04-10 16:11:21,779 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 379 transitions. Word has length 292 [2018-04-10 16:11:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:21,780 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 379 transitions. [2018-04-10 16:11:21,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 16:11:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 379 transitions. [2018-04-10 16:11:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-10 16:11:21,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:21,781 INFO L355 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:21,781 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash -604052879, now seen corresponding path program 14 times [2018-04-10 16:11:21,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:21,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:21,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:21,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:21,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-10 16:11:22,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:22,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:22,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:22,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:22,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-10 16:11:22,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:22,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-04-10 16:11:22,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:11:22,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:11:22,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:11:22,397 INFO L87 Difference]: Start difference. First operand 374 states and 379 transitions. Second operand 26 states. [2018-04-10 16:11:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:22,852 INFO L93 Difference]: Finished difference Result 389 states and 392 transitions. [2018-04-10 16:11:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:11:22,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2018-04-10 16:11:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:22,854 INFO L225 Difference]: With dead ends: 389 [2018-04-10 16:11:22,854 INFO L226 Difference]: Without dead ends: 383 [2018-04-10 16:11:22,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:11:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-10 16:11:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2018-04-10 16:11:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-10 16:11:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 377 transitions. [2018-04-10 16:11:22,861 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 377 transitions. Word has length 352 [2018-04-10 16:11:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:22,862 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 377 transitions. [2018-04-10 16:11:22,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:11:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 377 transitions. [2018-04-10 16:11:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-10 16:11:22,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:22,864 INFO L355 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:22,864 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 608157801, now seen corresponding path program 15 times [2018-04-10 16:11:22,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:22,865 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:22,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:22,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:22,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:22,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-10 16:11:23,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:23,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:23,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:23,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-10 16:11:23,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:23,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-10 16:11:23,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:23,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-10 16:11:23,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:11:23,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:11:23,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:11:23,165 INFO L87 Difference]: Start difference. First operand 374 states and 377 transitions. Second operand 11 states. [2018-04-10 16:11:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:23,412 INFO L93 Difference]: Finished difference Result 392 states and 396 transitions. [2018-04-10 16:11:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:11:23,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-04-10 16:11:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:23,413 INFO L225 Difference]: With dead ends: 392 [2018-04-10 16:11:23,413 INFO L226 Difference]: Without dead ends: 392 [2018-04-10 16:11:23,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 357 SyntacticMatches, 2 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 16:11:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-10 16:11:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 380. [2018-04-10 16:11:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-10 16:11:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 384 transitions. [2018-04-10 16:11:23,418 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 384 transitions. Word has length 358 [2018-04-10 16:11:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:23,419 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 384 transitions. [2018-04-10 16:11:23,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:11:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 384 transitions. [2018-04-10 16:11:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-10 16:11:23,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:23,421 INFO L355 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:23,421 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -992448415, now seen corresponding path program 16 times [2018-04-10 16:11:23,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:23,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:23,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:23,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:23,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:23,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-04-10 16:11:23,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:23,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:23,937 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:23,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:23,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 3433 proven. 652 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-10 16:11:24,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:24,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-04-10 16:11:24,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:11:24,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:11:24,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:11:24,441 INFO L87 Difference]: Start difference. First operand 380 states and 384 transitions. Second operand 42 states. [2018-04-10 16:11:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:25,368 INFO L93 Difference]: Finished difference Result 463 states and 468 transitions. [2018-04-10 16:11:25,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 16:11:25,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 364 [2018-04-10 16:11:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:25,408 INFO L225 Difference]: With dead ends: 463 [2018-04-10 16:11:25,408 INFO L226 Difference]: Without dead ends: 463 [2018-04-10 16:11:25,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=879, Invalid=3677, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:11:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-10 16:11:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2018-04-10 16:11:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-10 16:11:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 457 transitions. [2018-04-10 16:11:25,416 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 457 transitions. Word has length 364 [2018-04-10 16:11:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:25,416 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 457 transitions. [2018-04-10 16:11:25,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:11:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 457 transitions. [2018-04-10 16:11:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-04-10 16:11:25,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:25,419 INFO L355 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:25,419 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 64648569, now seen corresponding path program 17 times [2018-04-10 16:11:25,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:25,420 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:25,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:25,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:25,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:25,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-04-10 16:11:25,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:25,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:25,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:26,023 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-04-10 16:11:26,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:26,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2696 proven. 1638 refuted. 0 times theorem prover too weak. 5333 trivial. 0 not checked. [2018-04-10 16:11:26,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:26,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 25 [2018-04-10 16:11:26,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:11:26,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:11:26,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:11:26,280 INFO L87 Difference]: Start difference. First operand 452 states and 457 transitions. Second operand 26 states. [2018-04-10 16:11:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:26,534 INFO L93 Difference]: Finished difference Result 470 states and 476 transitions. [2018-04-10 16:11:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:11:26,535 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 430 [2018-04-10 16:11:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:26,537 INFO L225 Difference]: With dead ends: 470 [2018-04-10 16:11:26,537 INFO L226 Difference]: Without dead ends: 470 [2018-04-10 16:11:26,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:11:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-10 16:11:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2018-04-10 16:11:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-10 16:11:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 464 transitions. [2018-04-10 16:11:26,544 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 464 transitions. Word has length 430 [2018-04-10 16:11:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:26,544 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 464 transitions. [2018-04-10 16:11:26,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:11:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 464 transitions. [2018-04-10 16:11:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-10 16:11:26,547 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:26,548 INFO L355 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:26,548 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 523966833, now seen corresponding path program 18 times [2018-04-10 16:11:26,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:26,548 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:26,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:26,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:26,549 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:26,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-10 16:11:27,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:27,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:27,174 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-04-10 16:11:27,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:27,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 4033 proven. 1197 refuted. 0 times theorem prover too weak. 4774 trivial. 0 not checked. [2018-04-10 16:11:27,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:27,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2018-04-10 16:11:27,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 16:11:27,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 16:11:27,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:11:27,564 INFO L87 Difference]: Start difference. First operand 458 states and 464 transitions. Second operand 37 states. [2018-04-10 16:11:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:28,441 INFO L93 Difference]: Finished difference Result 544 states and 552 transitions. [2018-04-10 16:11:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 16:11:28,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 436 [2018-04-10 16:11:28,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:28,443 INFO L225 Difference]: With dead ends: 544 [2018-04-10 16:11:28,444 INFO L226 Difference]: Without dead ends: 544 [2018-04-10 16:11:28,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=866, Invalid=3294, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 16:11:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-10 16:11:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 533. [2018-04-10 16:11:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-10 16:11:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 541 transitions. [2018-04-10 16:11:28,452 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 541 transitions. Word has length 436 [2018-04-10 16:11:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:28,453 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 541 transitions. [2018-04-10 16:11:28,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 16:11:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 541 transitions. [2018-04-10 16:11:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-10 16:11:28,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:28,456 INFO L355 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:28,456 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 282969737, now seen corresponding path program 19 times [2018-04-10 16:11:28,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:28,456 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:28,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:28,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:28,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:28,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-10 16:11:29,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:29,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:29,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:29,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-10 16:11:29,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:29,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-04-10 16:11:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:11:29,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:11:29,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:11:29,333 INFO L87 Difference]: Start difference. First operand 533 states and 541 transitions. Second operand 32 states. [2018-04-10 16:11:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:29,682 INFO L93 Difference]: Finished difference Result 554 states and 558 transitions. [2018-04-10 16:11:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:11:29,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 502 [2018-04-10 16:11:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:29,684 INFO L225 Difference]: With dead ends: 554 [2018-04-10 16:11:29,684 INFO L226 Difference]: Without dead ends: 533 [2018-04-10 16:11:29,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 16:11:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-10 16:11:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-04-10 16:11:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-10 16:11:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 527 transitions. [2018-04-10 16:11:29,692 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 527 transitions. Word has length 502 [2018-04-10 16:11:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:29,693 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 527 transitions. [2018-04-10 16:11:29,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:11:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 527 transitions. [2018-04-10 16:11:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-10 16:11:29,696 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:29,696 INFO L355 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:29,697 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash 870003329, now seen corresponding path program 20 times [2018-04-10 16:11:29,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:29,697 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:29,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:29,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:29,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:29,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-10 16:11:30,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:30,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:30,148 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:30,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:30,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-10 16:11:30,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:30,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-04-10 16:11:30,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:11:30,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:11:30,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:11:30,288 INFO L87 Difference]: Start difference. First operand 524 states and 527 transitions. Second operand 15 states. [2018-04-10 16:11:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:30,433 INFO L93 Difference]: Finished difference Result 542 states and 546 transitions. [2018-04-10 16:11:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:11:30,465 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 508 [2018-04-10 16:11:30,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:30,467 INFO L225 Difference]: With dead ends: 542 [2018-04-10 16:11:30,467 INFO L226 Difference]: Without dead ends: 542 [2018-04-10 16:11:30,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:11:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-10 16:11:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 530. [2018-04-10 16:11:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-10 16:11:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 534 transitions. [2018-04-10 16:11:30,474 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 534 transitions. Word has length 508 [2018-04-10 16:11:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:30,474 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 534 transitions. [2018-04-10 16:11:30,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:11:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 534 transitions. [2018-04-10 16:11:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-10 16:11:30,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:30,478 INFO L355 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:30,478 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash -265555847, now seen corresponding path program 21 times [2018-04-10 16:11:30,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:30,478 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:30,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:30,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:30,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:30,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-04-10 16:11:31,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:31,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:31,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:31,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-10 16:11:31,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:31,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 5125 proven. 1949 refuted. 0 times theorem prover too weak. 7266 trivial. 0 not checked. [2018-04-10 16:11:32,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:32,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 53 [2018-04-10 16:11:32,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 16:11:32,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 16:11:32,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:11:32,017 INFO L87 Difference]: Start difference. First operand 530 states and 534 transitions. Second operand 53 states. [2018-04-10 16:11:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:33,145 INFO L93 Difference]: Finished difference Result 616 states and 621 transitions. [2018-04-10 16:11:33,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 16:11:33,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 514 [2018-04-10 16:11:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:33,147 INFO L225 Difference]: With dead ends: 616 [2018-04-10 16:11:33,148 INFO L226 Difference]: Without dead ends: 616 [2018-04-10 16:11:33,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1242, Invalid=6590, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 16:11:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-10 16:11:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2018-04-10 16:11:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-04-10 16:11:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 613 transitions. [2018-04-10 16:11:33,157 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 613 transitions. Word has length 514 [2018-04-10 16:11:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:33,158 INFO L459 AbstractCegarLoop]: Abstraction has 608 states and 613 transitions. [2018-04-10 16:11:33,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 16:11:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 613 transitions. [2018-04-10 16:11:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-04-10 16:11:33,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:33,162 INFO L355 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:33,162 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash -579703415, now seen corresponding path program 22 times [2018-04-10 16:11:33,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:33,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:33,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:33,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:33,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:33,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-04-10 16:11:33,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:33,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:33,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:33,940 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:33,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:33,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 7956 proven. 994 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-10 16:11:34,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:34,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 50 [2018-04-10 16:11:34,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 16:11:34,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 16:11:34,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2054, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:11:34,545 INFO L87 Difference]: Start difference. First operand 608 states and 613 transitions. Second operand 50 states. [2018-04-10 16:11:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:35,637 INFO L93 Difference]: Finished difference Result 625 states and 628 transitions. [2018-04-10 16:11:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 16:11:35,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 586 [2018-04-10 16:11:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:35,640 INFO L225 Difference]: With dead ends: 625 [2018-04-10 16:11:35,640 INFO L226 Difference]: Without dead ends: 619 [2018-04-10 16:11:35,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1182, Invalid=7190, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 16:11:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-04-10 16:11:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 608. [2018-04-10 16:11:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-04-10 16:11:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 611 transitions. [2018-04-10 16:11:35,650 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 611 transitions. Word has length 586 [2018-04-10 16:11:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:35,651 INFO L459 AbstractCegarLoop]: Abstraction has 608 states and 611 transitions. [2018-04-10 16:11:35,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 16:11:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 611 transitions. [2018-04-10 16:11:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-10 16:11:35,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:35,655 INFO L355 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:35,655 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1818728833, now seen corresponding path program 23 times [2018-04-10 16:11:35,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:35,656 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:35,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:35,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:35,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:35,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 16:11:36,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:36,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:36,086 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:36,567 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-04-10 16:11:36,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:36,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 16:11:36,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:36,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-04-10 16:11:36,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:11:36,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:11:36,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:11:36,862 INFO L87 Difference]: Start difference. First operand 608 states and 611 transitions. Second operand 27 states. [2018-04-10 16:11:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:37,131 INFO L93 Difference]: Finished difference Result 626 states and 630 transitions. [2018-04-10 16:11:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 16:11:37,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 592 [2018-04-10 16:11:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:37,133 INFO L225 Difference]: With dead ends: 626 [2018-04-10 16:11:37,133 INFO L226 Difference]: Without dead ends: 626 [2018-04-10 16:11:37,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:11:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-10 16:11:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 614. [2018-04-10 16:11:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-10 16:11:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 618 transitions. [2018-04-10 16:11:37,139 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 618 transitions. Word has length 592 [2018-04-10 16:11:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:37,139 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 618 transitions. [2018-04-10 16:11:37,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:11:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 618 transitions. [2018-04-10 16:11:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-10 16:11:37,143 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:37,143 INFO L355 BasicCegarLoop]: trace histogram [88, 78, 77, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:37,143 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 831461241, now seen corresponding path program 24 times [2018-04-10 16:11:37,144 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:37,144 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:37,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:37,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:37,145 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:37,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-10 16:11:37,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:37,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:37,970 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 16:11:37,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:37,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5202 proven. 322 refuted. 0 times theorem prover too weak. 14413 trivial. 0 not checked. [2018-04-10 16:11:38,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:38,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 32 [2018-04-10 16:11:38,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 16:11:38,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 16:11:38,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:11:38,176 INFO L87 Difference]: Start difference. First operand 614 states and 618 transitions. Second operand 32 states. [2018-04-10 16:11:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:38,711 INFO L93 Difference]: Finished difference Result 700 states and 705 transitions. [2018-04-10 16:11:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 16:11:38,712 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 598 [2018-04-10 16:11:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:38,713 INFO L225 Difference]: With dead ends: 700 [2018-04-10 16:11:38,713 INFO L226 Difference]: Without dead ends: 700 [2018-04-10 16:11:38,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=743, Invalid=2337, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:11:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-04-10 16:11:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2018-04-10 16:11:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-10 16:11:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 703 transitions. [2018-04-10 16:11:38,721 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 703 transitions. Word has length 598 [2018-04-10 16:11:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:38,722 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 703 transitions. [2018-04-10 16:11:38,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 16:11:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 703 transitions. [2018-04-10 16:11:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-04-10 16:11:38,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:38,727 INFO L355 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:38,727 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1107841919, now seen corresponding path program 25 times [2018-04-10 16:11:38,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:38,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:38,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:38,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:38,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:38,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-10 16:11:39,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:39,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:39,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:39,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-10 16:11:40,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:40,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-04-10 16:11:40,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 16:11:40,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 16:11:40,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 16:11:40,106 INFO L87 Difference]: Start difference. First operand 698 states and 703 transitions. Second operand 38 states. [2018-04-10 16:11:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:40,606 INFO L93 Difference]: Finished difference Result 713 states and 716 transitions. [2018-04-10 16:11:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 16:11:40,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 676 [2018-04-10 16:11:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:40,609 INFO L225 Difference]: With dead ends: 713 [2018-04-10 16:11:40,609 INFO L226 Difference]: Without dead ends: 707 [2018-04-10 16:11:40,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:11:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-04-10 16:11:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 698. [2018-04-10 16:11:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-10 16:11:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 701 transitions. [2018-04-10 16:11:40,615 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 701 transitions. Word has length 676 [2018-04-10 16:11:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:40,615 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 701 transitions. [2018-04-10 16:11:40,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 16:11:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 701 transitions. [2018-04-10 16:11:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-04-10 16:11:40,618 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:40,619 INFO L355 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:40,619 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1344323193, now seen corresponding path program 26 times [2018-04-10 16:11:40,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:40,619 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:40,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:40,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:40,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:40,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 16:11:41,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:41,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:41,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:41,192 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:41,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:41,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 16:11:41,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:41,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-04-10 16:11:41,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:11:41,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:11:41,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:11:41,340 INFO L87 Difference]: Start difference. First operand 698 states and 701 transitions. Second operand 17 states. [2018-04-10 16:11:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:41,538 INFO L93 Difference]: Finished difference Result 716 states and 720 transitions. [2018-04-10 16:11:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:11:41,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 682 [2018-04-10 16:11:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:41,540 INFO L225 Difference]: With dead ends: 716 [2018-04-10 16:11:41,540 INFO L226 Difference]: Without dead ends: 716 [2018-04-10 16:11:41,540 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:11:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-04-10 16:11:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 704. [2018-04-10 16:11:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-04-10 16:11:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 708 transitions. [2018-04-10 16:11:41,546 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 708 transitions. Word has length 682 [2018-04-10 16:11:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:41,547 INFO L459 AbstractCegarLoop]: Abstraction has 704 states and 708 transitions. [2018-04-10 16:11:41,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:11:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 708 transitions. [2018-04-10 16:11:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-04-10 16:11:41,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:41,552 INFO L355 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:41,552 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1172742769, now seen corresponding path program 27 times [2018-04-10 16:11:41,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:41,553 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:41,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:41,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:41,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:41,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 16:11:42,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:42,442 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:42,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-10 16:11:42,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:42,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 6545 proven. 507 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 16:11:42,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:42,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 16] total 45 [2018-04-10 16:11:42,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 16:11:42,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 16:11:42,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:11:42,783 INFO L87 Difference]: Start difference. First operand 704 states and 708 transitions. Second operand 45 states. [2018-04-10 16:11:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:43,865 INFO L93 Difference]: Finished difference Result 820 states and 826 transitions. [2018-04-10 16:11:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 16:11:43,865 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 688 [2018-04-10 16:11:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:43,867 INFO L225 Difference]: With dead ends: 820 [2018-04-10 16:11:43,867 INFO L226 Difference]: Without dead ends: 820 [2018-04-10 16:11:43,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1435, Invalid=5705, Unknown=0, NotChecked=0, Total=7140 [2018-04-10 16:11:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-04-10 16:11:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 800. [2018-04-10 16:11:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-04-10 16:11:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 806 transitions. [2018-04-10 16:11:43,872 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 806 transitions. Word has length 688 [2018-04-10 16:11:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:43,873 INFO L459 AbstractCegarLoop]: Abstraction has 800 states and 806 transitions. [2018-04-10 16:11:43,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 16:11:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 806 transitions. [2018-04-10 16:11:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-04-10 16:11:43,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:43,876 INFO L355 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:43,876 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1896000663, now seen corresponding path program 28 times [2018-04-10 16:11:43,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:43,877 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:43,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:43,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:43,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:43,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 14576 proven. 420 refuted. 0 times theorem prover too weak. 20179 trivial. 0 not checked. [2018-04-10 16:11:44,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:44,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:44,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:11:44,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:11:44,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:44,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 13728 proven. 1482 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-10 16:11:45,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:45,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 59 [2018-04-10 16:11:45,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 16:11:45,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 16:11:45,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 16:11:45,479 INFO L87 Difference]: Start difference. First operand 800 states and 806 transitions. Second operand 59 states. [2018-04-10 16:11:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:46,877 INFO L93 Difference]: Finished difference Result 814 states and 818 transitions. [2018-04-10 16:11:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 16:11:46,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 778 [2018-04-10 16:11:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:46,880 INFO L225 Difference]: With dead ends: 814 [2018-04-10 16:11:46,880 INFO L226 Difference]: Without dead ends: 808 [2018-04-10 16:11:46,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1618, Invalid=10154, Unknown=0, NotChecked=0, Total=11772 [2018-04-10 16:11:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-10 16:11:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 800. [2018-04-10 16:11:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-04-10 16:11:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 804 transitions. [2018-04-10 16:11:46,888 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 804 transitions. Word has length 778 [2018-04-10 16:11:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:46,888 INFO L459 AbstractCegarLoop]: Abstraction has 800 states and 804 transitions. [2018-04-10 16:11:46,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 16:11:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 804 transitions. [2018-04-10 16:11:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-04-10 16:11:46,892 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:46,893 INFO L355 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:46,893 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash 895063905, now seen corresponding path program 29 times [2018-04-10 16:11:46,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:46,893 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:46,893 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:46,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:46,894 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:46,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-04-10 16:11:48,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:48,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:48,003 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:11:48,622 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-04-10 16:11:48,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:48,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8627 proven. 2768 refuted. 0 times theorem prover too weak. 24425 trivial. 0 not checked. [2018-04-10 16:11:49,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:49,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 39] total 56 [2018-04-10 16:11:49,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 16:11:49,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 16:11:49,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=2530, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:11:49,351 INFO L87 Difference]: Start difference. First operand 800 states and 804 transitions. Second operand 56 states. [2018-04-10 16:11:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:50,531 INFO L93 Difference]: Finished difference Result 898 states and 902 transitions. [2018-04-10 16:11:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 16:11:50,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 784 [2018-04-10 16:11:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:50,533 INFO L225 Difference]: With dead ends: 898 [2018-04-10 16:11:50,533 INFO L226 Difference]: Without dead ends: 898 [2018-04-10 16:11:50,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=6039, Unknown=0, NotChecked=0, Total=7482 [2018-04-10 16:11:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-04-10 16:11:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 890. [2018-04-10 16:11:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-10 16:11:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 894 transitions. [2018-04-10 16:11:50,541 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 894 transitions. Word has length 784 [2018-04-10 16:11:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:50,541 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 894 transitions. [2018-04-10 16:11:50,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 16:11:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 894 transitions. [2018-04-10 16:11:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-10 16:11:50,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:50,545 INFO L355 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:50,545 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -165184423, now seen corresponding path program 30 times [2018-04-10 16:11:50,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:50,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:50,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:50,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:50,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:50,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-04-10 16:11:51,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:51,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:11:51,978 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 16:11:51,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:52,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 9431 proven. 534 refuted. 0 times theorem prover too weak. 35171 trivial. 0 not checked. [2018-04-10 16:11:52,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:52,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 49 [2018-04-10 16:11:52,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 16:11:52,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 16:11:52,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1993, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 16:11:52,465 INFO L87 Difference]: Start difference. First operand 890 states and 894 transitions. Second operand 49 states. [2018-04-10 16:11:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:54,053 INFO L93 Difference]: Finished difference Result 1007 states and 1010 transitions. [2018-04-10 16:11:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-10 16:11:54,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 874 [2018-04-10 16:11:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:54,055 INFO L225 Difference]: With dead ends: 1007 [2018-04-10 16:11:54,055 INFO L226 Difference]: Without dead ends: 998 [2018-04-10 16:11:54,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4062 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2165, Invalid=11641, Unknown=0, NotChecked=0, Total=13806 [2018-04-10 16:11:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-04-10 16:11:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 986. [2018-04-10 16:11:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-04-10 16:11:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 989 transitions. [2018-04-10 16:11:54,063 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 989 transitions. Word has length 874 [2018-04-10 16:11:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:54,063 INFO L459 AbstractCegarLoop]: Abstraction has 986 states and 989 transitions. [2018-04-10 16:11:54,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 16:11:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 989 transitions. [2018-04-10 16:11:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-04-10 16:11:54,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:54,068 INFO L355 BasicCegarLoop]: trace histogram [147, 133, 132, 132, 132, 132, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:54,068 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1060225345, now seen corresponding path program 31 times [2018-04-10 16:11:54,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:54,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:54,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:54,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:54,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:54,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 20675 proven. 574 refuted. 0 times theorem prover too weak. 35909 trivial. 0 not checked. [2018-04-10 16:11:55,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:55,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:55,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:55,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 20675 proven. 574 refuted. 0 times theorem prover too weak. 35909 trivial. 0 not checked. [2018-04-10 16:11:56,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:56,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-04-10 16:11:56,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 16:11:56,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 16:11:56,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 16:11:56,097 INFO L87 Difference]: Start difference. First operand 986 states and 989 transitions. Second operand 47 states. [2018-04-10 16:11:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:56,444 INFO L93 Difference]: Finished difference Result 1015 states and 1018 transitions. [2018-04-10 16:11:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 16:11:56,445 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 976 [2018-04-10 16:11:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:56,446 INFO L225 Difference]: With dead ends: 1015 [2018-04-10 16:11:56,446 INFO L226 Difference]: Without dead ends: 1009 [2018-04-10 16:11:56,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=825, Invalid=2715, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:11:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-04-10 16:11:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 997. [2018-04-10 16:11:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-04-10 16:11:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1000 transitions. [2018-04-10 16:11:56,452 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1000 transitions. Word has length 976 [2018-04-10 16:11:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:56,452 INFO L459 AbstractCegarLoop]: Abstraction has 997 states and 1000 transitions. [2018-04-10 16:11:56,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 16:11:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1000 transitions. [2018-04-10 16:11:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-04-10 16:11:56,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:56,457 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:56,457 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1744157895, now seen corresponding path program 32 times [2018-04-10 16:11:56,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:56,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:56,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:11:56,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:56,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 10773 proven. 588 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 16:11:57,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:57,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:57,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:11:57,463 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:11:57,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:57,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 10773 proven. 588 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 16:11:57,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:57,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-04-10 16:11:57,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:11:57,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:11:57,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:11:57,712 INFO L87 Difference]: Start difference. First operand 997 states and 1000 transitions. Second operand 19 states. [2018-04-10 16:11:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:57,894 INFO L93 Difference]: Finished difference Result 1008 states and 1011 transitions. [2018-04-10 16:11:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:11:57,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 982 [2018-04-10 16:11:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:57,896 INFO L225 Difference]: With dead ends: 1008 [2018-04-10 16:11:57,896 INFO L226 Difference]: Without dead ends: 1008 [2018-04-10 16:11:57,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 981 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:11:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-04-10 16:11:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 998. [2018-04-10 16:11:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-10 16:11:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1001 transitions. [2018-04-10 16:11:57,902 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1001 transitions. Word has length 982 [2018-04-10 16:11:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:57,902 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1001 transitions. [2018-04-10 16:11:57,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:11:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1001 transitions. [2018-04-10 16:11:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-04-10 16:11:57,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:57,908 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:57,908 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1639344335, now seen corresponding path program 33 times [2018-04-10 16:11:57,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:57,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:57,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:57,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:57,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:57,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:11:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 16:11:58,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:11:58,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:11:58,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:11:58,983 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-10 16:11:58,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:11:58,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:11:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-10 16:11:59,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:11:59,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-04-10 16:11:59,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:11:59,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:11:59,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:11:59,252 INFO L87 Difference]: Start difference. First operand 998 states and 1001 transitions. Second operand 20 states. [2018-04-10 16:11:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:11:59,475 INFO L93 Difference]: Finished difference Result 1026 states and 1031 transitions. [2018-04-10 16:11:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:11:59,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 988 [2018-04-10 16:11:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:11:59,477 INFO L225 Difference]: With dead ends: 1026 [2018-04-10 16:11:59,477 INFO L226 Difference]: Without dead ends: 1026 [2018-04-10 16:11:59,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:11:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-04-10 16:11:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1004. [2018-04-10 16:11:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-04-10 16:11:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1008 transitions. [2018-04-10 16:11:59,482 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1008 transitions. Word has length 988 [2018-04-10 16:11:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:11:59,483 INFO L459 AbstractCegarLoop]: Abstraction has 1004 states and 1008 transitions. [2018-04-10 16:11:59,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:11:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1008 transitions. [2018-04-10 16:11:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-04-10 16:11:59,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:11:59,488 INFO L355 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:11:59,488 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:11:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1652027095, now seen corresponding path program 34 times [2018-04-10 16:11:59,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:11:59,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:11:59,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:59,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:11:59,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:11:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:11:59,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-04-10 16:12:01,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:01,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:12:01,332 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:12:01,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:01,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 21640 proven. 2164 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-10 16:12:02,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:02,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 70 [2018-04-10 16:12:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 16:12:02,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 16:12:02,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=4025, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 16:12:02,586 INFO L87 Difference]: Start difference. First operand 1004 states and 1008 transitions. Second operand 70 states. [2018-04-10 16:12:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:04,029 INFO L93 Difference]: Finished difference Result 1126 states and 1130 transitions. [2018-04-10 16:12:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 16:12:04,029 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 994 [2018-04-10 16:12:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:04,031 INFO L225 Difference]: With dead ends: 1126 [2018-04-10 16:12:04,031 INFO L226 Difference]: Without dead ends: 1126 [2018-04-10 16:12:04,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2405, Invalid=11167, Unknown=0, NotChecked=0, Total=13572 [2018-04-10 16:12:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2018-04-10 16:12:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1118. [2018-04-10 16:12:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-04-10 16:12:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1122 transitions. [2018-04-10 16:12:04,038 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1122 transitions. Word has length 994 [2018-04-10 16:12:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:04,039 INFO L459 AbstractCegarLoop]: Abstraction has 1118 states and 1122 transitions. [2018-04-10 16:12:04,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 16:12:04,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1122 transitions. [2018-04-10 16:12:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-04-10 16:12:04,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:04,044 INFO L355 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:04,044 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1560222711, now seen corresponding path program 35 times [2018-04-10 16:12:04,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:04,045 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:04,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:04,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:04,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:04,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 16:12:05,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:05,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:05,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:12:08,670 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-04-10 16:12:08,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:09,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 16:12:09,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:09,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 19 [2018-04-10 16:12:09,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:12:09,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:12:09,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:12:09,503 INFO L87 Difference]: Start difference. First operand 1118 states and 1122 transitions. Second operand 20 states. [2018-04-10 16:12:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:09,980 INFO L93 Difference]: Finished difference Result 1133 states and 1138 transitions. [2018-04-10 16:12:09,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:12:09,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1102 [2018-04-10 16:12:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:09,982 INFO L225 Difference]: With dead ends: 1133 [2018-04-10 16:12:09,983 INFO L226 Difference]: Without dead ends: 1133 [2018-04-10 16:12:09,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1120 GetRequests, 1099 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:12:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-10 16:12:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1124. [2018-04-10 16:12:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-04-10 16:12:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1129 transitions. [2018-04-10 16:12:09,990 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1129 transitions. Word has length 1102 [2018-04-10 16:12:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:09,991 INFO L459 AbstractCegarLoop]: Abstraction has 1124 states and 1129 transitions. [2018-04-10 16:12:09,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:12:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1129 transitions. [2018-04-10 16:12:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-04-10 16:12:09,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:09,998 INFO L355 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:09,998 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash -120038399, now seen corresponding path program 36 times [2018-04-10 16:12:09,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:09,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:09,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:09,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:09,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:10,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-04-10 16:12:12,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:12,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:12,133 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:12:12,452 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-04-10 16:12:12,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:12,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 14812 proven. 707 refuted. 0 times theorem prover too weak. 59718 trivial. 0 not checked. [2018-04-10 16:12:12,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:12,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 22] total 42 [2018-04-10 16:12:12,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:12:12,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:12:12,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:12:12,927 INFO L87 Difference]: Start difference. First operand 1124 states and 1129 transitions. Second operand 42 states. [2018-04-10 16:12:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:13,783 INFO L93 Difference]: Finished difference Result 1362 states and 1372 transitions. [2018-04-10 16:12:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 16:12:13,783 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1108 [2018-04-10 16:12:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:13,786 INFO L225 Difference]: With dead ends: 1362 [2018-04-10 16:12:13,786 INFO L226 Difference]: Without dead ends: 1362 [2018-04-10 16:12:13,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1343, Invalid=4357, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 16:12:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-04-10 16:12:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1358. [2018-04-10 16:12:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-10 16:12:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1368 transitions. [2018-04-10 16:12:13,796 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1368 transitions. Word has length 1108 [2018-04-10 16:12:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:13,797 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1368 transitions. [2018-04-10 16:12:13,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:12:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1368 transitions. [2018-04-10 16:12:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-04-10 16:12:13,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:13,807 INFO L355 BasicCegarLoop]: trace histogram [184, 168, 167, 167, 167, 167, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:13,808 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1367851287, now seen corresponding path program 37 times [2018-04-10 16:12:13,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:13,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:13,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:13,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:13,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:13,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 28558 proven. 2167 refuted. 0 times theorem prover too weak. 59838 trivial. 0 not checked. [2018-04-10 16:12:16,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:16,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:16,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:16,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 40543 proven. 660 refuted. 0 times theorem prover too weak. 49360 trivial. 0 not checked. [2018-04-10 16:12:16,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:16,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-04-10 16:12:16,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 16:12:16,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 16:12:16,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:12:16,954 INFO L87 Difference]: Start difference. First operand 1358 states and 1368 transitions. Second operand 50 states. [2018-04-10 16:12:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:17,493 INFO L93 Difference]: Finished difference Result 1244 states and 1248 transitions. [2018-04-10 16:12:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 16:12:17,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1210 [2018-04-10 16:12:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:17,496 INFO L225 Difference]: With dead ends: 1244 [2018-04-10 16:12:17,496 INFO L226 Difference]: Without dead ends: 1235 [2018-04-10 16:12:17,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=936, Invalid=3096, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 16:12:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-04-10 16:12:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1232. [2018-04-10 16:12:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-10 16:12:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1236 transitions. [2018-04-10 16:12:17,503 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1236 transitions. Word has length 1210 [2018-04-10 16:12:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:17,504 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1236 transitions. [2018-04-10 16:12:17,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 16:12:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1236 transitions. [2018-04-10 16:12:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-04-10 16:12:17,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:17,511 INFO L355 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:17,511 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1881913057, now seen corresponding path program 38 times [2018-04-10 16:12:17,512 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:17,512 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:17,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:17,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:17,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:17,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-10 16:12:20,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:20,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:12:20,105 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:12:20,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:20,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-10 16:12:20,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:20,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-04-10 16:12:20,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 16:12:20,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 16:12:20,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 16:12:20,788 INFO L87 Difference]: Start difference. First operand 1232 states and 1236 transitions. Second operand 53 states. [2018-04-10 16:12:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:21,354 INFO L93 Difference]: Finished difference Result 1244 states and 1246 transitions. [2018-04-10 16:12:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 16:12:21,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1216 [2018-04-10 16:12:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:21,357 INFO L225 Difference]: With dead ends: 1244 [2018-04-10 16:12:21,357 INFO L226 Difference]: Without dead ends: 1238 [2018-04-10 16:12:21,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:12:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-04-10 16:12:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-04-10 16:12:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-10 16:12:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-04-10 16:12:21,364 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1216 [2018-04-10 16:12:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:21,365 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-04-10 16:12:21,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 16:12:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-04-10 16:12:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-04-10 16:12:21,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:21,372 INFO L355 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:21,372 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash -460291879, now seen corresponding path program 39 times [2018-04-10 16:12:21,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:21,373 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:21,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:21,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:21,373 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:21,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-04-10 16:12:23,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:23,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:12:23,078 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-04-10 16:12:23,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:23,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16552 proven. 867 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-04-10 16:12:23,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:23,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2018-04-10 16:12:23,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 16:12:23,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 16:12:23,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1281, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 16:12:23,696 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 42 states. [2018-04-10 16:12:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:24,292 INFO L93 Difference]: Finished difference Result 1247 states and 1250 transitions. [2018-04-10 16:12:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:12:24,292 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1222 [2018-04-10 16:12:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:24,295 INFO L225 Difference]: With dead ends: 1247 [2018-04-10 16:12:24,295 INFO L226 Difference]: Without dead ends: 1247 [2018-04-10 16:12:24,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 16:12:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2018-04-10 16:12:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1238. [2018-04-10 16:12:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2018-04-10 16:12:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1241 transitions. [2018-04-10 16:12:24,303 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1241 transitions. Word has length 1222 [2018-04-10 16:12:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:24,304 INFO L459 AbstractCegarLoop]: Abstraction has 1238 states and 1241 transitions. [2018-04-10 16:12:24,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 16:12:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1241 transitions. [2018-04-10 16:12:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-10 16:12:24,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:24,317 INFO L355 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:24,317 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -632087343, now seen corresponding path program 40 times [2018-04-10 16:12:24,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:24,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:24,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:24,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:24,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:24,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-10 16:12:27,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:27,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:27,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:12:27,216 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:12:27,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:27,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 31279 proven. 2758 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 16:12:28,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:28,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43] total 78 [2018-04-10 16:12:28,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 16:12:28,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 16:12:28,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=5012, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 16:12:28,576 INFO L87 Difference]: Start difference. First operand 1238 states and 1241 transitions. Second operand 78 states. [2018-04-10 16:12:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:30,291 INFO L93 Difference]: Finished difference Result 1372 states and 1376 transitions. [2018-04-10 16:12:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-10 16:12:30,291 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1228 [2018-04-10 16:12:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:30,294 INFO L225 Difference]: With dead ends: 1372 [2018-04-10 16:12:30,294 INFO L226 Difference]: Without dead ends: 1372 [2018-04-10 16:12:30,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2976, Invalid=14054, Unknown=0, NotChecked=0, Total=17030 [2018-04-10 16:12:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2018-04-10 16:12:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1364. [2018-04-10 16:12:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-04-10 16:12:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1368 transitions. [2018-04-10 16:12:30,302 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1368 transitions. Word has length 1228 [2018-04-10 16:12:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:30,303 INFO L459 AbstractCegarLoop]: Abstraction has 1364 states and 1368 transitions. [2018-04-10 16:12:30,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 16:12:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1368 transitions. [2018-04-10 16:12:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-04-10 16:12:30,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:30,316 INFO L355 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:30,316 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1478054495, now seen corresponding path program 41 times [2018-04-10 16:12:30,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:30,316 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:30,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:30,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:30,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:30,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-10 16:12:32,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:32,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:32,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:12:34,913 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-04-10 16:12:34,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:35,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-10 16:12:35,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:35,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-04-10 16:12:35,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 16:12:35,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 16:12:35,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:12:35,857 INFO L87 Difference]: Start difference. First operand 1364 states and 1368 transitions. Second operand 41 states. [2018-04-10 16:12:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:36,295 INFO L93 Difference]: Finished difference Result 1379 states and 1384 transitions. [2018-04-10 16:12:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:12:36,295 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1348 [2018-04-10 16:12:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:36,298 INFO L225 Difference]: With dead ends: 1379 [2018-04-10 16:12:36,298 INFO L226 Difference]: Without dead ends: 1379 [2018-04-10 16:12:36,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:12:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-04-10 16:12:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1370. [2018-04-10 16:12:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-04-10 16:12:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1375 transitions. [2018-04-10 16:12:36,306 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1375 transitions. Word has length 1348 [2018-04-10 16:12:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:36,306 INFO L459 AbstractCegarLoop]: Abstraction has 1370 states and 1375 transitions. [2018-04-10 16:12:36,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 16:12:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1375 transitions. [2018-04-10 16:12:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-04-10 16:12:36,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:36,315 INFO L355 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:36,316 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash 724997017, now seen corresponding path program 42 times [2018-04-10 16:12:36,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:36,316 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:36,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:36,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:36,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:36,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-04-10 16:12:39,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:39,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:39,783 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:12:41,713 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-04-10 16:12:41,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:41,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 20567 proven. 5569 refuted. 0 times theorem prover too weak. 89204 trivial. 0 not checked. [2018-04-10 16:12:42,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:42,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 51 [2018-04-10 16:12:42,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 16:12:42,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 16:12:42,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:12:42,456 INFO L87 Difference]: Start difference. First operand 1370 states and 1375 transitions. Second operand 51 states. [2018-04-10 16:12:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:43,456 INFO L93 Difference]: Finished difference Result 1635 states and 1645 transitions. [2018-04-10 16:12:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 16:12:43,456 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1354 [2018-04-10 16:12:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:43,460 INFO L225 Difference]: With dead ends: 1635 [2018-04-10 16:12:43,460 INFO L226 Difference]: Without dead ends: 1635 [2018-04-10 16:12:43,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1784, Invalid=6588, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 16:12:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2018-04-10 16:12:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1628. [2018-04-10 16:12:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-10 16:12:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1638 transitions. [2018-04-10 16:12:43,472 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1638 transitions. Word has length 1354 [2018-04-10 16:12:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:43,473 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1638 transitions. [2018-04-10 16:12:43,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 16:12:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1638 transitions. [2018-04-10 16:12:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2018-04-10 16:12:43,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:43,484 INFO L355 BasicCegarLoop]: trace histogram [225, 207, 206, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:43,484 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash 839607921, now seen corresponding path program 43 times [2018-04-10 16:12:43,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:43,484 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:43,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:43,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:43,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:43,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 40033 proven. 2761 refuted. 0 times theorem prover too weak. 93892 trivial. 0 not checked. [2018-04-10 16:12:47,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:47,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:47,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:47,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 57190 proven. 850 refuted. 0 times theorem prover too weak. 78646 trivial. 0 not checked. [2018-04-10 16:12:48,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:48,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-04-10 16:12:48,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 16:12:48,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 16:12:48,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 16:12:48,135 INFO L87 Difference]: Start difference. First operand 1628 states and 1638 transitions. Second operand 56 states. [2018-04-10 16:12:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:48,867 INFO L93 Difference]: Finished difference Result 1502 states and 1506 transitions. [2018-04-10 16:12:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 16:12:48,867 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1468 [2018-04-10 16:12:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:48,870 INFO L225 Difference]: With dead ends: 1502 [2018-04-10 16:12:48,870 INFO L226 Difference]: Without dead ends: 1493 [2018-04-10 16:12:48,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1521 GetRequests, 1451 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1179, Invalid=3933, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 16:12:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-04-10 16:12:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1490. [2018-04-10 16:12:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-04-10 16:12:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1494 transitions. [2018-04-10 16:12:48,880 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1494 transitions. Word has length 1468 [2018-04-10 16:12:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:48,880 INFO L459 AbstractCegarLoop]: Abstraction has 1490 states and 1494 transitions. [2018-04-10 16:12:48,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 16:12:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1494 transitions. [2018-04-10 16:12:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-04-10 16:12:48,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:48,890 INFO L355 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:48,890 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:48,890 INFO L82 PathProgramCache]: Analyzing trace with hash -637855639, now seen corresponding path program 44 times [2018-04-10 16:12:48,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:48,891 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:48,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:12:48,891 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:48,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:12:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-04-10 16:12:52,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:12:52,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:12:52,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:12:52,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:12:52,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:12:52,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:12:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 23606 proven. 1009 refuted. 0 times theorem prover too weak. 113346 trivial. 0 not checked. [2018-04-10 16:12:54,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:12:54,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 74 [2018-04-10 16:12:54,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 16:12:54,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 16:12:54,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4683, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 16:12:54,035 INFO L87 Difference]: Start difference. First operand 1490 states and 1494 transitions. Second operand 74 states. [2018-04-10 16:12:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:12:56,080 INFO L93 Difference]: Finished difference Result 1637 states and 1640 transitions. [2018-04-10 16:12:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-10 16:12:56,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1474 [2018-04-10 16:12:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:12:56,083 INFO L225 Difference]: With dead ends: 1637 [2018-04-10 16:12:56,084 INFO L226 Difference]: Without dead ends: 1628 [2018-04-10 16:12:56,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1460 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6154 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2749, Invalid=19303, Unknown=0, NotChecked=0, Total=22052 [2018-04-10 16:12:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2018-04-10 16:12:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1616. [2018-04-10 16:12:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-04-10 16:12:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1619 transitions. [2018-04-10 16:12:56,094 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1619 transitions. Word has length 1474 [2018-04-10 16:12:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:12:56,094 INFO L459 AbstractCegarLoop]: Abstraction has 1616 states and 1619 transitions. [2018-04-10 16:12:56,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 16:12:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1619 transitions. [2018-04-10 16:12:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1607 [2018-04-10 16:12:56,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:12:56,105 INFO L355 BasicCegarLoop]: trace histogram [247, 228, 227, 227, 227, 227, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:12:56,105 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:12:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash -119949527, now seen corresponding path program 45 times [2018-04-10 16:12:56,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:12:56,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:12:56,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:56,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:12:56,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:12:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:12:56,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 48915 proven. 1064 refuted. 0 times theorem prover too weak. 115419 trivial. 0 not checked. [2018-04-10 16:13:00,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:00,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:13:00,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-04-10 16:13:00,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:00,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 25096 proven. 1083 refuted. 0 times theorem prover too weak. 139219 trivial. 0 not checked. [2018-04-10 16:13:02,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:02,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 21] total 62 [2018-04-10 16:13:02,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 16:13:02,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 16:13:02,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=3299, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 16:13:02,097 INFO L87 Difference]: Start difference. First operand 1616 states and 1619 transitions. Second operand 62 states. [2018-04-10 16:13:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:04,388 INFO L93 Difference]: Finished difference Result 1644 states and 1647 transitions. [2018-04-10 16:13:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 16:13:04,388 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1606 [2018-04-10 16:13:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:04,391 INFO L225 Difference]: With dead ends: 1644 [2018-04-10 16:13:04,391 INFO L226 Difference]: Without dead ends: 1638 [2018-04-10 16:13:04,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1587 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=991, Invalid=8711, Unknown=0, NotChecked=0, Total=9702 [2018-04-10 16:13:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2018-04-10 16:13:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1628. [2018-04-10 16:13:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-10 16:13:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1631 transitions. [2018-04-10 16:13:04,399 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1631 transitions. Word has length 1606 [2018-04-10 16:13:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:04,399 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1631 transitions. [2018-04-10 16:13:04,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 16:13:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1631 transitions. [2018-04-10 16:13:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-04-10 16:13:04,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:04,411 INFO L355 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:04,411 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 180154649, now seen corresponding path program 46 times [2018-04-10 16:13:04,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:04,411 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:04,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:04,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:04,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:04,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 16:13:07,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:07,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:07,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:13:07,607 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:13:07,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:07,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 16:13:08,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:08,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-04-10 16:13:08,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 16:13:08,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 16:13:08,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:13:08,434 INFO L87 Difference]: Start difference. First operand 1628 states and 1631 transitions. Second operand 44 states. [2018-04-10 16:13:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:09,099 INFO L93 Difference]: Finished difference Result 1656 states and 1661 transitions. [2018-04-10 16:13:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:13:09,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1618 [2018-04-10 16:13:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:09,102 INFO L225 Difference]: With dead ends: 1656 [2018-04-10 16:13:09,102 INFO L226 Difference]: Without dead ends: 1656 [2018-04-10 16:13:09,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1598 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:13:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-04-10 16:13:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1634. [2018-04-10 16:13:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2018-04-10 16:13:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1638 transitions. [2018-04-10 16:13:09,111 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1638 transitions. Word has length 1618 [2018-04-10 16:13:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:09,111 INFO L459 AbstractCegarLoop]: Abstraction has 1634 states and 1638 transitions. [2018-04-10 16:13:09,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 16:13:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1638 transitions. [2018-04-10 16:13:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-04-10 16:13:09,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:09,123 INFO L355 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:09,123 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:09,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1560650479, now seen corresponding path program 47 times [2018-04-10 16:13:09,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:09,123 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:09,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:09,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:09,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:09,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 16:13:14,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:14,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 16:13:19,363 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-04-10 16:13:19,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:20,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29011 proven. 6824 refuted. 0 times theorem prover too weak. 133790 trivial. 0 not checked. [2018-04-10 16:13:21,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:21,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50] total 74 [2018-04-10 16:13:21,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 16:13:21,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 16:13:21,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=4319, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 16:13:21,375 INFO L87 Difference]: Start difference. First operand 1634 states and 1638 transitions. Second operand 74 states. [2018-04-10 16:13:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:22,887 INFO L93 Difference]: Finished difference Result 1789 states and 1794 transitions. [2018-04-10 16:13:22,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 16:13:22,888 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1624 [2018-04-10 16:13:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:22,890 INFO L225 Difference]: With dead ends: 1789 [2018-04-10 16:13:22,890 INFO L226 Difference]: Without dead ends: 1789 [2018-04-10 16:13:22,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1597 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2962, Invalid=11080, Unknown=0, NotChecked=0, Total=14042 [2018-04-10 16:13:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-04-10 16:13:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1778. [2018-04-10 16:13:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-04-10 16:13:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1783 transitions. [2018-04-10 16:13:22,899 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1783 transitions. Word has length 1624 [2018-04-10 16:13:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:22,900 INFO L459 AbstractCegarLoop]: Abstraction has 1778 states and 1783 transitions. [2018-04-10 16:13:22,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 16:13:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1783 transitions. [2018-04-10 16:13:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-04-10 16:13:22,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:22,913 INFO L355 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:22,913 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 963996625, now seen corresponding path program 48 times [2018-04-10 16:13:22,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:22,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:22,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:22,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:22,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:22,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-10 16:13:29,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:29,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 16:13:30,317 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-10 16:13:30,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:30,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 30421 proven. 1323 refuted. 0 times theorem prover too weak. 168176 trivial. 0 not checked. [2018-04-10 16:13:31,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:31,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24] total 73 [2018-04-10 16:13:31,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 16:13:31,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 16:13:31,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=4437, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 16:13:31,491 INFO L87 Difference]: Start difference. First operand 1778 states and 1783 transitions. Second operand 73 states. [2018-04-10 16:13:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:33,562 INFO L93 Difference]: Finished difference Result 2080 states and 2090 transitions. [2018-04-10 16:13:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 16:13:33,562 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1756 [2018-04-10 16:13:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:33,567 INFO L225 Difference]: With dead ends: 2080 [2018-04-10 16:13:33,587 INFO L226 Difference]: Without dead ends: 2080 [2018-04-10 16:13:33,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1734 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4305, Invalid=14601, Unknown=0, NotChecked=0, Total=18906 [2018-04-10 16:13:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2018-04-10 16:13:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1928. [2018-04-10 16:13:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-10 16:13:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1936 transitions. [2018-04-10 16:13:33,599 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1936 transitions. Word has length 1756 [2018-04-10 16:13:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:33,599 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 1936 transitions. [2018-04-10 16:13:33,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 16:13:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1936 transitions. [2018-04-10 16:13:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-04-10 16:13:33,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:33,613 INFO L355 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:33,613 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1179183553, now seen corresponding path program 49 times [2018-04-10 16:13:33,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:33,614 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:33,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:33,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:33,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:33,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-10 16:13:39,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:39,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:13:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:40,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33442 proven. 1220 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-10 16:13:41,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:41,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 72 [2018-04-10 16:13:41,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 16:13:41,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 16:13:41,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=3935, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 16:13:41,431 INFO L87 Difference]: Start difference. First operand 1928 states and 1936 transitions. Second operand 72 states. [2018-04-10 16:13:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:42,803 INFO L93 Difference]: Finished difference Result 2226 states and 2238 transitions. [2018-04-10 16:13:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 16:13:42,803 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1768 [2018-04-10 16:13:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:42,806 INFO L225 Difference]: With dead ends: 2226 [2018-04-10 16:13:42,806 INFO L226 Difference]: Without dead ends: 2226 [2018-04-10 16:13:42,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1858 GetRequests, 1745 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3324, Invalid=9786, Unknown=0, NotChecked=0, Total=13110 [2018-04-10 16:13:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-04-10 16:13:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2213. [2018-04-10 16:13:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2018-04-10 16:13:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2225 transitions. [2018-04-10 16:13:42,818 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2225 transitions. Word has length 1768 [2018-04-10 16:13:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:42,818 INFO L459 AbstractCegarLoop]: Abstraction has 2213 states and 2225 transitions. [2018-04-10 16:13:42,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 16:13:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2225 transitions. [2018-04-10 16:13:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-04-10 16:13:42,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:42,834 INFO L355 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:42,834 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:42,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1197311871, now seen corresponding path program 50 times [2018-04-10 16:13:42,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:42,834 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:42,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:42,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:13:42,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:42,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-10 16:13:49,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:49,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:49,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:13:49,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:13:49,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:49,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-10 16:13:51,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:51,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 68 [2018-04-10 16:13:51,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 16:13:51,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 16:13:51,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 16:13:51,277 INFO L87 Difference]: Start difference. First operand 2213 states and 2225 transitions. Second operand 68 states. [2018-04-10 16:13:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:52,140 INFO L93 Difference]: Finished difference Result 2090 states and 2094 transitions. [2018-04-10 16:13:52,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 16:13:52,140 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1900 [2018-04-10 16:13:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:52,143 INFO L225 Difference]: With dead ends: 2090 [2018-04-10 16:13:52,143 INFO L226 Difference]: Without dead ends: 1937 [2018-04-10 16:13:52,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1965 GetRequests, 1879 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1749, Invalid=5907, Unknown=0, NotChecked=0, Total=7656 [2018-04-10 16:13:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-04-10 16:13:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1928. [2018-04-10 16:13:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-10 16:13:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1931 transitions. [2018-04-10 16:13:52,154 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1931 transitions. Word has length 1900 [2018-04-10 16:13:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:52,154 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 1931 transitions. [2018-04-10 16:13:52,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 16:13:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1931 transitions. [2018-04-10 16:13:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-04-10 16:13:52,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:52,174 INFO L355 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:52,174 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1548555889, now seen corresponding path program 51 times [2018-04-10 16:13:52,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:52,175 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:52,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:52,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:52,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:52,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:13:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-10 16:13:56,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:13:56,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:13:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:13:56,777 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-04-10 16:13:56,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:13:56,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:13:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-10 16:13:57,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:13:57,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-04-10 16:13:57,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 16:13:57,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 16:13:57,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:13:57,693 INFO L87 Difference]: Start difference. First operand 1928 states and 1931 transitions. Second operand 30 states. [2018-04-10 16:13:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:13:58,060 INFO L93 Difference]: Finished difference Result 1946 states and 1950 transitions. [2018-04-10 16:13:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:13:58,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1912 [2018-04-10 16:13:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:13:58,062 INFO L225 Difference]: With dead ends: 1946 [2018-04-10 16:13:58,063 INFO L226 Difference]: Without dead ends: 1946 [2018-04-10 16:13:58,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1957 GetRequests, 1908 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 16:13:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-04-10 16:13:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1934. [2018-04-10 16:13:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-04-10 16:13:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 1938 transitions. [2018-04-10 16:13:58,073 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 1938 transitions. Word has length 1912 [2018-04-10 16:13:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:13:58,073 INFO L459 AbstractCegarLoop]: Abstraction has 1934 states and 1938 transitions. [2018-04-10 16:13:58,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 16:13:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 1938 transitions. [2018-04-10 16:13:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-04-10 16:13:58,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:13:58,089 INFO L355 BasicCegarLoop]: trace histogram [297, 276, 275, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:13:58,089 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-10 16:13:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash -29417367, now seen corresponding path program 52 times [2018-04-10 16:13:58,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:13:58,090 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:13:58,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:58,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:13:58,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:13:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:13:58,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:14:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-10 16:14:05,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:14:05,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:14:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 16:14:05,708 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 16:14:05,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:14:05,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-04-10 16:14:06,169 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 16:14:06,169 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:14:06,172 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:14:06,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:14:06 BoogieIcfgContainer [2018-04-10 16:14:06,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:14:06,173 INFO L168 Benchmark]: Toolchain (without parser) took 173408.51 ms. Allocated memory was 387.4 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 325.5 MB in the beginning and 1.0 GB in the end (delta: -709.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-04-10 16:14:06,174 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 387.4 MB. Free memory is still 346.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:06,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.48 ms. Allocated memory is still 387.4 MB. Free memory was 325.5 MB in the beginning and 314.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:06,174 INFO L168 Benchmark]: Boogie Preprocessor took 23.77 ms. Allocated memory is still 387.4 MB. Free memory is still 314.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:14:06,174 INFO L168 Benchmark]: RCFGBuilder took 225.95 ms. Allocated memory was 387.4 MB in the beginning and 576.7 MB in the end (delta: 189.3 MB). Free memory was 314.8 MB in the beginning and 536.9 MB in the end (delta: -222.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:14:06,174 INFO L168 Benchmark]: TraceAbstraction took 172999.82 ms. Allocated memory was 576.7 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 536.9 MB in the beginning and 1.0 GB in the end (delta: -498.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-04-10 16:14:06,175 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.24 ms. Allocated memory is still 387.4 MB. Free memory is still 346.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.48 ms. Allocated memory is still 387.4 MB. Free memory was 325.5 MB in the beginning and 314.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.77 ms. Allocated memory is still 387.4 MB. Free memory is still 314.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 225.95 ms. Allocated memory was 387.4 MB in the beginning and 576.7 MB in the end (delta: 189.3 MB). Free memory was 314.8 MB in the beginning and 536.9 MB in the end (delta: -222.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 172999.82 ms. Allocated memory was 576.7 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 536.9 MB in the beginning and 1.0 GB in the end (delta: -498.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 69 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 172.9s OverallTime, 61 OverallIterations, 297 TraceHistogramMax, 36.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2181 SDtfs, 19061 SDslu, 24948 SDs, 0 SdLazy, 68135 SolverSat, 2719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43048 GetRequests, 40063 SyntacticMatches, 14 SemanticMatches, 2971 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62449 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2213occurred in iteration=58, 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.3s AutomataMinimizationTime, 60 MinimizatonAttempts, 861 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 19.6s SatisfiabilityAnalysisTime, 94.3s InterpolantComputationTime, 81496 NumberOfCodeBlocks, 75930 NumberOfCodeBlocksAsserted, 611 NumberOfCheckSat, 81382 ConstructedInterpolants, 0 QuantifiedInterpolants, 142557923 SizeOfPredicates, 123 NumberOfNonLiveVariables, 80429 ConjunctsInSsa, 1325 ConjunctsInUnsatCore, 114 InterpolantComputations, 7 PerfectInterpolantSequences, 5898334/5978454 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/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-14-06-180.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-14-06-180.csv Completed graceful shutdown