java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 23:55:21,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 23:55:21,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 23:55:21,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 23:55:21,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 23:55:21,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 23:55:21,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 23:55:21,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 23:55:21,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 23:55:21,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 23:55:21,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 23:55:21,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 23:55:21,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 23:55:21,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 23:55:21,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 23:55:21,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 23:55:21,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 23:55:21,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 23:55:21,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 23:55:21,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 23:55:21,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 23:55:21,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 23:55:21,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 23:55:21,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 23:55:21,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 23:55:21,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 23:55:21,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 23:55:21,297 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 23:55:21,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 23:55:21,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 23:55:21,298 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 23:55:21,299 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_Array.epf [2018-04-12 23:55:21,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 23:55:21,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 23:55:21,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 23:55:21,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 23:55:21,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 23:55:21,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 23:55:21,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 23:55:21,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 23:55:21,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 23:55:21,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 23:55:21,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 23:55:21,352 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 23:55:21,355 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 23:55:21,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 23:55:21,356 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 23:55:21,357 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-12 23:55:21,651 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb49c5247c [2018-04-12 23:55:21,746 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 23:55:21,746 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 23:55:21,747 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-12 23:55:21,747 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 23:55:21,747 INFO L215 ultiparseSymbolTable]: [2018-04-12 23:55:21,747 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 23:55:21,747 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-12 23:55:21,748 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-12 23:55:21,748 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 23:55:21,748 INFO L233 ultiparseSymbolTable]: [2018-04-12 23:55:21,760 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb49c5247c [2018-04-12 23:55:21,763 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 23:55:21,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 23:55:21,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 23:55:21,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 23:55:21,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 23:55:21,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c999bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21, skipping insertion in model container [2018-04-12 23:55:21,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,781 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:55:21,789 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 23:55:21,884 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:55:21,902 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 23:55:21,906 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-12 23:55:21,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21 WrapperNode [2018-04-12 23:55:21,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 23:55:21,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 23:55:21,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 23:55:21,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 23:55:21,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (1/1) ... [2018-04-12 23:55:21,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 23:55:21,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 23:55:21,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 23:55:21,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 23:55:21,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (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-12 23:55:21,976 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 23:55:21,976 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 23:55:21,977 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-12 23:55:21,977 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 23:55:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 23:55:22,150 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 23:55:22,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:55:22 BoogieIcfgContainer [2018-04-12 23:55:22,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 23:55:22,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 23:55:22,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 23:55:22,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 23:55:22,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 11:55:21" (1/3) ... [2018-04-12 23:55:22,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3d6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:55:22, skipping insertion in model container [2018-04-12 23:55:22,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 11:55:21" (2/3) ... [2018-04-12 23:55:22,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3d6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 11:55:22, skipping insertion in model container [2018-04-12 23:55:22,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 11:55:22" (3/3) ... [2018-04-12 23:55:22,155 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-12 23:55:22,161 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-12 23:55:22,167 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-12 23:55:22,193 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 23:55:22,193 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 23:55:22,193 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 23:55:22,194 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-12 23:55:22,194 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-12 23:55:22,194 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 23:55:22,194 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 23:55:22,194 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 23:55:22,194 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 23:55:22,195 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 23:55:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-12 23:55:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-12 23:55:22,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,213 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:22,213 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-12 23:55:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash -895474378, now seen corresponding path program 1 times [2018-04-12 23:55:22,253 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,286 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,329 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-12 23:55:22,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:22,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 23:55:22,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,332 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-12 23:55:22,332 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= main_~i~1 0)] [2018-04-12 23:55:22,332 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-12 23:55:22,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:55:22,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:55:22,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:55:22,342 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-12 23:55:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,395 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-12 23:55:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:55:22,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-12 23:55:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,405 INFO L225 Difference]: With dead ends: 63 [2018-04-12 23:55:22,405 INFO L226 Difference]: Without dead ends: 59 [2018-04-12 23:55:22,406 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-12 23:55:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-12 23:55:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-12 23:55:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-12 23:55:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-12 23:55:22,435 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-12 23:55:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,435 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-12 23:55:22,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:55:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-12 23:55:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 23:55:22,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,436 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:22,436 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-12 23:55:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1597342241, now seen corresponding path program 1 times [2018-04-12 23:55:22,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,448 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,473 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-12 23:55:22,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:22,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 23:55:22,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,473 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-12 23:55:22,474 INFO L182 omatonBuilderFactory]: Interpolants [164#true, 165#false, 166#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)] [2018-04-12 23:55:22,474 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-12 23:55:22,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 23:55:22,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 23:55:22,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 23:55:22,476 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-12 23:55:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,516 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-12 23:55:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 23:55:22,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-12 23:55:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,519 INFO L225 Difference]: With dead ends: 60 [2018-04-12 23:55:22,519 INFO L226 Difference]: Without dead ends: 60 [2018-04-12 23:55:22,520 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-12 23:55:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-12 23:55:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-12 23:55:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-12 23:55:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-12 23:55:22,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-12 23:55:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,526 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-12 23:55:22,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 23:55:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-12 23:55:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 23:55:22,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,526 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:22,527 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-12 23:55:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997981, now seen corresponding path program 1 times [2018-04-12 23:55:22,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,539 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,571 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-12 23:55:22,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:22,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:55:22,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,572 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-12 23:55:22,572 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(= 1 (select |#valid| |main_~#mask~0.base|)), 282#(= 1 (select |#valid| |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.base|)), 283#(= 1 (select |#valid| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base))] [2018-04-12 23:55:22,572 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-12 23:55:22,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:55:22,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:55:22,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:55:22,573 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-04-12 23:55:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,627 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-12 23:55:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:55:22,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-12 23:55:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,628 INFO L225 Difference]: With dead ends: 51 [2018-04-12 23:55:22,628 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 23:55:22,628 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-12 23:55:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 23:55:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-12 23:55:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 23:55:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-12 23:55:22,631 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-04-12 23:55:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,631 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-12 23:55:22,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:55:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-12 23:55:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 23:55:22,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,632 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:22,632 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-12 23:55:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997980, now seen corresponding path program 1 times [2018-04-12 23:55:22,633 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,641 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,692 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-12 23:55:22,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:22,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 23:55:22,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,693 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-12 23:55:22,693 INFO L182 omatonBuilderFactory]: Interpolants [388#true, 389#false, 390#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)), 391#(and (= 32 (select |#length| |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.base|)) (= 0 |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~b.offset|)), 392#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.offset 0) (= 32 (select |#length| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base))), 393#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.offset 0) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 31) (= 32 (select |#length| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~b.base)))] [2018-04-12 23:55:22,693 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-12 23:55:22,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:55:22,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:55:22,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:55:22,694 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-12 23:55:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,737 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-04-12 23:55:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:55:22,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-12 23:55:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,738 INFO L225 Difference]: With dead ends: 53 [2018-04-12 23:55:22,738 INFO L226 Difference]: Without dead ends: 53 [2018-04-12 23:55:22,739 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-12 23:55:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-12 23:55:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-12 23:55:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 23:55:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-12 23:55:22,742 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-04-12 23:55:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,743 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-12 23:55:22,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:55:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-12 23:55:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 23:55:22,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,744 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-12 23:55:22,744 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-12 23:55:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -869005287, now seen corresponding path program 1 times [2018-04-12 23:55:22,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,756 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,786 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-12 23:55:22,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:22,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-04-12 23:55:22,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,786 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-12 23:55:22,787 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 504#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-12 23:55:22,787 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-12 23:55:22,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:55:22,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:55:22,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:55:22,787 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-04-12 23:55:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,813 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-12 23:55:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:55:22,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-12 23:55:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,814 INFO L225 Difference]: With dead ends: 65 [2018-04-12 23:55:22,814 INFO L226 Difference]: Without dead ends: 65 [2018-04-12 23:55:22,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:55:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-12 23:55:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-12 23:55:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-12 23:55:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-04-12 23:55:22,817 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-04-12 23:55:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,817 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-04-12 23:55:22,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:55:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-04-12 23:55:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-12 23:55:22,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,818 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-12 23:55:22,818 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-12 23:55:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -994035242, now seen corresponding path program 1 times [2018-04-12 23:55:22,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,851 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-12 23:55:22,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:22,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 23:55:22,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,852 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-12 23:55:22,852 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 0 main_~i~1), 629#(<= 1 main_~i~1), 630#(and (<= main_~i~1 31) (<= 1 main_~i~1))] [2018-04-12 23:55:22,852 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-12 23:55:22,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:55:22,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:55:22,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:55:22,852 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-04-12 23:55:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:22,890 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-12 23:55:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:55:22,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-12 23:55:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:22,892 INFO L225 Difference]: With dead ends: 66 [2018-04-12 23:55:22,892 INFO L226 Difference]: Without dead ends: 66 [2018-04-12 23:55:22,892 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-12 23:55:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-12 23:55:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-04-12 23:55:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-12 23:55:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-12 23:55:22,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-04-12 23:55:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:22,896 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-12 23:55:22,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:55:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-12 23:55:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 23:55:22,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:22,897 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-12 23:55:22,897 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-12 23:55:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash -561761263, now seen corresponding path program 2 times [2018-04-12 23:55:22,898 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:22,908 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:22,950 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-12 23:55:22,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:22,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 23:55:22,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:22,950 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-12 23:55:22,951 INFO L182 omatonBuilderFactory]: Interpolants [752#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1), 753#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1), 754#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 755#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 756#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 749#true, 750#false, 751#(= main_~i~1 0)] [2018-04-12 23:55:22,951 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-12 23:55:22,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:55:22,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:55:22,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:55:22,952 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 8 states. [2018-04-12 23:55:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,062 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-04-12 23:55:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:55:23,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-12 23:55:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,064 INFO L225 Difference]: With dead ends: 82 [2018-04-12 23:55:23,064 INFO L226 Difference]: Without dead ends: 82 [2018-04-12 23:55:23,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:55:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-12 23:55:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-04-12 23:55:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-12 23:55:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-04-12 23:55:23,069 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-04-12 23:55:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,069 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-04-12 23:55:23,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:55:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-04-12 23:55:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-12 23:55:23,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,070 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-12 23:55:23,070 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-12 23:55:23,070 INFO L82 PathProgramCache]: Analyzing trace with hash 701046357, now seen corresponding path program 1 times [2018-04-12 23:55:23,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,078 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,118 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-12 23:55:23,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 23:55:23,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,119 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-12 23:55:23,119 INFO L182 omatonBuilderFactory]: Interpolants [917#true, 918#false, 919#(= main_~i~1 0), 920#(<= main_~i~1 1)] [2018-04-12 23:55:23,119 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-12 23:55:23,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 23:55:23,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 23:55:23,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:55:23,120 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 4 states. [2018-04-12 23:55:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,160 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-12 23:55:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 23:55:23,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-12 23:55:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,161 INFO L225 Difference]: With dead ends: 98 [2018-04-12 23:55:23,161 INFO L226 Difference]: Without dead ends: 98 [2018-04-12 23:55:23,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-12 23:55:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-12 23:55:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-04-12 23:55:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-12 23:55:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-04-12 23:55:23,165 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-04-12 23:55:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,165 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-04-12 23:55:23,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 23:55:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-04-12 23:55:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 23:55:23,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,165 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-12 23:55:23,166 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-12 23:55:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1455688847, now seen corresponding path program 1 times [2018-04-12 23:55:23,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,177 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,217 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-12 23:55:23,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 23:55:23,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 23:55:23,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,218 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-12 23:55:23,218 INFO L182 omatonBuilderFactory]: Interpolants [1104#(and (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0) (<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 1105#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1) 0), 1100#true, 1101#false, 1102#(<= 0 main_~i~1), 1103#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0))] [2018-04-12 23:55:23,218 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-12 23:55:23,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:55:23,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:55:23,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:55:23,219 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-04-12 23:55:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,291 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-12 23:55:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:55:23,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-12 23:55:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,292 INFO L225 Difference]: With dead ends: 87 [2018-04-12 23:55:23,292 INFO L226 Difference]: Without dead ends: 81 [2018-04-12 23:55:23,292 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-12 23:55:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-12 23:55:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-12 23:55:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-12 23:55:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-12 23:55:23,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-04-12 23:55:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,297 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-12 23:55:23,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:55:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-12 23:55:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 23:55:23,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,298 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-12 23:55:23,298 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-12 23:55:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1559883415, now seen corresponding path program 2 times [2018-04-12 23:55:23,299 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,311 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,344 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-12 23:55:23,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:55:23,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,345 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-12 23:55:23,345 INFO L182 omatonBuilderFactory]: Interpolants [1280#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 1281#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 0), 1276#true, 1277#false, 1278#(<= 0 main_~i~1), 1279#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0))] [2018-04-12 23:55:23,345 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-12 23:55:23,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 23:55:23,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 23:55:23,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 23:55:23,346 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-04-12 23:55:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,394 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-12 23:55:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:55:23,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-12 23:55:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,395 INFO L225 Difference]: With dead ends: 90 [2018-04-12 23:55:23,395 INFO L226 Difference]: Without dead ends: 84 [2018-04-12 23:55:23,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:55:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-12 23:55:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-04-12 23:55:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-12 23:55:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-12 23:55:23,399 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-04-12 23:55:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,400 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-12 23:55:23,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 23:55:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-12 23:55:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 23:55:23,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,401 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-12 23:55:23,401 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-12 23:55:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash -250620575, now seen corresponding path program 3 times [2018-04-12 23:55:23,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,416 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,451 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-12 23:55:23,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-12 23:55:23,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,452 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-12 23:55:23,452 INFO L182 omatonBuilderFactory]: Interpolants [1456#false, 1457#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 1458#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 1459#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 1455#true] [2018-04-12 23:55:23,452 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-12 23:55:23,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 23:55:23,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 23:55:23,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:55:23,453 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-04-12 23:55:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,490 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-04-12 23:55:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 23:55:23,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-04-12 23:55:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,491 INFO L225 Difference]: With dead ends: 93 [2018-04-12 23:55:23,491 INFO L226 Difference]: Without dead ends: 93 [2018-04-12 23:55:23,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 23:55:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-12 23:55:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-04-12 23:55:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-12 23:55:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-12 23:55:23,496 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 52 [2018-04-12 23:55:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,496 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-12 23:55:23,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 23:55:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-12 23:55:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 23:55:23,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,497 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:23,497 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-12 23:55:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash -246224039, now seen corresponding path program 4 times [2018-04-12 23:55:23,498 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-12 23:55:23,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:55:23,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,562 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-12 23:55:23,562 INFO L182 omatonBuilderFactory]: Interpolants [1648#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 1649#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 1640#true, 1641#false, 1642#(= main_~i~1 0), 1643#(<= main_~i~1 1), 1644#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 2), 1645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2), 1646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 1647#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-12 23:55:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-12 23:55:23,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 23:55:23,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 23:55:23,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:55:23,563 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-04-12 23:55:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,688 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-04-12 23:55:23,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:55:23,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-12 23:55:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,689 INFO L225 Difference]: With dead ends: 128 [2018-04-12 23:55:23,689 INFO L226 Difference]: Without dead ends: 128 [2018-04-12 23:55:23,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-04-12 23:55:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-12 23:55:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-04-12 23:55:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-12 23:55:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-12 23:55:23,694 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 58 [2018-04-12 23:55:23,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,694 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-12 23:55:23,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 23:55:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-12 23:55:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-12 23:55:23,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,695 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-12 23:55:23,696 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-12 23:55:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 404087573, now seen corresponding path program 1 times [2018-04-12 23:55:23,696 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,707 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,753 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-12 23:55:23,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 23:55:23,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,753 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-12 23:55:23,753 INFO L182 omatonBuilderFactory]: Interpolants [1904#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 31), 1905#(<= main_~i~1 30), 1906#(<= main_~i~1 31), 1899#true, 1900#false, 1901#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size), 1902#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 31)), 1903#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 32))] [2018-04-12 23:55:23,753 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-12 23:55:23,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:55:23,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:55:23,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:55:23,754 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 8 states. [2018-04-12 23:55:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,847 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-04-12 23:55:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 23:55:23,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-04-12 23:55:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,849 INFO L225 Difference]: With dead ends: 92 [2018-04-12 23:55:23,849 INFO L226 Difference]: Without dead ends: 92 [2018-04-12 23:55:23,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:55:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-12 23:55:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-04-12 23:55:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-12 23:55:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-04-12 23:55:23,852 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 67 [2018-04-12 23:55:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,852 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-04-12 23:55:23,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:55:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-04-12 23:55:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-12 23:55:23,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,853 INFO L355 BasicCegarLoop]: trace histogram [10, 8, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:23,853 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-12 23:55:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 760045737, now seen corresponding path program 5 times [2018-04-12 23:55:23,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,865 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-12 23:55:23,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:23,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 23:55:23,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:23,921 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-12 23:55:23,921 INFO L182 omatonBuilderFactory]: Interpolants [2100#true, 2101#false, 2102#(<= 0 main_~i~1), 2103#(<= 1 main_~i~1), 2104#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 2105#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 2106#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 2107#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 1)] [2018-04-12 23:55:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 153 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-12 23:55:23,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 23:55:23,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 23:55:23,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 23:55:23,922 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 8 states. [2018-04-12 23:55:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:23,978 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-04-12 23:55:23,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:55:23,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-04-12 23:55:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:23,979 INFO L225 Difference]: With dead ends: 101 [2018-04-12 23:55:23,979 INFO L226 Difference]: Without dead ends: 95 [2018-04-12 23:55:23,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:55:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-12 23:55:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-04-12 23:55:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-12 23:55:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-04-12 23:55:23,983 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 82 [2018-04-12 23:55:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:23,983 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-04-12 23:55:23,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 23:55:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-04-12 23:55:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-12 23:55:23,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:23,985 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-12 23:55:23,985 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-12 23:55:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -264260447, now seen corresponding path program 6 times [2018-04-12 23:55:23,986 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:23,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-12 23:55:24,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:24,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:55:24,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:24,090 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-12 23:55:24,090 INFO L182 omatonBuilderFactory]: Interpolants [2304#false, 2305#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 2306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 2307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 2308#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 2309#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 2303#true] [2018-04-12 23:55:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-12 23:55:24,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:55:24,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:55:24,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:55:24,090 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 7 states. [2018-04-12 23:55:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:24,139 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-04-12 23:55:24,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 23:55:24,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-04-12 23:55:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:24,140 INFO L225 Difference]: With dead ends: 104 [2018-04-12 23:55:24,140 INFO L226 Difference]: Without dead ends: 104 [2018-04-12 23:55:24,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:55:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-12 23:55:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-04-12 23:55:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-12 23:55:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-04-12 23:55:24,143 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 88 [2018-04-12 23:55:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:24,143 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-04-12 23:55:24,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:55:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-04-12 23:55:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-12 23:55:24,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:24,148 INFO L355 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:24,149 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-12 23:55:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1483627161, now seen corresponding path program 7 times [2018-04-12 23:55:24,149 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:24,161 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-12 23:55:24,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:24,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:55:24,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:24,229 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-12 23:55:24,229 INFO L182 omatonBuilderFactory]: Interpolants [2516#true, 2517#false, 2518#(= main_~i~1 0), 2519#(<= main_~i~1 1), 2520#(<= main_~i~1 2), 2521#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 3), 2522#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3), 2523#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 2524#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 2525#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 2526#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 2527#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 194 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-12 23:55:24,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 23:55:24,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 23:55:24,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:55:24,230 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 12 states. [2018-04-12 23:55:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:24,335 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-04-12 23:55:24,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 23:55:24,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-04-12 23:55:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:24,336 INFO L225 Difference]: With dead ends: 136 [2018-04-12 23:55:24,336 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 23:55:24,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-04-12 23:55:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 23:55:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-04-12 23:55:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 23:55:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-04-12 23:55:24,339 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 94 [2018-04-12 23:55:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:24,339 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-04-12 23:55:24,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 23:55:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-04-12 23:55:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-12 23:55:24,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:24,340 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-12 23:55:24,340 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-12 23:55:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1650581535, now seen corresponding path program 8 times [2018-04-12 23:55:24,341 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:24,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:24,405 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-12 23:55:24,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:24,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:55:24,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:24,405 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-12 23:55:24,405 INFO L182 omatonBuilderFactory]: Interpolants [2816#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 2817#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 2), 2808#true, 2809#false, 2810#(<= 0 main_~i~1), 2811#(<= 1 main_~i~1), 2812#(<= 2 main_~i~1), 2813#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 2814#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 2815#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2))] [2018-04-12 23:55:24,406 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-12 23:55:24,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 23:55:24,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 23:55:24,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:55:24,406 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 10 states. [2018-04-12 23:55:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:24,471 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-04-12 23:55:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 23:55:24,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-04-12 23:55:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:24,472 INFO L225 Difference]: With dead ends: 143 [2018-04-12 23:55:24,473 INFO L226 Difference]: Without dead ends: 137 [2018-04-12 23:55:24,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:55:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-12 23:55:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-04-12 23:55:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 23:55:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-04-12 23:55:24,476 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 124 [2018-04-12 23:55:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:24,476 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-04-12 23:55:24,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 23:55:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-04-12 23:55:24,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-12 23:55:24,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:24,478 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-12 23:55:24,478 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-12 23:55:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1018374617, now seen corresponding path program 9 times [2018-04-12 23:55:24,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:24,495 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:24,555 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-12 23:55:24,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:24,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-12 23:55:24,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:24,555 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-12 23:55:24,556 INFO L182 omatonBuilderFactory]: Interpolants [3104#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 3105#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 3099#true, 3100#false, 3101#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 3102#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 3103#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2))] [2018-04-12 23:55:24,556 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-12 23:55:24,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 23:55:24,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 23:55:24,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:55:24,557 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 7 states. [2018-04-12 23:55:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:24,615 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-04-12 23:55:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 23:55:24,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-04-12 23:55:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:24,616 INFO L225 Difference]: With dead ends: 146 [2018-04-12 23:55:24,616 INFO L226 Difference]: Without dead ends: 146 [2018-04-12 23:55:24,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 23:55:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-12 23:55:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-04-12 23:55:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-12 23:55:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-04-12 23:55:24,618 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 130 [2018-04-12 23:55:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:24,618 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-04-12 23:55:24,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 23:55:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-04-12 23:55:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-04-12 23:55:24,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:24,619 INFO L355 BasicCegarLoop]: trace histogram [18, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:24,619 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-12 23:55:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 236127697, now seen corresponding path program 10 times [2018-04-12 23:55:24,620 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:24,629 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-12 23:55:24,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:24,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 23:55:24,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:24,729 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-12 23:55:24,729 INFO L182 omatonBuilderFactory]: Interpolants [3392#true, 3393#false, 3394#(= main_~i~1 0), 3395#(<= main_~i~1 1), 3396#(<= main_~i~1 2), 3397#(<= main_~i~1 3), 3398#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 4), 3399#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4), 3400#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 3401#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 3402#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 3403#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 3404#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 3405#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 397 proven. 44 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-12 23:55:24,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 23:55:24,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 23:55:24,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-04-12 23:55:24,730 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 14 states. [2018-04-12 23:55:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:24,921 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-04-12 23:55:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 23:55:24,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-04-12 23:55:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:24,922 INFO L225 Difference]: With dead ends: 184 [2018-04-12 23:55:24,922 INFO L226 Difference]: Without dead ends: 184 [2018-04-12 23:55:24,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-04-12 23:55:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-12 23:55:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-04-12 23:55:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-12 23:55:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-04-12 23:55:24,927 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 136 [2018-04-12 23:55:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:24,928 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-04-12 23:55:24,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 23:55:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-04-12 23:55:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-12 23:55:24,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:24,929 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-12 23:55:24,929 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-12 23:55:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1774140143, now seen corresponding path program 11 times [2018-04-12 23:55:24,930 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:24,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:25,039 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-12 23:55:25,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:25,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:55:25,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:25,040 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-12 23:55:25,040 INFO L182 omatonBuilderFactory]: Interpolants [3792#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 3793#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 3794#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 3795#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 3), 3784#true, 3785#false, 3786#(<= 0 main_~i~1), 3787#(<= 1 main_~i~1), 3788#(<= 2 main_~i~1), 3789#(<= 3 main_~i~1), 3790#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 3791#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1))] [2018-04-12 23:55:25,041 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-12 23:55:25,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-12 23:55:25,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-12 23:55:25,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-12 23:55:25,041 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand 12 states. [2018-04-12 23:55:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:25,175 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-04-12 23:55:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 23:55:25,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-04-12 23:55:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:25,176 INFO L225 Difference]: With dead ends: 191 [2018-04-12 23:55:25,177 INFO L226 Difference]: Without dead ends: 185 [2018-04-12 23:55:25,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-12 23:55:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-12 23:55:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-04-12 23:55:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-12 23:55:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-04-12 23:55:25,181 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 172 [2018-04-12 23:55:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:25,181 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-04-12 23:55:25,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-12 23:55:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-04-12 23:55:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-12 23:55:25,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:25,182 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-12 23:55:25,183 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-12 23:55:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1375873801, now seen corresponding path program 12 times [2018-04-12 23:55:25,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:25,202 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:25,271 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-12 23:55:25,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:25,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-12 23:55:25,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:25,272 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-12 23:55:25,272 INFO L182 omatonBuilderFactory]: Interpolants [4176#false, 4177#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 4178#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 4179#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 4180#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 4181#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 4182#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 4183#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 4175#true] [2018-04-12 23:55:25,272 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-12 23:55:25,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 23:55:25,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 23:55:25,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 23:55:25,273 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 9 states. [2018-04-12 23:55:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:25,363 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-04-12 23:55:25,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 23:55:25,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2018-04-12 23:55:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:25,365 INFO L225 Difference]: With dead ends: 194 [2018-04-12 23:55:25,365 INFO L226 Difference]: Without dead ends: 194 [2018-04-12 23:55:25,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:55:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-12 23:55:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-04-12 23:55:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-12 23:55:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-04-12 23:55:25,369 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 178 [2018-04-12 23:55:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:25,369 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-04-12 23:55:25,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 23:55:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-04-12 23:55:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-12 23:55:25,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:25,371 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-12 23:55:25,371 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-12 23:55:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2106090241, now seen corresponding path program 13 times [2018-04-12 23:55:25,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:25,390 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:25,525 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-12 23:55:25,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:25,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 23:55:25,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:25,526 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-12 23:55:25,526 INFO L182 omatonBuilderFactory]: Interpolants [4576#(= main_~i~1 0), 4577#(<= main_~i~1 1), 4578#(<= main_~i~1 2), 4579#(<= main_~i~1 3), 4580#(<= main_~i~1 4), 4581#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 5), 4582#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5), 4583#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 4584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 4585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 4586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 4587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 4588#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 4589#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 4574#true, 4575#false] [2018-04-12 23:55:25,527 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-12 23:55:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 23:55:25,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 23:55:25,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-12 23:55:25,528 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 16 states. [2018-04-12 23:55:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:25,758 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-04-12 23:55:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 23:55:25,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 184 [2018-04-12 23:55:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:25,760 INFO L225 Difference]: With dead ends: 238 [2018-04-12 23:55:25,760 INFO L226 Difference]: Without dead ends: 238 [2018-04-12 23:55:25,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-04-12 23:55:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-12 23:55:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-04-12 23:55:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-12 23:55:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 239 transitions. [2018-04-12 23:55:25,763 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 239 transitions. Word has length 184 [2018-04-12 23:55:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:25,764 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-04-12 23:55:25,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 23:55:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 239 transitions. [2018-04-12 23:55:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-04-12 23:55:25,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:25,764 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-12 23:55:25,764 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-12 23:55:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1356019769, now seen corresponding path program 14 times [2018-04-12 23:55:25,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:25,779 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:25,870 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-12 23:55:25,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:25,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 23:55:25,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:25,871 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-12 23:55:25,871 INFO L182 omatonBuilderFactory]: Interpolants [5088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 5089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 5090#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 5091#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 4), 5078#true, 5079#false, 5080#(<= 0 main_~i~1), 5081#(<= 1 main_~i~1), 5082#(<= 2 main_~i~1), 5083#(<= 3 main_~i~1), 5084#(<= 4 main_~i~1), 5085#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 5086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 5087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2))] [2018-04-12 23:55:25,871 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-12 23:55:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 23:55:25,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 23:55:25,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-12 23:55:25,872 INFO L87 Difference]: Start difference. First operand 236 states and 239 transitions. Second operand 14 states. [2018-04-12 23:55:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:25,989 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-04-12 23:55:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 23:55:25,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-04-12 23:55:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:25,990 INFO L225 Difference]: With dead ends: 245 [2018-04-12 23:55:25,990 INFO L226 Difference]: Without dead ends: 239 [2018-04-12 23:55:25,991 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:55:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-12 23:55:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-04-12 23:55:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-12 23:55:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-04-12 23:55:25,993 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 226 [2018-04-12 23:55:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:25,993 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-04-12 23:55:25,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 23:55:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-04-12 23:55:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-12 23:55:25,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:25,994 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-12 23:55:25,994 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-12 23:55:25,995 INFO L82 PathProgramCache]: Analyzing trace with hash 901554225, now seen corresponding path program 15 times [2018-04-12 23:55:25,995 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:26,011 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:26,101 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-12 23:55:26,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:26,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-12 23:55:26,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:26,102 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-12 23:55:26,102 INFO L182 omatonBuilderFactory]: Interpolants [5584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 5585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 5586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 5587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 5588#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 5589#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 5590#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 5581#true, 5582#false, 5583#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)] [2018-04-12 23:55:26,103 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-12 23:55:26,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 23:55:26,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 23:55:26,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-12 23:55:26,104 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 10 states. [2018-04-12 23:55:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:26,181 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-04-12 23:55:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 23:55:26,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-04-12 23:55:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:26,183 INFO L225 Difference]: With dead ends: 248 [2018-04-12 23:55:26,183 INFO L226 Difference]: Without dead ends: 248 [2018-04-12 23:55:26,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-04-12 23:55:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-12 23:55:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2018-04-12 23:55:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-12 23:55:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2018-04-12 23:55:26,187 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 232 [2018-04-12 23:55:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:26,187 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2018-04-12 23:55:26,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 23:55:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2018-04-12 23:55:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-12 23:55:26,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:26,188 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-12 23:55:26,188 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-12 23:55:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1429186007, now seen corresponding path program 16 times [2018-04-12 23:55:26,189 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:26,205 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:26,349 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-12 23:55:26,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:26,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 23:55:26,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:26,350 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-12 23:55:26,350 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= main_~i~1 0), 6094#(<= main_~i~1 1), 6095#(<= main_~i~1 2), 6096#(<= main_~i~1 3), 6097#(<= main_~i~1 4), 6098#(<= main_~i~1 5), 6099#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 6), 6100#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6), 6101#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 6102#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 6103#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 6104#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 6105#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 6106#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 6107#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 6108#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:26,351 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-12 23:55:26,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 23:55:26,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 23:55:26,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:55:26,352 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 18 states. [2018-04-12 23:55:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:26,599 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-04-12 23:55:26,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 23:55:26,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2018-04-12 23:55:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:26,600 INFO L225 Difference]: With dead ends: 298 [2018-04-12 23:55:26,600 INFO L226 Difference]: Without dead ends: 298 [2018-04-12 23:55:26,600 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2018-04-12 23:55:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-12 23:55:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-04-12 23:55:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-12 23:55:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2018-04-12 23:55:26,603 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 238 [2018-04-12 23:55:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:26,604 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2018-04-12 23:55:26,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 23:55:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2018-04-12 23:55:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-04-12 23:55:26,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:26,605 INFO L355 BasicCegarLoop]: trace histogram [40, 34, 33, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:26,605 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-12 23:55:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1943743655, now seen corresponding path program 17 times [2018-04-12 23:55:26,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:26,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-04-12 23:55:26,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:26,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 23:55:26,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:26,802 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-12 23:55:26,802 INFO L182 omatonBuilderFactory]: Interpolants [6720#false, 6721#(<= 0 main_~i~1), 6722#(<= 1 main_~i~1), 6723#(<= 2 main_~i~1), 6724#(<= 3 main_~i~1), 6725#(<= 4 main_~i~1), 6726#(<= 5 main_~i~1), 6727#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 6728#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 6729#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 6730#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 6731#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 6732#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 6733#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 6734#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 5), 6719#true] [2018-04-12 23:55:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3885 backedges. 2231 proven. 102 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2018-04-12 23:55:26,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 23:55:26,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 23:55:26,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-12 23:55:26,804 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 16 states. [2018-04-12 23:55:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:27,069 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-04-12 23:55:27,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 23:55:27,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 286 [2018-04-12 23:55:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:27,072 INFO L225 Difference]: With dead ends: 305 [2018-04-12 23:55:27,072 INFO L226 Difference]: Without dead ends: 299 [2018-04-12 23:55:27,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:55:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-12 23:55:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-04-12 23:55:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-12 23:55:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2018-04-12 23:55:27,077 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 286 [2018-04-12 23:55:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:27,077 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2018-04-12 23:55:27,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 23:55:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2018-04-12 23:55:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-12 23:55:27,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:27,079 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-12 23:55:27,079 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-12 23:55:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1874435247, now seen corresponding path program 18 times [2018-04-12 23:55:27,080 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:27,105 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-12 23:55:27,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:27,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:55:27,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:27,215 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-12 23:55:27,215 INFO L182 omatonBuilderFactory]: Interpolants [7346#true, 7347#false, 7348#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 7349#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 7350#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 7351#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 7352#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 7353#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 7354#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 7355#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 7356#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7))] [2018-04-12 23:55:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1311 proven. 147 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-12 23:55:27,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:55:27,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:55:27,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:55:27,217 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 11 states. [2018-04-12 23:55:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:27,336 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-04-12 23:55:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 23:55:27,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 292 [2018-04-12 23:55:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:27,338 INFO L225 Difference]: With dead ends: 308 [2018-04-12 23:55:27,338 INFO L226 Difference]: Without dead ends: 308 [2018-04-12 23:55:27,338 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-04-12 23:55:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-12 23:55:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2018-04-12 23:55:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-12 23:55:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 304 transitions. [2018-04-12 23:55:27,343 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 304 transitions. Word has length 292 [2018-04-12 23:55:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:27,343 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 304 transitions. [2018-04-12 23:55:27,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:55:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 304 transitions. [2018-04-12 23:55:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-04-12 23:55:27,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:27,345 INFO L355 BasicCegarLoop]: trace histogram [42, 36, 35, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:27,345 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-12 23:55:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 914572617, now seen corresponding path program 19 times [2018-04-12 23:55:27,346 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:27,373 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-12 23:55:27,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:27,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 23:55:27,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:27,616 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-12 23:55:27,616 INFO L182 omatonBuilderFactory]: Interpolants [7979#true, 7980#false, 7981#(= main_~i~1 0), 7982#(<= main_~i~1 1), 7983#(<= main_~i~1 2), 7984#(<= main_~i~1 3), 7985#(<= main_~i~1 4), 7986#(<= main_~i~1 5), 7987#(<= main_~i~1 6), 7988#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 7), 7989#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7), 7990#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 7991#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 7992#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 7993#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 7994#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 7995#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 7996#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 7997#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 7998#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4317 backedges. 1660 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-12 23:55:27,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 23:55:27,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 23:55:27,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-04-12 23:55:27,619 INFO L87 Difference]: Start difference. First operand 302 states and 304 transitions. Second operand 20 states. [2018-04-12 23:55:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:27,921 INFO L93 Difference]: Finished difference Result 364 states and 367 transitions. [2018-04-12 23:55:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 23:55:27,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 298 [2018-04-12 23:55:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:27,922 INFO L225 Difference]: With dead ends: 364 [2018-04-12 23:55:27,922 INFO L226 Difference]: Without dead ends: 364 [2018-04-12 23:55:27,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-04-12 23:55:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-12 23:55:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-04-12 23:55:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-12 23:55:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 365 transitions. [2018-04-12 23:55:27,926 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 365 transitions. Word has length 298 [2018-04-12 23:55:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:27,926 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 365 transitions. [2018-04-12 23:55:27,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 23:55:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 365 transitions. [2018-04-12 23:55:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-12 23:55:27,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:27,928 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-12 23:55:27,928 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-12 23:55:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -604052879, now seen corresponding path program 20 times [2018-04-12 23:55:27,929 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:27,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:28,220 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-12 23:55:28,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:28,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 23:55:28,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:28,221 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-12 23:55:28,221 INFO L182 omatonBuilderFactory]: Interpolants [8743#true, 8744#false, 8745#(<= 0 main_~i~1), 8746#(<= 1 main_~i~1), 8747#(<= 2 main_~i~1), 8748#(<= 3 main_~i~1), 8749#(<= 4 main_~i~1), 8750#(<= 5 main_~i~1), 8751#(<= 6 main_~i~1), 8752#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 8753#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 8754#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 8755#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 8756#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 8757#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 8758#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 8759#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 8760#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 6)] [2018-04-12 23:55:28,222 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-12 23:55:28,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 23:55:28,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 23:55:28,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:55:28,223 INFO L87 Difference]: Start difference. First operand 362 states and 365 transitions. Second operand 18 states. [2018-04-12 23:55:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:28,557 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-04-12 23:55:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 23:55:28,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-04-12 23:55:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:28,559 INFO L225 Difference]: With dead ends: 371 [2018-04-12 23:55:28,559 INFO L226 Difference]: Without dead ends: 365 [2018-04-12 23:55:28,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-04-12 23:55:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-12 23:55:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-04-12 23:55:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-04-12 23:55:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2018-04-12 23:55:28,565 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 352 [2018-04-12 23:55:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:28,565 INFO L459 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2018-04-12 23:55:28,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 23:55:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2018-04-12 23:55:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-12 23:55:28,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:28,567 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-12 23:55:28,567 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-12 23:55:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash 608157801, now seen corresponding path program 21 times [2018-04-12 23:55:28,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:28,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:28,777 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-12 23:55:28,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:28,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-12 23:55:28,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:28,778 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-12 23:55:28,778 INFO L182 omatonBuilderFactory]: Interpolants [9506#true, 9507#false, 9508#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 9509#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 9510#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 9511#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 9512#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 9513#(and (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 9514#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 9515#(and (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 9516#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0))] [2018-04-12 23:55:28,779 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-12 23:55:28,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 23:55:28,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 23:55:28,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:55:28,779 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 11 states. [2018-04-12 23:55:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:28,966 INFO L93 Difference]: Finished difference Result 374 states and 376 transitions. [2018-04-12 23:55:28,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 23:55:28,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-04-12 23:55:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:28,968 INFO L225 Difference]: With dead ends: 374 [2018-04-12 23:55:28,968 INFO L226 Difference]: Without dead ends: 374 [2018-04-12 23:55:28,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-12 23:55:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-12 23:55:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2018-04-12 23:55:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-04-12 23:55:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 370 transitions. [2018-04-12 23:55:28,974 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 370 transitions. Word has length 358 [2018-04-12 23:55:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:28,975 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 370 transitions. [2018-04-12 23:55:28,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 23:55:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 370 transitions. [2018-04-12 23:55:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-12 23:55:28,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:28,993 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-12 23:55:28,993 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-12 23:55:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash -992448415, now seen corresponding path program 22 times [2018-04-12 23:55:28,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:29,027 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:29,271 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-12 23:55:29,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:29,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 23:55:29,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:29,272 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-12 23:55:29,272 INFO L182 omatonBuilderFactory]: Interpolants [10272#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 10273#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 10274#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 10275#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 10276#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 10277#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 10278#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 10279#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 10280#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 10259#true, 10260#false, 10261#(= main_~i~1 0), 10262#(<= main_~i~1 1), 10263#(<= main_~i~1 2), 10264#(<= main_~i~1 3), 10265#(<= main_~i~1 4), 10266#(<= main_~i~1 5), 10267#(<= main_~i~1 6), 10268#(<= main_~i~1 7), 10269#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 8), 10270#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8), 10271#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8))] [2018-04-12 23:55:29,273 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-12 23:55:29,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 23:55:29,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 23:55:29,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-04-12 23:55:29,273 INFO L87 Difference]: Start difference. First operand 368 states and 370 transitions. Second operand 22 states. [2018-04-12 23:55:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:29,639 INFO L93 Difference]: Finished difference Result 436 states and 439 transitions. [2018-04-12 23:55:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 23:55:29,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 364 [2018-04-12 23:55:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:29,641 INFO L225 Difference]: With dead ends: 436 [2018-04-12 23:55:29,642 INFO L226 Difference]: Without dead ends: 436 [2018-04-12 23:55:29,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:55:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-12 23:55:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-04-12 23:55:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-12 23:55:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 437 transitions. [2018-04-12 23:55:29,648 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 437 transitions. Word has length 364 [2018-04-12 23:55:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:29,649 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 437 transitions. [2018-04-12 23:55:29,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 23:55:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 437 transitions. [2018-04-12 23:55:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-12 23:55:29,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:29,651 INFO L355 BasicCegarLoop]: trace histogram [61, 53, 52, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:29,651 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-12 23:55:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1036409983, now seen corresponding path program 23 times [2018-04-12 23:55:29,652 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:29,687 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-04-12 23:55:29,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:29,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 23:55:29,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:29,937 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-12 23:55:29,937 INFO L182 omatonBuilderFactory]: Interpolants [11171#true, 11172#false, 11173#(<= 0 main_~i~1), 11174#(<= 1 main_~i~1), 11175#(<= 2 main_~i~1), 11176#(<= 3 main_~i~1), 11177#(<= 4 main_~i~1), 11178#(<= 5 main_~i~1), 11179#(<= 6 main_~i~1), 11180#(<= 7 main_~i~1), 11181#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 11182#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 11183#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 11184#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 11185#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 11186#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 11187#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 11188#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 11189#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 11190#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 7)] [2018-04-12 23:55:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9336 backedges. 4716 proven. 184 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2018-04-12 23:55:29,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-12 23:55:29,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-12 23:55:29,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-04-12 23:55:29,938 INFO L87 Difference]: Start difference. First operand 434 states and 437 transitions. Second operand 20 states. [2018-04-12 23:55:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:30,230 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-04-12 23:55:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 23:55:30,230 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 424 [2018-04-12 23:55:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:30,232 INFO L225 Difference]: With dead ends: 443 [2018-04-12 23:55:30,232 INFO L226 Difference]: Without dead ends: 437 [2018-04-12 23:55:30,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-04-12 23:55:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-12 23:55:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-04-12 23:55:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-12 23:55:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-04-12 23:55:30,238 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 424 [2018-04-12 23:55:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:30,239 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-04-12 23:55:30,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-12 23:55:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-04-12 23:55:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-04-12 23:55:30,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:30,240 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-12 23:55:30,240 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-12 23:55:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 64648569, now seen corresponding path program 24 times [2018-04-12 23:55:30,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:30,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:30,470 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-12 23:55:30,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:30,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-12 23:55:30,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:30,471 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-12 23:55:30,471 INFO L182 omatonBuilderFactory]: Interpolants [12082#true, 12083#false, 12084#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 12085#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 12086#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 12087#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 12088#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 12089#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 12090#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 12091#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 12092#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 12093#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 12094#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9))] [2018-04-12 23:55:30,472 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-12 23:55:30,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-12 23:55:30,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-12 23:55:30,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-04-12 23:55:30,473 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 13 states. [2018-04-12 23:55:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:30,643 INFO L93 Difference]: Finished difference Result 446 states and 448 transitions. [2018-04-12 23:55:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-12 23:55:30,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 430 [2018-04-12 23:55:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:30,646 INFO L225 Difference]: With dead ends: 446 [2018-04-12 23:55:30,646 INFO L226 Difference]: Without dead ends: 446 [2018-04-12 23:55:30,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:55:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-04-12 23:55:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2018-04-12 23:55:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-12 23:55:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 442 transitions. [2018-04-12 23:55:30,653 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 442 transitions. Word has length 430 [2018-04-12 23:55:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:30,654 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 442 transitions. [2018-04-12 23:55:30,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-12 23:55:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 442 transitions. [2018-04-12 23:55:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-12 23:55:30,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:30,658 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-12 23:55:30,658 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-12 23:55:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 523966833, now seen corresponding path program 25 times [2018-04-12 23:55:30,659 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:30,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:30,989 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-12 23:55:30,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:30,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 23:55:30,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:30,990 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-12 23:55:30,990 INFO L182 omatonBuilderFactory]: Interpolants [12997#true, 12998#false, 12999#(= main_~i~1 0), 13000#(<= main_~i~1 1), 13001#(<= main_~i~1 2), 13002#(<= main_~i~1 3), 13003#(<= main_~i~1 4), 13004#(<= main_~i~1 5), 13005#(<= main_~i~1 6), 13006#(<= main_~i~1 7), 13007#(<= main_~i~1 8), 13008#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 9), 13009#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9), 13010#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 13011#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 13012#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 13013#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 13014#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 13015#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 13016#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 13017#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 13018#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 13019#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 13020#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:30,991 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-12 23:55:30,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 23:55:30,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 23:55:30,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-04-12 23:55:30,991 INFO L87 Difference]: Start difference. First operand 440 states and 442 transitions. Second operand 24 states. [2018-04-12 23:55:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:31,322 INFO L93 Difference]: Finished difference Result 514 states and 517 transitions. [2018-04-12 23:55:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 23:55:31,323 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 436 [2018-04-12 23:55:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:31,324 INFO L225 Difference]: With dead ends: 514 [2018-04-12 23:55:31,324 INFO L226 Difference]: Without dead ends: 514 [2018-04-12 23:55:31,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 23:55:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-12 23:55:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2018-04-12 23:55:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-04-12 23:55:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 515 transitions. [2018-04-12 23:55:31,331 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 515 transitions. Word has length 436 [2018-04-12 23:55:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:31,331 INFO L459 AbstractCegarLoop]: Abstraction has 512 states and 515 transitions. [2018-04-12 23:55:31,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 23:55:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 515 transitions. [2018-04-12 23:55:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-12 23:55:31,334 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:31,334 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-12 23:55:31,334 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-12 23:55:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 282969737, now seen corresponding path program 26 times [2018-04-12 23:55:31,335 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:31,376 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:31,639 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-12 23:55:31,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:31,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 23:55:31,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:31,640 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-12 23:55:31,640 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 14081#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 14082#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 14083#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 14084#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 14085#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 14086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 14087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 14088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 14089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 14090#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 8), 14069#true, 14070#false, 14071#(<= 0 main_~i~1), 14072#(<= 1 main_~i~1), 14073#(<= 2 main_~i~1), 14074#(<= 3 main_~i~1), 14075#(<= 4 main_~i~1), 14076#(<= 5 main_~i~1), 14077#(<= 6 main_~i~1), 14078#(<= 7 main_~i~1), 14079#(<= 8 main_~i~1)] [2018-04-12 23:55:31,640 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-12 23:55:31,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 23:55:31,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 23:55:31,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-04-12 23:55:31,641 INFO L87 Difference]: Start difference. First operand 512 states and 515 transitions. Second operand 22 states. [2018-04-12 23:55:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:31,932 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-04-12 23:55:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 23:55:31,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 502 [2018-04-12 23:55:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:31,934 INFO L225 Difference]: With dead ends: 521 [2018-04-12 23:55:31,934 INFO L226 Difference]: Without dead ends: 515 [2018-04-12 23:55:31,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:55:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-04-12 23:55:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2018-04-12 23:55:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-04-12 23:55:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 513 transitions. [2018-04-12 23:55:31,941 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 513 transitions. Word has length 502 [2018-04-12 23:55:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:31,941 INFO L459 AbstractCegarLoop]: Abstraction has 512 states and 513 transitions. [2018-04-12 23:55:31,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 23:55:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 513 transitions. [2018-04-12 23:55:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-12 23:55:31,944 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:31,945 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-12 23:55:31,945 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-12 23:55:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 870003329, now seen corresponding path program 27 times [2018-04-12 23:55:31,946 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:31,986 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:32,197 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-12 23:55:32,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:32,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-12 23:55:32,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:32,198 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-12 23:55:32,198 INFO L182 omatonBuilderFactory]: Interpolants [15140#true, 15141#false, 15142#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 15143#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 15144#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 15145#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 15146#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 15147#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 15148#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 15149#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 15150#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 15151#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 15152#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 15153#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0))] [2018-04-12 23:55:32,198 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-12 23:55:32,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-12 23:55:32,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-12 23:55:32,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-12 23:55:32,199 INFO L87 Difference]: Start difference. First operand 512 states and 513 transitions. Second operand 14 states. [2018-04-12 23:55:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:32,330 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-04-12 23:55:32,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-12 23:55:32,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 508 [2018-04-12 23:55:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:32,331 INFO L225 Difference]: With dead ends: 524 [2018-04-12 23:55:32,331 INFO L226 Difference]: Without dead ends: 524 [2018-04-12 23:55:32,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2018-04-12 23:55:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-12 23:55:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 518. [2018-04-12 23:55:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-12 23:55:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 520 transitions. [2018-04-12 23:55:32,335 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 520 transitions. Word has length 508 [2018-04-12 23:55:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:32,335 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 520 transitions. [2018-04-12 23:55:32,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-12 23:55:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 520 transitions. [2018-04-12 23:55:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-12 23:55:32,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:32,337 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-12 23:55:32,337 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-12 23:55:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -265555847, now seen corresponding path program 28 times [2018-04-12 23:55:32,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:32,362 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:32,697 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-12 23:55:32,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:32,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 23:55:32,697 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:32,698 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-12 23:55:32,698 INFO L182 omatonBuilderFactory]: Interpolants [16214#true, 16215#false, 16216#(= main_~i~1 0), 16217#(<= main_~i~1 1), 16218#(<= main_~i~1 2), 16219#(<= main_~i~1 3), 16220#(<= main_~i~1 4), 16221#(<= main_~i~1 5), 16222#(<= main_~i~1 6), 16223#(<= main_~i~1 7), 16224#(<= main_~i~1 8), 16225#(<= main_~i~1 9), 16226#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 10), 16227#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10), 16228#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 16229#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 16230#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 16231#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 16232#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 16233#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 16234#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 16235#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 16236#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 16237#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 16238#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 16239#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:32,698 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-12 23:55:32,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 23:55:32,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 23:55:32,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-04-12 23:55:32,699 INFO L87 Difference]: Start difference. First operand 518 states and 520 transitions. Second operand 26 states. [2018-04-12 23:55:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:32,941 INFO L93 Difference]: Finished difference Result 598 states and 601 transitions. [2018-04-12 23:55:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 23:55:32,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 514 [2018-04-12 23:55:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:32,943 INFO L225 Difference]: With dead ends: 598 [2018-04-12 23:55:32,943 INFO L226 Difference]: Without dead ends: 598 [2018-04-12 23:55:32,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 23:55:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-04-12 23:55:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2018-04-12 23:55:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-04-12 23:55:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 599 transitions. [2018-04-12 23:55:32,949 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 599 transitions. Word has length 514 [2018-04-12 23:55:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:32,950 INFO L459 AbstractCegarLoop]: Abstraction has 596 states and 599 transitions. [2018-04-12 23:55:32,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 23:55:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 599 transitions. [2018-04-12 23:55:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-04-12 23:55:32,953 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:32,953 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-12 23:55:32,954 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-12 23:55:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -579703415, now seen corresponding path program 29 times [2018-04-12 23:55:32,955 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:32,997 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:33,341 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-12 23:55:33,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:33,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 23:55:33,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:33,341 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-12 23:55:33,341 INFO L182 omatonBuilderFactory]: Interpolants [17472#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 17473#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 17474#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 17475#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 17476#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 17477#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 17478#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 17479#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 17480#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 17481#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 9), 17458#true, 17459#false, 17460#(<= 0 main_~i~1), 17461#(<= 1 main_~i~1), 17462#(<= 2 main_~i~1), 17463#(<= 3 main_~i~1), 17464#(<= 4 main_~i~1), 17465#(<= 5 main_~i~1), 17466#(<= 6 main_~i~1), 17467#(<= 7 main_~i~1), 17468#(<= 8 main_~i~1), 17469#(<= 9 main_~i~1), 17470#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 17471#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1))] [2018-04-12 23:55:33,342 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-12 23:55:33,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 23:55:33,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 23:55:33,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-04-12 23:55:33,342 INFO L87 Difference]: Start difference. First operand 596 states and 599 transitions. Second operand 24 states. [2018-04-12 23:55:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:33,680 INFO L93 Difference]: Finished difference Result 605 states and 606 transitions. [2018-04-12 23:55:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 23:55:33,680 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 586 [2018-04-12 23:55:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:33,681 INFO L225 Difference]: With dead ends: 605 [2018-04-12 23:55:33,681 INFO L226 Difference]: Without dead ends: 599 [2018-04-12 23:55:33,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 23:55:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-12 23:55:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2018-04-12 23:55:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-04-12 23:55:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 597 transitions. [2018-04-12 23:55:33,686 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 597 transitions. Word has length 586 [2018-04-12 23:55:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:33,686 INFO L459 AbstractCegarLoop]: Abstraction has 596 states and 597 transitions. [2018-04-12 23:55:33,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 23:55:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 597 transitions. [2018-04-12 23:55:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-12 23:55:33,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:33,688 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-12 23:55:33,688 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-12 23:55:33,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1818728833, now seen corresponding path program 30 times [2018-04-12 23:55:33,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:33,715 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:33,979 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-12 23:55:33,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:33,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-12 23:55:33,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:33,979 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-12 23:55:33,980 INFO L182 omatonBuilderFactory]: Interpolants [18701#true, 18702#false, 18703#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 18704#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 18705#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 18706#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 18707#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 18708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 18709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 18710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 18711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 18712#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 18713#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 18714#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 18715#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-12 23:55:33,980 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-12 23:55:33,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-12 23:55:33,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-12 23:55:33,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-04-12 23:55:33,981 INFO L87 Difference]: Start difference. First operand 596 states and 597 transitions. Second operand 15 states. [2018-04-12 23:55:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:34,161 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2018-04-12 23:55:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 23:55:34,161 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 592 [2018-04-12 23:55:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:34,162 INFO L225 Difference]: With dead ends: 608 [2018-04-12 23:55:34,162 INFO L226 Difference]: Without dead ends: 608 [2018-04-12 23:55:34,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-04-12 23:55:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-12 23:55:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2018-04-12 23:55:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-12 23:55:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 604 transitions. [2018-04-12 23:55:34,167 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 604 transitions. Word has length 592 [2018-04-12 23:55:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:34,168 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 604 transitions. [2018-04-12 23:55:34,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-12 23:55:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 604 transitions. [2018-04-12 23:55:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-12 23:55:34,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:34,172 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-12 23:55:34,172 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-12 23:55:34,172 INFO L82 PathProgramCache]: Analyzing trace with hash 831461241, now seen corresponding path program 31 times [2018-04-12 23:55:34,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:34,215 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:34,596 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-12 23:55:34,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:34,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 23:55:34,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:34,597 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-12 23:55:34,597 INFO L182 omatonBuilderFactory]: Interpolants [19968#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 19969#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 19970#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 19971#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 19972#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 19973#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 19946#true, 19947#false, 19948#(= main_~i~1 0), 19949#(<= main_~i~1 1), 19950#(<= main_~i~1 2), 19951#(<= main_~i~1 3), 19952#(<= main_~i~1 4), 19953#(<= main_~i~1 5), 19954#(<= main_~i~1 6), 19955#(<= main_~i~1 7), 19956#(<= main_~i~1 8), 19957#(<= main_~i~1 9), 19958#(<= main_~i~1 10), 19959#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 11), 19960#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11), 19961#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 19962#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 19963#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 19964#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 19965#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 19966#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 19967#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5))] [2018-04-12 23:55:34,597 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-12 23:55:34,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 23:55:34,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 23:55:34,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-04-12 23:55:34,598 INFO L87 Difference]: Start difference. First operand 602 states and 604 transitions. Second operand 28 states. [2018-04-12 23:55:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:35,085 INFO L93 Difference]: Finished difference Result 688 states and 691 transitions. [2018-04-12 23:55:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 23:55:35,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 598 [2018-04-12 23:55:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:35,086 INFO L225 Difference]: With dead ends: 688 [2018-04-12 23:55:35,087 INFO L226 Difference]: Without dead ends: 688 [2018-04-12 23:55:35,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 23:55:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-04-12 23:55:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2018-04-12 23:55:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-12 23:55:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 689 transitions. [2018-04-12 23:55:35,094 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 689 transitions. Word has length 598 [2018-04-12 23:55:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:35,094 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 689 transitions. [2018-04-12 23:55:35,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 23:55:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 689 transitions. [2018-04-12 23:55:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-04-12 23:55:35,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:35,099 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-12 23:55:35,099 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-12 23:55:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1107841919, now seen corresponding path program 32 times [2018-04-12 23:55:35,100 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:35,144 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:35,559 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-12 23:55:35,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:35,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 23:55:35,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:35,560 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-12 23:55:35,560 INFO L182 omatonBuilderFactory]: Interpolants [21376#(<= 0 main_~i~1), 21377#(<= 1 main_~i~1), 21378#(<= 2 main_~i~1), 21379#(<= 3 main_~i~1), 21380#(<= 4 main_~i~1), 21381#(<= 5 main_~i~1), 21382#(<= 6 main_~i~1), 21383#(<= 7 main_~i~1), 21384#(<= 8 main_~i~1), 21385#(<= 9 main_~i~1), 21386#(<= 10 main_~i~1), 21387#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 21388#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 21389#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 21390#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 21391#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 21392#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 21393#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 21394#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 21395#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 21396#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 21397#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 21398#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 21399#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 10), 21374#true, 21375#false] [2018-04-12 23:55:35,561 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-12 23:55:35,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 23:55:35,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 23:55:35,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-04-12 23:55:35,561 INFO L87 Difference]: Start difference. First operand 686 states and 689 transitions. Second operand 26 states. [2018-04-12 23:55:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:35,948 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-04-12 23:55:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 23:55:35,948 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 676 [2018-04-12 23:55:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:35,949 INFO L225 Difference]: With dead ends: 695 [2018-04-12 23:55:35,950 INFO L226 Difference]: Without dead ends: 689 [2018-04-12 23:55:35,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=960, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 23:55:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-04-12 23:55:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 686. [2018-04-12 23:55:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-04-12 23:55:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 687 transitions. [2018-04-12 23:55:35,954 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 687 transitions. Word has length 676 [2018-04-12 23:55:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:35,955 INFO L459 AbstractCegarLoop]: Abstraction has 686 states and 687 transitions. [2018-04-12 23:55:35,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 23:55:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 687 transitions. [2018-04-12 23:55:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-04-12 23:55:35,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:35,957 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-12 23:55:35,957 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-12 23:55:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1344323193, now seen corresponding path program 33 times [2018-04-12 23:55:35,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:35,988 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:36,248 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-12 23:55:36,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:36,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-12 23:55:36,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:36,249 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-12 23:55:36,249 INFO L182 omatonBuilderFactory]: Interpolants [22816#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 22801#true, 22802#false, 22803#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 22804#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 22805#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 22806#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 22807#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 22808#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 22809#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 22810#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 22811#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 22812#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 22813#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 22814#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 22815#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-12 23:55:36,249 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-12 23:55:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-12 23:55:36,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-12 23:55:36,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-04-12 23:55:36,250 INFO L87 Difference]: Start difference. First operand 686 states and 687 transitions. Second operand 16 states. [2018-04-12 23:55:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:36,494 INFO L93 Difference]: Finished difference Result 698 states and 700 transitions. [2018-04-12 23:55:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 23:55:36,494 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 682 [2018-04-12 23:55:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:36,496 INFO L225 Difference]: With dead ends: 698 [2018-04-12 23:55:36,496 INFO L226 Difference]: Without dead ends: 698 [2018-04-12 23:55:36,496 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2018-04-12 23:55:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-04-12 23:55:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2018-04-12 23:55:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-04-12 23:55:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 694 transitions. [2018-04-12 23:55:36,500 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 694 transitions. Word has length 682 [2018-04-12 23:55:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:36,500 INFO L459 AbstractCegarLoop]: Abstraction has 692 states and 694 transitions. [2018-04-12 23:55:36,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-12 23:55:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 694 transitions. [2018-04-12 23:55:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-04-12 23:55:36,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:36,503 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-12 23:55:36,503 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-12 23:55:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1172742769, now seen corresponding path program 34 times [2018-04-12 23:55:36,504 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:36,533 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:36,932 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-12 23:55:36,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:36,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 23:55:36,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:36,933 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-12 23:55:36,933 INFO L182 omatonBuilderFactory]: Interpolants [24256#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 24257#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 24258#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 24229#true, 24230#false, 24231#(= main_~i~1 0), 24232#(<= main_~i~1 1), 24233#(<= main_~i~1 2), 24234#(<= main_~i~1 3), 24235#(<= main_~i~1 4), 24236#(<= main_~i~1 5), 24237#(<= main_~i~1 6), 24238#(<= main_~i~1 7), 24239#(<= main_~i~1 8), 24240#(<= main_~i~1 9), 24241#(<= main_~i~1 10), 24242#(<= main_~i~1 11), 24243#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 12), 24244#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12), 24245#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 24246#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 24247#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 24248#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 24249#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 24250#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 24251#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 24252#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 24253#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 24254#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 24255#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2))] [2018-04-12 23:55:36,934 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-12 23:55:36,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 23:55:36,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 23:55:36,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:55:36,934 INFO L87 Difference]: Start difference. First operand 692 states and 694 transitions. Second operand 30 states. [2018-04-12 23:55:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:37,442 INFO L93 Difference]: Finished difference Result 784 states and 787 transitions. [2018-04-12 23:55:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 23:55:37,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 688 [2018-04-12 23:55:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:37,444 INFO L225 Difference]: With dead ends: 784 [2018-04-12 23:55:37,444 INFO L226 Difference]: Without dead ends: 784 [2018-04-12 23:55:37,445 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 23:55:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-04-12 23:55:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2018-04-12 23:55:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-12 23:55:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 785 transitions. [2018-04-12 23:55:37,452 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 785 transitions. Word has length 688 [2018-04-12 23:55:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:37,452 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 785 transitions. [2018-04-12 23:55:37,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 23:55:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 785 transitions. [2018-04-12 23:55:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-04-12 23:55:37,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:37,462 INFO L355 BasicCegarLoop]: trace histogram [115, 103, 102, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:37,462 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-12 23:55:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash 409831793, now seen corresponding path program 35 times [2018-04-12 23:55:37,463 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:37,513 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-04-12 23:55:38,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:38,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 23:55:38,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:38,105 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-12 23:55:38,105 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= 1 main_~i~1), 25857#(<= 2 main_~i~1), 25858#(<= 3 main_~i~1), 25859#(<= 4 main_~i~1), 25860#(<= 5 main_~i~1), 25861#(<= 6 main_~i~1), 25862#(<= 7 main_~i~1), 25863#(<= 8 main_~i~1), 25864#(<= 9 main_~i~1), 25865#(<= 10 main_~i~1), 25866#(<= 11 main_~i~1), 25867#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 25868#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 25869#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 25870#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 25871#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 25872#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 25873#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 25874#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 25875#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 25876#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 25877#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 25878#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 25879#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 25880#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 11), 25853#true, 25854#false, 25855#(<= 0 main_~i~1)] [2018-04-12 23:55:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 34536 backedges. 14018 proven. 420 refuted. 0 times theorem prover too weak. 20098 trivial. 0 not checked. [2018-04-12 23:55:38,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 23:55:38,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 23:55:38,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-04-12 23:55:38,106 INFO L87 Difference]: Start difference. First operand 782 states and 785 transitions. Second operand 28 states. [2018-04-12 23:55:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:38,554 INFO L93 Difference]: Finished difference Result 791 states and 792 transitions. [2018-04-12 23:55:38,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 23:55:38,554 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 772 [2018-04-12 23:55:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:38,556 INFO L225 Difference]: With dead ends: 791 [2018-04-12 23:55:38,556 INFO L226 Difference]: Without dead ends: 785 [2018-04-12 23:55:38,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 23:55:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-04-12 23:55:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 782. [2018-04-12 23:55:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-04-12 23:55:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 783 transitions. [2018-04-12 23:55:38,560 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 783 transitions. Word has length 772 [2018-04-12 23:55:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:38,560 INFO L459 AbstractCegarLoop]: Abstraction has 782 states and 783 transitions. [2018-04-12 23:55:38,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 23:55:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 783 transitions. [2018-04-12 23:55:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-04-12 23:55:38,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:38,564 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-12 23:55:38,564 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-12 23:55:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1167448215, now seen corresponding path program 36 times [2018-04-12 23:55:38,564 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:38,610 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-04-12 23:55:38,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:38,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-12 23:55:38,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:38,998 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-12 23:55:38,998 INFO L182 omatonBuilderFactory]: Interpolants [27488#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 27489#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 27490#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 27491#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 27492#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 27476#true, 27477#false, 27478#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 27479#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 27480#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 27481#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 27482#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 27483#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 27484#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 27485#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 27486#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 27487#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)] [2018-04-12 23:55:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 7626 proven. 507 refuted. 0 times theorem prover too weak. 27042 trivial. 0 not checked. [2018-04-12 23:55:38,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 23:55:38,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 23:55:38,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-04-12 23:55:38,999 INFO L87 Difference]: Start difference. First operand 782 states and 783 transitions. Second operand 17 states. [2018-04-12 23:55:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:39,241 INFO L93 Difference]: Finished difference Result 794 states and 796 transitions. [2018-04-12 23:55:39,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 23:55:39,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 778 [2018-04-12 23:55:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:39,244 INFO L225 Difference]: With dead ends: 794 [2018-04-12 23:55:39,244 INFO L226 Difference]: Without dead ends: 794 [2018-04-12 23:55:39,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-04-12 23:55:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-12 23:55:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2018-04-12 23:55:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-04-12 23:55:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 790 transitions. [2018-04-12 23:55:39,251 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 790 transitions. Word has length 778 [2018-04-12 23:55:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:39,252 INFO L459 AbstractCegarLoop]: Abstraction has 788 states and 790 transitions. [2018-04-12 23:55:39,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 23:55:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 790 transitions. [2018-04-12 23:55:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-04-12 23:55:39,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:39,257 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-12 23:55:39,257 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-12 23:55:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 895063905, now seen corresponding path program 37 times [2018-04-12 23:55:39,258 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:39,311 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:39,828 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-12 23:55:39,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:39,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 23:55:39,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:39,829 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-12 23:55:39,829 INFO L182 omatonBuilderFactory]: Interpolants [29120#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 29121#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 29122#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 29123#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 29124#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 29125#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 29126#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 29127#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 29128#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 29129#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 29130#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 29099#true, 29100#false, 29101#(= main_~i~1 0), 29102#(<= main_~i~1 1), 29103#(<= main_~i~1 2), 29104#(<= main_~i~1 3), 29105#(<= main_~i~1 4), 29106#(<= main_~i~1 5), 29107#(<= main_~i~1 6), 29108#(<= main_~i~1 7), 29109#(<= main_~i~1 8), 29110#(<= main_~i~1 9), 29111#(<= main_~i~1 10), 29112#(<= main_~i~1 11), 29113#(<= main_~i~1 12), 29114#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 13), 29115#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13), 29116#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 29117#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 29118#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 29119#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10))] [2018-04-12 23:55:39,830 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-12 23:55:39,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 23:55:39,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 23:55:39,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:55:39,831 INFO L87 Difference]: Start difference. First operand 788 states and 790 transitions. Second operand 32 states. [2018-04-12 23:55:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:40,469 INFO L93 Difference]: Finished difference Result 886 states and 889 transitions. [2018-04-12 23:55:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 23:55:40,469 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 784 [2018-04-12 23:55:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:40,471 INFO L225 Difference]: With dead ends: 886 [2018-04-12 23:55:40,471 INFO L226 Difference]: Without dead ends: 886 [2018-04-12 23:55:40,471 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=529, Invalid=1633, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 23:55:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-04-12 23:55:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-04-12 23:55:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-04-12 23:55:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 887 transitions. [2018-04-12 23:55:40,477 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 887 transitions. Word has length 784 [2018-04-12 23:55:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:40,478 INFO L459 AbstractCegarLoop]: Abstraction has 884 states and 887 transitions. [2018-04-12 23:55:40,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 23:55:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 887 transitions. [2018-04-12 23:55:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-12 23:55:40,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:40,482 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-12 23:55:40,482 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-12 23:55:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash -165184423, now seen corresponding path program 38 times [2018-04-12 23:55:40,483 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:40,531 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:41,108 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-12 23:55:41,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:41,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 23:55:41,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:41,109 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-12 23:55:41,109 INFO L182 omatonBuilderFactory]: Interpolants [30931#true, 30932#false, 30933#(<= 0 main_~i~1), 30934#(<= 1 main_~i~1), 30935#(<= 2 main_~i~1), 30936#(<= 3 main_~i~1), 30937#(<= 4 main_~i~1), 30938#(<= 5 main_~i~1), 30939#(<= 6 main_~i~1), 30940#(<= 7 main_~i~1), 30941#(<= 8 main_~i~1), 30942#(<= 9 main_~i~1), 30943#(<= 10 main_~i~1), 30944#(<= 11 main_~i~1), 30945#(<= 12 main_~i~1), 30946#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 30947#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 30948#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 30949#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 30950#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 30951#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 30952#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 30953#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 30954#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 30955#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 30956#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 30957#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 30958#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 30959#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 30960#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 12)] [2018-04-12 23:55:41,109 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-12 23:55:41,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 23:55:41,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 23:55:41,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:55:41,110 INFO L87 Difference]: Start difference. First operand 884 states and 887 transitions. Second operand 30 states. [2018-04-12 23:55:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:41,619 INFO L93 Difference]: Finished difference Result 893 states and 894 transitions. [2018-04-12 23:55:41,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 23:55:41,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 874 [2018-04-12 23:55:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:41,621 INFO L225 Difference]: With dead ends: 893 [2018-04-12 23:55:41,621 INFO L226 Difference]: Without dead ends: 887 [2018-04-12 23:55:41,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 23:55:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-04-12 23:55:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2018-04-12 23:55:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-04-12 23:55:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 885 transitions. [2018-04-12 23:55:41,626 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 885 transitions. Word has length 874 [2018-04-12 23:55:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:41,627 INFO L459 AbstractCegarLoop]: Abstraction has 884 states and 885 transitions. [2018-04-12 23:55:41,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 23:55:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 885 transitions. [2018-04-12 23:55:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-04-12 23:55:41,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:41,631 INFO L355 BasicCegarLoop]: trace histogram [132, 119, 118, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:41,631 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-12 23:55:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1508029359, now seen corresponding path program 39 times [2018-04-12 23:55:41,632 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:41,665 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-12 23:55:42,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:42,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-12 23:55:42,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:42,030 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-12 23:55:42,031 INFO L182 omatonBuilderFactory]: Interpolants [32768#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 32769#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 32770#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 32771#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 32772#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 32773#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 32774#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 32775#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 32776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 32777#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 32778#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 32779#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 32762#true, 32763#false, 32764#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 32765#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 32766#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 32767#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)] [2018-04-12 23:55:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45867 backedges. 9438 proven. 588 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-12 23:55:42,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-12 23:55:42,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-12 23:55:42,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2018-04-12 23:55:42,032 INFO L87 Difference]: Start difference. First operand 884 states and 885 transitions. Second operand 18 states. [2018-04-12 23:55:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:42,207 INFO L93 Difference]: Finished difference Result 896 states and 898 transitions. [2018-04-12 23:55:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 23:55:42,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 880 [2018-04-12 23:55:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:42,209 INFO L225 Difference]: With dead ends: 896 [2018-04-12 23:55:42,209 INFO L226 Difference]: Without dead ends: 896 [2018-04-12 23:55:42,209 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2018-04-12 23:55:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-04-12 23:55:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 890. [2018-04-12 23:55:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-12 23:55:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 892 transitions. [2018-04-12 23:55:42,215 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 892 transitions. Word has length 880 [2018-04-12 23:55:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:42,215 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 892 transitions. [2018-04-12 23:55:42,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-12 23:55:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 892 transitions. [2018-04-12 23:55:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-04-12 23:55:42,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:42,219 INFO L355 BasicCegarLoop]: trace histogram [133, 120, 119, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:42,219 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-12 23:55:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1614320055, now seen corresponding path program 40 times [2018-04-12 23:55:42,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:42,254 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-12 23:55:42,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:42,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 23:55:42,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:42,821 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-12 23:55:42,821 INFO L182 omatonBuilderFactory]: Interpolants [34624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 34625#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 34592#true, 34593#false, 34594#(= main_~i~1 0), 34595#(<= main_~i~1 1), 34596#(<= main_~i~1 2), 34597#(<= main_~i~1 3), 34598#(<= main_~i~1 4), 34599#(<= main_~i~1 5), 34600#(<= main_~i~1 6), 34601#(<= main_~i~1 7), 34602#(<= main_~i~1 8), 34603#(<= main_~i~1 9), 34604#(<= main_~i~1 10), 34605#(<= main_~i~1 11), 34606#(<= main_~i~1 12), 34607#(<= main_~i~1 13), 34608#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 14), 34609#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14), 34610#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 34611#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 34612#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 34613#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 34614#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 34615#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 34616#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 34617#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 34618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 34619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 34620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 34621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 34622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 34623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-12 23:55:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 46604 backedges. 10732 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-12 23:55:42,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 23:55:42,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 23:55:42,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 23:55:42,823 INFO L87 Difference]: Start difference. First operand 890 states and 892 transitions. Second operand 34 states. [2018-04-12 23:55:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:43,416 INFO L93 Difference]: Finished difference Result 994 states and 997 transitions. [2018-04-12 23:55:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 23:55:43,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 886 [2018-04-12 23:55:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:43,418 INFO L225 Difference]: With dead ends: 994 [2018-04-12 23:55:43,418 INFO L226 Difference]: Without dead ends: 994 [2018-04-12 23:55:43,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=596, Invalid=1854, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 23:55:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-04-12 23:55:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2018-04-12 23:55:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-04-12 23:55:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 995 transitions. [2018-04-12 23:55:43,423 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 995 transitions. Word has length 886 [2018-04-12 23:55:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:43,424 INFO L459 AbstractCegarLoop]: Abstraction has 992 states and 995 transitions. [2018-04-12 23:55:43,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 23:55:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 995 transitions. [2018-04-12 23:55:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-04-12 23:55:43,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:43,428 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-12 23:55:43,428 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-12 23:55:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 76312377, now seen corresponding path program 41 times [2018-04-12 23:55:43,429 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:43,481 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-04-12 23:55:44,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:44,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 23:55:44,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:44,080 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-12 23:55:44,080 INFO L182 omatonBuilderFactory]: Interpolants [36672#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 36673#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 36674#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 36675#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 13), 36644#true, 36645#false, 36646#(<= 0 main_~i~1), 36647#(<= 1 main_~i~1), 36648#(<= 2 main_~i~1), 36649#(<= 3 main_~i~1), 36650#(<= 4 main_~i~1), 36651#(<= 5 main_~i~1), 36652#(<= 6 main_~i~1), 36653#(<= 7 main_~i~1), 36654#(<= 8 main_~i~1), 36655#(<= 9 main_~i~1), 36656#(<= 10 main_~i~1), 36657#(<= 11 main_~i~1), 36658#(<= 12 main_~i~1), 36659#(<= 13 main_~i~1), 36660#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 36661#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 36662#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 36663#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 36664#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 36665#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 36666#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 36667#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 36668#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 36669#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 36670#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 36671#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11))] [2018-04-12 23:55:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 21411 proven. 574 refuted. 0 times theorem prover too weak. 35996 trivial. 0 not checked. [2018-04-12 23:55:44,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 23:55:44,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 23:55:44,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:55:44,081 INFO L87 Difference]: Start difference. First operand 992 states and 995 transitions. Second operand 32 states. [2018-04-12 23:55:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:44,381 INFO L93 Difference]: Finished difference Result 1001 states and 1002 transitions. [2018-04-12 23:55:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 23:55:44,381 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 982 [2018-04-12 23:55:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:44,383 INFO L225 Difference]: With dead ends: 1001 [2018-04-12 23:55:44,383 INFO L226 Difference]: Without dead ends: 995 [2018-04-12 23:55:44,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 23:55:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-04-12 23:55:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 992. [2018-04-12 23:55:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-04-12 23:55:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 993 transitions. [2018-04-12 23:55:44,388 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 993 transitions. Word has length 982 [2018-04-12 23:55:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:44,388 INFO L459 AbstractCegarLoop]: Abstraction has 992 states and 993 transitions. [2018-04-12 23:55:44,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 23:55:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 993 transitions. [2018-04-12 23:55:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-04-12 23:55:44,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:44,393 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-12 23:55:44,393 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-12 23:55:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1639344335, now seen corresponding path program 42 times [2018-04-12 23:55:44,394 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:44,436 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:44,833 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-12 23:55:44,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:44,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 23:55:44,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:44,834 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-12 23:55:44,834 INFO L182 omatonBuilderFactory]: Interpolants [38695#true, 38696#false, 38697#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 38698#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 38699#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 38700#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 38701#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 38702#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 38703#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 38704#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 38705#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 38706#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 38707#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 38708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 38709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 38710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 38711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 38712#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 38713#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15))] [2018-04-12 23:55:44,835 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-12 23:55:44,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 23:55:44,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 23:55:44,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-04-12 23:55:44,835 INFO L87 Difference]: Start difference. First operand 992 states and 993 transitions. Second operand 19 states. [2018-04-12 23:55:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:45,029 INFO L93 Difference]: Finished difference Result 1004 states and 1006 transitions. [2018-04-12 23:55:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-12 23:55:45,029 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 988 [2018-04-12 23:55:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:45,031 INFO L225 Difference]: With dead ends: 1004 [2018-04-12 23:55:45,031 INFO L226 Difference]: Without dead ends: 1004 [2018-04-12 23:55:45,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 23:55:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-04-12 23:55:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 998. [2018-04-12 23:55:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-12 23:55:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1000 transitions. [2018-04-12 23:55:45,036 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1000 transitions. Word has length 988 [2018-04-12 23:55:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:45,037 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1000 transitions. [2018-04-12 23:55:45,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 23:55:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1000 transitions. [2018-04-12 23:55:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-04-12 23:55:45,041 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:45,041 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-12 23:55:45,041 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-12 23:55:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1652027095, now seen corresponding path program 43 times [2018-04-12 23:55:45,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:45,079 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:45,715 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-12 23:55:45,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:45,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 23:55:45,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:45,716 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-12 23:55:45,716 INFO L182 omatonBuilderFactory]: Interpolants [40768#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 40769#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 40770#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 40771#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 40772#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 40773#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 40774#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 40775#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 40776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 40777#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 40778#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 40779#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 40744#true, 40745#false, 40746#(= main_~i~1 0), 40747#(<= main_~i~1 1), 40748#(<= main_~i~1 2), 40749#(<= main_~i~1 3), 40750#(<= main_~i~1 4), 40751#(<= main_~i~1 5), 40752#(<= main_~i~1 6), 40753#(<= main_~i~1 7), 40754#(<= main_~i~1 8), 40755#(<= main_~i~1 9), 40756#(<= main_~i~1 10), 40757#(<= main_~i~1 11), 40758#(<= main_~i~1 12), 40759#(<= main_~i~1 13), 40760#(<= main_~i~1 14), 40761#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 15), 40762#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15), 40763#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 40764#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 40765#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 40766#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 40767#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11))] [2018-04-12 23:55:45,717 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-12 23:55:45,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 23:55:45,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 23:55:45,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 23:55:45,718 INFO L87 Difference]: Start difference. First operand 998 states and 1000 transitions. Second operand 36 states. [2018-04-12 23:55:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:46,369 INFO L93 Difference]: Finished difference Result 1108 states and 1111 transitions. [2018-04-12 23:55:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 23:55:46,369 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 994 [2018-04-12 23:55:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:46,372 INFO L225 Difference]: With dead ends: 1108 [2018-04-12 23:55:46,373 INFO L226 Difference]: Without dead ends: 1108 [2018-04-12 23:55:46,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=667, Invalid=2089, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 23:55:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-04-12 23:55:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2018-04-12 23:55:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-12 23:55:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1109 transitions. [2018-04-12 23:55:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1109 transitions. Word has length 994 [2018-04-12 23:55:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:46,381 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1109 transitions. [2018-04-12 23:55:46,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 23:55:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1109 transitions. [2018-04-12 23:55:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-04-12 23:55:46,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:46,387 INFO L355 BasicCegarLoop]: trace histogram [166, 151, 150, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:46,387 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-12 23:55:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 759381521, now seen corresponding path program 44 times [2018-04-12 23:55:46,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:46,436 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-04-12 23:55:47,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:47,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 23:55:47,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:47,216 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-12 23:55:47,216 INFO L182 omatonBuilderFactory]: Interpolants [43028#true, 43029#false, 43030#(<= 0 main_~i~1), 43031#(<= 1 main_~i~1), 43032#(<= 2 main_~i~1), 43033#(<= 3 main_~i~1), 43034#(<= 4 main_~i~1), 43035#(<= 5 main_~i~1), 43036#(<= 6 main_~i~1), 43037#(<= 7 main_~i~1), 43038#(<= 8 main_~i~1), 43039#(<= 9 main_~i~1), 43040#(<= 10 main_~i~1), 43041#(<= 11 main_~i~1), 43042#(<= 12 main_~i~1), 43043#(<= 13 main_~i~1), 43044#(<= 14 main_~i~1), 43045#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 43046#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 43047#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 43048#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 43049#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 43050#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 43051#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 43052#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 43053#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 43054#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 43055#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 43056#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 43057#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 43058#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 43059#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 43060#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 43061#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 14)] [2018-04-12 23:55:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 73365 backedges. 25919 proven. 660 refuted. 0 times theorem prover too weak. 46786 trivial. 0 not checked. [2018-04-12 23:55:47,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 23:55:47,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 23:55:47,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 23:55:47,218 INFO L87 Difference]: Start difference. First operand 1106 states and 1109 transitions. Second operand 34 states. [2018-04-12 23:55:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:48,033 INFO L93 Difference]: Finished difference Result 1115 states and 1116 transitions. [2018-04-12 23:55:48,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 23:55:48,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1096 [2018-04-12 23:55:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:48,035 INFO L225 Difference]: With dead ends: 1115 [2018-04-12 23:55:48,035 INFO L226 Difference]: Without dead ends: 1109 [2018-04-12 23:55:48,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=1728, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 23:55:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2018-04-12 23:55:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1106. [2018-04-12 23:55:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2018-04-12 23:55:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1107 transitions. [2018-04-12 23:55:48,042 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1107 transitions. Word has length 1096 [2018-04-12 23:55:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:48,042 INFO L459 AbstractCegarLoop]: Abstraction has 1106 states and 1107 transitions. [2018-04-12 23:55:48,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 23:55:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1107 transitions. [2018-04-12 23:55:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-04-12 23:55:48,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:48,055 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-12 23:55:48,055 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-12 23:55:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1560222711, now seen corresponding path program 45 times [2018-04-12 23:55:48,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:48,101 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:48,733 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-12 23:55:48,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:48,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-12 23:55:48,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:48,734 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-12 23:55:48,734 INFO L182 omatonBuilderFactory]: Interpolants [45312#false, 45313#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 45314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 45315#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 45316#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 45317#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 45318#(and (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 45319#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 45320#(and (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 45321#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45322#(and (<= 9 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 45323#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10) (<= 10 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45324#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11) (<= 11 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45325#(and (<= 12 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 45326#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13) (<= 13 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 45327#(and (<= 14 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 45328#(and (<= 15 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 45329#(and (<= 16 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 45311#true] [2018-04-12 23:55:48,735 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-12 23:55:48,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 23:55:48,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 23:55:48,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 23:55:48,736 INFO L87 Difference]: Start difference. First operand 1106 states and 1107 transitions. Second operand 19 states. [2018-04-12 23:55:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:49,227 INFO L93 Difference]: Finished difference Result 1118 states and 1120 transitions. [2018-04-12 23:55:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 23:55:49,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1102 [2018-04-12 23:55:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:49,229 INFO L225 Difference]: With dead ends: 1118 [2018-04-12 23:55:49,229 INFO L226 Difference]: Without dead ends: 1118 [2018-04-12 23:55:49,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-12 23:55:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2018-04-12 23:55:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1112. [2018-04-12 23:55:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-04-12 23:55:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1114 transitions. [2018-04-12 23:55:49,234 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1114 transitions. Word has length 1102 [2018-04-12 23:55:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:49,235 INFO L459 AbstractCegarLoop]: Abstraction has 1112 states and 1114 transitions. [2018-04-12 23:55:49,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 23:55:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1114 transitions. [2018-04-12 23:55:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-04-12 23:55:49,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:49,240 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-12 23:55:49,240 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-12 23:55:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash -120038399, now seen corresponding path program 46 times [2018-04-12 23:55:49,241 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:49,288 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:50,161 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-12 23:55:50,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:50,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 23:55:50,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:50,161 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-12 23:55:50,161 INFO L182 omatonBuilderFactory]: Interpolants [47560#true, 47561#false, 47562#(= main_~i~1 0), 47563#(<= main_~i~1 1), 47564#(<= main_~i~1 2), 47565#(<= main_~i~1 3), 47566#(<= main_~i~1 4), 47567#(<= main_~i~1 5), 47568#(<= main_~i~1 6), 47569#(<= main_~i~1 7), 47570#(<= main_~i~1 8), 47571#(<= main_~i~1 9), 47572#(<= main_~i~1 10), 47573#(<= main_~i~1 11), 47574#(<= main_~i~1 12), 47575#(<= main_~i~1 13), 47576#(<= main_~i~1 14), 47577#(<= main_~i~1 15), 47578#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 16), 47579#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16), 47580#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 47581#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 47582#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 47583#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 47584#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 47585#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 47586#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 47587#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 47588#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 47589#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 47590#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 47591#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 47592#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 47593#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 47594#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 47595#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 47596#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 47597#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:55:50,162 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-12 23:55:50,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 23:55:50,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 23:55:50,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 23:55:50,163 INFO L87 Difference]: Start difference. First operand 1112 states and 1114 transitions. Second operand 38 states. [2018-04-12 23:55:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:50,900 INFO L93 Difference]: Finished difference Result 1228 states and 1231 transitions. [2018-04-12 23:55:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 23:55:50,900 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1108 [2018-04-12 23:55:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:50,902 INFO L225 Difference]: With dead ends: 1228 [2018-04-12 23:55:50,902 INFO L226 Difference]: Without dead ends: 1228 [2018-04-12 23:55:50,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=742, Invalid=2338, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 23:55:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-04-12 23:55:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1226. [2018-04-12 23:55:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-12 23:55:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1229 transitions. [2018-04-12 23:55:50,907 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1229 transitions. Word has length 1108 [2018-04-12 23:55:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:50,908 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1229 transitions. [2018-04-12 23:55:50,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 23:55:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1229 transitions. [2018-04-12 23:55:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-04-12 23:55:50,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:50,914 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-12 23:55:50,914 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-12 23:55:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1881913057, now seen corresponding path program 47 times [2018-04-12 23:55:50,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:50,957 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:51,772 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-12 23:55:51,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:51,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-12 23:55:51,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:51,773 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-12 23:55:51,773 INFO L182 omatonBuilderFactory]: Interpolants [50112#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 50113#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 50114#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 50115#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 50116#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 50117#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 50118#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 50119#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 50120#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 50121#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 50122#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 50123#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 15), 50088#true, 50089#false, 50090#(<= 0 main_~i~1), 50091#(<= 1 main_~i~1), 50092#(<= 2 main_~i~1), 50093#(<= 3 main_~i~1), 50094#(<= 4 main_~i~1), 50095#(<= 5 main_~i~1), 50096#(<= 6 main_~i~1), 50097#(<= 7 main_~i~1), 50098#(<= 8 main_~i~1), 50099#(<= 9 main_~i~1), 50100#(<= 10 main_~i~1), 50101#(<= 11 main_~i~1), 50102#(<= 12 main_~i~1), 50103#(<= 13 main_~i~1), 50104#(<= 14 main_~i~1), 50105#(<= 15 main_~i~1), 50106#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 50107#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 50108#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 50109#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 50110#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 50111#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5))] [2018-04-12 23:55:51,775 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-12 23:55:51,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 23:55:51,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 23:55:51,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 23:55:51,775 INFO L87 Difference]: Start difference. First operand 1226 states and 1229 transitions. Second operand 36 states. [2018-04-12 23:55:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:52,338 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-04-12 23:55:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 23:55:52,338 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1216 [2018-04-12 23:55:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:52,340 INFO L225 Difference]: With dead ends: 1235 [2018-04-12 23:55:52,340 INFO L226 Difference]: Without dead ends: 1229 [2018-04-12 23:55:52,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=1955, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 23:55:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-04-12 23:55:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2018-04-12 23:55:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-04-12 23:55:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1227 transitions. [2018-04-12 23:55:52,346 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1227 transitions. Word has length 1216 [2018-04-12 23:55:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:52,347 INFO L459 AbstractCegarLoop]: Abstraction has 1226 states and 1227 transitions. [2018-04-12 23:55:52,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 23:55:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1227 transitions. [2018-04-12 23:55:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-04-12 23:55:52,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:52,353 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-12 23:55:52,353 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-12 23:55:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -460291879, now seen corresponding path program 48 times [2018-04-12 23:55:52,354 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:52,426 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:53,017 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-12 23:55:53,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:53,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-12 23:55:53,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:53,018 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-12 23:55:53,018 INFO L182 omatonBuilderFactory]: Interpolants [52615#true, 52616#false, 52617#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 52618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 52619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 52620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 52621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 52622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 52623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 52624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 52625#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 52626#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 52627#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 52628#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 52629#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 52630#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 52631#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 52632#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 52633#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 52634#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 52635#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17))] [2018-04-12 23:55:53,019 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-12 23:55:53,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 23:55:53,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 23:55:53,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-04-12 23:55:53,020 INFO L87 Difference]: Start difference. First operand 1226 states and 1227 transitions. Second operand 21 states. [2018-04-12 23:55:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:53,248 INFO L93 Difference]: Finished difference Result 1238 states and 1240 transitions. [2018-04-12 23:55:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 23:55:53,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1222 [2018-04-12 23:55:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:53,251 INFO L225 Difference]: With dead ends: 1238 [2018-04-12 23:55:53,251 INFO L226 Difference]: Without dead ends: 1238 [2018-04-12 23:55:53,251 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 23:55:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-04-12 23:55:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-04-12 23:55:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-12 23:55:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-04-12 23:55:53,257 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1222 [2018-04-12 23:55:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:53,257 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-04-12 23:55:53,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 23:55:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-04-12 23:55:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-12 23:55:53,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:53,263 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-12 23:55:53,264 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-12 23:55:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -632087343, now seen corresponding path program 49 times [2018-04-12 23:55:53,264 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:53,314 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:54,094 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-12 23:55:54,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:54,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 23:55:54,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:54,095 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-12 23:55:54,095 INFO L182 omatonBuilderFactory]: Interpolants [55168#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 55169#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 55170#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 55171#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 55172#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 55173#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 55174#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 55175#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 55176#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 55177#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 55138#true, 55139#false, 55140#(= main_~i~1 0), 55141#(<= main_~i~1 1), 55142#(<= main_~i~1 2), 55143#(<= main_~i~1 3), 55144#(<= main_~i~1 4), 55145#(<= main_~i~1 5), 55146#(<= main_~i~1 6), 55147#(<= main_~i~1 7), 55148#(<= main_~i~1 8), 55149#(<= main_~i~1 9), 55150#(<= main_~i~1 10), 55151#(<= main_~i~1 11), 55152#(<= main_~i~1 12), 55153#(<= main_~i~1 13), 55154#(<= main_~i~1 14), 55155#(<= main_~i~1 15), 55156#(<= main_~i~1 16), 55157#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 17), 55158#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17), 55159#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 55160#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 55161#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 55162#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 55163#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 55164#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 55165#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 55166#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 55167#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9))] [2018-04-12 23:55:54,096 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-12 23:55:54,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 23:55:54,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 23:55:54,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 23:55:54,097 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 40 states. [2018-04-12 23:55:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:55,008 INFO L93 Difference]: Finished difference Result 1354 states and 1357 transitions. [2018-04-12 23:55:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 23:55:55,008 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1228 [2018-04-12 23:55:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:55,011 INFO L225 Difference]: With dead ends: 1354 [2018-04-12 23:55:55,011 INFO L226 Difference]: Without dead ends: 1354 [2018-04-12 23:55:55,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 23:55:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-04-12 23:55:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-04-12 23:55:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-04-12 23:55:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1355 transitions. [2018-04-12 23:55:55,017 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1355 transitions. Word has length 1228 [2018-04-12 23:55:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:55,017 INFO L459 AbstractCegarLoop]: Abstraction has 1352 states and 1355 transitions. [2018-04-12 23:55:55,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 23:55:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1355 transitions. [2018-04-12 23:55:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2018-04-12 23:55:55,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:55,025 INFO L355 BasicCegarLoop]: trace histogram [205, 188, 187, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:55:55,025 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-12 23:55:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1642338729, now seen corresponding path program 50 times [2018-04-12 23:55:55,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:55,094 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-04-12 23:55:55,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:55,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-12 23:55:55,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:55,974 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-12 23:55:55,974 INFO L182 omatonBuilderFactory]: Interpolants [57922#true, 57923#false, 57924#(<= 0 main_~i~1), 57925#(<= 1 main_~i~1), 57926#(<= 2 main_~i~1), 57927#(<= 3 main_~i~1), 57928#(<= 4 main_~i~1), 57929#(<= 5 main_~i~1), 57930#(<= 6 main_~i~1), 57931#(<= 7 main_~i~1), 57932#(<= 8 main_~i~1), 57933#(<= 9 main_~i~1), 57934#(<= 10 main_~i~1), 57935#(<= 11 main_~i~1), 57936#(<= 12 main_~i~1), 57937#(<= 13 main_~i~1), 57938#(<= 14 main_~i~1), 57939#(<= 15 main_~i~1), 57940#(<= 16 main_~i~1), 57941#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 57942#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 57943#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 57944#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 57945#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 57946#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 57947#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 57948#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 57949#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 57950#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 57951#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 57952#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 57953#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 57954#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 57955#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 57956#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 57957#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 57958#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 57959#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 16)] [2018-04-12 23:55:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 113016 backedges. 36738 proven. 850 refuted. 0 times theorem prover too weak. 75428 trivial. 0 not checked. [2018-04-12 23:55:55,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 23:55:55,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 23:55:55,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 23:55:55,977 INFO L87 Difference]: Start difference. First operand 1352 states and 1355 transitions. Second operand 38 states. [2018-04-12 23:55:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:56,828 INFO L93 Difference]: Finished difference Result 1361 states and 1362 transitions. [2018-04-12 23:55:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-12 23:55:56,828 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1342 [2018-04-12 23:55:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:56,830 INFO L225 Difference]: With dead ends: 1361 [2018-04-12 23:55:56,830 INFO L226 Difference]: Without dead ends: 1355 [2018-04-12 23:55:56,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=2196, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 23:55:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-04-12 23:55:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1352. [2018-04-12 23:55:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-04-12 23:55:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1353 transitions. [2018-04-12 23:55:56,837 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1353 transitions. Word has length 1342 [2018-04-12 23:55:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:56,837 INFO L459 AbstractCegarLoop]: Abstraction has 1352 states and 1353 transitions. [2018-04-12 23:55:56,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 23:55:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1353 transitions. [2018-04-12 23:55:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-04-12 23:55:56,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:56,845 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-12 23:55:56,845 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-12 23:55:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1478054495, now seen corresponding path program 51 times [2018-04-12 23:55:56,846 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:56,898 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:57,519 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-12 23:55:57,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:57,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-12 23:55:57,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:57,519 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-12 23:55:57,520 INFO L182 omatonBuilderFactory]: Interpolants [60705#true, 60706#false, 60707#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 60708#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 60709#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 60710#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 60711#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 60712#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 60713#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 60714#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 60715#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 60716#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 60717#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 60718#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 60719#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 60720#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 60721#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 60722#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 60723#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 60724#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 60725#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 60726#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18))] [2018-04-12 23:55:57,521 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-12 23:55:57,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 23:55:57,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 23:55:57,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=283, Unknown=0, NotChecked=0, Total=462 [2018-04-12 23:55:57,521 INFO L87 Difference]: Start difference. First operand 1352 states and 1353 transitions. Second operand 22 states. [2018-04-12 23:55:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:57,780 INFO L93 Difference]: Finished difference Result 1364 states and 1366 transitions. [2018-04-12 23:55:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 23:55:57,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1348 [2018-04-12 23:55:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:57,783 INFO L225 Difference]: With dead ends: 1364 [2018-04-12 23:55:57,783 INFO L226 Difference]: Without dead ends: 1364 [2018-04-12 23:55:57,783 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 23:55:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-04-12 23:55:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1358. [2018-04-12 23:55:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-12 23:55:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1360 transitions. [2018-04-12 23:55:57,792 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1360 transitions. Word has length 1348 [2018-04-12 23:55:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:57,792 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1360 transitions. [2018-04-12 23:55:57,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 23:55:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1360 transitions. [2018-04-12 23:55:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-04-12 23:55:57,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:57,805 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-12 23:55:57,805 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-12 23:55:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash 724997017, now seen corresponding path program 52 times [2018-04-12 23:55:57,806 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:57,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:55:58,798 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-12 23:55:58,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:55:58,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 23:55:58,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:55:58,799 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-12 23:55:58,799 INFO L182 omatonBuilderFactory]: Interpolants [63488#(<= main_~i~1 3), 63489#(<= main_~i~1 4), 63490#(<= main_~i~1 5), 63491#(<= main_~i~1 6), 63492#(<= main_~i~1 7), 63493#(<= main_~i~1 8), 63494#(<= main_~i~1 9), 63495#(<= main_~i~1 10), 63496#(<= main_~i~1 11), 63497#(<= main_~i~1 12), 63498#(<= main_~i~1 13), 63499#(<= main_~i~1 14), 63500#(<= main_~i~1 15), 63501#(<= main_~i~1 16), 63502#(<= main_~i~1 17), 63503#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 18), 63504#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18), 63505#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 63506#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 63507#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 63508#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 63509#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 63510#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 63511#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 63512#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 63513#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 63514#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 63515#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 63516#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 63517#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 63518#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 63519#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 63520#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 63521#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 63522#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 63523#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 63524#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 63483#true, 63484#false, 63485#(= main_~i~1 0), 63486#(<= main_~i~1 1), 63487#(<= main_~i~1 2)] [2018-04-12 23:55:58,801 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-12 23:55:58,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 23:55:58,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 23:55:58,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 23:55:58,801 INFO L87 Difference]: Start difference. First operand 1358 states and 1360 transitions. Second operand 42 states. [2018-04-12 23:55:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:55:59,590 INFO L93 Difference]: Finished difference Result 1486 states and 1489 transitions. [2018-04-12 23:55:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 23:55:59,590 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1354 [2018-04-12 23:55:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:55:59,593 INFO L225 Difference]: With dead ends: 1486 [2018-04-12 23:55:59,593 INFO L226 Difference]: Without dead ends: 1486 [2018-04-12 23:55:59,594 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=904, Invalid=2878, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 23:55:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-04-12 23:55:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1484. [2018-04-12 23:55:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-04-12 23:55:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1487 transitions. [2018-04-12 23:55:59,604 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1487 transitions. Word has length 1354 [2018-04-12 23:55:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:55:59,604 INFO L459 AbstractCegarLoop]: Abstraction has 1484 states and 1487 transitions. [2018-04-12 23:55:59,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 23:55:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1487 transitions. [2018-04-12 23:55:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-04-12 23:55:59,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:55:59,614 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-12 23:55:59,614 INFO L408 AbstractCegarLoop]: === Iteration 62 === [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-12 23:55:59,614 INFO L82 PathProgramCache]: Analyzing trace with hash -637855639, now seen corresponding path program 53 times [2018-04-12 23:55:59,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:55:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:55:59,675 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:00,686 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-12 23:56:00,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:00,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-12 23:56:00,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:00,687 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-12 23:56:00,687 INFO L182 omatonBuilderFactory]: Interpolants [66561#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 66560#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 66563#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 66562#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 66565#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 66564#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 66567#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 66566#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 66569#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 66568#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 66571#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 66570#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 66573#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 66572#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 66574#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 17), 66535#true, 66537#(<= 0 main_~i~1), 66536#false, 66539#(<= 2 main_~i~1), 66538#(<= 1 main_~i~1), 66541#(<= 4 main_~i~1), 66540#(<= 3 main_~i~1), 66543#(<= 6 main_~i~1), 66542#(<= 5 main_~i~1), 66545#(<= 8 main_~i~1), 66544#(<= 7 main_~i~1), 66547#(<= 10 main_~i~1), 66546#(<= 9 main_~i~1), 66549#(<= 12 main_~i~1), 66548#(<= 11 main_~i~1), 66551#(<= 14 main_~i~1), 66550#(<= 13 main_~i~1), 66553#(<= 16 main_~i~1), 66552#(<= 15 main_~i~1), 66555#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 66554#(<= 17 main_~i~1), 66557#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 66556#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 66559#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 66558#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3))] [2018-04-12 23:56:00,689 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-12 23:56:00,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 23:56:00,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 23:56:00,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 23:56:00,689 INFO L87 Difference]: Start difference. First operand 1484 states and 1487 transitions. Second operand 40 states. [2018-04-12 23:56:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:01,239 INFO L93 Difference]: Finished difference Result 1493 states and 1494 transitions. [2018-04-12 23:56:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 23:56:01,240 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1474 [2018-04-12 23:56:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:01,243 INFO L225 Difference]: With dead ends: 1493 [2018-04-12 23:56:01,243 INFO L226 Difference]: Without dead ends: 1487 [2018-04-12 23:56:01,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=2451, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 23:56:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-04-12 23:56:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1484. [2018-04-12 23:56:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-04-12 23:56:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1485 transitions. [2018-04-12 23:56:01,253 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1485 transitions. Word has length 1474 [2018-04-12 23:56:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:01,253 INFO L459 AbstractCegarLoop]: Abstraction has 1484 states and 1485 transitions. [2018-04-12 23:56:01,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 23:56:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1485 transitions. [2018-04-12 23:56:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-04-12 23:56:01,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:01,265 INFO L355 BasicCegarLoop]: trace histogram [227, 209, 208, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:01,265 INFO L408 AbstractCegarLoop]: === Iteration 63 === [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-12 23:56:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 121936993, now seen corresponding path program 54 times [2018-04-12 23:56:01,266 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:01,371 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-04-12 23:56:02,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:02,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-12 23:56:02,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:02,148 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-12 23:56:02,148 INFO L182 omatonBuilderFactory]: Interpolants [69601#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 69600#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 69603#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 69602#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 69605#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 69604#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 69607#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 69606#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 69608#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 69587#false, 69586#true, 69589#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 69588#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 69591#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 69590#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 69593#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 69592#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 69595#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 69594#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 69597#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 69596#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 69599#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 69598#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)] [2018-04-12 23:56:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 139242 backedges. 22833 proven. 1083 refuted. 0 times theorem prover too weak. 115326 trivial. 0 not checked. [2018-04-12 23:56:02,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 23:56:02,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 23:56:02,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=290, Unknown=0, NotChecked=0, Total=506 [2018-04-12 23:56:02,150 INFO L87 Difference]: Start difference. First operand 1484 states and 1485 transitions. Second operand 23 states. [2018-04-12 23:56:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:02,395 INFO L93 Difference]: Finished difference Result 1496 states and 1498 transitions. [2018-04-12 23:56:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 23:56:02,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1480 [2018-04-12 23:56:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:02,397 INFO L225 Difference]: With dead ends: 1496 [2018-04-12 23:56:02,397 INFO L226 Difference]: Without dead ends: 1496 [2018-04-12 23:56:02,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-04-12 23:56:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-04-12 23:56:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1490. [2018-04-12 23:56:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-04-12 23:56:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1492 transitions. [2018-04-12 23:56:02,406 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1492 transitions. Word has length 1480 [2018-04-12 23:56:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:02,407 INFO L459 AbstractCegarLoop]: Abstraction has 1490 states and 1492 transitions. [2018-04-12 23:56:02,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 23:56:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1492 transitions. [2018-04-12 23:56:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1487 [2018-04-12 23:56:02,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:02,416 INFO L355 BasicCegarLoop]: trace histogram [228, 210, 209, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:02,416 INFO L408 AbstractCegarLoop]: === Iteration 64 === [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-12 23:56:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2003406247, now seen corresponding path program 55 times [2018-04-12 23:56:02,417 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:02,478 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-12 23:56:03,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:03,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-12 23:56:03,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:03,568 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-12 23:56:03,568 INFO L182 omatonBuilderFactory]: Interpolants [72641#(<= main_~i~1 8), 72640#(<= main_~i~1 7), 72643#(<= main_~i~1 10), 72642#(<= main_~i~1 9), 72645#(<= main_~i~1 12), 72644#(<= main_~i~1 11), 72647#(<= main_~i~1 14), 72646#(<= main_~i~1 13), 72649#(<= main_~i~1 16), 72648#(<= main_~i~1 15), 72651#(<= main_~i~1 18), 72650#(<= main_~i~1 17), 72653#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19), 72652#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 19), 72655#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 72654#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 72657#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 72656#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 72659#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 72658#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 72661#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 72660#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 72663#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 72662#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 72665#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 72664#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 72667#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 72666#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 72669#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 72668#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 72671#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 72670#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 72673#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 72672#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 72674#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 72631#true, 72633#(= main_~i~1 0), 72632#false, 72635#(<= main_~i~1 2), 72634#(<= main_~i~1 1), 72637#(<= main_~i~1 4), 72636#(<= main_~i~1 3), 72639#(<= main_~i~1 6), 72638#(<= main_~i~1 5)] [2018-04-12 23:56:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 140529 backedges. 25162 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-12 23:56:03,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 23:56:03,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 23:56:03,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 23:56:03,570 INFO L87 Difference]: Start difference. First operand 1490 states and 1492 transitions. Second operand 44 states. [2018-04-12 23:56:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:04,179 INFO L93 Difference]: Finished difference Result 1624 states and 1627 transitions. [2018-04-12 23:56:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 23:56:04,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1486 [2018-04-12 23:56:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:04,182 INFO L225 Difference]: With dead ends: 1624 [2018-04-12 23:56:04,182 INFO L226 Difference]: Without dead ends: 1624 [2018-04-12 23:56:04,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=991, Invalid=3169, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 23:56:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2018-04-12 23:56:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2018-04-12 23:56:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-04-12 23:56:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1625 transitions. [2018-04-12 23:56:04,189 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1625 transitions. Word has length 1486 [2018-04-12 23:56:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:04,190 INFO L459 AbstractCegarLoop]: Abstraction has 1622 states and 1625 transitions. [2018-04-12 23:56:04,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 23:56:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1625 transitions. [2018-04-12 23:56:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1613 [2018-04-12 23:56:04,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:04,202 INFO L355 BasicCegarLoop]: trace histogram [248, 229, 228, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:04,202 INFO L408 AbstractCegarLoop]: === Iteration 65 === [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-12 23:56:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -330410207, now seen corresponding path program 56 times [2018-04-12 23:56:04,203 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:04,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-04-12 23:56:05,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:05,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-12 23:56:05,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:05,446 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-12 23:56:05,446 INFO L182 omatonBuilderFactory]: Interpolants [75969#(<= 4 main_~i~1), 75968#(<= 3 main_~i~1), 75971#(<= 6 main_~i~1), 75970#(<= 5 main_~i~1), 75973#(<= 8 main_~i~1), 75972#(<= 7 main_~i~1), 75975#(<= 10 main_~i~1), 75974#(<= 9 main_~i~1), 75977#(<= 12 main_~i~1), 75976#(<= 11 main_~i~1), 75979#(<= 14 main_~i~1), 75978#(<= 13 main_~i~1), 75981#(<= 16 main_~i~1), 75980#(<= 15 main_~i~1), 75983#(<= 18 main_~i~1), 75982#(<= 17 main_~i~1), 75985#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 75984#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 75987#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 75986#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 75989#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 75988#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 75991#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 75990#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 75993#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 75992#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 75995#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 75994#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 75997#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 75996#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 75999#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 75998#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 76001#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 76000#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 76003#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 76002#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 76004#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 18), 75963#true, 75965#(<= 0 main_~i~1), 75964#false, 75967#(<= 2 main_~i~1), 75966#(<= 1 main_~i~1)] [2018-04-12 23:56:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 166801 backedges. 50201 proven. 1064 refuted. 0 times theorem prover too weak. 115536 trivial. 0 not checked. [2018-04-12 23:56:05,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 23:56:05,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 23:56:05,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 23:56:05,450 INFO L87 Difference]: Start difference. First operand 1622 states and 1625 transitions. Second operand 42 states. [2018-04-12 23:56:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:06,156 INFO L93 Difference]: Finished difference Result 1631 states and 1632 transitions. [2018-04-12 23:56:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-12 23:56:06,156 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1612 [2018-04-12 23:56:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:06,158 INFO L225 Difference]: With dead ends: 1631 [2018-04-12 23:56:06,158 INFO L226 Difference]: Without dead ends: 1625 [2018-04-12 23:56:06,158 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=2720, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 23:56:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2018-04-12 23:56:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1622. [2018-04-12 23:56:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-04-12 23:56:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1623 transitions. [2018-04-12 23:56:06,164 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1623 transitions. Word has length 1612 [2018-04-12 23:56:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:06,165 INFO L459 AbstractCegarLoop]: Abstraction has 1622 states and 1623 transitions. [2018-04-12 23:56:06,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 23:56:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1623 transitions. [2018-04-12 23:56:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-04-12 23:56:06,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:06,175 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-12 23:56:06,175 INFO L408 AbstractCegarLoop]: === Iteration 66 === [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-12 23:56:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 180154649, now seen corresponding path program 57 times [2018-04-12 23:56:06,176 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:06,256 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:07,096 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-12 23:56:07,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:07,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-12 23:56:07,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:07,097 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-12 23:56:07,097 INFO L182 omatonBuilderFactory]: Interpolants [79297#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 79296#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 79299#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 79298#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 79301#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 79300#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 79303#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 79302#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 79305#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 79304#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 79307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 79306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 79309#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 79308#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 79311#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 79310#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 79313#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 79312#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 79315#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 79314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 79317#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20) (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 79316#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 79295#false, 79294#true] [2018-04-12 23:56:07,099 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-12 23:56:07,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 23:56:07,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 23:56:07,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-04-12 23:56:07,100 INFO L87 Difference]: Start difference. First operand 1622 states and 1623 transitions. Second operand 24 states. [2018-04-12 23:56:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:07,422 INFO L93 Difference]: Finished difference Result 1634 states and 1636 transitions. [2018-04-12 23:56:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 23:56:07,422 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1618 [2018-04-12 23:56:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:07,424 INFO L225 Difference]: With dead ends: 1634 [2018-04-12 23:56:07,424 INFO L226 Difference]: Without dead ends: 1634 [2018-04-12 23:56:07,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=560, Invalid=1246, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 23:56:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-04-12 23:56:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1628. [2018-04-12 23:56:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-12 23:56:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1630 transitions. [2018-04-12 23:56:07,431 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1630 transitions. Word has length 1618 [2018-04-12 23:56:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:07,431 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1630 transitions. [2018-04-12 23:56:07,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 23:56:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1630 transitions. [2018-04-12 23:56:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-04-12 23:56:07,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:07,442 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-12 23:56:07,442 INFO L408 AbstractCegarLoop]: === Iteration 67 === [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-12 23:56:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1560650479, now seen corresponding path program 58 times [2018-04-12 23:56:07,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:07,514 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:08,751 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-12 23:56:08,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:08,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 23:56:08,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:08,752 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-12 23:56:08,752 INFO L182 omatonBuilderFactory]: Interpolants [82625#(<= main_~i~1 5), 82624#(<= main_~i~1 4), 82627#(<= main_~i~1 7), 82626#(<= main_~i~1 6), 82629#(<= main_~i~1 9), 82628#(<= main_~i~1 8), 82631#(<= main_~i~1 11), 82630#(<= main_~i~1 10), 82633#(<= main_~i~1 13), 82632#(<= main_~i~1 12), 82635#(<= main_~i~1 15), 82634#(<= main_~i~1 14), 82637#(<= main_~i~1 17), 82636#(<= main_~i~1 16), 82639#(<= main_~i~1 19), 82638#(<= main_~i~1 18), 82641#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20), 82640#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 82643#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 82642#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 82645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 82644#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 82647#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 82646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 82649#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 82648#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 82651#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 82650#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 82653#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 82652#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 82655#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 82654#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 82657#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 82656#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 82659#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 82658#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 82661#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 82660#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 82663#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 82662#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 82619#false, 82618#true, 82621#(<= main_~i~1 1), 82620#(= main_~i~1 0), 82623#(<= main_~i~1 3), 82622#(<= main_~i~1 2)] [2018-04-12 23:56:08,754 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-12 23:56:08,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 23:56:08,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 23:56:08,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 23:56:08,754 INFO L87 Difference]: Start difference. First operand 1628 states and 1630 transitions. Second operand 46 states. [2018-04-12 23:56:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:09,490 INFO L93 Difference]: Finished difference Result 1768 states and 1771 transitions. [2018-04-12 23:56:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 23:56:09,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1624 [2018-04-12 23:56:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:09,492 INFO L225 Difference]: With dead ends: 1768 [2018-04-12 23:56:09,493 INFO L226 Difference]: Without dead ends: 1768 [2018-04-12 23:56:09,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1082, Invalid=3474, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 23:56:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-04-12 23:56:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2018-04-12 23:56:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2018-04-12 23:56:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 1769 transitions. [2018-04-12 23:56:09,502 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 1769 transitions. Word has length 1624 [2018-04-12 23:56:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:09,502 INFO L459 AbstractCegarLoop]: Abstraction has 1766 states and 1769 transitions. [2018-04-12 23:56:09,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 23:56:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 1769 transitions. [2018-04-12 23:56:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-04-12 23:56:09,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:09,515 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-12 23:56:09,515 INFO L408 AbstractCegarLoop]: === Iteration 68 === [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-12 23:56:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash 963996625, now seen corresponding path program 59 times [2018-04-12 23:56:09,516 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:09,585 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:11,163 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-12 23:56:11,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:11,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 23:56:11,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:11,163 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-12 23:56:11,163 INFO L182 omatonBuilderFactory]: Interpolants [86273#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 86272#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 86275#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 86274#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 86277#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 86276#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 86279#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 86278#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 86281#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 86280#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 86283#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 86282#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 86285#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 86284#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 86287#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 86286#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 86289#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 86288#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 86291#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 86290#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 86243#false, 86242#true, 86245#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 86244#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 86247#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 86246#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 86249#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 86248#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 86251#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 86250#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 86253#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 86252#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 86255#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 86254#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 86257#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 86256#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 86259#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 86258#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 86261#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 86260#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 86263#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 86262#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 86265#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 19), 86264#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 86267#(<= main_~i~1 19), 86266#(<= main_~i~1 18), 86269#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20), 86268#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 86271#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 86270#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20))] [2018-04-12 23:56:11,166 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-12 23:56:11,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 23:56:11,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 23:56:11,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 23:56:11,167 INFO L87 Difference]: Start difference. First operand 1766 states and 1769 transitions. Second operand 50 states. [2018-04-12 23:56:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:12,298 INFO L93 Difference]: Finished difference Result 1918 states and 1922 transitions. [2018-04-12 23:56:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-12 23:56:12,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1756 [2018-04-12 23:56:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:12,301 INFO L225 Difference]: With dead ends: 1918 [2018-04-12 23:56:12,301 INFO L226 Difference]: Without dead ends: 1918 [2018-04-12 23:56:12,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2332, Invalid=6598, Unknown=0, NotChecked=0, Total=8930 [2018-04-12 23:56:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2018-04-12 23:56:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1772. [2018-04-12 23:56:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-04-12 23:56:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 1775 transitions. [2018-04-12 23:56:12,311 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 1775 transitions. Word has length 1756 [2018-04-12 23:56:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:12,312 INFO L459 AbstractCegarLoop]: Abstraction has 1772 states and 1775 transitions. [2018-04-12 23:56:12,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 23:56:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 1775 transitions. [2018-04-12 23:56:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-04-12 23:56:12,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:12,324 INFO L355 BasicCegarLoop]: trace histogram [272, 252, 251, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:12,324 INFO L408 AbstractCegarLoop]: === Iteration 69 === [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-12 23:56:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1134640695, now seen corresponding path program 60 times [2018-04-12 23:56:12,325 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:12,457 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-04-12 23:56:13,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:13,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-12 23:56:13,444 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:13,444 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-12 23:56:13,444 INFO L182 omatonBuilderFactory]: Interpolants [90073#false, 90072#true, 90075#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 90074#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 90077#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 90076#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 90079#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 90078#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 90081#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 90080#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 90083#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 90082#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 90085#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 90084#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 90087#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 90086#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 90089#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 90088#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 90091#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 90090#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 90093#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 90092#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 90095#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 90094#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 90096#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21))] [2018-04-12 23:56:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 201463 backedges. 30550 proven. 1323 refuted. 0 times theorem prover too weak. 169590 trivial. 0 not checked. [2018-04-12 23:56:13,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 23:56:13,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 23:56:13,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-04-12 23:56:13,447 INFO L87 Difference]: Start difference. First operand 1772 states and 1775 transitions. Second operand 25 states. [2018-04-12 23:56:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:13,732 INFO L93 Difference]: Finished difference Result 1784 states and 1788 transitions. [2018-04-12 23:56:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 23:56:13,733 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1762 [2018-04-12 23:56:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:13,735 INFO L225 Difference]: With dead ends: 1784 [2018-04-12 23:56:13,735 INFO L226 Difference]: Without dead ends: 1784 [2018-04-12 23:56:13,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 23:56:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2018-04-12 23:56:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1778. [2018-04-12 23:56:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-04-12 23:56:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1782 transitions. [2018-04-12 23:56:13,742 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1782 transitions. Word has length 1762 [2018-04-12 23:56:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:13,742 INFO L459 AbstractCegarLoop]: Abstraction has 1778 states and 1782 transitions. [2018-04-12 23:56:13,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 23:56:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1782 transitions. [2018-04-12 23:56:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-04-12 23:56:13,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:13,755 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-12 23:56:13,755 INFO L408 AbstractCegarLoop]: === Iteration 70 === [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-12 23:56:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1179183553, now seen corresponding path program 61 times [2018-04-12 23:56:13,755 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:13,841 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:15,217 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-12 23:56:15,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:15,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 23:56:15,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:15,218 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-12 23:56:15,218 INFO L182 omatonBuilderFactory]: Interpolants [93699#true, 93701#(= main_~i~1 0), 93700#false, 93703#(<= main_~i~1 2), 93702#(<= main_~i~1 1), 93705#(<= main_~i~1 4), 93704#(<= main_~i~1 3), 93707#(<= main_~i~1 6), 93706#(<= main_~i~1 5), 93709#(<= main_~i~1 8), 93708#(<= main_~i~1 7), 93711#(<= main_~i~1 10), 93710#(<= main_~i~1 9), 93713#(<= main_~i~1 12), 93712#(<= main_~i~1 11), 93715#(<= main_~i~1 14), 93714#(<= main_~i~1 13), 93717#(<= main_~i~1 16), 93716#(<= main_~i~1 15), 93719#(<= main_~i~1 18), 93718#(<= main_~i~1 17), 93721#(<= main_~i~1 20), 93720#(<= main_~i~1 19), 93723#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21), 93722#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 21), 93725#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 93724#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 93727#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 93726#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 93729#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 93728#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 93731#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 93730#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 93733#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 93732#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 93735#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 93734#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 93737#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 93736#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 93739#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 93738#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 93741#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 93740#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 93743#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 93742#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 93745#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 93744#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 93746#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:56:15,220 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-12 23:56:15,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 23:56:15,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 23:56:15,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 23:56:15,221 INFO L87 Difference]: Start difference. First operand 1778 states and 1782 transitions. Second operand 48 states. [2018-04-12 23:56:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:16,097 INFO L93 Difference]: Finished difference Result 2076 states and 2085 transitions. [2018-04-12 23:56:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-12 23:56:16,097 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1768 [2018-04-12 23:56:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:16,101 INFO L225 Difference]: With dead ends: 2076 [2018-04-12 23:56:16,101 INFO L226 Difference]: Without dead ends: 2076 [2018-04-12 23:56:16,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-04-12 23:56:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2018-04-12 23:56:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2072. [2018-04-12 23:56:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-12 23:56:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2081 transitions. [2018-04-12 23:56:16,119 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2081 transitions. Word has length 1768 [2018-04-12 23:56:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:16,120 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2081 transitions. [2018-04-12 23:56:16,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 23:56:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2081 transitions. [2018-04-12 23:56:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-04-12 23:56:16,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:16,141 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-12 23:56:16,141 INFO L408 AbstractCegarLoop]: === Iteration 71 === [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-12 23:56:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1197311871, now seen corresponding path program 62 times [2018-04-12 23:56:16,142 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:16,222 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:17,790 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-12 23:56:17,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:17,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-12 23:56:17,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-12 23:56:17,791 INFO L182 omatonBuilderFactory]: Interpolants [97985#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 97984#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 97986#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 20), 97941#true, 97943#(<= 0 main_~i~1), 97942#false, 97945#(<= 2 main_~i~1), 97944#(<= 1 main_~i~1), 97947#(<= 4 main_~i~1), 97946#(<= 3 main_~i~1), 97949#(<= 6 main_~i~1), 97948#(<= 5 main_~i~1), 97951#(<= 8 main_~i~1), 97950#(<= 7 main_~i~1), 97953#(<= 10 main_~i~1), 97952#(<= 9 main_~i~1), 97955#(<= 12 main_~i~1), 97954#(<= 11 main_~i~1), 97957#(<= 14 main_~i~1), 97956#(<= 13 main_~i~1), 97959#(<= 16 main_~i~1), 97958#(<= 15 main_~i~1), 97961#(<= 18 main_~i~1), 97960#(<= 17 main_~i~1), 97963#(<= 20 main_~i~1), 97962#(<= 19 main_~i~1), 97965#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 97964#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 97967#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 97966#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 97969#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 97968#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 97971#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 97970#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 97973#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 97972#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 97975#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 97974#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 97977#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 97976#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 97979#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 97978#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 97981#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 97980#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 97983#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 97982#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18))] [2018-04-12 23:56:17,794 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-12 23:56:17,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-12 23:56:17,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-12 23:56:17,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-04-12 23:56:17,794 INFO L87 Difference]: Start difference. First operand 2072 states and 2081 transitions. Second operand 46 states. [2018-04-12 23:56:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:18,246 INFO L93 Difference]: Finished difference Result 1940 states and 1942 transitions. [2018-04-12 23:56:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-12 23:56:18,246 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1900 [2018-04-12 23:56:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:18,250 INFO L225 Difference]: With dead ends: 1940 [2018-04-12 23:56:18,250 INFO L226 Difference]: Without dead ends: 1919 [2018-04-12 23:56:18,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=990, Invalid=3300, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 23:56:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2018-04-12 23:56:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1916. [2018-04-12 23:56:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-04-12 23:56:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 1917 transitions. [2018-04-12 23:56:18,260 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 1917 transitions. Word has length 1900 [2018-04-12 23:56:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:18,260 INFO L459 AbstractCegarLoop]: Abstraction has 1916 states and 1917 transitions. [2018-04-12 23:56:18,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-12 23:56:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 1917 transitions. [2018-04-12 23:56:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-04-12 23:56:18,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:18,275 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-12 23:56:18,275 INFO L408 AbstractCegarLoop]: === Iteration 72 === [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-12 23:56:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1548555889, now seen corresponding path program 63 times [2018-04-12 23:56:18,275 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:18,361 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:19,517 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-12 23:56:19,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:19,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-12 23:56:19,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:19,518 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-12 23:56:19,518 INFO L182 omatonBuilderFactory]: Interpolants [101889#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 101888#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 101891#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 101890#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 101893#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 101892#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 101895#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 101894#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 101897#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 101896#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 101899#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 101898#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 101901#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 101900#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 101903#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 101902#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 101905#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 101904#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 101907#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 101906#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 101908#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 101883#true, 101885#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 101884#false, 101887#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 101886#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)] [2018-04-12 23:56:19,521 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-12 23:56:19,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 23:56:19,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 23:56:19,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=389, Unknown=0, NotChecked=0, Total=650 [2018-04-12 23:56:19,521 INFO L87 Difference]: Start difference. First operand 1916 states and 1917 transitions. Second operand 26 states. [2018-04-12 23:56:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:19,885 INFO L93 Difference]: Finished difference Result 1928 states and 1930 transitions. [2018-04-12 23:56:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 23:56:19,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1912 [2018-04-12 23:56:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:19,889 INFO L225 Difference]: With dead ends: 1928 [2018-04-12 23:56:19,890 INFO L226 Difference]: Without dead ends: 1928 [2018-04-12 23:56:19,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2018-04-12 23:56:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-04-12 23:56:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2018-04-12 23:56:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-04-12 23:56:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 1924 transitions. [2018-04-12 23:56:19,899 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 1924 transitions. Word has length 1912 [2018-04-12 23:56:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:19,899 INFO L459 AbstractCegarLoop]: Abstraction has 1922 states and 1924 transitions. [2018-04-12 23:56:19,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 23:56:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 1924 transitions. [2018-04-12 23:56:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-04-12 23:56:19,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:19,915 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-12 23:56:19,915 INFO L408 AbstractCegarLoop]: === Iteration 73 === [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-12 23:56:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash -29417367, now seen corresponding path program 64 times [2018-04-12 23:56:19,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:20,018 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:21,587 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-12 23:56:21,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:21,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 23:56:21,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:21,588 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-12 23:56:21,588 INFO L182 omatonBuilderFactory]: Interpolants [105801#true, 105803#(= main_~i~1 0), 105802#false, 105805#(<= main_~i~1 2), 105804#(<= main_~i~1 1), 105807#(<= main_~i~1 4), 105806#(<= main_~i~1 3), 105809#(<= main_~i~1 6), 105808#(<= main_~i~1 5), 105811#(<= main_~i~1 8), 105810#(<= main_~i~1 7), 105813#(<= main_~i~1 10), 105812#(<= main_~i~1 9), 105815#(<= main_~i~1 12), 105814#(<= main_~i~1 11), 105817#(<= main_~i~1 14), 105816#(<= main_~i~1 13), 105819#(<= main_~i~1 16), 105818#(<= main_~i~1 15), 105821#(<= main_~i~1 18), 105820#(<= main_~i~1 17), 105823#(<= main_~i~1 20), 105822#(<= main_~i~1 19), 105825#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 22), 105824#(<= main_~i~1 21), 105827#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 105826#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22), 105829#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 105828#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 105831#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 105830#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 105833#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 105832#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 105835#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 105834#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 105837#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 105836#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 105839#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 105838#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 105841#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 105840#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 105843#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 105842#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 105845#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 105844#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 105847#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 105846#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 105849#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 105848#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 105850#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:56:21,591 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-12 23:56:21,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 23:56:21,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 23:56:21,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 23:56:21,591 INFO L87 Difference]: Start difference. First operand 1922 states and 1924 transitions. Second operand 50 states. [2018-04-12 23:56:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:22,557 INFO L93 Difference]: Finished difference Result 2074 states and 2077 transitions. [2018-04-12 23:56:22,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-12 23:56:22,558 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1918 [2018-04-12 23:56:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:22,561 INFO L225 Difference]: With dead ends: 2074 [2018-04-12 23:56:22,561 INFO L226 Difference]: Without dead ends: 2074 [2018-04-12 23:56:22,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1276, Invalid=4126, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 23:56:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2018-04-12 23:56:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2072. [2018-04-12 23:56:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-12 23:56:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2075 transitions. [2018-04-12 23:56:22,569 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2075 transitions. Word has length 1918 [2018-04-12 23:56:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:22,570 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2075 transitions. [2018-04-12 23:56:22,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 23:56:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2075 transitions. [2018-04-12 23:56:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-04-12 23:56:22,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:22,597 INFO L355 BasicCegarLoop]: trace histogram [320, 298, 297, 297, 297, 297, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:22,597 INFO L408 AbstractCegarLoop]: === Iteration 74 === [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-12 23:56:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1148758297, now seen corresponding path program 65 times [2018-04-12 23:56:22,598 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:22,683 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-04-12 23:56:24,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:24,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-12 23:56:24,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:24,432 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-12 23:56:24,432 INFO L182 omatonBuilderFactory]: Interpolants [110081#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 110080#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 110083#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 110082#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 110085#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 110084#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 110087#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 110086#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 110089#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 110088#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 110091#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 110090#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 110092#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 21), 110045#true, 110047#(<= 0 main_~i~1), 110046#false, 110049#(<= 2 main_~i~1), 110048#(<= 1 main_~i~1), 110051#(<= 4 main_~i~1), 110050#(<= 3 main_~i~1), 110053#(<= 6 main_~i~1), 110052#(<= 5 main_~i~1), 110055#(<= 8 main_~i~1), 110054#(<= 7 main_~i~1), 110057#(<= 10 main_~i~1), 110056#(<= 9 main_~i~1), 110059#(<= 12 main_~i~1), 110058#(<= 11 main_~i~1), 110061#(<= 14 main_~i~1), 110060#(<= 13 main_~i~1), 110063#(<= 16 main_~i~1), 110062#(<= 15 main_~i~1), 110065#(<= 18 main_~i~1), 110064#(<= 17 main_~i~1), 110067#(<= 20 main_~i~1), 110066#(<= 19 main_~i~1), 110069#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 110068#(<= 21 main_~i~1), 110071#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 110070#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 110073#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 110072#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 110075#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 110074#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 110077#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 110076#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 110079#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 110078#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9))] [2018-04-12 23:56:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 280621 backedges. 75983 proven. 1430 refuted. 0 times theorem prover too weak. 203208 trivial. 0 not checked. [2018-04-12 23:56:24,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-12 23:56:24,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-12 23:56:24,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1679, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 23:56:24,436 INFO L87 Difference]: Start difference. First operand 2072 states and 2075 transitions. Second operand 48 states. [2018-04-12 23:56:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:25,073 INFO L93 Difference]: Finished difference Result 2081 states and 2082 transitions. [2018-04-12 23:56:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 23:56:25,074 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2062 [2018-04-12 23:56:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:25,077 INFO L225 Difference]: With dead ends: 2081 [2018-04-12 23:56:25,077 INFO L226 Difference]: Without dead ends: 2075 [2018-04-12 23:56:25,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1081, Invalid=3611, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 23:56:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-04-12 23:56:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2072. [2018-04-12 23:56:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-04-12 23:56:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2073 transitions. [2018-04-12 23:56:25,091 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2073 transitions. Word has length 2062 [2018-04-12 23:56:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:25,092 INFO L459 AbstractCegarLoop]: Abstraction has 2072 states and 2073 transitions. [2018-04-12 23:56:25,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-12 23:56:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2073 transitions. [2018-04-12 23:56:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2069 [2018-04-12 23:56:25,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:25,119 INFO L355 BasicCegarLoop]: trace histogram [321, 299, 298, 298, 298, 298, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:25,120 INFO L408 AbstractCegarLoop]: === Iteration 75 === [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-12 23:56:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1453135599, now seen corresponding path program 66 times [2018-04-12 23:56:25,121 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:25,249 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-04-12 23:56:26,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:26,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-12 23:56:26,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:26,545 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-12 23:56:26,545 INFO L182 omatonBuilderFactory]: Interpolants [114305#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 114304#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 114307#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 114306#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 114309#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 114308#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 114311#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 114310#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 114313#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 114312#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 114314#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 114289#false, 114288#true, 114291#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 114290#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 114293#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 114292#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 114295#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 114294#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 114297#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 114296#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 114299#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 114298#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 114301#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 114300#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 114303#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 114302#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)] [2018-04-12 23:56:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 282450 backedges. 39831 proven. 1587 refuted. 0 times theorem prover too weak. 241032 trivial. 0 not checked. [2018-04-12 23:56:26,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 23:56:26,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 23:56:26,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=396, Unknown=0, NotChecked=0, Total=702 [2018-04-12 23:56:26,550 INFO L87 Difference]: Start difference. First operand 2072 states and 2073 transitions. Second operand 27 states. [2018-04-12 23:56:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:26,882 INFO L93 Difference]: Finished difference Result 2084 states and 2086 transitions. [2018-04-12 23:56:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 23:56:26,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 2068 [2018-04-12 23:56:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:26,885 INFO L225 Difference]: With dead ends: 2084 [2018-04-12 23:56:26,885 INFO L226 Difference]: Without dead ends: 2084 [2018-04-12 23:56:26,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 23:56:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2018-04-12 23:56:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2078. [2018-04-12 23:56:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2018-04-12 23:56:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2080 transitions. [2018-04-12 23:56:26,894 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2080 transitions. Word has length 2068 [2018-04-12 23:56:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:26,894 INFO L459 AbstractCegarLoop]: Abstraction has 2078 states and 2080 transitions. [2018-04-12 23:56:26,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 23:56:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2080 transitions. [2018-04-12 23:56:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2075 [2018-04-12 23:56:26,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:26,911 INFO L355 BasicCegarLoop]: trace histogram [322, 300, 299, 299, 299, 299, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:26,911 INFO L408 AbstractCegarLoop]: === Iteration 76 === [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-12 23:56:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1410628361, now seen corresponding path program 67 times [2018-04-12 23:56:26,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:27,026 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-04-12 23:56:28,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:28,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 23:56:28,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:28,843 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-12 23:56:28,843 INFO L182 omatonBuilderFactory]: Interpolants [118529#(<= main_~i~1 6), 118528#(<= main_~i~1 5), 118531#(<= main_~i~1 8), 118530#(<= main_~i~1 7), 118533#(<= main_~i~1 10), 118532#(<= main_~i~1 9), 118535#(<= main_~i~1 12), 118534#(<= main_~i~1 11), 118537#(<= main_~i~1 14), 118536#(<= main_~i~1 13), 118539#(<= main_~i~1 16), 118538#(<= main_~i~1 15), 118541#(<= main_~i~1 18), 118540#(<= main_~i~1 17), 118543#(<= main_~i~1 20), 118542#(<= main_~i~1 19), 118545#(<= main_~i~1 22), 118544#(<= main_~i~1 21), 118547#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23), 118546#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 23), 118549#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 118548#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 118551#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 118550#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 118553#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 118552#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 118555#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 118554#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 118557#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 118556#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 118559#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 118558#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 118561#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 118560#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 118563#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 118562#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 118565#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 118564#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 118567#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 118566#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 118569#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 118568#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 118571#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 118570#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 118572#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 118521#true, 118523#(= main_~i~1 0), 118522#false, 118525#(<= main_~i~1 2), 118524#(<= main_~i~1 1), 118527#(<= main_~i~1 4), 118526#(<= main_~i~1 3)] [2018-04-12 23:56:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 284285 backedges. 43204 proven. 1545 refuted. 0 times theorem prover too weak. 239536 trivial. 0 not checked. [2018-04-12 23:56:28,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 23:56:28,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 23:56:28,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1998, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 23:56:28,847 INFO L87 Difference]: Start difference. First operand 2078 states and 2080 transitions. Second operand 52 states. [2018-04-12 23:56:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:29,723 INFO L93 Difference]: Finished difference Result 2236 states and 2239 transitions. [2018-04-12 23:56:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 23:56:29,723 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2074 [2018-04-12 23:56:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:29,726 INFO L225 Difference]: With dead ends: 2236 [2018-04-12 23:56:29,726 INFO L226 Difference]: Without dead ends: 2236 [2018-04-12 23:56:29,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1379, Invalid=4473, Unknown=0, NotChecked=0, Total=5852 [2018-04-12 23:56:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2018-04-12 23:56:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2018-04-12 23:56:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-04-12 23:56:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2237 transitions. [2018-04-12 23:56:29,742 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2237 transitions. Word has length 2074 [2018-04-12 23:56:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:29,743 INFO L459 AbstractCegarLoop]: Abstraction has 2234 states and 2237 transitions. [2018-04-12 23:56:29,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 23:56:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2237 transitions. [2018-04-12 23:56:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2225 [2018-04-12 23:56:29,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:29,774 INFO L355 BasicCegarLoop]: trace histogram [346, 323, 322, 322, 322, 322, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:29,774 INFO L408 AbstractCegarLoop]: === Iteration 77 === [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-12 23:56:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1590184015, now seen corresponding path program 68 times [2018-04-12 23:56:29,775 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:29,890 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-04-12 23:56:31,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:31,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-12 23:56:31,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:31,949 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-12 23:56:31,949 INFO L182 omatonBuilderFactory]: Interpolants [123137#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 123136#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 123139#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 123138#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 123141#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 123140#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 123142#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 22), 123093#true, 123095#(<= 0 main_~i~1), 123094#false, 123097#(<= 2 main_~i~1), 123096#(<= 1 main_~i~1), 123099#(<= 4 main_~i~1), 123098#(<= 3 main_~i~1), 123101#(<= 6 main_~i~1), 123100#(<= 5 main_~i~1), 123103#(<= 8 main_~i~1), 123102#(<= 7 main_~i~1), 123105#(<= 10 main_~i~1), 123104#(<= 9 main_~i~1), 123107#(<= 12 main_~i~1), 123106#(<= 11 main_~i~1), 123109#(<= 14 main_~i~1), 123108#(<= 13 main_~i~1), 123111#(<= 16 main_~i~1), 123110#(<= 15 main_~i~1), 123113#(<= 18 main_~i~1), 123112#(<= 17 main_~i~1), 123115#(<= 20 main_~i~1), 123114#(<= 19 main_~i~1), 123117#(<= 22 main_~i~1), 123116#(<= 21 main_~i~1), 123119#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 123118#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 123121#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 123120#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 123123#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 123122#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 123125#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 123124#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 123127#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 123126#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 123129#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 123128#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 123131#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 123130#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 123133#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 123132#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 123135#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 123134#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16))] [2018-04-12 23:56:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 329061 backedges. 86211 proven. 1564 refuted. 0 times theorem prover too weak. 241286 trivial. 0 not checked. [2018-04-12 23:56:31,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 23:56:31,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 23:56:31,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 23:56:31,954 INFO L87 Difference]: Start difference. First operand 2234 states and 2237 transitions. Second operand 50 states. [2018-04-12 23:56:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:32,533 INFO L93 Difference]: Finished difference Result 2243 states and 2244 transitions. [2018-04-12 23:56:32,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-12 23:56:32,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2224 [2018-04-12 23:56:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:32,536 INFO L225 Difference]: With dead ends: 2243 [2018-04-12 23:56:32,536 INFO L226 Difference]: Without dead ends: 2237 [2018-04-12 23:56:32,536 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1176, Invalid=3936, Unknown=0, NotChecked=0, Total=5112 [2018-04-12 23:56:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2018-04-12 23:56:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2234. [2018-04-12 23:56:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-04-12 23:56:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2235 transitions. [2018-04-12 23:56:32,547 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2235 transitions. Word has length 2224 [2018-04-12 23:56:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:32,548 INFO L459 AbstractCegarLoop]: Abstraction has 2234 states and 2235 transitions. [2018-04-12 23:56:32,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 23:56:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2235 transitions. [2018-04-12 23:56:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2231 [2018-04-12 23:56:32,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:32,567 INFO L355 BasicCegarLoop]: trace histogram [347, 324, 323, 323, 323, 323, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:32,567 INFO L408 AbstractCegarLoop]: === Iteration 78 === [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-12 23:56:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1264821673, now seen corresponding path program 69 times [2018-04-12 23:56:32,568 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:32,677 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-04-12 23:56:34,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:34,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-12 23:56:34,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:34,210 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-12 23:56:34,211 INFO L182 omatonBuilderFactory]: Interpolants [127681#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 127680#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 127683#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 127682#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 127685#(and (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 127684#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 127687#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20) (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127686#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 127689#(and (<= 6 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 127688#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21) (<= 5 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127691#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24) (<= 8 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127690#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23) (<= 7 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 127665#false, 127664#true, 127667#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 127666#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 127669#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 127668#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 127671#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 127670#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 127673#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 127672#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 127675#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 127674#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 127677#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 127676#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 127679#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 127678#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)] [2018-04-12 23:56:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 331042 backedges. 45103 proven. 1728 refuted. 0 times theorem prover too weak. 284211 trivial. 0 not checked. [2018-04-12 23:56:34,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 23:56:34,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 23:56:34,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-04-12 23:56:34,214 INFO L87 Difference]: Start difference. First operand 2234 states and 2235 transitions. Second operand 28 states. [2018-04-12 23:56:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:34,749 INFO L93 Difference]: Finished difference Result 2246 states and 2248 transitions. [2018-04-12 23:56:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-12 23:56:34,750 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 2230 [2018-04-12 23:56:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:34,752 INFO L225 Difference]: With dead ends: 2246 [2018-04-12 23:56:34,752 INFO L226 Difference]: Without dead ends: 2246 [2018-04-12 23:56:34,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=644, Invalid=1906, Unknown=0, NotChecked=0, Total=2550 [2018-04-12 23:56:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2018-04-12 23:56:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2240. [2018-04-12 23:56:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2018-04-12 23:56:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2242 transitions. [2018-04-12 23:56:34,761 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2242 transitions. Word has length 2230 [2018-04-12 23:56:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:34,761 INFO L459 AbstractCegarLoop]: Abstraction has 2240 states and 2242 transitions. [2018-04-12 23:56:34,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 23:56:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2242 transitions. [2018-04-12 23:56:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2237 [2018-04-12 23:56:34,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:34,780 INFO L355 BasicCegarLoop]: trace histogram [348, 325, 324, 324, 324, 324, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:34,780 INFO L408 AbstractCegarLoop]: === Iteration 79 === [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-12 23:56:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -229939807, now seen corresponding path program 70 times [2018-04-12 23:56:34,780 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:34,882 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 333029 backedges. 48767 proven. 1684 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-04-12 23:56:36,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:36,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 23:56:36,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:36,874 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-12 23:56:36,874 INFO L182 omatonBuilderFactory]: Interpolants [132226#(= main_~i~1 0), 132227#(<= main_~i~1 1), 132224#true, 132225#false, 132230#(<= main_~i~1 4), 132231#(<= main_~i~1 5), 132228#(<= main_~i~1 2), 132229#(<= main_~i~1 3), 132234#(<= main_~i~1 8), 132235#(<= main_~i~1 9), 132232#(<= main_~i~1 6), 132233#(<= main_~i~1 7), 132238#(<= main_~i~1 12), 132239#(<= main_~i~1 13), 132236#(<= main_~i~1 10), 132237#(<= main_~i~1 11), 132242#(<= main_~i~1 16), 132243#(<= main_~i~1 17), 132240#(<= main_~i~1 14), 132241#(<= main_~i~1 15), 132246#(<= main_~i~1 20), 132247#(<= main_~i~1 21), 132244#(<= main_~i~1 18), 132245#(<= main_~i~1 19), 132250#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 24), 132251#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24), 132248#(<= main_~i~1 22), 132249#(<= main_~i~1 23), 132254#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 132255#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 132252#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 132253#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 132258#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 132259#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 132256#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 132257#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 132262#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 132263#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 132260#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 132261#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 132266#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 132267#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 132264#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 132265#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 132270#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 132271#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 132268#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 132269#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 132274#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 132275#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 132272#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 132273#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 132276#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 132277#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:56:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 333029 backedges. 48767 proven. 1684 refuted. 0 times theorem prover too weak. 282578 trivial. 0 not checked. [2018-04-12 23:56:36,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 23:56:36,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 23:56:36,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=2156, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 23:56:36,878 INFO L87 Difference]: Start difference. First operand 2240 states and 2242 transitions. Second operand 54 states. [2018-04-12 23:56:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:37,977 INFO L93 Difference]: Finished difference Result 2404 states and 2407 transitions. [2018-04-12 23:56:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-12 23:56:37,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2236 [2018-04-12 23:56:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:37,981 INFO L225 Difference]: With dead ends: 2404 [2018-04-12 23:56:37,981 INFO L226 Difference]: Without dead ends: 2404 [2018-04-12 23:56:37,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1486, Invalid=4834, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 23:56:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2018-04-12 23:56:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2402. [2018-04-12 23:56:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-04-12 23:56:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 2405 transitions. [2018-04-12 23:56:37,990 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 2405 transitions. Word has length 2236 [2018-04-12 23:56:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:37,991 INFO L459 AbstractCegarLoop]: Abstraction has 2402 states and 2405 transitions. [2018-04-12 23:56:37,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 23:56:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2405 transitions. [2018-04-12 23:56:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2393 [2018-04-12 23:56:38,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:38,011 INFO L355 BasicCegarLoop]: trace histogram [373, 349, 348, 348, 348, 348, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:38,011 INFO L408 AbstractCegarLoop]: === Iteration 80 === [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-12 23:56:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1174542271, now seen corresponding path program 71 times [2018-04-12 23:56:38,012 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:38,112 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 383496 backedges. 97316 proven. 1704 refuted. 0 times theorem prover too weak. 284476 trivial. 0 not checked. [2018-04-12 23:56:40,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:40,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-12 23:56:40,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:40,375 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-12 23:56:40,375 INFO L182 omatonBuilderFactory]: Interpolants [137138#(<= 0 main_~i~1), 137139#(<= 1 main_~i~1), 137136#true, 137137#false, 137142#(<= 4 main_~i~1), 137143#(<= 5 main_~i~1), 137140#(<= 2 main_~i~1), 137141#(<= 3 main_~i~1), 137146#(<= 8 main_~i~1), 137147#(<= 9 main_~i~1), 137144#(<= 6 main_~i~1), 137145#(<= 7 main_~i~1), 137150#(<= 12 main_~i~1), 137151#(<= 13 main_~i~1), 137148#(<= 10 main_~i~1), 137149#(<= 11 main_~i~1), 137154#(<= 16 main_~i~1), 137155#(<= 17 main_~i~1), 137152#(<= 14 main_~i~1), 137153#(<= 15 main_~i~1), 137158#(<= 20 main_~i~1), 137159#(<= 21 main_~i~1), 137156#(<= 18 main_~i~1), 137157#(<= 19 main_~i~1), 137162#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 137163#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 137160#(<= 22 main_~i~1), 137161#(<= 23 main_~i~1), 137166#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 137167#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 137164#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 137165#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 137170#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 137171#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 137168#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 137169#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 137174#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 137175#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 137172#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 137173#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 137178#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 137179#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 137176#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 137177#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 137182#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 137183#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 137180#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 137181#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 137186#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 137187#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 23), 137184#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 137185#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23))] [2018-04-12 23:56:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 383496 backedges. 97316 proven. 1704 refuted. 0 times theorem prover too weak. 284476 trivial. 0 not checked. [2018-04-12 23:56:40,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-12 23:56:40,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-12 23:56:40,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1975, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 23:56:40,380 INFO L87 Difference]: Start difference. First operand 2402 states and 2405 transitions. Second operand 52 states. [2018-04-12 23:56:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:41,370 INFO L93 Difference]: Finished difference Result 2411 states and 2412 transitions. [2018-04-12 23:56:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-12 23:56:41,370 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2392 [2018-04-12 23:56:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:41,372 INFO L225 Difference]: With dead ends: 2411 [2018-04-12 23:56:41,372 INFO L226 Difference]: Without dead ends: 2405 [2018-04-12 23:56:41,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1275, Invalid=4275, Unknown=0, NotChecked=0, Total=5550 [2018-04-12 23:56:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-04-12 23:56:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2402. [2018-04-12 23:56:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2018-04-12 23:56:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 2403 transitions. [2018-04-12 23:56:41,382 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 2403 transitions. Word has length 2392 [2018-04-12 23:56:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:41,383 INFO L459 AbstractCegarLoop]: Abstraction has 2402 states and 2403 transitions. [2018-04-12 23:56:41,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-12 23:56:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2403 transitions. [2018-04-12 23:56:41,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2399 [2018-04-12 23:56:41,404 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:41,404 INFO L355 BasicCegarLoop]: trace histogram [374, 350, 349, 349, 349, 349, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:41,404 INFO L408 AbstractCegarLoop]: === Iteration 81 === [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-12 23:56:41,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1005049287, now seen corresponding path program 72 times [2018-04-12 23:56:41,405 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:41,519 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 385635 backedges. 50820 proven. 1875 refuted. 0 times theorem prover too weak. 332940 trivial. 0 not checked. [2018-04-12 23:56:43,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:43,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-12 23:56:43,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:43,190 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-12 23:56:43,190 INFO L182 omatonBuilderFactory]: Interpolants [142047#true, 142050#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 142051#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 142048#false, 142049#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 142054#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 142055#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 142052#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 142053#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 142058#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 142059#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 142056#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 142057#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 142062#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 142063#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 142060#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 142061#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 142066#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 142067#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 142064#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 142065#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 142070#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 142071#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 142068#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 142069#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 142074#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 142075#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 142072#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 142073#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)] [2018-04-12 23:56:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 385635 backedges. 50820 proven. 1875 refuted. 0 times theorem prover too weak. 332940 trivial. 0 not checked. [2018-04-12 23:56:43,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 23:56:43,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 23:56:43,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=455, Unknown=0, NotChecked=0, Total=812 [2018-04-12 23:56:43,195 INFO L87 Difference]: Start difference. First operand 2402 states and 2403 transitions. Second operand 29 states. [2018-04-12 23:56:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:43,558 INFO L93 Difference]: Finished difference Result 2414 states and 2416 transitions. [2018-04-12 23:56:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 23:56:43,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 2398 [2018-04-12 23:56:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:43,561 INFO L225 Difference]: With dead ends: 2414 [2018-04-12 23:56:43,562 INFO L226 Difference]: Without dead ends: 2414 [2018-04-12 23:56:43,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 23:56:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2018-04-12 23:56:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2408. [2018-04-12 23:56:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2018-04-12 23:56:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2410 transitions. [2018-04-12 23:56:43,571 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2410 transitions. Word has length 2398 [2018-04-12 23:56:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:43,572 INFO L459 AbstractCegarLoop]: Abstraction has 2408 states and 2410 transitions. [2018-04-12 23:56:43,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 23:56:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2410 transitions. [2018-04-12 23:56:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2405 [2018-04-12 23:56:43,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:43,592 INFO L355 BasicCegarLoop]: trace histogram [375, 351, 350, 350, 350, 350, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:43,592 INFO L408 AbstractCegarLoop]: === Iteration 82 === [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-12 23:56:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1945223631, now seen corresponding path program 73 times [2018-04-12 23:56:43,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:43,766 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 387780 backedges. 54787 proven. 1829 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-04-12 23:56:46,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:46,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 23:56:46,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:46,003 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-12 23:56:46,003 INFO L182 omatonBuilderFactory]: Interpolants [146946#true, 146947#false, 146950#(<= main_~i~1 2), 146951#(<= main_~i~1 3), 146948#(= main_~i~1 0), 146949#(<= main_~i~1 1), 146954#(<= main_~i~1 6), 146955#(<= main_~i~1 7), 146952#(<= main_~i~1 4), 146953#(<= main_~i~1 5), 146958#(<= main_~i~1 10), 146959#(<= main_~i~1 11), 146956#(<= main_~i~1 8), 146957#(<= main_~i~1 9), 146962#(<= main_~i~1 14), 146963#(<= main_~i~1 15), 146960#(<= main_~i~1 12), 146961#(<= main_~i~1 13), 146966#(<= main_~i~1 18), 146967#(<= main_~i~1 19), 146964#(<= main_~i~1 16), 146965#(<= main_~i~1 17), 146970#(<= main_~i~1 22), 146971#(<= main_~i~1 23), 146968#(<= main_~i~1 20), 146969#(<= main_~i~1 21), 146974#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25), 146975#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 146972#(<= main_~i~1 24), 146973#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 25), 146978#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 146979#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 146976#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 146977#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 146982#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 146983#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 146980#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 146981#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 146986#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 146987#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 146984#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 146985#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 146990#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 146991#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 146988#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 146989#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 146994#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 146995#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 146992#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 146993#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 146998#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 146999#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 146996#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 146997#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 147000#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 147001#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:56:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 387780 backedges. 54787 proven. 1829 refuted. 0 times theorem prover too weak. 331164 trivial. 0 not checked. [2018-04-12 23:56:46,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 23:56:46,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 23:56:46,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=2320, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 23:56:46,008 INFO L87 Difference]: Start difference. First operand 2408 states and 2410 transitions. Second operand 56 states. [2018-04-12 23:56:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:47,122 INFO L93 Difference]: Finished difference Result 2578 states and 2581 transitions. [2018-04-12 23:56:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 23:56:47,122 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2404 [2018-04-12 23:56:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:47,124 INFO L225 Difference]: With dead ends: 2578 [2018-04-12 23:56:47,124 INFO L226 Difference]: Without dead ends: 2578 [2018-04-12 23:56:47,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1597, Invalid=5209, Unknown=0, NotChecked=0, Total=6806 [2018-04-12 23:56:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2018-04-12 23:56:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2576. [2018-04-12 23:56:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2018-04-12 23:56:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 2579 transitions. [2018-04-12 23:56:47,134 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 2579 transitions. Word has length 2404 [2018-04-12 23:56:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:47,134 INFO L459 AbstractCegarLoop]: Abstraction has 2576 states and 2579 transitions. [2018-04-12 23:56:47,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 23:56:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 2579 transitions. [2018-04-12 23:56:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2567 [2018-04-12 23:56:47,156 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:47,157 INFO L355 BasicCegarLoop]: trace histogram [401, 376, 375, 375, 375, 375, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:47,157 INFO L408 AbstractCegarLoop]: === Iteration 83 === [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-12 23:56:47,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1971385655, now seen corresponding path program 74 times [2018-04-12 23:56:47,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:47,293 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 444400 backedges. 109334 proven. 1850 refuted. 0 times theorem prover too weak. 333216 trivial. 0 not checked. [2018-04-12 23:56:49,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:49,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-12 23:56:49,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:49,965 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-12 23:56:49,965 INFO L182 omatonBuilderFactory]: Interpolants [152210#true, 152211#false, 152214#(<= 2 main_~i~1), 152215#(<= 3 main_~i~1), 152212#(<= 0 main_~i~1), 152213#(<= 1 main_~i~1), 152218#(<= 6 main_~i~1), 152219#(<= 7 main_~i~1), 152216#(<= 4 main_~i~1), 152217#(<= 5 main_~i~1), 152222#(<= 10 main_~i~1), 152223#(<= 11 main_~i~1), 152220#(<= 8 main_~i~1), 152221#(<= 9 main_~i~1), 152226#(<= 14 main_~i~1), 152227#(<= 15 main_~i~1), 152224#(<= 12 main_~i~1), 152225#(<= 13 main_~i~1), 152230#(<= 18 main_~i~1), 152231#(<= 19 main_~i~1), 152228#(<= 16 main_~i~1), 152229#(<= 17 main_~i~1), 152234#(<= 22 main_~i~1), 152235#(<= 23 main_~i~1), 152232#(<= 20 main_~i~1), 152233#(<= 21 main_~i~1), 152238#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 152239#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 152236#(<= 24 main_~i~1), 152237#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 152242#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 152243#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 152240#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 152241#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 152246#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 152247#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 152244#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 152245#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 152250#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 152251#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 152248#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 152249#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 152254#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 152255#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 152252#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 152253#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 152258#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 152259#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 152256#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 152257#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 152262#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 152263#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 24), 152260#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 152261#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24))] [2018-04-12 23:56:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 444400 backedges. 109334 proven. 1850 refuted. 0 times theorem prover too weak. 333216 trivial. 0 not checked. [2018-04-12 23:56:49,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-12 23:56:49,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-12 23:56:49,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2132, Unknown=0, NotChecked=0, Total=2862 [2018-04-12 23:56:49,971 INFO L87 Difference]: Start difference. First operand 2576 states and 2579 transitions. Second operand 54 states. [2018-04-12 23:56:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:51,016 INFO L93 Difference]: Finished difference Result 2585 states and 2586 transitions. [2018-04-12 23:56:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-12 23:56:51,016 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2566 [2018-04-12 23:56:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:51,019 INFO L225 Difference]: With dead ends: 2585 [2018-04-12 23:56:51,019 INFO L226 Difference]: Without dead ends: 2579 [2018-04-12 23:56:51,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1378, Invalid=4628, Unknown=0, NotChecked=0, Total=6006 [2018-04-12 23:56:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2018-04-12 23:56:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2576. [2018-04-12 23:56:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2018-04-12 23:56:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 2577 transitions. [2018-04-12 23:56:51,030 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 2577 transitions. Word has length 2566 [2018-04-12 23:56:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:51,030 INFO L459 AbstractCegarLoop]: Abstraction has 2576 states and 2577 transitions. [2018-04-12 23:56:51,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-12 23:56:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 2577 transitions. [2018-04-12 23:56:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2573 [2018-04-12 23:56:51,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:51,054 INFO L355 BasicCegarLoop]: trace histogram [402, 377, 376, 376, 376, 376, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:51,054 INFO L408 AbstractCegarLoop]: === Iteration 84 === [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-12 23:56:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash -585611583, now seen corresponding path program 75 times [2018-04-12 23:56:51,055 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:51,178 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 446703 backedges. 57000 proven. 2028 refuted. 0 times theorem prover too weak. 387675 trivial. 0 not checked. [2018-04-12 23:56:53,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:53,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-12 23:56:53,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:53,097 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-12 23:56:53,097 INFO L182 omatonBuilderFactory]: Interpolants [157474#false, 157475#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 157473#true, 157478#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 157479#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 157476#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 157477#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 157482#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 157483#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 157480#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 157481#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 157486#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 157487#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 157484#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 157485#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 157490#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 157491#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 157488#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 157489#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 157494#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 157495#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 157492#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 157493#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 157498#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 157499#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 157496#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 157497#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 157502#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 157500#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 157501#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25))] [2018-04-12 23:56:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 446703 backedges. 57000 proven. 2028 refuted. 0 times theorem prover too weak. 387675 trivial. 0 not checked. [2018-04-12 23:56:53,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 23:56:53,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 23:56:53,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2018-04-12 23:56:53,102 INFO L87 Difference]: Start difference. First operand 2576 states and 2577 transitions. Second operand 30 states. [2018-04-12 23:56:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:53,519 INFO L93 Difference]: Finished difference Result 2588 states and 2590 transitions. [2018-04-12 23:56:53,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 23:56:53,519 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 2572 [2018-04-12 23:56:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:53,523 INFO L225 Difference]: With dead ends: 2588 [2018-04-12 23:56:53,523 INFO L226 Difference]: Without dead ends: 2588 [2018-04-12 23:56:53,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 23:56:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2018-04-12 23:56:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2582. [2018-04-12 23:56:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2018-04-12 23:56:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 2584 transitions. [2018-04-12 23:56:53,534 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 2584 transitions. Word has length 2572 [2018-04-12 23:56:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:53,535 INFO L459 AbstractCegarLoop]: Abstraction has 2582 states and 2584 transitions. [2018-04-12 23:56:53,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 23:56:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 2584 transitions. [2018-04-12 23:56:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2579 [2018-04-12 23:56:53,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:53,557 INFO L355 BasicCegarLoop]: trace histogram [403, 378, 377, 377, 377, 377, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:53,558 INFO L408 AbstractCegarLoop]: === Iteration 85 === [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-12 23:56:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash 769184953, now seen corresponding path program 76 times [2018-04-12 23:56:53,558 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:53,682 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:56:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 449012 backedges. 61282 proven. 1980 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-04-12 23:56:56,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:56:56,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 23:56:56,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:56:56,203 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-12 23:56:56,203 INFO L182 omatonBuilderFactory]: Interpolants [162723#true, 162726#(<= main_~i~1 1), 162727#(<= main_~i~1 2), 162724#false, 162725#(= main_~i~1 0), 162730#(<= main_~i~1 5), 162731#(<= main_~i~1 6), 162728#(<= main_~i~1 3), 162729#(<= main_~i~1 4), 162734#(<= main_~i~1 9), 162735#(<= main_~i~1 10), 162732#(<= main_~i~1 7), 162733#(<= main_~i~1 8), 162738#(<= main_~i~1 13), 162739#(<= main_~i~1 14), 162736#(<= main_~i~1 11), 162737#(<= main_~i~1 12), 162742#(<= main_~i~1 17), 162743#(<= main_~i~1 18), 162740#(<= main_~i~1 15), 162741#(<= main_~i~1 16), 162746#(<= main_~i~1 21), 162747#(<= main_~i~1 22), 162744#(<= main_~i~1 19), 162745#(<= main_~i~1 20), 162750#(<= main_~i~1 25), 162751#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 26), 162748#(<= main_~i~1 23), 162749#(<= main_~i~1 24), 162754#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 162755#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 162752#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26), 162753#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 162758#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 162759#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 162756#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 162757#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 162762#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 162763#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 162760#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 162761#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 162766#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 162767#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 162764#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 162765#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 162770#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 162771#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 162768#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 162769#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 162774#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 162775#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 162772#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 162773#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 162778#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 162779#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 162776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 162777#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 162780#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:56:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 449012 backedges. 61282 proven. 1980 refuted. 0 times theorem prover too weak. 385750 trivial. 0 not checked. [2018-04-12 23:56:56,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 23:56:56,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 23:56:56,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=2490, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 23:56:56,209 INFO L87 Difference]: Start difference. First operand 2582 states and 2584 transitions. Second operand 58 states. [2018-04-12 23:56:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:56:57,426 INFO L93 Difference]: Finished difference Result 2758 states and 2761 transitions. [2018-04-12 23:56:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-12 23:56:57,426 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2578 [2018-04-12 23:56:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:56:57,429 INFO L225 Difference]: With dead ends: 2758 [2018-04-12 23:56:57,429 INFO L226 Difference]: Without dead ends: 2758 [2018-04-12 23:56:57,429 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1712, Invalid=5598, Unknown=0, NotChecked=0, Total=7310 [2018-04-12 23:56:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-04-12 23:56:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2756. [2018-04-12 23:56:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-04-12 23:56:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 2759 transitions. [2018-04-12 23:56:57,443 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 2759 transitions. Word has length 2578 [2018-04-12 23:56:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:56:57,444 INFO L459 AbstractCegarLoop]: Abstraction has 2756 states and 2759 transitions. [2018-04-12 23:56:57,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 23:56:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 2759 transitions. [2018-04-12 23:56:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2747 [2018-04-12 23:56:57,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:56:57,469 INFO L355 BasicCegarLoop]: trace histogram [430, 404, 403, 403, 403, 403, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:56:57,470 INFO L408 AbstractCegarLoop]: === Iteration 86 === [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-12 23:56:57,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1712234167, now seen corresponding path program 77 times [2018-04-12 23:56:57,470 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:56:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:56:57,599 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 512265 backedges. 122301 proven. 2002 refuted. 0 times theorem prover too weak. 387962 trivial. 0 not checked. [2018-04-12 23:57:00,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:00,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-12 23:57:00,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:00,623 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-12 23:57:00,623 INFO L182 omatonBuilderFactory]: Interpolants [168351#true, 168354#(<= 1 main_~i~1), 168355#(<= 2 main_~i~1), 168352#false, 168353#(<= 0 main_~i~1), 168358#(<= 5 main_~i~1), 168359#(<= 6 main_~i~1), 168356#(<= 3 main_~i~1), 168357#(<= 4 main_~i~1), 168362#(<= 9 main_~i~1), 168363#(<= 10 main_~i~1), 168360#(<= 7 main_~i~1), 168361#(<= 8 main_~i~1), 168366#(<= 13 main_~i~1), 168367#(<= 14 main_~i~1), 168364#(<= 11 main_~i~1), 168365#(<= 12 main_~i~1), 168370#(<= 17 main_~i~1), 168371#(<= 18 main_~i~1), 168368#(<= 15 main_~i~1), 168369#(<= 16 main_~i~1), 168374#(<= 21 main_~i~1), 168375#(<= 22 main_~i~1), 168372#(<= 19 main_~i~1), 168373#(<= 20 main_~i~1), 168378#(<= 25 main_~i~1), 168379#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 168376#(<= 23 main_~i~1), 168377#(<= 24 main_~i~1), 168382#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 168383#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 168380#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 168381#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 168386#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 168387#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 168384#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 168385#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 168390#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 168391#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 168388#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 168389#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 168394#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 168395#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 168392#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 168393#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 168398#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 168399#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 168396#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 168397#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 168402#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 168403#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 168400#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 168401#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 168406#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 25), 168404#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 168405#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26))] [2018-04-12 23:57:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 512265 backedges. 122301 proven. 2002 refuted. 0 times theorem prover too weak. 387962 trivial. 0 not checked. [2018-04-12 23:57:00,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-12 23:57:00,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-12 23:57:00,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2295, Unknown=0, NotChecked=0, Total=3080 [2018-04-12 23:57:00,630 INFO L87 Difference]: Start difference. First operand 2756 states and 2759 transitions. Second operand 56 states. [2018-04-12 23:57:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:01,826 INFO L93 Difference]: Finished difference Result 2765 states and 2766 transitions. [2018-04-12 23:57:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-12 23:57:01,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2746 [2018-04-12 23:57:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:01,830 INFO L225 Difference]: With dead ends: 2765 [2018-04-12 23:57:01,830 INFO L226 Difference]: Without dead ends: 2759 [2018-04-12 23:57:01,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=4995, Unknown=0, NotChecked=0, Total=6480 [2018-04-12 23:57:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-04-12 23:57:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2756. [2018-04-12 23:57:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-04-12 23:57:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 2757 transitions. [2018-04-12 23:57:01,841 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 2757 transitions. Word has length 2746 [2018-04-12 23:57:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:01,842 INFO L459 AbstractCegarLoop]: Abstraction has 2756 states and 2757 transitions. [2018-04-12 23:57:01,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-12 23:57:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 2757 transitions. [2018-04-12 23:57:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2753 [2018-04-12 23:57:01,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:01,867 INFO L355 BasicCegarLoop]: trace histogram [431, 405, 404, 404, 404, 404, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:01,867 INFO L408 AbstractCegarLoop]: === Iteration 87 === [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-12 23:57:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1214299457, now seen corresponding path program 78 times [2018-04-12 23:57:01,868 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:02,005 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 514738 backedges. 63661 proven. 2187 refuted. 0 times theorem prover too weak. 448890 trivial. 0 not checked. [2018-04-12 23:57:04,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:04,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-12 23:57:04,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:04,348 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-12 23:57:04,348 INFO L182 omatonBuilderFactory]: Interpolants [173978#true, 173979#false, 173982#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 173983#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 173980#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 173981#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 173986#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 173987#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 173984#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 173985#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 173990#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 173991#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 173988#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 173989#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 173994#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 173995#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 173992#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 173993#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 173998#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 173999#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 173996#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 173997#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 174002#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 174003#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 174000#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 174001#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 174006#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26), 174007#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 174004#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 174005#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25), 174008#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27))] [2018-04-12 23:57:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 514738 backedges. 63661 proven. 2187 refuted. 0 times theorem prover too weak. 448890 trivial. 0 not checked. [2018-04-12 23:57:04,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 23:57:04,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 23:57:04,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=518, Unknown=0, NotChecked=0, Total=930 [2018-04-12 23:57:04,354 INFO L87 Difference]: Start difference. First operand 2756 states and 2757 transitions. Second operand 31 states. [2018-04-12 23:57:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:04,767 INFO L93 Difference]: Finished difference Result 2768 states and 2770 transitions. [2018-04-12 23:57:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 23:57:04,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 2752 [2018-04-12 23:57:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:04,771 INFO L225 Difference]: With dead ends: 2768 [2018-04-12 23:57:04,771 INFO L226 Difference]: Without dead ends: 2768 [2018-04-12 23:57:04,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 23:57:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2018-04-12 23:57:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2762. [2018-04-12 23:57:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2018-04-12 23:57:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 2764 transitions. [2018-04-12 23:57:04,782 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 2764 transitions. Word has length 2752 [2018-04-12 23:57:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:04,782 INFO L459 AbstractCegarLoop]: Abstraction has 2762 states and 2764 transitions. [2018-04-12 23:57:04,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 23:57:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 2764 transitions. [2018-04-12 23:57:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2759 [2018-04-12 23:57:04,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:04,808 INFO L355 BasicCegarLoop]: trace histogram [432, 406, 405, 405, 405, 405, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:04,808 INFO L408 AbstractCegarLoop]: === Iteration 88 === [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-12 23:57:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1785828551, now seen corresponding path program 79 times [2018-04-12 23:57:04,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:04,982 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 517217 backedges. 68270 proven. 2137 refuted. 0 times theorem prover too weak. 446810 trivial. 0 not checked. [2018-04-12 23:57:07,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:07,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 23:57:07,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:07,768 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-12 23:57:07,768 INFO L182 omatonBuilderFactory]: Interpolants [179591#true, 179594#(<= main_~i~1 1), 179595#(<= main_~i~1 2), 179592#false, 179593#(= main_~i~1 0), 179598#(<= main_~i~1 5), 179599#(<= main_~i~1 6), 179596#(<= main_~i~1 3), 179597#(<= main_~i~1 4), 179602#(<= main_~i~1 9), 179603#(<= main_~i~1 10), 179600#(<= main_~i~1 7), 179601#(<= main_~i~1 8), 179606#(<= main_~i~1 13), 179607#(<= main_~i~1 14), 179604#(<= main_~i~1 11), 179605#(<= main_~i~1 12), 179610#(<= main_~i~1 17), 179611#(<= main_~i~1 18), 179608#(<= main_~i~1 15), 179609#(<= main_~i~1 16), 179614#(<= main_~i~1 21), 179615#(<= main_~i~1 22), 179612#(<= main_~i~1 19), 179613#(<= main_~i~1 20), 179618#(<= main_~i~1 25), 179619#(<= main_~i~1 26), 179616#(<= main_~i~1 23), 179617#(<= main_~i~1 24), 179622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 179623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 179620#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 27), 179621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27), 179626#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 179627#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 179624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 179625#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 179630#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 179631#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 179628#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 179629#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 179634#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 179635#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 179632#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 179633#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 179638#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 179639#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 179636#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 179637#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 179642#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 179643#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 179640#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 179641#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 179646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 179647#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 179644#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 179645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 179650#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 179648#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 179649#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:57:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 517217 backedges. 68270 proven. 2137 refuted. 0 times theorem prover too weak. 446810 trivial. 0 not checked. [2018-04-12 23:57:07,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 23:57:07,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 23:57:07,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=874, Invalid=2666, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 23:57:07,774 INFO L87 Difference]: Start difference. First operand 2762 states and 2764 transitions. Second operand 60 states. [2018-04-12 23:57:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:09,065 INFO L93 Difference]: Finished difference Result 2944 states and 2947 transitions. [2018-04-12 23:57:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-12 23:57:09,065 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2758 [2018-04-12 23:57:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:09,068 INFO L225 Difference]: With dead ends: 2944 [2018-04-12 23:57:09,068 INFO L226 Difference]: Without dead ends: 2944 [2018-04-12 23:57:09,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1831, Invalid=6001, Unknown=0, NotChecked=0, Total=7832 [2018-04-12 23:57:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2018-04-12 23:57:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2018-04-12 23:57:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2018-04-12 23:57:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 2945 transitions. [2018-04-12 23:57:09,080 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 2945 transitions. Word has length 2758 [2018-04-12 23:57:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:09,081 INFO L459 AbstractCegarLoop]: Abstraction has 2942 states and 2945 transitions. [2018-04-12 23:57:09,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 23:57:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 2945 transitions. [2018-04-12 23:57:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2933 [2018-04-12 23:57:09,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:09,110 INFO L355 BasicCegarLoop]: trace histogram [460, 433, 432, 432, 432, 432, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:09,110 INFO L408 AbstractCegarLoop]: === Iteration 89 === [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-12 23:57:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 684728257, now seen corresponding path program 80 times [2018-04-12 23:57:09,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:09,292 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 587601 backedges. 136253 proven. 2160 refuted. 0 times theorem prover too weak. 449188 trivial. 0 not checked. [2018-04-12 23:57:12,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:12,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-12 23:57:12,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:12,564 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-12 23:57:12,564 INFO L182 omatonBuilderFactory]: Interpolants [185602#(<= 5 main_~i~1), 185603#(<= 6 main_~i~1), 185600#(<= 3 main_~i~1), 185601#(<= 4 main_~i~1), 185606#(<= 9 main_~i~1), 185607#(<= 10 main_~i~1), 185604#(<= 7 main_~i~1), 185605#(<= 8 main_~i~1), 185610#(<= 13 main_~i~1), 185611#(<= 14 main_~i~1), 185608#(<= 11 main_~i~1), 185609#(<= 12 main_~i~1), 185614#(<= 17 main_~i~1), 185615#(<= 18 main_~i~1), 185612#(<= 15 main_~i~1), 185613#(<= 16 main_~i~1), 185618#(<= 21 main_~i~1), 185619#(<= 22 main_~i~1), 185616#(<= 19 main_~i~1), 185617#(<= 20 main_~i~1), 185622#(<= 25 main_~i~1), 185623#(<= 26 main_~i~1), 185620#(<= 23 main_~i~1), 185621#(<= 24 main_~i~1), 185626#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 185627#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 185624#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 185625#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 185630#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 185631#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 185628#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 185629#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 185634#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 185635#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 185632#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 185633#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 185638#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 185639#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 185636#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 185637#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 185642#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 185643#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 185640#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 185641#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 185646#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 185647#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 185644#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 185645#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 185650#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26)), 185651#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27)), 185648#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 185649#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 185652#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 26), 185595#true, 185598#(<= 1 main_~i~1), 185599#(<= 2 main_~i~1), 185596#false, 185597#(<= 0 main_~i~1)] [2018-04-12 23:57:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 587601 backedges. 136253 proven. 2160 refuted. 0 times theorem prover too weak. 449188 trivial. 0 not checked. [2018-04-12 23:57:12,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-12 23:57:12,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-12 23:57:12,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 23:57:12,571 INFO L87 Difference]: Start difference. First operand 2942 states and 2945 transitions. Second operand 58 states. [2018-04-12 23:57:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:13,774 INFO L93 Difference]: Finished difference Result 2951 states and 2952 transitions. [2018-04-12 23:57:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-12 23:57:13,775 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2932 [2018-04-12 23:57:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:13,778 INFO L225 Difference]: With dead ends: 2951 [2018-04-12 23:57:13,778 INFO L226 Difference]: Without dead ends: 2945 [2018-04-12 23:57:13,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1596, Invalid=5376, Unknown=0, NotChecked=0, Total=6972 [2018-04-12 23:57:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2018-04-12 23:57:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2942. [2018-04-12 23:57:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2018-04-12 23:57:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 2943 transitions. [2018-04-12 23:57:13,790 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 2943 transitions. Word has length 2932 [2018-04-12 23:57:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:13,790 INFO L459 AbstractCegarLoop]: Abstraction has 2942 states and 2943 transitions. [2018-04-12 23:57:13,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-12 23:57:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 2943 transitions. [2018-04-12 23:57:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2939 [2018-04-12 23:57:13,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:13,819 INFO L355 BasicCegarLoop]: trace histogram [461, 434, 433, 433, 433, 433, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:13,819 INFO L408 AbstractCegarLoop]: === Iteration 90 === [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-12 23:57:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 305512889, now seen corresponding path program 81 times [2018-04-12 23:57:13,820 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:13,970 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 590250 backedges. 70821 proven. 2352 refuted. 0 times theorem prover too weak. 517077 trivial. 0 not checked. [2018-04-12 23:57:16,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:16,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-12 23:57:16,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:16,483 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-12 23:57:16,483 INFO L182 omatonBuilderFactory]: Interpolants [191618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 191619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 191616#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 191617#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 191622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 191623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 191620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 191621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 191626#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 191627#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 191624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 191625#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24) (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 191628#(and (<= 3 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 191629#(and (<= 4 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 191598#true, 191599#false, 191602#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 191603#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 191600#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 191601#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 191606#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 191607#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 191604#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 191605#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 191610#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 191611#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 191608#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 191609#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 191614#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 191615#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 191612#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 191613#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)] [2018-04-12 23:57:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 590250 backedges. 70821 proven. 2352 refuted. 0 times theorem prover too weak. 517077 trivial. 0 not checked. [2018-04-12 23:57:16,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 23:57:16,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 23:57:16,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=629, Unknown=0, NotChecked=0, Total=992 [2018-04-12 23:57:16,490 INFO L87 Difference]: Start difference. First operand 2942 states and 2943 transitions. Second operand 32 states. [2018-04-12 23:57:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:17,026 INFO L93 Difference]: Finished difference Result 2954 states and 2956 transitions. [2018-04-12 23:57:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 23:57:17,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2938 [2018-04-12 23:57:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:17,029 INFO L225 Difference]: With dead ends: 2954 [2018-04-12 23:57:17,029 INFO L226 Difference]: Without dead ends: 2954 [2018-04-12 23:57:17,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1116, Invalid=2306, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 23:57:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-04-12 23:57:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2948. [2018-04-12 23:57:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2018-04-12 23:57:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 2950 transitions. [2018-04-12 23:57:17,040 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 2950 transitions. Word has length 2938 [2018-04-12 23:57:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:17,041 INFO L459 AbstractCegarLoop]: Abstraction has 2948 states and 2950 transitions. [2018-04-12 23:57:17,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 23:57:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 2950 transitions. [2018-04-12 23:57:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2945 [2018-04-12 23:57:17,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:17,070 INFO L355 BasicCegarLoop]: trace histogram [462, 435, 434, 434, 434, 434, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:17,070 INFO L408 AbstractCegarLoop]: === Iteration 91 === [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-12 23:57:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1350317489, now seen corresponding path program 82 times [2018-04-12 23:57:17,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:17,235 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 592905 backedges. 75769 proven. 2300 refuted. 0 times theorem prover too weak. 514836 trivial. 0 not checked. [2018-04-12 23:57:20,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:20,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 23:57:20,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:20,368 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-12 23:57:20,368 INFO L182 omatonBuilderFactory]: Interpolants [197635#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 197634#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 197633#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 197632#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 197639#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 197638#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 197637#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 197636#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 197643#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 197642#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 197641#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 197640#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 197647#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 197646#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 197645#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 197644#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 197587#false, 197586#true, 197591#(<= main_~i~1 3), 197590#(<= main_~i~1 2), 197589#(<= main_~i~1 1), 197588#(= main_~i~1 0), 197595#(<= main_~i~1 7), 197594#(<= main_~i~1 6), 197593#(<= main_~i~1 5), 197592#(<= main_~i~1 4), 197599#(<= main_~i~1 11), 197598#(<= main_~i~1 10), 197597#(<= main_~i~1 9), 197596#(<= main_~i~1 8), 197603#(<= main_~i~1 15), 197602#(<= main_~i~1 14), 197601#(<= main_~i~1 13), 197600#(<= main_~i~1 12), 197607#(<= main_~i~1 19), 197606#(<= main_~i~1 18), 197605#(<= main_~i~1 17), 197604#(<= main_~i~1 16), 197611#(<= main_~i~1 23), 197610#(<= main_~i~1 22), 197609#(<= main_~i~1 21), 197608#(<= main_~i~1 20), 197615#(<= main_~i~1 27), 197614#(<= main_~i~1 26), 197613#(<= main_~i~1 25), 197612#(<= main_~i~1 24), 197619#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 197618#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 197617#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 28), 197616#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 28), 197623#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 197622#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 197621#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 197620#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 197627#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 197626#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 197625#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 197624#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 197631#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 197630#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 197629#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 197628#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18))] [2018-04-12 23:57:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 592905 backedges. 75769 proven. 2300 refuted. 0 times theorem prover too weak. 514836 trivial. 0 not checked. [2018-04-12 23:57:20,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 23:57:20,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 23:57:20,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=2848, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 23:57:20,375 INFO L87 Difference]: Start difference. First operand 2948 states and 2950 transitions. Second operand 62 states. [2018-04-12 23:57:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:21,648 INFO L93 Difference]: Finished difference Result 3136 states and 3139 transitions. [2018-04-12 23:57:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-12 23:57:21,648 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2944 [2018-04-12 23:57:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:21,652 INFO L225 Difference]: With dead ends: 3136 [2018-04-12 23:57:21,652 INFO L226 Difference]: Without dead ends: 3136 [2018-04-12 23:57:21,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1954, Invalid=6418, Unknown=0, NotChecked=0, Total=8372 [2018-04-12 23:57:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2018-04-12 23:57:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3134. [2018-04-12 23:57:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2018-04-12 23:57:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 3137 transitions. [2018-04-12 23:57:21,672 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 3137 transitions. Word has length 2944 [2018-04-12 23:57:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:21,674 INFO L459 AbstractCegarLoop]: Abstraction has 3134 states and 3137 transitions. [2018-04-12 23:57:21,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 23:57:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3137 transitions. [2018-04-12 23:57:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3125 [2018-04-12 23:57:21,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:21,716 INFO L355 BasicCegarLoop]: trace histogram [491, 463, 462, 462, 462, 462, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:21,716 INFO L408 AbstractCegarLoop]: === Iteration 92 === [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-12 23:57:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1842713551, now seen corresponding path program 83 times [2018-04-12 23:57:21,716 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:21,867 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 670936 backedges. 151226 proven. 2324 refuted. 0 times theorem prover too weak. 517386 trivial. 0 not checked. [2018-04-12 23:57:25,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:25,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-12 23:57:25,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:25,375 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-12 23:57:25,376 INFO L182 omatonBuilderFactory]: Interpolants [204035#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27)), 204034#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26)), 204033#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 204032#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 204037#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 27), 204036#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 28)), 203979#false, 203978#true, 203983#(<= 3 main_~i~1), 203982#(<= 2 main_~i~1), 203981#(<= 1 main_~i~1), 203980#(<= 0 main_~i~1), 203987#(<= 7 main_~i~1), 203986#(<= 6 main_~i~1), 203985#(<= 5 main_~i~1), 203984#(<= 4 main_~i~1), 203991#(<= 11 main_~i~1), 203990#(<= 10 main_~i~1), 203989#(<= 9 main_~i~1), 203988#(<= 8 main_~i~1), 203995#(<= 15 main_~i~1), 203994#(<= 14 main_~i~1), 203993#(<= 13 main_~i~1), 203992#(<= 12 main_~i~1), 203999#(<= 19 main_~i~1), 203998#(<= 18 main_~i~1), 203997#(<= 17 main_~i~1), 203996#(<= 16 main_~i~1), 204003#(<= 23 main_~i~1), 204002#(<= 22 main_~i~1), 204001#(<= 21 main_~i~1), 204000#(<= 20 main_~i~1), 204007#(<= 27 main_~i~1), 204006#(<= 26 main_~i~1), 204005#(<= 25 main_~i~1), 204004#(<= 24 main_~i~1), 204011#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 204010#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 204009#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 204008#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 204015#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 204014#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 204013#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 204012#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 204019#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 204018#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 204017#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 204016#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 204023#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 204022#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 204021#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 204020#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 204027#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 204026#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 204025#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 204024#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 204031#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 204030#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 204029#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 204028#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20))] [2018-04-12 23:57:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 670936 backedges. 151226 proven. 2324 refuted. 0 times theorem prover too weak. 517386 trivial. 0 not checked. [2018-04-12 23:57:25,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-12 23:57:25,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-12 23:57:25,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2639, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 23:57:25,385 INFO L87 Difference]: Start difference. First operand 3134 states and 3137 transitions. Second operand 60 states. [2018-04-12 23:57:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:26,128 INFO L93 Difference]: Finished difference Result 3143 states and 3144 transitions. [2018-04-12 23:57:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-12 23:57:26,128 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 3124 [2018-04-12 23:57:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:26,132 INFO L225 Difference]: With dead ends: 3143 [2018-04-12 23:57:26,132 INFO L226 Difference]: Without dead ends: 3137 [2018-04-12 23:57:26,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1711, Invalid=5771, Unknown=0, NotChecked=0, Total=7482 [2018-04-12 23:57:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2018-04-12 23:57:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 3134. [2018-04-12 23:57:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2018-04-12 23:57:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 3135 transitions. [2018-04-12 23:57:26,144 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 3135 transitions. Word has length 3124 [2018-04-12 23:57:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:26,145 INFO L459 AbstractCegarLoop]: Abstraction has 3134 states and 3135 transitions. [2018-04-12 23:57:26,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-12 23:57:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3135 transitions. [2018-04-12 23:57:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3131 [2018-04-12 23:57:26,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:26,185 INFO L355 BasicCegarLoop]: trace histogram [492, 464, 463, 463, 463, 463, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:26,185 INFO L408 AbstractCegarLoop]: === Iteration 93 === [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-12 23:57:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1959658967, now seen corresponding path program 84 times [2018-04-12 23:57:26,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:26,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 673767 backedges. 78498 proven. 2523 refuted. 0 times theorem prover too weak. 592746 trivial. 0 not checked. [2018-04-12 23:57:29,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:29,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-12 23:57:29,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:29,070 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-12 23:57:29,070 INFO L182 omatonBuilderFactory]: Interpolants [210371#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 210370#false, 210369#true, 210375#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 210374#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 210373#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 210372#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 210379#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 210378#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 210377#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 210376#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 210383#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 210382#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 210381#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 210380#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 210387#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 210386#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 210385#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 210384#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 210391#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 210390#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 210389#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 210388#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 210395#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 210394#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 210393#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 210392#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 210399#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28), 210398#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27), 210397#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26), 210396#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25), 210401#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29)), 210400#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28))] [2018-04-12 23:57:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 673767 backedges. 78498 proven. 2523 refuted. 0 times theorem prover too weak. 592746 trivial. 0 not checked. [2018-04-12 23:57:29,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 23:57:29,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 23:57:29,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=585, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 23:57:29,078 INFO L87 Difference]: Start difference. First operand 3134 states and 3135 transitions. Second operand 33 states. [2018-04-12 23:57:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:29,556 INFO L93 Difference]: Finished difference Result 3146 states and 3148 transitions. [2018-04-12 23:57:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 23:57:29,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 3130 [2018-04-12 23:57:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:29,559 INFO L225 Difference]: With dead ends: 3146 [2018-04-12 23:57:29,559 INFO L226 Difference]: Without dead ends: 3146 [2018-04-12 23:57:29,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 23:57:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2018-04-12 23:57:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3140. [2018-04-12 23:57:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-04-12 23:57:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 3142 transitions. [2018-04-12 23:57:29,571 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 3142 transitions. Word has length 3130 [2018-04-12 23:57:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:29,572 INFO L459 AbstractCegarLoop]: Abstraction has 3140 states and 3142 transitions. [2018-04-12 23:57:29,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 23:57:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 3142 transitions. [2018-04-12 23:57:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3137 [2018-04-12 23:57:29,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:29,604 INFO L355 BasicCegarLoop]: trace histogram [493, 465, 464, 464, 464, 464, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:29,605 INFO L408 AbstractCegarLoop]: === Iteration 94 === [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-12 23:57:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1641522655, now seen corresponding path program 85 times [2018-04-12 23:57:29,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:29,781 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 676604 backedges. 83797 proven. 2469 refuted. 0 times theorem prover too weak. 590338 trivial. 0 not checked. [2018-04-12 23:57:33,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:33,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 23:57:33,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:33,297 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-12 23:57:33,297 INFO L182 omatonBuilderFactory]: Interpolants [216747#(<= main_~i~1 1), 216746#(= main_~i~1 0), 216745#false, 216744#true, 216751#(<= main_~i~1 5), 216750#(<= main_~i~1 4), 216749#(<= main_~i~1 3), 216748#(<= main_~i~1 2), 216755#(<= main_~i~1 9), 216754#(<= main_~i~1 8), 216753#(<= main_~i~1 7), 216752#(<= main_~i~1 6), 216759#(<= main_~i~1 13), 216758#(<= main_~i~1 12), 216757#(<= main_~i~1 11), 216756#(<= main_~i~1 10), 216763#(<= main_~i~1 17), 216762#(<= main_~i~1 16), 216761#(<= main_~i~1 15), 216760#(<= main_~i~1 14), 216767#(<= main_~i~1 21), 216766#(<= main_~i~1 20), 216765#(<= main_~i~1 19), 216764#(<= main_~i~1 18), 216771#(<= main_~i~1 25), 216770#(<= main_~i~1 24), 216769#(<= main_~i~1 23), 216768#(<= main_~i~1 22), 216775#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 29), 216774#(<= main_~i~1 28), 216773#(<= main_~i~1 27), 216772#(<= main_~i~1 26), 216779#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 216778#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 216777#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29)), 216776#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 29), 216783#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 216782#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 216781#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 216780#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 216787#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 216786#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 216785#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 216784#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 216791#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 216790#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 216789#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 216788#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 216795#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 216794#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 216793#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 216792#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 216799#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 216798#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 216797#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 216796#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 216803#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 216802#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 216801#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 216800#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 216807#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 216806#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 216805#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 216804#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2))] [2018-04-12 23:57:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 676604 backedges. 83797 proven. 2469 refuted. 0 times theorem prover too weak. 590338 trivial. 0 not checked. [2018-04-12 23:57:33,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 23:57:33,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 23:57:33,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=3036, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 23:57:33,305 INFO L87 Difference]: Start difference. First operand 3140 states and 3142 transitions. Second operand 64 states. [2018-04-12 23:57:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:34,480 INFO L93 Difference]: Finished difference Result 3334 states and 3337 transitions. [2018-04-12 23:57:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-12 23:57:34,495 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 3136 [2018-04-12 23:57:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:34,498 INFO L225 Difference]: With dead ends: 3334 [2018-04-12 23:57:34,499 INFO L226 Difference]: Without dead ends: 3334 [2018-04-12 23:57:34,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2081, Invalid=6849, Unknown=0, NotChecked=0, Total=8930 [2018-04-12 23:57:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2018-04-12 23:57:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2018-04-12 23:57:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2018-04-12 23:57:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 3335 transitions. [2018-04-12 23:57:34,512 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 3335 transitions. Word has length 3136 [2018-04-12 23:57:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:34,513 INFO L459 AbstractCegarLoop]: Abstraction has 3332 states and 3335 transitions. [2018-04-12 23:57:34,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 23:57:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 3335 transitions. [2018-04-12 23:57:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3323 [2018-04-12 23:57:34,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:34,551 INFO L355 BasicCegarLoop]: trace histogram [523, 494, 493, 493, 493, 493, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:34,551 INFO L408 AbstractCegarLoop]: === Iteration 95 === [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-12 23:57:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash 398384793, now seen corresponding path program 86 times [2018-04-12 23:57:34,552 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:34,744 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 762816 backedges. 167256 proven. 2494 refuted. 0 times theorem prover too weak. 593066 trivial. 0 not checked. [2018-04-12 23:57:38,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:38,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-12 23:57:38,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:38,669 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-12 23:57:38,669 INFO L182 omatonBuilderFactory]: Interpolants [223539#(<= 1 main_~i~1), 223538#(<= 0 main_~i~1), 223537#false, 223536#true, 223543#(<= 5 main_~i~1), 223542#(<= 4 main_~i~1), 223541#(<= 3 main_~i~1), 223540#(<= 2 main_~i~1), 223547#(<= 9 main_~i~1), 223546#(<= 8 main_~i~1), 223545#(<= 7 main_~i~1), 223544#(<= 6 main_~i~1), 223551#(<= 13 main_~i~1), 223550#(<= 12 main_~i~1), 223549#(<= 11 main_~i~1), 223548#(<= 10 main_~i~1), 223555#(<= 17 main_~i~1), 223554#(<= 16 main_~i~1), 223553#(<= 15 main_~i~1), 223552#(<= 14 main_~i~1), 223559#(<= 21 main_~i~1), 223558#(<= 20 main_~i~1), 223557#(<= 19 main_~i~1), 223556#(<= 18 main_~i~1), 223563#(<= 25 main_~i~1), 223562#(<= 24 main_~i~1), 223561#(<= 23 main_~i~1), 223560#(<= 22 main_~i~1), 223567#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 223566#(<= 28 main_~i~1), 223565#(<= 27 main_~i~1), 223564#(<= 26 main_~i~1), 223571#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 223570#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 223569#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 223568#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 223575#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 223574#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 223573#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 223572#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 223579#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 223578#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 223577#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 223576#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 223583#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 223582#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 223581#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 223580#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 223587#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 223586#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 223585#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 223584#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 223591#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 223590#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 223589#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 223588#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 223595#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 28)), 223594#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27)), 223593#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26)), 223592#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 223597#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 28), 223596#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 29))] [2018-04-12 23:57:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 762816 backedges. 167256 proven. 2494 refuted. 0 times theorem prover too weak. 593066 trivial. 0 not checked. [2018-04-12 23:57:38,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-12 23:57:38,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-12 23:57:38,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2820, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 23:57:38,679 INFO L87 Difference]: Start difference. First operand 3332 states and 3335 transitions. Second operand 62 states. [2018-04-12 23:57:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:39,788 INFO L93 Difference]: Finished difference Result 3341 states and 3342 transitions. [2018-04-12 23:57:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-12 23:57:39,788 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 3322 [2018-04-12 23:57:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:39,792 INFO L225 Difference]: With dead ends: 3341 [2018-04-12 23:57:39,792 INFO L226 Difference]: Without dead ends: 3335 [2018-04-12 23:57:39,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2059 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1830, Invalid=6180, Unknown=0, NotChecked=0, Total=8010 [2018-04-12 23:57:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2018-04-12 23:57:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3332. [2018-04-12 23:57:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2018-04-12 23:57:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 3333 transitions. [2018-04-12 23:57:39,807 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 3333 transitions. Word has length 3322 [2018-04-12 23:57:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:39,808 INFO L459 AbstractCegarLoop]: Abstraction has 3332 states and 3333 transitions. [2018-04-12 23:57:39,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-12 23:57:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 3333 transitions. [2018-04-12 23:57:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3329 [2018-04-12 23:57:39,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:39,846 INFO L355 BasicCegarLoop]: trace histogram [524, 495, 494, 494, 494, 494, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:39,846 INFO L408 AbstractCegarLoop]: === Iteration 96 === [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-12 23:57:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1908539025, now seen corresponding path program 87 times [2018-04-12 23:57:39,847 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:40,103 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 765835 backedges. 86710 proven. 2700 refuted. 0 times theorem prover too weak. 676425 trivial. 0 not checked. [2018-04-12 23:57:43,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:43,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-12 23:57:43,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:43,198 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-12 23:57:43,198 INFO L182 omatonBuilderFactory]: Interpolants [230339#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 230338#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 230337#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 230336#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 230343#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 230342#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 230341#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 230340#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 230347#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 230346#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 230345#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 230344#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 230351#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 230350#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 230349#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 230348#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 230355#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26), 230354#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25), 230353#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 230352#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 230359#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29)), 230358#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 230357#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28), 230356#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27), 230360#(and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 30) (<= 2 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)), 230327#true, 230331#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 230330#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 230329#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 230328#false, 230335#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6), 230334#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 230333#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 230332#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)] [2018-04-12 23:57:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 765835 backedges. 86710 proven. 2700 refuted. 0 times theorem prover too weak. 676425 trivial. 0 not checked. [2018-04-12 23:57:43,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 23:57:43,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 23:57:43,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=649, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 23:57:43,206 INFO L87 Difference]: Start difference. First operand 3332 states and 3333 transitions. Second operand 34 states. [2018-04-12 23:57:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:43,731 INFO L93 Difference]: Finished difference Result 3344 states and 3346 transitions. [2018-04-12 23:57:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 23:57:43,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 3328 [2018-04-12 23:57:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:43,735 INFO L225 Difference]: With dead ends: 3344 [2018-04-12 23:57:43,735 INFO L226 Difference]: Without dead ends: 3344 [2018-04-12 23:57:43,735 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2018-04-12 23:57:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2018-04-12 23:57:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 3338. [2018-04-12 23:57:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3338 states. [2018-04-12 23:57:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 3340 transitions. [2018-04-12 23:57:43,747 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 3340 transitions. Word has length 3328 [2018-04-12 23:57:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:43,748 INFO L459 AbstractCegarLoop]: Abstraction has 3338 states and 3340 transitions. [2018-04-12 23:57:43,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 23:57:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 3340 transitions. [2018-04-12 23:57:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3335 [2018-04-12 23:57:43,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:43,785 INFO L355 BasicCegarLoop]: trace histogram [525, 496, 495, 495, 495, 495, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:43,785 INFO L408 AbstractCegarLoop]: === Iteration 97 === [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-12 23:57:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1865248905, now seen corresponding path program 88 times [2018-04-12 23:57:43,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:43,973 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 768860 backedges. 92372 proven. 2644 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-04-12 23:57:47,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:47,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 23:57:47,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:47,856 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-12 23:57:47,857 INFO L182 omatonBuilderFactory]: Interpolants [237103#(= main_~i~1 0), 237102#false, 237101#true, 237107#(<= main_~i~1 4), 237106#(<= main_~i~1 3), 237105#(<= main_~i~1 2), 237104#(<= main_~i~1 1), 237111#(<= main_~i~1 8), 237110#(<= main_~i~1 7), 237109#(<= main_~i~1 6), 237108#(<= main_~i~1 5), 237115#(<= main_~i~1 12), 237114#(<= main_~i~1 11), 237113#(<= main_~i~1 10), 237112#(<= main_~i~1 9), 237119#(<= main_~i~1 16), 237118#(<= main_~i~1 15), 237117#(<= main_~i~1 14), 237116#(<= main_~i~1 13), 237123#(<= main_~i~1 20), 237122#(<= main_~i~1 19), 237121#(<= main_~i~1 18), 237120#(<= main_~i~1 17), 237127#(<= main_~i~1 24), 237126#(<= main_~i~1 23), 237125#(<= main_~i~1 22), 237124#(<= main_~i~1 21), 237131#(<= main_~i~1 28), 237130#(<= main_~i~1 27), 237129#(<= main_~i~1 26), 237128#(<= main_~i~1 25), 237135#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 30)), 237134#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 30), 237133#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 30), 237132#(<= main_~i~1 29), 237139#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 237138#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 237137#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 237136#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29)), 237143#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 237142#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 237141#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 237140#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 237147#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 237146#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 237145#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 237144#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 237151#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 237150#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 237149#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 237148#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 237155#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 237154#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 237153#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 237152#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 237159#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 237158#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 237157#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 237156#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 237163#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 237162#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 237161#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 237160#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 237166#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 237165#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 237164#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1))] [2018-04-12 23:57:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 768860 backedges. 92372 proven. 2644 refuted. 0 times theorem prover too weak. 673844 trivial. 0 not checked. [2018-04-12 23:57:47,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 23:57:47,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 23:57:47,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1060, Invalid=3230, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 23:57:47,865 INFO L87 Difference]: Start difference. First operand 3338 states and 3340 transitions. Second operand 66 states. [2018-04-12 23:57:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:49,121 INFO L93 Difference]: Finished difference Result 3538 states and 3541 transitions. [2018-04-12 23:57:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-12 23:57:49,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3334 [2018-04-12 23:57:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:49,126 INFO L225 Difference]: With dead ends: 3538 [2018-04-12 23:57:49,126 INFO L226 Difference]: Without dead ends: 3538 [2018-04-12 23:57:49,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2212, Invalid=7294, Unknown=0, NotChecked=0, Total=9506 [2018-04-12 23:57:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2018-04-12 23:57:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3536. [2018-04-12 23:57:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2018-04-12 23:57:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 3539 transitions. [2018-04-12 23:57:49,140 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 3539 transitions. Word has length 3334 [2018-04-12 23:57:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:49,141 INFO L459 AbstractCegarLoop]: Abstraction has 3536 states and 3539 transitions. [2018-04-12 23:57:49,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 23:57:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 3539 transitions. [2018-04-12 23:57:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3527 [2018-04-12 23:57:49,181 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:49,182 INFO L355 BasicCegarLoop]: trace histogram [556, 526, 525, 525, 525, 525, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:49,182 INFO L408 AbstractCegarLoop]: === Iteration 98 === [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-12 23:57:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1216577785, now seen corresponding path program 89 times [2018-04-12 23:57:49,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:49,373 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 863805 backedges. 184379 proven. 2670 refuted. 0 times theorem prover too weak. 676756 trivial. 0 not checked. [2018-04-12 23:57:53,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:53,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-12 23:57:53,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:53,679 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-12 23:57:53,679 INFO L182 omatonBuilderFactory]: Interpolants [244355#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 244354#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 244353#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 244352#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 244359#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 244358#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 244357#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 244356#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 244363#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26)), 244362#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 244361#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 244360#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 244367#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 30)), 244366#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 29)), 244365#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 28)), 244364#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27)), 244368#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 29), 244307#(<= 0 main_~i~1), 244306#false, 244305#true, 244311#(<= 4 main_~i~1), 244310#(<= 3 main_~i~1), 244309#(<= 2 main_~i~1), 244308#(<= 1 main_~i~1), 244315#(<= 8 main_~i~1), 244314#(<= 7 main_~i~1), 244313#(<= 6 main_~i~1), 244312#(<= 5 main_~i~1), 244319#(<= 12 main_~i~1), 244318#(<= 11 main_~i~1), 244317#(<= 10 main_~i~1), 244316#(<= 9 main_~i~1), 244323#(<= 16 main_~i~1), 244322#(<= 15 main_~i~1), 244321#(<= 14 main_~i~1), 244320#(<= 13 main_~i~1), 244327#(<= 20 main_~i~1), 244326#(<= 19 main_~i~1), 244325#(<= 18 main_~i~1), 244324#(<= 17 main_~i~1), 244331#(<= 24 main_~i~1), 244330#(<= 23 main_~i~1), 244329#(<= 22 main_~i~1), 244328#(<= 21 main_~i~1), 244335#(<= 28 main_~i~1), 244334#(<= 27 main_~i~1), 244333#(<= 26 main_~i~1), 244332#(<= 25 main_~i~1), 244339#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 244338#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 244337#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 244336#(<= 29 main_~i~1), 244343#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 244342#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 244341#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 244340#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 244347#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 244346#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9)), 244345#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 244344#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 244351#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 244350#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 244349#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 244348#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11))] [2018-04-12 23:57:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 863805 backedges. 184379 proven. 2670 refuted. 0 times theorem prover too weak. 676756 trivial. 0 not checked. [2018-04-12 23:57:53,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-12 23:57:53,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-12 23:57:53,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=3007, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 23:57:53,690 INFO L87 Difference]: Start difference. First operand 3536 states and 3539 transitions. Second operand 64 states. [2018-04-12 23:57:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:54,612 INFO L93 Difference]: Finished difference Result 3545 states and 3546 transitions. [2018-04-12 23:57:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-12 23:57:54,613 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 3526 [2018-04-12 23:57:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:54,616 INFO L225 Difference]: With dead ends: 3545 [2018-04-12 23:57:54,616 INFO L226 Difference]: Without dead ends: 3539 [2018-04-12 23:57:54,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1953, Invalid=6603, Unknown=0, NotChecked=0, Total=8556 [2018-04-12 23:57:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2018-04-12 23:57:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3536. [2018-04-12 23:57:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2018-04-12 23:57:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 3537 transitions. [2018-04-12 23:57:54,629 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 3537 transitions. Word has length 3526 [2018-04-12 23:57:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:54,630 INFO L459 AbstractCegarLoop]: Abstraction has 3536 states and 3537 transitions. [2018-04-12 23:57:54,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-12 23:57:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 3537 transitions. [2018-04-12 23:57:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3533 [2018-04-12 23:57:54,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:54,671 INFO L355 BasicCegarLoop]: trace histogram [557, 527, 526, 526, 526, 526, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:54,671 INFO L408 AbstractCegarLoop]: === Iteration 99 === [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-12 23:57:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1387026673, now seen corresponding path program 90 times [2018-04-12 23:57:54,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:54,871 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:57:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 867018 backedges. 95475 proven. 2883 refuted. 0 times theorem prover too weak. 768660 trivial. 0 not checked. [2018-04-12 23:57:58,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:57:58,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-12 23:57:58,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:57:58,298 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-12 23:57:58,298 INFO L182 omatonBuilderFactory]: Interpolants [251523#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13), 251522#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12), 251521#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11), 251520#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10), 251527#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17), 251526#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16), 251525#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15), 251524#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14), 251531#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21), 251530#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20), 251529#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19), 251528#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18), 251535#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25), 251534#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24), 251533#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23), 251532#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22), 251539#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29), 251538#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28), 251537#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27), 251536#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26), 251542#(and (<= 1 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 31)), 251541#(and (<= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 30)), 251540#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 30), 251511#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1), 251510#(= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0), 251509#false, 251508#true, 251515#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5), 251514#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4), 251513#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3), 251512#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2), 251519#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9), 251518#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8), 251517#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7), 251516#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)] [2018-04-12 23:57:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 867018 backedges. 95475 proven. 2883 refuted. 0 times theorem prover too weak. 768660 trivial. 0 not checked. [2018-04-12 23:57:58,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 23:57:58,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 23:57:58,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=656, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 23:57:58,308 INFO L87 Difference]: Start difference. First operand 3536 states and 3537 transitions. Second operand 35 states. [2018-04-12 23:57:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:57:58,807 INFO L93 Difference]: Finished difference Result 3548 states and 3550 transitions. [2018-04-12 23:57:58,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 23:57:58,807 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 3532 [2018-04-12 23:57:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:57:58,811 INFO L225 Difference]: With dead ends: 3548 [2018-04-12 23:57:58,811 INFO L226 Difference]: Without dead ends: 3548 [2018-04-12 23:57:58,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-04-12 23:57:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2018-04-12 23:57:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3542. [2018-04-12 23:57:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2018-04-12 23:57:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 3544 transitions. [2018-04-12 23:57:58,825 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 3544 transitions. Word has length 3532 [2018-04-12 23:57:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:57:58,826 INFO L459 AbstractCegarLoop]: Abstraction has 3542 states and 3544 transitions. [2018-04-12 23:57:58,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 23:57:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 3544 transitions. [2018-04-12 23:57:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3539 [2018-04-12 23:57:58,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:57:58,866 INFO L355 BasicCegarLoop]: trace histogram [558, 528, 527, 527, 527, 527, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:57:58,866 INFO L408 AbstractCegarLoop]: === Iteration 100 === [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-12 23:57:58,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1069712105, now seen corresponding path program 91 times [2018-04-12 23:57:58,867 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:57:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:57:59,075 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 870237 backedges. 101512 proven. 2825 refuted. 0 times theorem prover too weak. 765900 trivial. 0 not checked. [2018-04-12 23:58:04,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:04,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-12 23:58:04,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:04,636 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-12 23:58:04,636 INFO L182 omatonBuilderFactory]: Interpolants [258695#(= main_~i~1 0), 258694#false, 258693#true, 258699#(<= main_~i~1 4), 258698#(<= main_~i~1 3), 258697#(<= main_~i~1 2), 258696#(<= main_~i~1 1), 258703#(<= main_~i~1 8), 258702#(<= main_~i~1 7), 258701#(<= main_~i~1 6), 258700#(<= main_~i~1 5), 258707#(<= main_~i~1 12), 258706#(<= main_~i~1 11), 258705#(<= main_~i~1 10), 258704#(<= main_~i~1 9), 258711#(<= main_~i~1 16), 258710#(<= main_~i~1 15), 258709#(<= main_~i~1 14), 258708#(<= main_~i~1 13), 258715#(<= main_~i~1 20), 258714#(<= main_~i~1 19), 258713#(<= main_~i~1 18), 258712#(<= main_~i~1 17), 258719#(<= main_~i~1 24), 258718#(<= main_~i~1 23), 258717#(<= main_~i~1 22), 258716#(<= main_~i~1 21), 258723#(<= main_~i~1 28), 258722#(<= main_~i~1 27), 258721#(<= main_~i~1 26), 258720#(<= main_~i~1 25), 258727#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 31), 258726#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 31), 258725#(<= main_~i~1 30), 258724#(<= main_~i~1 29), 258731#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 28)), 258730#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 29)), 258729#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 30)), 258728#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 31)), 258735#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 24)), 258734#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 25)), 258733#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 26)), 258732#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 27)), 258739#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 20)), 258738#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 21)), 258737#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 22)), 258736#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 23)), 258743#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 16)), 258742#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 17)), 258741#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 18)), 258740#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 19)), 258747#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 12)), 258746#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 13)), 258745#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 14)), 258744#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 15)), 258751#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 8)), 258750#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 9)), 258749#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 10)), 258748#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 11)), 258755#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 4)), 258754#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 5)), 258753#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 6)), 258752#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 7)), 258759#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0), 258758#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 1)), 258757#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 2)), 258756#(<= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 3)), 258760#(<= (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1) __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0)] [2018-04-12 23:58:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 870237 backedges. 101512 proven. 2825 refuted. 0 times theorem prover too weak. 765900 trivial. 0 not checked. [2018-04-12 23:58:04,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-12 23:58:04,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-12 23:58:04,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1126, Invalid=3430, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 23:58:04,646 INFO L87 Difference]: Start difference. First operand 3542 states and 3544 transitions. Second operand 68 states. [2018-04-12 23:58:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:05,973 INFO L93 Difference]: Finished difference Result 3748 states and 3751 transitions. [2018-04-12 23:58:05,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 23:58:05,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3538 [2018-04-12 23:58:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:05,978 INFO L225 Difference]: With dead ends: 3748 [2018-04-12 23:58:05,978 INFO L226 Difference]: Without dead ends: 3748 [2018-04-12 23:58:05,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2347, Invalid=7753, Unknown=0, NotChecked=0, Total=10100 [2018-04-12 23:58:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2018-04-12 23:58:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3746. [2018-04-12 23:58:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3746 states. [2018-04-12 23:58:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 3749 transitions. [2018-04-12 23:58:05,993 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 3749 transitions. Word has length 3538 [2018-04-12 23:58:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:05,994 INFO L459 AbstractCegarLoop]: Abstraction has 3746 states and 3749 transitions. [2018-04-12 23:58:05,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-12 23:58:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 3749 transitions. [2018-04-12 23:58:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3737 [2018-04-12 23:58:06,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:06,039 INFO L355 BasicCegarLoop]: trace histogram [590, 559, 558, 558, 558, 558, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:58:06,039 INFO L408 AbstractCegarLoop]: === Iteration 101 === [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-12 23:58:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash 832196433, now seen corresponding path program 92 times [2018-04-12 23:58:06,040 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 23:58:06,244 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 23:58:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 974485 backedges. 202631 proven. 2852 refuted. 0 times theorem prover too weak. 769002 trivial. 0 not checked. [2018-04-12 23:58:10,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-12 23:58:10,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-12 23:58:10,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-12 23:58:10,982 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-12 23:58:10,982 INFO L182 omatonBuilderFactory]: Interpolants [266372#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 18)), 266373#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 19)), 266374#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 20)), 266375#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 21)), 266368#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 14)), 266369#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 15)), 266370#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 16)), 266371#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 17)), 266380#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 26)), 266381#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 27)), 266382#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 28)), 266383#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 29)), 266376#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 22)), 266377#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 23)), 266378#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 24)), 266379#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 25)), 266384#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 30)), 266385#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 31)), 266386#(<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| 30), 266324#(<= 1 main_~i~1), 266325#(<= 2 main_~i~1), 266326#(<= 3 main_~i~1), 266327#(<= 4 main_~i~1), 266321#true, 266322#false, 266323#(<= 0 main_~i~1), 266332#(<= 9 main_~i~1), 266333#(<= 10 main_~i~1), 266334#(<= 11 main_~i~1), 266335#(<= 12 main_~i~1), 266328#(<= 5 main_~i~1), 266329#(<= 6 main_~i~1), 266330#(<= 7 main_~i~1), 266331#(<= 8 main_~i~1), 266340#(<= 17 main_~i~1), 266341#(<= 18 main_~i~1), 266342#(<= 19 main_~i~1), 266343#(<= 20 main_~i~1), 266336#(<= 13 main_~i~1), 266337#(<= 14 main_~i~1), 266338#(<= 15 main_~i~1), 266339#(<= 16 main_~i~1), 266348#(<= 25 main_~i~1), 266349#(<= 26 main_~i~1), 266350#(<= 27 main_~i~1), 266351#(<= 28 main_~i~1), 266344#(<= 21 main_~i~1), 266345#(<= 22 main_~i~1), 266346#(<= 23 main_~i~1), 266347#(<= 24 main_~i~1), 266356#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 2)), 266357#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 3)), 266358#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 4)), 266359#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 5)), 266352#(<= 29 main_~i~1), 266353#(<= 30 main_~i~1), 266354#(and (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size) (= __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0 0)), 266355#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 1)), 266364#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 10)), 266365#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 11)), 266366#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 12)), 266367#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 13)), 266360#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 6)), 266361#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 7)), 266362#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 8)), 266363#(<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo_~size 9))] [2018-04-12 23:58:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 974485 backedges. 202631 proven. 2852 refuted. 0 times theorem prover too weak. 769002 trivial. 0 not checked. [2018-04-12 23:58:10,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 23:58:10,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 23:58:10,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3200, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 23:58:10,995 INFO L87 Difference]: Start difference. First operand 3746 states and 3749 transitions. Second operand 66 states. [2018-04-12 23:58:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 23:58:12,253 INFO L93 Difference]: Finished difference Result 3755 states and 3756 transitions. [2018-04-12 23:58:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-12 23:58:12,253 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3736 [2018-04-12 23:58:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 23:58:12,256 INFO L225 Difference]: With dead ends: 3755 [2018-04-12 23:58:12,257 INFO L226 Difference]: Without dead ends: 3749 [2018-04-12 23:58:12,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2080, Invalid=7040, Unknown=0, NotChecked=0, Total=9120 [2018-04-12 23:58:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-04-12 23:58:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3746. [2018-04-12 23:58:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3746 states. [2018-04-12 23:58:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 3747 transitions. [2018-04-12 23:58:12,270 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 3747 transitions. Word has length 3736 [2018-04-12 23:58:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 23:58:12,271 INFO L459 AbstractCegarLoop]: Abstraction has 3746 states and 3747 transitions. [2018-04-12 23:58:12,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 23:58:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 3747 transitions. [2018-04-12 23:58:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3743 [2018-04-12 23:58:12,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 23:58:12,315 INFO L355 BasicCegarLoop]: trace histogram [591, 560, 559, 559, 559, 559, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 23:58:12,315 INFO L408 AbstractCegarLoop]: === Iteration 102 === [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-12 23:58:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1353057609, now seen corresponding path program 93 times [2018-04-12 23:58:12,316 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-12 23:58:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 23:58:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 23:58:14,495 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 23:58:14,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 11:58:14 BoogieIcfgContainer [2018-04-12 23:58:14,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 23:58:14,886 INFO L168 Benchmark]: Toolchain (without parser) took 173122.69 ms. Allocated memory was 394.3 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 336.6 MB in the beginning and 769.2 MB in the end (delta: -432.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-12 23:58:14,887 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 394.3 MB. Free memory is still 354.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 23:58:14,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.27 ms. Allocated memory is still 394.3 MB. Free memory was 336.6 MB in the beginning and 326.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-12 23:58:14,887 INFO L168 Benchmark]: Boogie Preprocessor took 27.26 ms. Allocated memory is still 394.3 MB. Free memory was 326.0 MB in the beginning and 324.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-12 23:58:14,888 INFO L168 Benchmark]: RCFGBuilder took 209.71 ms. Allocated memory was 394.3 MB in the beginning and 590.9 MB in the end (delta: 196.6 MB). Free memory was 324.7 MB in the beginning and 554.8 MB in the end (delta: -230.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. [2018-04-12 23:58:14,888 INFO L168 Benchmark]: TraceAbstraction took 172733.84 ms. Allocated memory was 590.9 MB in the beginning and 2.8 GB in the end (delta: 2.3 GB). Free memory was 554.8 MB in the beginning and 769.2 MB in the end (delta: -214.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-04-12 23:58:14,889 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.12 ms. Allocated memory is still 394.3 MB. Free memory is still 354.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.27 ms. Allocated memory is still 394.3 MB. Free memory was 336.6 MB in the beginning and 326.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.26 ms. Allocated memory is still 394.3 MB. Free memory was 326.0 MB in the beginning and 324.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.71 ms. Allocated memory was 394.3 MB in the beginning and 590.9 MB in the end (delta: 196.6 MB). Free memory was 324.7 MB in the beginning and 554.8 MB in the end (delta: -230.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 172733.84 ms. Allocated memory was 590.9 MB in the beginning and 2.8 GB in the end (delta: 2.3 GB). Free memory was 554.8 MB in the beginning and 769.2 MB in the end (delta: -214.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L24] int i, b[32]; [L25] FCALL char mask[32]; VAL [mask={43:0}] [L26] i = 0 VAL [i=0, mask={43:0}] [L26] COND TRUE i < sizeof(mask) VAL [i=0, mask={43:0}] [L27] EXPR b[i] VAL [i=0, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=1, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={43:0}, b={43:0}, i=0, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={43:0}, b={43:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={43:0}, b={43:0}, i=0, size=1] [L18] EXPR, FCALL b[i] VAL [\old(size)=1, b={43:0}, b={43:0}, b[i]=53, i=0, size=1] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=1, b={43:0}, b={43:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={43:0}, b={43:0}, i=1, size=1] [L18] EXPR, FCALL b[i] VAL [\old(size)=1, b={43:0}, b={43:0}, b[i]=50, i=1, size=1] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=1, b={43:0}, b={43:0}, i=2, size=1] [L20] RET return i; VAL [\old(size)=1, \result=2, b={43:0}, b={43:0}, i=2, size=1] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=2, i=0, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=1, mask={43:0}] [L27] EXPR b[i] VAL [i=1, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=2, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={43:0}, b={43:0}, i=0, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={43:0}, b={43:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={43:0}, b={43:0}, i=0, size=2] [L18] EXPR, FCALL b[i] VAL [\old(size)=2, b={43:0}, b={43:0}, b[i]=53, i=0, size=2] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=2, b={43:0}, b={43:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={43:0}, b={43:0}, i=1, size=2] [L18] EXPR, FCALL b[i] VAL [\old(size)=2, b={43:0}, b={43:0}, b[i]=50, i=1, size=2] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=2, b={43:0}, b={43:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={43:0}, b={43:0}, i=2, size=2] [L18] EXPR, FCALL b[i] VAL [\old(size)=2, b={43:0}, b={43:0}, b[i]=59, i=2, size=2] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=2, b={43:0}, b={43:0}, i=3, size=2] [L20] RET return i; VAL [\old(size)=2, \result=3, b={43:0}, b={43:0}, i=3, size=2] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=3, i=1, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=2, mask={43:0}] [L27] EXPR b[i] VAL [i=2, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=3, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={43:0}, b={43:0}, i=0, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={43:0}, b={43:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={43:0}, b={43:0}, i=0, size=3] [L18] EXPR, FCALL b[i] VAL [\old(size)=3, b={43:0}, b={43:0}, b[i]=53, i=0, size=3] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=3, b={43:0}, b={43:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={43:0}, b={43:0}, i=1, size=3] [L18] EXPR, FCALL b[i] VAL [\old(size)=3, b={43:0}, b={43:0}, b[i]=50, i=1, size=3] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=3, b={43:0}, b={43:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={43:0}, b={43:0}, i=2, size=3] [L18] EXPR, FCALL b[i] VAL [\old(size)=3, b={43:0}, b={43:0}, b[i]=59, i=2, size=3] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=3, b={43:0}, b={43:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={43:0}, b={43:0}, i=3, size=3] [L18] EXPR, FCALL b[i] VAL [\old(size)=3, b={43:0}, b={43:0}, b[i]=41, i=3, size=3] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=3, b={43:0}, b={43:0}, i=4, size=3] [L20] RET return i; VAL [\old(size)=3, \result=4, b={43:0}, b={43:0}, i=4, size=3] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=4, i=2, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=3, mask={43:0}] [L27] EXPR b[i] VAL [i=3, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=4, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={43:0}, b={43:0}, i=0, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={43:0}, b={43:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={43:0}, b={43:0}, i=0, size=4] [L18] EXPR, FCALL b[i] VAL [\old(size)=4, b={43:0}, b={43:0}, b[i]=53, i=0, size=4] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=4, b={43:0}, b={43:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={43:0}, b={43:0}, i=1, size=4] [L18] EXPR, FCALL b[i] VAL [\old(size)=4, b={43:0}, b={43:0}, b[i]=50, i=1, size=4] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=4, b={43:0}, b={43:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={43:0}, b={43:0}, i=2, size=4] [L18] EXPR, FCALL b[i] VAL [\old(size)=4, b={43:0}, b={43:0}, b[i]=59, i=2, size=4] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=4, b={43:0}, b={43:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={43:0}, b={43:0}, i=3, size=4] [L18] EXPR, FCALL b[i] VAL [\old(size)=4, b={43:0}, b={43:0}, b[i]=41, i=3, size=4] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=4, b={43:0}, b={43:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={43:0}, b={43:0}, i=4, size=4] [L18] EXPR, FCALL b[i] VAL [\old(size)=4, b={43:0}, b={43:0}, b[i]=52, i=4, size=4] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=4, b={43:0}, b={43:0}, i=5, size=4] [L20] RET return i; VAL [\old(size)=4, \result=5, b={43:0}, b={43:0}, i=5, size=4] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=5, i=3, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=4, mask={43:0}] [L27] EXPR b[i] VAL [i=4, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=5, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={43:0}, b={43:0}, i=0, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=0, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=53, i=0, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=1, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=50, i=1, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=2, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=59, i=2, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=3, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=41, i=3, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=4, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=52, i=4, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=5, b={43:0}, b={43:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={43:0}, b={43:0}, i=5, size=5] [L18] EXPR, FCALL b[i] VAL [\old(size)=5, b={43:0}, b={43:0}, b[i]=35, i=5, size=5] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=5, b={43:0}, b={43:0}, i=6, size=5] [L20] RET return i; VAL [\old(size)=5, \result=6, b={43:0}, b={43:0}, i=6, size=5] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=6, i=4, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=5, mask={43:0}] [L27] EXPR b[i] VAL [i=5, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=6, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={43:0}, b={43:0}, i=0, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=0, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=53, i=0, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=1, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=50, i=1, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=2, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=59, i=2, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=3, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=41, i=3, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=4, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=52, i=4, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=5, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=35, i=5, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=6, b={43:0}, b={43:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={43:0}, b={43:0}, i=6, size=6] [L18] EXPR, FCALL b[i] VAL [\old(size)=6, b={43:0}, b={43:0}, b[i]=34, i=6, size=6] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=6, b={43:0}, b={43:0}, i=7, size=6] [L20] RET return i; VAL [\old(size)=6, \result=7, b={43:0}, b={43:0}, i=7, size=6] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=7, i=5, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=6, mask={43:0}] [L27] EXPR b[i] VAL [i=6, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=7, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={43:0}, b={43:0}, i=0, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=0, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=53, i=0, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=1, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=50, i=1, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=2, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=59, i=2, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=3, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=41, i=3, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=4, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=52, i=4, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=5, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=35, i=5, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=6, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=34, i=6, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=7, b={43:0}, b={43:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={43:0}, b={43:0}, i=7, size=7] [L18] EXPR, FCALL b[i] VAL [\old(size)=7, b={43:0}, b={43:0}, b[i]=51, i=7, size=7] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=7, b={43:0}, b={43:0}, i=8, size=7] [L20] RET return i; VAL [\old(size)=7, \result=8, b={43:0}, b={43:0}, i=8, size=7] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=8, i=6, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=7, mask={43:0}] [L27] EXPR b[i] VAL [i=7, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=8, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={43:0}, b={43:0}, i=0, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=0, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=53, i=0, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=1, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=50, i=1, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=2, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=59, i=2, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=3, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=41, i=3, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=4, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=52, i=4, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=5, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=35, i=5, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=6, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=34, i=6, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=7, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=51, i=7, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=8, b={43:0}, b={43:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={43:0}, b={43:0}, i=8, size=8] [L18] EXPR, FCALL b[i] VAL [\old(size)=8, b={43:0}, b={43:0}, b[i]=36, i=8, size=8] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=8, b={43:0}, b={43:0}, i=9, size=8] [L20] RET return i; VAL [\old(size)=8, \result=9, b={43:0}, b={43:0}, i=9, size=8] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=9, i=7, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=8, mask={43:0}] [L27] EXPR b[i] VAL [i=8, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=9, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={43:0}, b={43:0}, i=0, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=0, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=53, i=0, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=1, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=50, i=1, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=2, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=59, i=2, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=3, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=41, i=3, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=4, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=52, i=4, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=5, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=35, i=5, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=6, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=34, i=6, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=7, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=51, i=7, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=8, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=36, i=8, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=9, b={43:0}, b={43:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={43:0}, b={43:0}, i=9, size=9] [L18] EXPR, FCALL b[i] VAL [\old(size)=9, b={43:0}, b={43:0}, b[i]=37, i=9, size=9] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=9, b={43:0}, b={43:0}, i=10, size=9] [L20] RET return i; VAL [\old(size)=9, \result=10, b={43:0}, b={43:0}, i=10, size=9] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=10, i=8, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=9, mask={43:0}] [L27] EXPR b[i] VAL [i=9, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=10, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={43:0}, b={43:0}, i=0, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=0, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=53, i=0, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=1, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=50, i=1, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=2, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=59, i=2, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=3, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=41, i=3, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=4, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=52, i=4, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=5, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=35, i=5, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=6, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=34, i=6, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=7, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=51, i=7, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=8, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=36, i=8, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=9, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=37, i=9, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=10, b={43:0}, b={43:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={43:0}, b={43:0}, i=10, size=10] [L18] EXPR, FCALL b[i] VAL [\old(size)=10, b={43:0}, b={43:0}, b[i]=42, i=10, size=10] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=10, b={43:0}, b={43:0}, i=11, size=10] [L20] RET return i; VAL [\old(size)=10, \result=11, b={43:0}, b={43:0}, i=11, size=10] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=11, i=9, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=10, mask={43:0}] [L27] EXPR b[i] VAL [i=10, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=11, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={43:0}, b={43:0}, i=0, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=0, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=53, i=0, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=1, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=50, i=1, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=2, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=59, i=2, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=3, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=41, i=3, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=4, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=52, i=4, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=5, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=35, i=5, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=6, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=34, i=6, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=7, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=51, i=7, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=8, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=36, i=8, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=9, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=37, i=9, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=10, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=42, i=10, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=11, b={43:0}, b={43:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={43:0}, b={43:0}, i=11, size=11] [L18] EXPR, FCALL b[i] VAL [\old(size)=11, b={43:0}, b={43:0}, b[i]=62, i=11, size=11] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=11, b={43:0}, b={43:0}, i=12, size=11] [L20] RET return i; VAL [\old(size)=11, \result=12, b={43:0}, b={43:0}, i=12, size=11] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=12, i=10, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=11, mask={43:0}] [L27] EXPR b[i] VAL [i=11, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=12, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={43:0}, b={43:0}, i=0, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=0, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=53, i=0, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=1, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=50, i=1, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=2, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=59, i=2, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=3, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=41, i=3, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=4, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=52, i=4, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=5, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=35, i=5, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=6, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=34, i=6, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=7, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=51, i=7, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=8, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=36, i=8, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=9, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=37, i=9, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=10, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=42, i=10, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=11, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=62, i=11, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=12, b={43:0}, b={43:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={43:0}, b={43:0}, i=12, size=12] [L18] EXPR, FCALL b[i] VAL [\old(size)=12, b={43:0}, b={43:0}, b[i]=61, i=12, size=12] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=12, b={43:0}, b={43:0}, i=13, size=12] [L20] RET return i; VAL [\old(size)=12, \result=13, b={43:0}, b={43:0}, i=13, size=12] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=13, i=11, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=12, mask={43:0}] [L27] EXPR b[i] VAL [i=12, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=13, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={43:0}, b={43:0}, i=0, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=0, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=53, i=0, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=1, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=50, i=1, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=2, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=59, i=2, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=3, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=41, i=3, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=4, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=52, i=4, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=5, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=35, i=5, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=6, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=34, i=6, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=7, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=51, i=7, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=8, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=36, i=8, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=9, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=37, i=9, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=10, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=42, i=10, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=11, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=62, i=11, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=12, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=61, i=12, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=13, b={43:0}, b={43:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={43:0}, b={43:0}, i=13, size=13] [L18] EXPR, FCALL b[i] VAL [\old(size)=13, b={43:0}, b={43:0}, b[i]=63, i=13, size=13] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=13, b={43:0}, b={43:0}, i=14, size=13] [L20] RET return i; VAL [\old(size)=13, \result=14, b={43:0}, b={43:0}, i=14, size=13] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=14, i=12, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=13, mask={43:0}] [L27] EXPR b[i] VAL [i=13, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=14, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={43:0}, b={43:0}, i=0, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=0, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=53, i=0, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=1, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=50, i=1, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=2, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=59, i=2, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=3, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=41, i=3, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=4, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=52, i=4, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=5, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=35, i=5, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=6, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=34, i=6, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=7, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=51, i=7, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=8, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=36, i=8, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=9, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=37, i=9, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=10, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=42, i=10, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=11, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=62, i=11, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=12, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=61, i=12, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=13, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=63, i=13, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=14, b={43:0}, b={43:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={43:0}, b={43:0}, i=14, size=14] [L18] EXPR, FCALL b[i] VAL [\old(size)=14, b={43:0}, b={43:0}, b[i]=40, i=14, size=14] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=14, b={43:0}, b={43:0}, i=15, size=14] [L20] RET return i; VAL [\old(size)=14, \result=15, b={43:0}, b={43:0}, i=15, size=14] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=15, i=13, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=14, mask={43:0}] [L27] EXPR b[i] VAL [i=14, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=15, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={43:0}, b={43:0}, i=0, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=0, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=53, i=0, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=1, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=50, i=1, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=2, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=59, i=2, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=3, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=41, i=3, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=4, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=52, i=4, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=5, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=35, i=5, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=6, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=34, i=6, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=7, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=51, i=7, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=8, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=36, i=8, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=9, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=37, i=9, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=10, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=42, i=10, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=11, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=62, i=11, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=12, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=61, i=12, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=13, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=63, i=13, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=14, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=40, i=14, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=15, b={43:0}, b={43:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={43:0}, b={43:0}, i=15, size=15] [L18] EXPR, FCALL b[i] VAL [\old(size)=15, b={43:0}, b={43:0}, b[i]=48, i=15, size=15] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=15, b={43:0}, b={43:0}, i=16, size=15] [L20] RET return i; VAL [\old(size)=15, \result=16, b={43:0}, b={43:0}, i=16, size=15] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=16, i=14, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=15, mask={43:0}] [L27] EXPR b[i] VAL [i=15, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=16, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={43:0}, b={43:0}, i=0, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=0, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=53, i=0, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=1, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=50, i=1, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=2, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=59, i=2, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=3, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=41, i=3, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=4, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=52, i=4, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=5, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=35, i=5, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=6, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=34, i=6, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=7, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=51, i=7, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=8, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=36, i=8, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=9, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=37, i=9, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=10, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=42, i=10, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=11, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=62, i=11, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=12, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=61, i=12, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=13, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=63, i=13, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=14, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=40, i=14, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=15, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=48, i=15, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=16, b={43:0}, b={43:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={43:0}, b={43:0}, i=16, size=16] [L18] EXPR, FCALL b[i] VAL [\old(size)=16, b={43:0}, b={43:0}, b[i]=54, i=16, size=16] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=16, b={43:0}, b={43:0}, i=17, size=16] [L20] RET return i; VAL [\old(size)=16, \result=17, b={43:0}, b={43:0}, i=17, size=16] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=17, i=15, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=16, mask={43:0}] [L27] EXPR b[i] VAL [i=16, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=17, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={43:0}, b={43:0}, i=0, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=0, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=53, i=0, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=1, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=50, i=1, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=2, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=59, i=2, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=3, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=41, i=3, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=4, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=52, i=4, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=5, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=35, i=5, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=6, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=34, i=6, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=7, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=51, i=7, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=8, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=36, i=8, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=9, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=37, i=9, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=10, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=42, i=10, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=11, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=62, i=11, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=12, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=61, i=12, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=13, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=63, i=13, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=14, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=40, i=14, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=15, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=48, i=15, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=16, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=54, i=16, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=17, b={43:0}, b={43:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={43:0}, b={43:0}, i=17, size=17] [L18] EXPR, FCALL b[i] VAL [\old(size)=17, b={43:0}, b={43:0}, b[i]=64, i=17, size=17] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=17, b={43:0}, b={43:0}, i=18, size=17] [L20] RET return i; VAL [\old(size)=17, \result=18, b={43:0}, b={43:0}, i=18, size=17] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=18, i=16, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=17, mask={43:0}] [L27] EXPR b[i] VAL [i=17, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=18, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={43:0}, b={43:0}, i=0, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=0, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=53, i=0, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=1, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=50, i=1, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=2, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=59, i=2, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=3, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=41, i=3, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=4, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=52, i=4, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=5, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=35, i=5, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=6, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=34, i=6, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=7, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=51, i=7, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=8, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=36, i=8, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=9, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=37, i=9, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=10, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=42, i=10, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=11, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=62, i=11, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=12, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=61, i=12, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=13, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=63, i=13, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=14, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=40, i=14, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=15, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=48, i=15, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=16, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=54, i=16, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=17, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=64, i=17, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=18, b={43:0}, b={43:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={43:0}, b={43:0}, i=18, size=18] [L18] EXPR, FCALL b[i] VAL [\old(size)=18, b={43:0}, b={43:0}, b[i]=44, i=18, size=18] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=18, b={43:0}, b={43:0}, i=19, size=18] [L20] RET return i; VAL [\old(size)=18, \result=19, b={43:0}, b={43:0}, i=19, size=18] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=19, i=17, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=18, mask={43:0}] [L27] EXPR b[i] VAL [i=18, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=19, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={43:0}, b={43:0}, i=0, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=0, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=53, i=0, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=1, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=50, i=1, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=2, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=59, i=2, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=3, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=41, i=3, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=4, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=52, i=4, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=5, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=35, i=5, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=6, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=34, i=6, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=7, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=51, i=7, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=8, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=36, i=8, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=9, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=37, i=9, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=10, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=42, i=10, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=11, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=62, i=11, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=12, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=61, i=12, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=13, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=63, i=13, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=14, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=40, i=14, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=15, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=48, i=15, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=16, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=54, i=16, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=17, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=64, i=17, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=18, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=44, i=18, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=19, b={43:0}, b={43:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={43:0}, b={43:0}, i=19, size=19] [L18] EXPR, FCALL b[i] VAL [\old(size)=19, b={43:0}, b={43:0}, b[i]=58, i=19, size=19] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=19, b={43:0}, b={43:0}, i=20, size=19] [L20] RET return i; VAL [\old(size)=19, \result=20, b={43:0}, b={43:0}, i=20, size=19] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=20, i=18, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=19, mask={43:0}] [L27] EXPR b[i] VAL [i=19, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=20, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={43:0}, b={43:0}, i=0, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=0, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=53, i=0, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=1, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=50, i=1, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=2, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=59, i=2, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=3, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=41, i=3, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=4, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=52, i=4, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=5, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=35, i=5, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=6, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=34, i=6, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=7, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=51, i=7, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=8, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=36, i=8, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=9, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=37, i=9, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=10, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=42, i=10, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=11, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=62, i=11, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=12, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=61, i=12, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=13, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=63, i=13, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=14, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=40, i=14, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=15, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=48, i=15, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=16, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=54, i=16, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=17, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=64, i=17, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=18, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=44, i=18, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=19, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=58, i=19, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=20, b={43:0}, b={43:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={43:0}, b={43:0}, i=20, size=20] [L18] EXPR, FCALL b[i] VAL [\old(size)=20, b={43:0}, b={43:0}, b[i]=55, i=20, size=20] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=20, b={43:0}, b={43:0}, i=21, size=20] [L20] RET return i; VAL [\old(size)=20, \result=21, b={43:0}, b={43:0}, i=21, size=20] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=21, i=19, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=20, mask={43:0}] [L27] EXPR b[i] VAL [i=20, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=21, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={43:0}, b={43:0}, i=0, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=0, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=53, i=0, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=1, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=50, i=1, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=2, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=59, i=2, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=3, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=41, i=3, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=4, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=52, i=4, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=5, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=35, i=5, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=6, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=34, i=6, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=7, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=51, i=7, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=8, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=36, i=8, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=9, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=37, i=9, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=10, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=42, i=10, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=11, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=62, i=11, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=12, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=61, i=12, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=13, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=63, i=13, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=14, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=40, i=14, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=15, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=48, i=15, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=16, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=54, i=16, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=17, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=64, i=17, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=18, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=44, i=18, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=19, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=58, i=19, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=20, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=55, i=20, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=21, b={43:0}, b={43:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={43:0}, b={43:0}, i=21, size=21] [L18] EXPR, FCALL b[i] VAL [\old(size)=21, b={43:0}, b={43:0}, b[i]=33, i=21, size=21] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=21, b={43:0}, b={43:0}, i=22, size=21] [L20] RET return i; VAL [\old(size)=21, \result=22, b={43:0}, b={43:0}, i=22, size=21] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=22, i=20, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=21, mask={43:0}] [L27] EXPR b[i] VAL [i=21, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=22, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={43:0}, b={43:0}, i=0, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=0, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=53, i=0, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=1, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=50, i=1, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=2, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=59, i=2, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=3, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=41, i=3, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=4, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=52, i=4, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=5, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=35, i=5, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=6, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=34, i=6, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=7, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=51, i=7, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=8, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=36, i=8, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=9, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=37, i=9, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=10, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=42, i=10, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=11, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=62, i=11, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=12, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=61, i=12, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=13, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=63, i=13, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=14, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=40, i=14, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=15, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=48, i=15, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=16, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=54, i=16, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=17, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=64, i=17, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=18, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=44, i=18, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=19, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=58, i=19, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=20, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=55, i=20, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=21, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=33, i=21, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=22, b={43:0}, b={43:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={43:0}, b={43:0}, i=22, size=22] [L18] EXPR, FCALL b[i] VAL [\old(size)=22, b={43:0}, b={43:0}, b[i]=47, i=22, size=22] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=22, b={43:0}, b={43:0}, i=23, size=22] [L20] RET return i; VAL [\old(size)=22, \result=23, b={43:0}, b={43:0}, i=23, size=22] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=23, i=21, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=22, mask={43:0}] [L27] EXPR b[i] VAL [i=22, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=23, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={43:0}, b={43:0}, i=0, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=0, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=53, i=0, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=1, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=50, i=1, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=2, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=59, i=2, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=3, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=41, i=3, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=4, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=52, i=4, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=5, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=35, i=5, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=6, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=34, i=6, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=7, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=51, i=7, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=8, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=36, i=8, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=9, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=37, i=9, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=10, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=42, i=10, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=11, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=62, i=11, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=12, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=61, i=12, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=13, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=63, i=13, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=14, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=40, i=14, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=15, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=48, i=15, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=16, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=54, i=16, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=17, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=64, i=17, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=18, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=44, i=18, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=19, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=58, i=19, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=20, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=55, i=20, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=21, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=33, i=21, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=22, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=47, i=22, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=23, b={43:0}, b={43:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={43:0}, b={43:0}, i=23, size=23] [L18] EXPR, FCALL b[i] VAL [\old(size)=23, b={43:0}, b={43:0}, b[i]=46, i=23, size=23] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=23, b={43:0}, b={43:0}, i=24, size=23] [L20] RET return i; VAL [\old(size)=23, \result=24, b={43:0}, b={43:0}, i=24, size=23] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=24, i=22, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=23, mask={43:0}] [L27] EXPR b[i] VAL [i=23, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=24, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={43:0}, b={43:0}, i=0, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=0, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=53, i=0, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=1, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=50, i=1, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=2, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=59, i=2, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=3, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=41, i=3, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=4, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=52, i=4, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=5, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=35, i=5, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=6, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=34, i=6, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=7, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=51, i=7, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=8, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=36, i=8, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=9, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=37, i=9, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=10, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=42, i=10, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=11, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=62, i=11, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=12, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=61, i=12, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=13, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=63, i=13, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=14, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=40, i=14, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=15, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=48, i=15, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=16, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=54, i=16, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=17, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=64, i=17, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=18, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=44, i=18, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=19, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=58, i=19, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=20, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=55, i=20, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=21, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=33, i=21, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=22, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=47, i=22, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=23, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=46, i=23, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=24, b={43:0}, b={43:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={43:0}, b={43:0}, i=24, size=24] [L18] EXPR, FCALL b[i] VAL [\old(size)=24, b={43:0}, b={43:0}, b[i]=67, i=24, size=24] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=24, b={43:0}, b={43:0}, i=25, size=24] [L20] RET return i; VAL [\old(size)=24, \result=25, b={43:0}, b={43:0}, i=25, size=24] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=25, i=23, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=24, mask={43:0}] [L27] EXPR b[i] VAL [i=24, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=25, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={43:0}, b={43:0}, i=0, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=0, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=53, i=0, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=1, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=50, i=1, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=2, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=59, i=2, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=3, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=41, i=3, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=4, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=52, i=4, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=5, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=35, i=5, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=6, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=34, i=6, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=7, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=51, i=7, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=8, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=36, i=8, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=9, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=37, i=9, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=10, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=42, i=10, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=11, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=62, i=11, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=12, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=61, i=12, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=13, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=63, i=13, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=14, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=40, i=14, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=15, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=48, i=15, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=16, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=54, i=16, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=17, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=64, i=17, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=18, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=44, i=18, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=19, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=58, i=19, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=20, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=55, i=20, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=21, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=33, i=21, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=22, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=47, i=22, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=23, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=46, i=23, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=24, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=67, i=24, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=25, b={43:0}, b={43:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={43:0}, b={43:0}, i=25, size=25] [L18] EXPR, FCALL b[i] VAL [\old(size)=25, b={43:0}, b={43:0}, b[i]=45, i=25, size=25] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=25, b={43:0}, b={43:0}, i=26, size=25] [L20] RET return i; VAL [\old(size)=25, \result=26, b={43:0}, b={43:0}, i=26, size=25] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=26, i=24, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=25, mask={43:0}] [L27] EXPR b[i] VAL [i=25, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=26, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={43:0}, b={43:0}, i=0, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=0, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=53, i=0, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=1, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=50, i=1, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=2, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=59, i=2, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=3, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=41, i=3, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=4, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=52, i=4, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=5, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=35, i=5, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=6, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=34, i=6, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=7, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=51, i=7, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=8, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=36, i=8, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=9, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=37, i=9, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=10, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=42, i=10, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=11, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=62, i=11, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=12, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=61, i=12, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=13, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=63, i=13, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=14, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=40, i=14, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=15, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=48, i=15, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=16, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=54, i=16, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=17, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=64, i=17, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=18, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=44, i=18, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=19, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=58, i=19, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=20, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=55, i=20, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=21, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=33, i=21, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=22, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=47, i=22, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=23, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=46, i=23, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=24, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=67, i=24, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=25, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=45, i=25, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=26, b={43:0}, b={43:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={43:0}, b={43:0}, i=26, size=26] [L18] EXPR, FCALL b[i] VAL [\old(size)=26, b={43:0}, b={43:0}, b[i]=56, i=26, size=26] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=26, b={43:0}, b={43:0}, i=27, size=26] [L20] RET return i; VAL [\old(size)=26, \result=27, b={43:0}, b={43:0}, i=27, size=26] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=27, i=25, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=26, mask={43:0}] [L27] EXPR b[i] VAL [i=26, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=27, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={43:0}, b={43:0}, i=0, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=0, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=53, i=0, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=1, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=50, i=1, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=2, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=59, i=2, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=3, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=41, i=3, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=4, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=52, i=4, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=5, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=35, i=5, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=6, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=34, i=6, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=7, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=51, i=7, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=8, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=36, i=8, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=9, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=37, i=9, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=10, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=42, i=10, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=11, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=62, i=11, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=12, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=61, i=12, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=13, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=63, i=13, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=14, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=40, i=14, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=15, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=48, i=15, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=16, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=54, i=16, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=17, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=64, i=17, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=18, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=44, i=18, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=19, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=58, i=19, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=20, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=55, i=20, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=21, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=33, i=21, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=22, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=47, i=22, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=23, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=46, i=23, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=24, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=67, i=24, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=25, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=45, i=25, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=26, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=56, i=26, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=27, b={43:0}, b={43:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={43:0}, b={43:0}, i=27, size=27] [L18] EXPR, FCALL b[i] VAL [\old(size)=27, b={43:0}, b={43:0}, b[i]=38, i=27, size=27] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=27, b={43:0}, b={43:0}, i=28, size=27] [L20] RET return i; VAL [\old(size)=27, \result=28, b={43:0}, b={43:0}, i=28, size=27] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=28, i=26, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=27, mask={43:0}] [L27] EXPR b[i] VAL [i=27, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=28, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={43:0}, b={43:0}, i=0, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=0, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=53, i=0, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=1, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=50, i=1, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=2, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=59, i=2, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=3, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=41, i=3, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=4, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=52, i=4, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=5, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=35, i=5, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=6, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=34, i=6, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=7, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=51, i=7, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=8, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=36, i=8, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=9, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=37, i=9, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=10, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=42, i=10, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=11, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=62, i=11, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=12, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=61, i=12, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=13, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=63, i=13, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=14, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=40, i=14, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=15, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=48, i=15, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=16, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=54, i=16, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=17, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=64, i=17, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=18, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=44, i=18, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=19, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=58, i=19, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=20, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=55, i=20, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=21, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=33, i=21, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=22, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=47, i=22, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=23, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=46, i=23, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=24, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=67, i=24, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=25, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=45, i=25, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=26, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=56, i=26, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=27, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=38, i=27, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=28, b={43:0}, b={43:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={43:0}, b={43:0}, i=28, size=28] [L18] EXPR, FCALL b[i] VAL [\old(size)=28, b={43:0}, b={43:0}, b[i]=65, i=28, size=28] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=28, b={43:0}, b={43:0}, i=29, size=28] [L20] RET return i; VAL [\old(size)=28, \result=29, b={43:0}, b={43:0}, i=29, size=28] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=29, i=27, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=28, mask={43:0}] [L27] EXPR b[i] VAL [i=28, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=29, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={43:0}, b={43:0}, i=0, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=0, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=53, i=0, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=1, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=50, i=1, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=2, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=59, i=2, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=3, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=41, i=3, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=4, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=52, i=4, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=5, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=35, i=5, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=6, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=34, i=6, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=7, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=51, i=7, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=8, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=36, i=8, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=9, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=37, i=9, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=10, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=42, i=10, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=11, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=62, i=11, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=12, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=61, i=12, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=13, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=63, i=13, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=14, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=40, i=14, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=15, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=48, i=15, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=16, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=54, i=16, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=17, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=64, i=17, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=18, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=44, i=18, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=19, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=58, i=19, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=20, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=55, i=20, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=21, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=33, i=21, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=22, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=47, i=22, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=23, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=46, i=23, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=24, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=67, i=24, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=25, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=45, i=25, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=26, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=56, i=26, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=27, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=38, i=27, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=28, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=65, i=28, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=29, b={43:0}, b={43:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={43:0}, b={43:0}, i=29, size=29] [L18] EXPR, FCALL b[i] VAL [\old(size)=29, b={43:0}, b={43:0}, b[i]=66, i=29, size=29] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=29, b={43:0}, b={43:0}, i=30, size=29] [L20] RET return i; VAL [\old(size)=29, \result=30, b={43:0}, b={43:0}, i=30, size=29] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=30, i=28, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=29, mask={43:0}] [L27] EXPR b[i] VAL [i=29, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=30, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={43:0}, b={43:0}, i=0, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=0, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=53, i=0, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=1, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=50, i=1, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=2, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=59, i=2, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=3, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=41, i=3, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=4, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=52, i=4, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=5, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=35, i=5, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=6, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=34, i=6, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=7, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=51, i=7, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=8, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=36, i=8, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=9, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=37, i=9, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=10, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=42, i=10, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=11, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=62, i=11, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=12, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=61, i=12, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=13, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=63, i=13, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=14, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=40, i=14, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=15, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=48, i=15, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=16, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=54, i=16, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=17, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=64, i=17, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=18, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=44, i=18, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=19, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=58, i=19, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=20, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=55, i=20, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=21, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=33, i=21, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=22, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=47, i=22, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=23, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=46, i=23, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=24, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=67, i=24, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=25, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=45, i=25, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=26, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=56, i=26, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=27, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=38, i=27, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=28, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=65, i=28, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=29, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=66, i=29, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=30, b={43:0}, b={43:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={43:0}, b={43:0}, i=30, size=30] [L18] EXPR, FCALL b[i] VAL [\old(size)=30, b={43:0}, b={43:0}, b[i]=39, i=30, size=30] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=30, b={43:0}, b={43:0}, i=31, size=30] [L20] RET return i; VAL [\old(size)=30, \result=31, b={43:0}, b={43:0}, i=31, size=30] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=31, i=29, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=30, mask={43:0}] [L27] EXPR b[i] VAL [i=30, mask={43:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=31, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={43:0}, b={43:0}, i=0, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=0, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=53, i=0, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=1, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=50, i=1, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=2, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=59, i=2, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=3, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=41, i=3, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=4, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=52, i=4, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=5, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=35, i=5, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=6, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=34, i=6, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=7, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=51, i=7, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=8, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=36, i=8, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=9, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=37, i=9, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=10, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=42, i=10, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=11, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=62, i=11, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=12, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=61, i=12, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=13, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=63, i=13, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=14, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=40, i=14, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=15, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=48, i=15, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=16, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=54, i=16, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=17, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=64, i=17, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=18, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=44, i=18, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=19, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=58, i=19, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=20, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=55, i=20, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=21, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=33, i=21, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=22, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=47, i=22, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=23, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=46, i=23, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=24, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=67, i=24, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=25, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=45, i=25, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=26, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=56, i=26, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=27, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=38, i=27, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=28, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=65, i=28, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=29, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=66, i=29, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=30, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=39, i=30, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=31, b={43:0}, b={43:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={43:0}, b={43:0}, i=31, size=31] [L18] EXPR, FCALL b[i] VAL [\old(size)=31, b={43:0}, b={43:0}, b[i]=57, i=31, size=31] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND FALSE !(i <= size) VAL [\old(size)=31, b={43:0}, b={43:0}, i=32, size=31] [L20] RET return i; VAL [\old(size)=31, \result=32, b={43:0}, b={43:0}, i=32, size=31] [L27] EXPR foo(mask, i + 1) VAL [foo(mask, i + 1)=32, i=30, mask={43:0}] [L27] b[i] = foo(mask, i + 1) [L26] i++ [L26] i++ [L26] COND TRUE i < sizeof(mask) VAL [i=31, mask={43:0}] [L27] b[i] VAL [i=31, mask={43:0}] [L27] CALL foo(mask, i + 1) VAL [\old(size)=32, b={43:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=32, b={43:0}, b={43:0}, i=0, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=0, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=0, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=53, i=0, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=1, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=1, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=50, i=1, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=2, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=2, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=59, i=2, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=3, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=3, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=41, i=3, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=4, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=4, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=52, i=4, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=5, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=5, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=35, i=5, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=6, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=6, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=34, i=6, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=7, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=7, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=51, i=7, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=8, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=8, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=36, i=8, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=9, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=9, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=37, i=9, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=10, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=10, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=42, i=10, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=11, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=11, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=62, i=11, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=12, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=12, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=61, i=12, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=13, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=13, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=63, i=13, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=14, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=14, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=40, i=14, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=15, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=15, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=48, i=15, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=16, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=16, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=54, i=16, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=17, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=17, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=64, i=17, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=18, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=18, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=44, i=18, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=19, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=19, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=58, i=19, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=20, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=20, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=55, i=20, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=21, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=21, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=33, i=21, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=22, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=22, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=47, i=22, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=23, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=23, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=46, i=23, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=24, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=24, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=67, i=24, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=25, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=25, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=45, i=25, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=26, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=26, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=56, i=26, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=27, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=27, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=38, i=27, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=28, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=28, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=65, i=28, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=29, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=29, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=66, i=29, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=30, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=30, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=39, i=30, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=31, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=31, size=32] [L18] EXPR, FCALL b[i] VAL [\old(size)=32, b={43:0}, b={43:0}, b[i]=57, i=31, size=32] [L18] a[i] = b[i] [L17] i++ [L17] i++ [L17] COND TRUE i <= size VAL [\old(size)=32, b={43:0}, b={43:0}, i=32, size=32] [L18] a[i] VAL [\old(size)=32, b={43:0}, b={43:0}, i=32, size=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. UNSAFE Result, 172.6s OverallTime, 102 OverallIterations, 591 TraceHistogramMax, 48.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3402 SDtfs, 18174 SDslu, 30346 SDs, 0 SdLazy, 98206 SolverSat, 2060 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4423 GetRequests, 167 SyntacticMatches, 6 SemanticMatches, 4250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49493 ImplicationChecksByTransitivity, 39.5s Time, 0.3s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3746occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 19212613/19307668 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 101 MinimizatonAttempts, 562 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.8s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 132484 NumberOfCodeBlocks, 132484 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 128641 ConstructedInterpolants, 0 QuantifiedInterpolants, 386595743 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 6 PerfectInterpolantSequences, 19212613/19307668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! 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_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_23-58-14-897.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_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_23-58-14-897.csv Received shutdown request...